Related papers: Computing Free Non-commutative Groebner Bases over…
Due to the elimination property held by the lexicographic monomial order, the corresponding Groebner bases display strong structural properties from which meaningful informations can easily be extracted. We study these properties for…
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…
Motivated by better understanding the bideterminant (=product of minors) basis on the polynomial ring in $n \times m$ variables, we develop theory \& algorithms for Gr\"obner bases in not only algebras with straightening law (ASLs or Hodge…
Two correspondences have been provided that associate any linear code over a finite field with a binomial ideal. In this paper, algorithms for computing their Graver bases and universal Gr\"obner bases are given. To this end, a connection…
A Comprehensive Grobner system for a parametric ideal I in K(A)[X] represents the collection of all Grobner bases of the ideals I' in K[X] obtained as the values of the parameters A vary in K. The recent algorithms for computing them…
In this paper we introduce a working generalization of the theory of Gr\"obner bases for algebras of partial difference polynomials with constant coefficients. One obtains symbolic (formal) computation for systems of linear or non-linear…
For an efficient implementation of Buchberger's Algorithm, it is essential to avoid the treatment of as many unnecessary critical pairs or obstructions as possible. In the case of the commutative polynomial ring, this is achieved by the…
The paper gives analogues of some starting results in the theory of Gaussian Hilbert Spaces for semicircular distributed random variables. The transition from the commutative to the free frame is done considering matrices of increasing…
One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…
In this survey, we formulate the Gr\"{o}bner-Shirshov bases theory for associative algebras and Lie algebras. Some new Composition-Diamond lemmas and applications are mentioned.
Long before we learn to construct the field of rational numbers (out of the ring of integers) at university, we learn how to calculate with fractions at school. When it comes to "numbers", we are used to a commutative multiplication, for…
In this paper, we review Shirshov's method for free Lie algebras invented by him in 1962 which is now called the Groebner-Shirshov bases theory.
In this paper, we construct a canonical linear basis for free commutative integro-differential algebras by applying the method of Gr\"obner-Shirshov bases. We establish the Composition-Diamond Lemma for free commutative differential…
We consider the problem of determining Gr\"obner bases of binomial ideals associated with linear error correcting codes. Computation of Gr\"obner bases of linear codes have become a topic of interest to many researchers in coding theory…
We report on our experiences exploring state of the art Groebner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature…
A contemporary and exciting application of Groebner bases is their use in computational biology, particularly in the reverse engineering of gene regulatory networks from experimental data. In this setting, the data are typically limited to…
In this paper, we extend the characterization of $\mathbb{Z}[x]/\ < f \ >$, where $f \in \mathbb{Z}[x]$ to be a free $\mathbb{Z}$-module to multivariate polynomial rings over any commutative Noetherian ring, $A$. The characterization allows…
Let $K$ be an infinite field and $K< X> =K< X_1,...,X_n>$ the free associative algebra generated by $X=\{X_1,...,X_n\}$ over $K$. It is proved that if $I$ is a two-sided ideal of $K< X>$ such that the $K$-algebra $A=K< X> /I$ is almost…
Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…
We report on an approach to integration-by-parts reduction based on Gr\"obner bases. We establish the underlying noncommutative rational double-shift algebra wherein the integration-by-parts relations form a left ideal. We describe in…