A Reachability Test for Systems over Polynomial Rings using Gröbner Bases

Author(s):  
L.C.G.J.M. Habets
2014 ◽  
Vol 24 (08) ◽  
pp. 1157-1182 ◽  
Author(s):  
Roberto La Scala

Let K〈xi〉 be the free associative algebra generated by a finite or a countable number of variables xi. The notion of "letterplace correspondence" introduced in [R. La Scala and V. Levandovskyy, Letterplace ideals and non-commutative Gröbner bases, J. Symbolic Comput. 44(10) (2009) 1374–1393; R. La Scala and V. Levandovskyy, Skew polynomial rings, Gröbner bases and the letterplace embedding of the free associative algebra, J. Symbolic Comput. 48 (2013) 110–131] for the graded (two-sided) ideals of K〈xi〉 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 K〈xi,t〉, where t is an extra variable and for their letterplace analogues in the commutative polynomial algebra K[xij, tj], where j ranges in ℕ. In particular, one obtains an alternative algorithm for computing inhomogeneous noncommutative Gröbner bases using just homogeneous commutative polynomials. The feasibility of the proposed methods is shown by an experimental implementation developed in the computer algebra system Maple and by using standard routines for the Buchberger algorithm contained in Singular.


2020 ◽  
Vol 30 (08) ◽  
pp. 1565-1576
Author(s):  
Murray Bremner ◽  
Vladimir Dotsenko

Using methods of computer algebra, especially, Gröbner bases for submodules of free modules over polynomial rings, we solve a classification problem in theory of algebraic operads: we show that the only nontrivial (possibly inhomogeneous) distributive law between the operad of Lie algebras and the operad of commutative associative algebras is given by the Livernet–Loday formula deforming the Poisson operad into the associative operad.


2011 ◽  
Vol 48 (4) ◽  
pp. 458-474
Author(s):  
Junaid Khan

A theory of “subalgebra basis” analogous to standard basis (the generalization of Gröbner bases to monomial orderings which are not necessarily well orderings [1]) for ideals in polynomial rings over a field is developed. We call these bases “SASBI Basis” for “Subalgebra Analogue to Standard Basis for Ideals”. The case of global orderings, here they are called “SAGBI Basis” for “Subalgebra Analogue to Gröbner Basis for Ideals”, is treated in [6]. Sasbi bases may be infinite. In this paper we consider subalgebras admitting a finite Sasbi basis and give algorithms to compute them.


2010 ◽  
Vol 8 (4) ◽  
Author(s):  
Janusz Zieliński

AbstractBorder bases are an alternative to Gröbner bases. The former have several more desirable properties. In this paper some constructions and operations on border bases are presented. Namely; the case of a restriction of an ideal to a polynomial ring (in a smaller number of variables), the case of the intersection of two ideals, and the case of the kernel of a homomorphism of polynomial rings. These constructions are applied to the ideal of relations and to factorizable derivations.


Author(s):  
J. Apel ◽  
J. Stückrad ◽  
P. Tworzewski ◽  
T. Winiarski

2018 ◽  
Vol 28 (01) ◽  
pp. 1-36 ◽  
Author(s):  
Xing Gao ◽  
Li Guo ◽  
Markus Rosenkranz

Using the language of operated algebras, we construct and investigate a class of operator rings and enriched modules induced by a derivation or Rota–Baxter operator. In applying the general framework to univariate polynomials, one is led to the integro–differential analogs of the classical Weyl algebra. These are analyzed in terms of skew polynomial rings and noncommutative Gröbner bases.


2018 ◽  
Vol 17 (06) ◽  
pp. 1850112 ◽  
Author(s):  
Maria Francis ◽  
Ambedkar Dukkipati

In this paper, we draw connections between ideal lattices and multivariate polynomial rings over integers using Gröbner bases. Univariate ideal lattices are ideals in the residue class ring, [Formula: see text] (here [Formula: see text] is a monic polynomial) and cryptographic primitives have been built based on these objects. Ideal lattices in the univariate case are generalizations of cyclic lattices. We introduce the notion of multivariate cyclic lattices and show that ideal lattices are a generalization of them in the multivariate case too. Based on multivariate ideal lattices, we construct hash functions using Gröbner basis techniques. We define a worst case problem, shortest substitution problem with respect to an ideal in [Formula: see text], and use its computational hardness to establish the collision resistance of the hash functions.


Sign in / Sign up

Export Citation Format

Share Document