Related papers: The first Mayr-Meyer ideal
In this paper, we investigate three problems concerning the toric ideal associated to a matroid. Firstly, we list all matroids $\mathcal M$ such that its corresponding toric ideal $I_{\mathcal M}$ is a complete intersection. Secondly, we…
The ideal membership problem asks whether an element in the ring belongs to the given ideal. In this paper, we propose a function that reflecting the complexity of the ideal membership problem in the ring of Laurent polynomials with integer…
We consider determinantal ideals, where the generating minors are encoded in a hypergraph. We study when the generating minors form a Gr\"obner basis. In this case, the ideal is radical, and we can describe algebraic and numerical…
The classical involutive division theory by Janet decomposes in the same way both the ideal and the escalier. The aim of this paper, following Janet's approach, is to discuss the combinatorial properties of involutive divisions, when…
An ideal in a polynomial ring encodes a system of linear partial differential equations with constant coefficients. Primary decomposition organizes the solutions to the PDE. This paper develops a novel structure theory for primary ideals in…
The membership problem for an algebraic structure asks whether a given element is contained in some substructure, which is usually given by generators. In this work we study the membership problem, as well as the conjugacy problem, for…
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…
Recent results of Kahle and Miller give a method of constructing primary decompositions of binomial ideals by first constructing "mesoprimary decompositions" determined by their underlying monoid congruences. These mesoprimary…
We consider the bit-probe complexity of the set membership problem, where a set S of size at most n from a universe of size m is to be represented as a short bit vector in order to answer membership queries of the form "Is x in S?" by…
Given an ideal $I$ and a polynomial $f$ the Ideal Membership Problem is to test if $f\in I$. This problem is a fundamental algorithmic problem with important applications and notoriously intractable. We study the complexity of the Ideal…
We define the notion of componentwise regularity and study some of its basic properties. We prove an analogue, when working with weight orders, of Buchberger's criterion to compute Gr\"obner bases; the proof of our criterion relies on a…
Let $\mathbb{F}[X]$ be the polynomial ring over the variables $X=\{x_1,x_2, \ldots, x_n\}$. An ideal $I=\langle p_1(x_1), \ldots, p_n(x_n)\rangle$ generated by univariate polynomials $\{p_i(x_i)\}_{i=1}^n$ is a \emph{univariate ideal}. We…
In this paper we describe the method which we applied to successfully compute the primary decomposition of a certain ideal coming from applications in combinatorial algebra and algebraic statistics regarding conditional independence…
We establish a criterion for the (failure of) the containment $I^{(m)}\subset I^r$ for 3-generated ideals $I$ defining reduced sets of points in $\mathbb{P}^2$. Our criterion arises from studying the minimal free resolutions of the powers…
We find a relation between the vanishing of a globally defined residue current on $\P^n$ and solution of the membership problem with control of the polynomial degrees. Several classical results appear as special cases, such as Max…
We describe the universal Groebner basis of the ideal of maximal minors and the ideal of $2$-minors of a multigraded matrix of linear forms. Our results imply that the ideals are radical and provide bounds on the regularity. In particular,…
We present an algorithm to compute the primary decomposition of a submodule $\mathcal{N}$ of the free module $\Z[x_1, \ldots, x_n]^m$. For this purpose we use algorithms for primary decomposition of ideals in the polynomial ring over the…
We discuss the possibility of representing elements in polynomial ideals in $\C^N$ with optimal degree bounds. Classical theorems due to Macaulay and Max Noether say that such a representation is possible under certain conditions on the…
A natural candidate for a generating set of the (necessarily prime) defining ideal of an $n$-dimensional monomial curve, when the ideal is an almost complete intersection, is a full set of $n$ critical binomials. In a somewhat modified and…
Let I be an ideal of height two in R=k[x_0,x_1] generated by forms of the same degree, and let K be the ideal of defining equations of the Rees algebra of I. Suppose that the second largest column degree in the syzygy matrix of I is e. We…