English
Related papers

Related papers: Degree Bounds for Gr\"obner Bases in Algebras of S…

200 papers

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.…

Algebraic Geometry · Mathematics 2026-02-13 Carlos Rodriguez , Anna-Laura Sattelberger

For the solvable polynomial algebras introduced and studied by Kandri-Rody and Weispfenning [J. Symbolic Comput., 9(1990)], a constructive characterization is given in terms of Gr\"obner bases for ideals of free algebras, thereby solvable…

Rings and Algebras · Mathematics 2013-01-08 Huishi Li

Let $F$ be a non-negatively graded free module over a polynomial ring $\mathbb{K}[x_1,\dots,x_n]$ generated by $m$ basis elements. Let $M$ be a submodule of $F$ generated by elements in $F$ with degrees bounded by $D$ and dim $F/M$=$r$. We…

Commutative Algebra · Mathematics 2022-04-22 Yihui Liang

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…

Symbolic Computation · Computer Science 2017-05-09 Amir Hashemi , Werner M. Seiler

G-algebras, or Groebner bases algebras, were considered by Levandovsky, these algebras include very important families of algebras, like the Weyl algebras and the universal enveloping algebra of a finite dimensional Lie algebra. These…

Rings and Algebras · Mathematics 2014-01-21 R. Martinez-Villa , J. Mondragon

We prove a double-exponential upper bound on the degree and on the complexity of constructing a Janet basis of a $D$-module. This generalizes a well known bound on the complexity of a Gr\"obner basis of a module over the algebra of…

Analysis of PDEs · Mathematics 2007-05-23 Alexander Chistov , Dima Grigoriev

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…

Cryptography and Security · Computer Science 2022-09-22 Alessio Caminata , Elisa Gorla

For central simple finitely generated algebras of finite Gelfand-Kirillov dimension and for their division algebras upper bounds are obtained for the transcendence degree of their commutative subalgebras and subfields respectively. In the…

Rings and Algebras · Mathematics 2007-05-23 V. Bavula

We develop the theory of integrable representations for an arbitrary maximal parabolic subalgebra of an affine Lie algebra. We see that such subalgebras can be thought of as arising in a natural way from a Borel--de Siebenthal pair of…

Representation Theory · Mathematics 2018-08-31 Vyjayanthi Chari , Deniz Kus , Matt Odell

We make explicit the exponential bound on the degrees of the polynomials appearing in the Effective Quillen-Suslin Theorem, and apply it jointly with the Hilbert-Burch Theorem to show that the syzygy module of a sequence of m polynomials in…

Commutative Algebra · Mathematics 2021-06-09 Teresa Cortadellas Benitez , Carlos D'Andrea , Eulalia Montoro

We generalize signature Gr\"obner bases, previously studied in the free algebra over a field or polynomial rings over a ring, to ideals in the mixed algebra $R[x_1,...,x_k]\langle y_1,\dots,y_n \rangle$ where $R$ is a principal ideal…

Commutative Algebra · Mathematics 2023-07-19 Clemens Hofstadler , Thibaut Verron

This paper studies three results that describe the structure of the super-coinvariant algebra of pseudo-reflection groups over a field of characteristic $0$. Our most general result determines the top component in total degree, which we…

Combinatorics · Mathematics 2021-09-09 Joshua P. Swanson , Nolan R. Wallach

This paper introduces and studies a class of Weyl-type algebras \(A_{p,t,\cA} = \Weyl{e^{\pm x^{p} e^{t x}},\; e^{\cA x},\; x^{\cA}}\) constructed over exponential-polynomial rings, where \(\FF\) is a field of characteristic zero, \(\cA\)…

Rings and Algebras · Mathematics 2025-12-09 Mohammad H. M. Rashid

We present here a new approach for computing Gr\"obner bases for bilateral modules over an effective ring. Our method is based on Weispfenning notion of restricted Gr\"obner bases and related multiplication.

Rings and Algebras · Mathematics 2016-11-29 Michela Ceria

The so called generalized down-up algebras are revisited from a viewpoint of Gr\"obner basis theory. Particularly it is shown explicitly that generalized down-up algebras are solvable polynomial algebras (provided $\lambda\omega\ne 0$), and…

Rings and Algebras · Mathematics 2022-01-11 Rabigul Tuniyaz , Gulshadam Yunus

We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…

Algebraic Geometry · Mathematics 2024-11-27 Daoji Huang , Matt Larson

Let $R$ be a polynomial ring in $m$ variables over a field of characteristic zero. We classify all rank $n$ twisted generalized Weyl algebras over $R$, up to $\mathbb{Z}^n$-graded isomorphisms, in terms of higher spin 6-vertex…

Rings and Algebras · Mathematics 2020-06-09 Jonas T. Hartwig , Daniele Rosso

The aim of the paper is to extend the class of generalized Weyl algebras to a larger class of rings (they are also called {\em generalized Weyl algebras}) that are determined by two ring endomorphisms rather than one as in the case of `old'…

Rings and Algebras · Mathematics 2016-12-30 V. V Bavula

This paper introduces and systematically studies Weyl-type, Witt-type, and non-associative algebras defined over expolynomial rings -- commutative rings generated by exponential functions $e^{\alpha x}$, exponentials of exponentials $e^{\pm…

Rings and Algebras · Mathematics 2025-12-15 Mohammad H. M Rashid

Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…

Symbolic Computation · Computer Science 2016-10-03 Matthew England , James H. Davenport
‹ Prev 1 2 3 10 Next ›