Related papers: Computing Free Non-commutative Groebner Bases over…
In this paper, we examine the structure of systems that are weighted homogeneous for several systems of weights, and how it impacts the computation of Gr\"obner bases. We present several linear algebra algorithms for computing Gr\"obner…
After the language of module and theirs morphisms, this short course presents matricial calculus and determinants in a commutative ring as appliction of ``remarquable identities'' in the ring of polynomials with integer coefficients with…
In this paper, we characterized the relationship between Groebner bases and u-bases: any minimal Groebner basis of the syzygy module for n univariate polynomials with respect to the term-over-position monomial order is its u-basis.…
We study associative graded algebras which have a ``complete flag'' of cyclic modules with linear free resolutions, i.e., algebras over which there is a cyclic Koszul module with every admissible number of relations (from zero up to the…
Each linear code can be described by a code ideal given as the sum of a toric ideal and a non-prime ideal. In this way, several concepts from the theory of toric ideals can be translated into the setting of code ideals. It will be shown…
Exploiting symmetry in Groebner basis computations is difficult when the symmetry takes the form of a group acting by automorphisms on monomials in finitely many variables. This is largely due to the fact that the group elements, being…
In this paper, we establish the Composition-Diamond lemma for associative nonunitary Rota-Baxter algebras with weight $\lambda$. As applications, we obtain a linear basis of a free commutative Rota-Baxter algebra without unity and show that…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
In this paper, we propose the concept of an $\Omega$-Rota-Baxter system, which is a generalization of a Rota-Baxter system and an $\Omega$-Rota-Baxter algebra of weight zero. In the framework of operated algebras, we obtain a linear basis…
In this survey, we outline two recent constructions of free commutative integro-differential algebras. They are based on the construction of free commutative Rota-Baxter algebras by mixable shuffles. The first is by evaluations. The second…
Many years ago, Rota proposed a program on determining algebraic identities that can be satisfied by linear operators. After an extended period of dormant, progress on this program picked up speed in recent years, thanks to perspectives…
One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{\"o}bner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in the case of…
We give illustrative examples of how the computer algebra system OSCAR can support research in commutative algebra and algebraic geometry. We start with a thorough introduction to Groebner basis techniques, with particular emphasis on the…
The goal of this paper is to introduce the notion of $G$-Frobenius manifolds for any finite group $G$. This work is motivated by the fact that any $G$-Frobenius algebra yields an ordinary Frobenius algebra by taking its $G$-invariants. We…
We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…
In this paper we use the operadic framework to find Gr\"obner-Shirshov bases for the free quadri-algebra. We perform computations using the representation of the nonsymmetric operad by planar rooted trees in a very intuitive way.…
Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among…
Motivated by recent work on the use of topological methods to study collections of rings between an integral domain and its quotient field, we examine spaces of subrings of a commutative ring, where these spaces are endowed with the Zariski…
We describe how Groebner bases can be used to solve the reduction problem for Feynman integrals, i.e. to construct an algorithm that provides the possibility to express a Feynman integral of a given family as a linear combination of some…
This text consists of five relatively systematic notes on Gr\"obner bases and free resolutions of modules over solvable polynomial algebras.