English
Related papers

Related papers: Groebner bases via linkage

200 papers

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

Rings and Algebras · Mathematics 2011-06-02 Roberto Boldini

We study the ideals of the partition, Brauer, and Jones monoid, establishing various combinatorial results on generating sets and idempotent generating sets via an analysis of their Graham--Houghton graphs. We show that each proper ideal of…

Group Theory · Mathematics 2016-08-16 James East , Robert Gray

We give a description of the minimal primes of the ideal generated by the 2 x 2 adjacent minors of a generic matrix. We also compute the complete prime decomposition of the ideal of adjacent m x m minors of an m x n generic matrix when the…

Commutative Algebra · Mathematics 2007-05-23 Serkan Hosten , Seth Sullivant

Given a finite set $\mathbf{X}$ of distinct points, Marinari-Mora's 'Axis of Evil Theorem' states that a combinatorial algorithm and interpolation enable to find a 'linear' factorization for a lexicographical minimal Groebner basis…

Commutative Algebra · Mathematics 2012-08-09 Michela Ceria

Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…

Commutative Algebra · Mathematics 2024-11-07 Hiroshi Kera , Yuki Ishihara , Yuta Kambe , Tristan Vaccon , Kazuhiro Yokoyama

We present an elegant, generic and extensive formalization of Gr\"obner bases in Isabelle/HOL. The formalization covers all of the essentials of the theory (polynomial reduction, S-polynomials, Buchberger's algorithm, Buchberger's criteria…

Logic in Computer Science · Computer Science 2018-05-02 Alexander Maletzky , Fabian Immler

Let $I\subset \mathbb C[x,y,z]$ be an ideal of height 2 and minimally generated by three homogeneous polynomials of the same degree. If $I$ is a locally complete intersection we give a criterion for $\mathbb C[x,y,z]/I$ to be arithmetically…

Commutative Algebra · Mathematics 2012-11-02 Stefan O. Tohaneanu

In this paper, we extend the characterization of $\mathbb{Z}[x]/\ < f \ >$, where $f \in \mathbb{Z}[x]$ to be a free $\mathbb{Z}$-module to multivariate polynomial rings over any commutative Noetherian ring, $A$. The characterization allows…

Symbolic Computation · Computer Science 2016-04-05 Maria Francis , Ambedkar Dukkipati

Given an affine algebra $R=K[x_1,\dots,x_n]/I$ over a field $K$, where $I$ is an ideal in the polynomial ring $P=K[x_1,\dots,x_n]$, we examine the task of effectively calculating re-embeddings of $I$, i.e., of presentations $R=P'/I'$ such…

Commutative Algebra · Mathematics 2024-01-19 Martin Kreuzer , Le Ngoc Long , Lorenzo Robbiano

In this article we produce Groebner bases for the defining ideal of a monomial curve that corresponds to an almost arithmetic sequence of positive integers, correcting previous work of Sengupta,(2003).

Commutative Algebra · Mathematics 2007-05-23 Ibrahim Al-Ayyoub

We study the binomial and monomial ideals arising from linear equivalence of divisors on graphs from the point of view of Gr\"obner theory. We give an explicit description of a minimal Gr\"obner bases for each higher syzygy module. In each…

Combinatorics · Mathematics 2019-10-21 Fatemeh Mohammadi , Farbod Shokrieh

This paper is concerned with linear algebra based methods for solving exactly polynomial systems through so-called Gr\"obner bases, which allow one to compute modulo the polynomial ideal generated by the input equations. This is a topical…

Symbolic Computation · Computer Science 2023-07-28 Jérémy Berthomieu , Christian Eder , Mohab Safey El Din

Multiview ideals arise from the geometry of image formation in pinhole cameras, and universal multiview ideals are their analogs for unknown cameras. We prove that a natural collection of polynomials form a universal Gr\"obner basis for…

Commutative Algebra · Mathematics 2025-09-30 Timothy Duff , Jack Kendrick , Rekha R. Thomas

Given a finite set of arbitrarily distributed points in affine space with arbitrary multiplicity structures, we present an algorithm to compute the reduced Groebner basis of the vanishing ideal under the lexicographic ordering. Our method…

Algebraic Geometry · Mathematics 2013-01-22 Na Lei , Xiaopeng Zheng , Yuxue Ren

In this paper we show that polyomino ideal of a simple polyomino coincides with the toric ideal of a weakly chordal bipartite graph and hence it has a quadratic Gr\"obner basis with respect to a suitable monomial order.

Commutative Algebra · Mathematics 2015-01-26 Ayesha Asloob Qureshi , Takafumi Shibuta , Akihiro Shikama

Let K be a field and let m_0,...,m_{n} be an almost arithmetic sequence of positive integers. Let C be a toric variety in the affine (n+1)-space, defined parametrically by x_0=t^{m_0},...,x_{n}=t^{m_{n}}. In this paper we produce a minimal…

Commutative Algebra · Mathematics 2010-09-07 Ibrahim Al-Ayyoub

In this paper, we study ideals spanned by polynomials or overconvergent series in a Tate algebra. With state-of-the-art algorithms for computing Tate Gr{\"o}bner bases, even if the input is polynomials, the size of the output grows with the…

Symbolic Computation · Computer Science 2022-02-16 Xavier Caruso , Tristan Vaccon , Thibaut Verron

Let $M$ be an $n\times n$ matrix of homogeneous linear forms over a field $\Bbbk$. If the ideal $\mathcal{I}_{n-2}(M)$ generated by minors of size $n-1$ is Cohen-Macaulay, then the Gulliksen-Neg{\aa}rd complex is a free resolution of…

Symbolic Computation · Computer Science 2024-05-03 Sriram Gopalakrishnan

The goal of this paper is to study irreducible families W(b;a) of codimension 4, arithmetically Gorenstein schemes X of P^n defined by the submaximal minors of a t x t matrix A with entries homogeneous forms of degree a_j-b_i. Under some…

Algebraic Geometry · Mathematics 2011-09-13 Jan O. Kleppe , Rosa M. Miro-Roig

We study the problem of the computation of Groebner basis for the ideal of linear recurring relations of a doubly periodic array. We find a set of indexes such that, along with some conditions, guarantees that the set of polynomials…

Information Theory · Computer Science 2024-01-22 José Joaquín Bernal , Juan Jacobo Simón