Related papers: Involutive Division Technique: Some Generalization…

Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…

This overview is devoted to splitting methods, a class of numerical integrators intended for differential equations that can be subdivided into different problems easier to solve than the original system. Closely connected with this class…

In this article we present two new algorithms to compute the Groebner basis of an ideal that is invariant under certain permutations of the ring variables and which are both implemented in SINGULAR (cf. [DGPS12]). The first and major…

Inspired by prior work of Bruinier and Ono and Mertens and Rolen, we study class polynomials for non-holomorphic modular functions arising from modular forms of negative weight. In particular, we give general conditions for the…

This paper is devoted to studying the first-order variational analysis of non-convex and non-differentiable functions that may not be subdifferentially regular. To achieve this goal, we entirely rely on two concepts of directional…

For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…

It has been shown previously that a large class of monomial maps equivariant under the action of an infinite symmetric group have finitely generated kernels up to the symmetric action. We prove that these symmetric toric ideals also have…

Invariant theory provides more efficient tools, such as Molien generating functions and integrity bases, than basic group theory, that relies on projector techniques for the construction of symmetry--adapted polynomials in the symmetry…

We propose notions of "Noetherian" and "integral" for schemes over an abelian symmetric monoidal category $(\mathcal C,\otimes,1)$. For Noetherian integral schemes, we construct a "function field" that is a commutative monoid object of…

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

Partitioning a set of elements into an unknown number of mutually exclusive subsets is essential in many machine learning problems. However, assigning elements, such as samples in a dataset or neurons in a network layer, to an unknown and…

In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are…

Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…

In this paper, we consider the solvability of a class of nonlinear fourth order integro-differential equations with Navier boundary condition. We first deal with a corresponding linear problem and establish a maximum principle. Using the…

This paper continues a research program on constructive investigations of non-commutative Ore localizations, initiated in our previous papers, and particularly touches the constructiveness of arithmetics within such localizations. Earlier…

We generalize the "facial weak order" of a finite Coxeter group to a partial order on a set of intervals in a complete lattice. We apply our construction to the lattice of torsion classes of a finite-dimensional algebra and consider its…

The subdivision algorithm by Dellnitz and Hohmann for the computation of invariant sets of dynamical systems decomposes the relevant region of the state space into boxes and analyzes the induced box dynamics. Its convergence is proved in an…

We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…

This paper is concerned with linear algebra based methods for solving exactly polynomial systems through so-called Gr\"obner bases, which allow one to compute modulo the polynomial ideal generated by the input equations. This is a topical…