Extended letterplace correspondence for nongraded noncommutative ideals and related algorithms
Roberto La Scala

TL;DR
This paper extends the letterplace correspondence to nongraded noncommutative ideals, enabling the modeling of such algebras via graded commutative algebras and introducing algorithms for computing inhomogeneous noncommutative Gröbner bases.
Contribution
It generalizes the letterplace correspondence to nongraded ideals and develops new algorithms using homogeneous commutative polynomials for noncommutative algebra computations.
Findings
Extended letterplace correspondence to nongraded ideals
Developed saturation notions for graded ideals and their analogues
Implemented algorithms in Maple and Singular for practical validation
Abstract
Let be the free associative algebra generated by a finite or countable number of variables . The notion of "letterplace correspondence" introduced in [1,2] for the graded (two-sided) ideals of is extended in this paper also to the nongraded case. This amounts to the possibility of modelizing nongraded noncommutative presented algebras by means of a class of graded commutative algebras that are invariant under the action of the monoid of natural numbers. For such purpose we develop the notion of saturation for the graded ideals of , where is an extra variable and for their letterplace analogues in the commutative polynomial algebra , where ranges in . In particular, one obtains an alternative algorithm for computing inhomogeneous noncommutative Gr\"obner bases using just homogeneous commutative…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Algebraic structures and combinatorial models
