Related papers: Noncommutative Gr\"obner bases over rings
Assuming sufficiently many terms of a n-dimensional table defined over a field are given, we aim at guessing the linear recurrence relations with either constant or polynomial coefficients they satisfy. In many applications, the table terms…
We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…
Border bases are a generalization of Gr\"obner bases for zero-dimensional ideals in polynomial rings. In this article, we introduce border bases for a non-commutative ring of linear differential operators, namely the rational Weyl algebra.…
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…
In the paper, we establish Gr\"obner-Shirshov bases for semirings and commutative semirings. As applications, we obtain Gr\"obner-Shirshov bases and A. Blass's (1995) and M. Fiore -T. Leinster's (2004) normal forms of the semirings…
We develop algebraic tools for statistical inference from samples of rotation matrices. This rests on the theory of D-modules in algebraic analysis. Noncommutative Gr\"obner bases are used to design numerical algorithms for maximum…
We construct by geometric methods a noncommutative model E of the algebra of regular functions on the universal (2-fold) cover M of certain nilpotent coadjoint orbits O for a complex simple Lie algebra g. Here O is the dense orbit in the…
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…
We present a general method for computing discriminants of noncommutative algebras. It builds a connection with Poisson geometry and expresses the discriminants as products of Poisson primes. The method is applicable to algebras obtained by…
We define a new type of ideal basis called the proper basis that improves both Gr\"obner basis and Buchberger's algorithm. Let $x_1$ be the least variable of a monomial ordering in a polynomial ring $K[x_1,\dotsc,x_n]$ over a field $K$. The…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
We shall describe a simple generalization of commutative rings. The category GR of such "rings", contains the ordinary commutative rings (fully faithfully), but also the "integers" and "residue field" at a real or complex place of a field ;…
We develop a theory of bicrystalline ideals, synthesizing Gr\"obner basis techniques and Kashiwara's crystal theory. This provides a unified algebraic, combinatorial, and computational approach that applies to ideals of interest, old and…
One of the major open problems in noncommutative algebraic geometry is the classification of noncommutative projective surfaces (or, slightly more generally, of noetherian connected graded domains of Gelfand-Kirillov dimension 3). Earlier…
Let K be a field equipped with a valuation. Tropical varieties over K can be defined with a theory of Gr{\"o}bner bases taking into account the valuation of K. While generalizing the classical theory of Gr{\"o}bner bases, it is not clear…
Let $K\ < x_i\ >$ be the free associative algebra generated by a finite or countable number of variables $x_i$. The notion of "letterplace correspondence" introduced in [1,2] for the graded (two-sided) ideals of $K\ < x_i\ >$ is extended in…
We consider ideals involving the maximal minors of a polynomial matrix. For example, those arising in the computation of the critical values of a polynomial restricted to a variety for polynomial optimisation. Gr\"obner bases are a…
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…
Inspired by the commutator and anticommutator algebras derived from algebras graded by groups, we introduce noncommutatively graded algebras. We generalize various classical graded results to the noncommutatively graded situation concerning…
We formulate a mathematical setup for computational neural networks using noncommutative algebras and near-rings, in motivation of quantum automata. We study the moduli space of the corresponding framed quiver representations, and find…