English
Related papers

Related papers: Gr\"obner Bases for Linearized Polynomials

200 papers

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…

Symbolic Computation · Computer Science 2021-11-19 Jérémy Berthomieu , Mohab Safey El Din

Let K be a field with a valuation and let S be the polynomial ring S:= K[x_1,..., x_n]. We discuss the extension of Groebner theory to ideals in S, taking the valuations of coefficients into account, and describe the Buchberger algorithm in…

Commutative Algebra · Mathematics 2017-09-04 Andrew J. Chan , Diane Maclagan

We review some applications of Gr\"obner-Shirshov bases, including PBW theorems, linear bases of free universal algebras, normal forms for groups and semigroups, extensions of groups and algebras, embedding of algebras.

Rings and Algebras · Mathematics 2015-02-24 L. A. Bokut , Yuqun Chen

We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…

Algebraic Geometry · Mathematics 2015-05-27 Adam S. Sikora

In this paper we develop a Grobner bases theory for ideals of partial difference polynomials with constant or non-constant coefficients. In particular, we introduce a criterion providing the finiteness of such bases when a difference ideal…

Commutative Algebra · Mathematics 2014-10-28 Vladimir P. Gerdt , Roberto La Scala

In this paper we give elementary conditions completely characterising when the theory of modules of a Pr\"ufer domain is decidable. Using these results, we show that the theory of modules of the ring of integer valued polynomials is…

Logic · Mathematics 2024-12-17 Lorna Gregory

In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…

Commutative Algebra · Mathematics 2007-05-23 Vladimir P. Gerdt

We give an explicit algorithm to compute a projective resolution of a module over the noncommutative ring based on the noncommutative Groebner bases theory.

Algebraic Topology · Mathematics 2009-06-09 Tomohiro Fukaya

We investigate some Galois groups of linearized polynomials over fields such as $\mathbb{F}_q(t)$. The space of roots of such a polynomial is a module for its Galois group. We present a realization of the symmetric powers of this module, as…

Number Theory · Mathematics 2022-06-06 Rod Gow , Gary McGuire

We introduce the concept of a Gr\"obner nice pair of ideals in a polynomial ring and we present some applications.

Commutative Algebra · Mathematics 2021-01-22 Mircea Cimpoeaş , Dumitru I. Stamate

In this paper we present the first-ever computer formalization of the theory of Gr\"obner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the…

Symbolic Computation · Computer Science 2016-07-22 Alexander Maletzky

It is known that for binary codes one can use Gr\"obner bases to obtain a subset of codewords of minimal support that can be used to determine the second generalized Hamming weight of the code. In this paper we establish conditions on a…

Commutative Algebra · Mathematics 2025-10-14 Hernán de Alba , Cecilia Martínez-Reyes

Formal verification techniques based on computer algebra have proven highly effective for circuit verification. The circuit, given as an and-inverter graph, is encoded as a set of polynomials that automatically generates a Gr\"obner basis…

Symbolic Computation · Computer Science 2025-01-22 Daniela Kaufmann , Jérémy Berthomieu

In this paper, we characterized the relationship between Groebner bases and u-bases: any minimal Groebner basis of the syzygy module for n univariate polynomials with respect to the term-over-position monomial order is its u-basis.…

Symbolic Computation · Computer Science 2021-01-01 Dingkang Wang , Hesong Wang , Fanghui Xiao

We create several families of bases for the symmetric polynomials. From these bases we prove that certain Schur symmetric polynomials form a basis for quotients of symmetric polynomials that generalize the cohomology and the quantum…

Combinatorics · Mathematics 2019-11-19 Andrew Weinfeld

We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…

Combinatorics · Mathematics 2023-11-17 Bogdan Nica

In his Ph.D. thesis, Sean Griffin introduced a family of ideals and found monomial bases for their quotient rings. These rings simultaneously generalize the Delta Conjecture coinvariant rings of Haglund-Rhoades-Shimozono and the cohomology…

Combinatorics · Mathematics 2023-08-01 Tianyi Yu

This habilitation (German variant of a PhD on top of a PhD) thesis presents the quintessence of the ideas and experiences with Groebner Bases of Birgit Reinert. She died unexpectedly without providing an abstract. As arXiv requires an…

Rings and Algebras · Mathematics 2009-03-29 Birgit Reinert

Grassmann manifolds $G_{k,n}$ are among the central objects in geometry and topology. The Borel picture of the mod 2 cohomology of $G_{k,n}$ is given as a polynomial algebra modulo a certain ideal $I_{k,n}$. The purpose of this paper is to…

Algebraic Topology · Mathematics 2013-05-20 Zoran Z. Petrović , Branislav I. Prvulović , Marko Radovanović

Let $R$ be a graded ring. We introduce a class of graded $R$-modules called Gr\"obner-coherent modules. Roughly, these are graded $R$-modules that are coherent as ungraded modules because they admit an adequate theory of Gr\"obner bases.…

Commutative Algebra · Mathematics 2016-06-13 Rohit Nagpal , Andrew Snowden
‹ Prev 1 3 4 5 6 7 10 Next ›