English
Related papers

Related papers: Univariate Ideal Membership Parameterized by Rank,…

200 papers

We present a new approach to the ideal membership problem for polynomial rings over the integers: given polynomials $f_0,f_1,...,f_n\in\Z[X]$, where $X=(X_1,...,X_N)$ is an $N$-tuple of indeterminates, are there $g_1,...,g_n\in\Z[X]$ such…

Commutative Algebra · Mathematics 2007-05-23 Matthias Aschenbrenner

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

Commutative Algebra · Mathematics 2019-08-08 John Abbott , Anna Maria Bigatti , Elisa Palezzato , Lorenzo Robbiano

The Ideal Membership Problem (IMP) tests if an input polynomial $f\in \mathbb{F}[x_1,\dots,x_n]$ with coefficients from a field $\mathbb{F}$ belongs to a given ideal $I \subseteq \mathbb{F}[x_1,\dots,x_n]$. It is a well-known fundamental…

Computational Complexity · Computer Science 2020-07-02 Arpitha P. Bharathi , Monaldo Mastrolilli

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

Logic in Computer Science · Computer Science 2026-05-21 Arka Ghosh , Sławomir Lasota

A cofactor representation of an ideal element, that is, a representation in terms of the generators, can be considered as a certificate for ideal membership. Such a representation is typically not unique, and some can be a lot more…

Symbolic Computation · Computer Science 2024-04-10 Clemens Hofstadler , Thibaut Verron

Let $F$ be a finitely generated free group, and let $H\le F$ be a finitely generated subgroup. An equation for an element $g\in F$ with coefficients in $H$ is an element $w(x)\in H*\langle x \rangle$ such that $w(g)=1$ in $F$; the degree of…

Group Theory · Mathematics 2024-03-26 Dario Ascari

A minor is principal means it is defined by the same row and column indices. Let $X$ be a square generic matrix, $K[X]$ the polynomial ring in entries of $X$, over an algebraically closed field, $K$. For fixed $t\leq n$, let $\mathfrak P_t$…

Commutative Algebra · Mathematics 2015-08-04 Ashley K. Wheeler

Let X be an algebraic toric set in a projective space over a finite field. We study the vanishing ideal, I(X), of X and show some useful degree bounds for a minimal set of generators of I(X). We give an explicit description of a set of…

Commutative Algebra · Mathematics 2015-01-12 Jorge Neves , Maria Vaz Pinto , Rafael H. Villarreal

We introduce a new class of polynomial ideals associated to a simple graph, $G$. Let $K[E_G]$ be the polynomial ring on the edges of $G$ and $K[V_G]$ the polynomial ring on the vertices of $G$. We associate to $G$ an ideal, $I(X_G)$,…

Commutative Algebra · Mathematics 2019-09-09 Jorge Neves , Maria Vaz Pinto , Rafael H. Villarreal

With a simple graph $G$ on $[n]$, we associate a binomial ideal $P_G$ generated by diagonal minors of an $n \times n$ matrix $X=(x_{ij})$ of variables. We show that for any graph $G$, $P_G$ is a prime complete intersection ideal and…

Commutative Algebra · Mathematics 2012-01-27 Viviana Ene , Ayesha Asloob Qureshi

Let $F$ be a finitely generated free group and let $H\le F$ be a finitely generated subgroup. Given an element $g\in F$, we study the ideal $\mathfrak{I}_g$ of equations for $g$ with coefficients in $H$, i.e. the elements $w(x)\in H*\langle…

Group Theory · Mathematics 2025-06-25 Dario Ascari

Let $\mathbb{K}$ be a field, $\mathcal{X}$ be an infinite set (of indeterminates), and $\mathcal{G}$ be a group acting on $\mathcal{X}$. An ideal in the polynomial ring $\mathbb{K}[\mathcal{X}]$ is called equivariant if it is invariant…

Logic in Computer Science · Computer Science 2025-07-15 Arka Ghosh , Aliaume Lopez

We consider the polynomial Ideal Membership Problem (IMP) for ideals encoding combinatorial problems that are instances of CSPs over a finite language. In this paper, the input polynomial $f$ has degree at most $d=O(1)$ (we call this…

Data Structures and Algorithms · Computer Science 2024-10-30 Arpitha P. Bharathi , Monaldo Mastrolilli

We prove that a monomial ideal $I$ generated in a single degree, is polymatroidal if and only if it has linear quotients with respect to the lexicographical ordering of the minimal generators induced by every ordering of variables. We also…

Commutative Algebra · Mathematics 2018-08-21 Somayeh Bandari , Rahim Rahmati-Asghar

An equigenerated monomial ideal $I$ in the polynomial ring $R=k[z_1,\ldots, z_n]$ is a Freiman ideal if $\mu(I^2)=\ell(I)\mu(I)-{\ell(I)\choose 2}$ where $\ell(I)$ is the analytic spread of $I$ and $\mu(I)$ is the number of minimal…

Commutative Algebra · Mathematics 2021-05-04 Guangjun Zhu , Yakun Zhao , Yijun Cui

Let $R^h$ denote the polynomial ring in variables $x_1,\,\ldots,\, x_h$ over a specified field $K$. We consider all of these rings simultaneously, and in each use lexicographic (lex) monomial order with $x_1 > \cdots > x_h$. Given a fixed…

Commutative Algebra · Mathematics 2020-03-03 Tigran Ananyan , Melvin Hochster

In this survey we determine an explicit set of generators of the maximal ideals in the ring $\mathbb R[x_1,\dots,x_n]$ of polynomials in $n$ variables with real coefficients and give an easy analytic proof of the Bass-Vasershtein theorem on…

Rings and Algebras · Mathematics 2014-10-24 Raymond Mortini , Rudolf Rupp

For a given ideal I in K[x_1,...,x_n,y_1,...,y_m] in a polynomial ring with n+m variables, we want to find all elements that can be written as f-g for some f in K[x_1,...,x_n] and some g in K[y_1,...,y_m], i.e., all elements of I that…

Symbolic Computation · Computer Science 2024-05-30 Manfred Buchacher , Manuel Kauers

Given polynomials $f_0,\dots, f_k$ the Ideal Membership Problem, IMP for short, asks if $f_0$ belongs to the ideal generated by $f_1,\dots, f_k$. In the search version of this problem the task is to find a proof of this fact. The IMP is a…

Computational Complexity · Computer Science 2026-02-10 Andrei A. Bulatov , Akbar Rafiey

To any lattice $L \subset \mathbb{Z}^{m}$ one can associate the lattice ideal $I_{L} \subset K[x_{1},...,x_{m}]$. This paper concerns the study of the relation between the binomial arithmetical rank and the minimal number of generators of…

Commutative Algebra · Mathematics 2013-04-29 Anargyros Katsabekis
‹ Prev 1 2 3 10 Next ›