Related papers: Universal Groebner bases for maximal minors

Abhyankar defined an ideal to be Hilbertian if its Hilbert polynomial coincides with its Hilbert function for all nonnegative integers. In 1984, he proved that the ideal of (r+1)-order minors of a generic p x q matrix is Hilbertian. We give…

Let $S=\mathbb{C}[x_{ij}]$ be a polynomial ring of $m\times n$ variables over $\mathbb{C}$ and let $I$ be the determinantal ideal of maximal minors of $S$. Using the representation theoretic techniques introduced in arXiv:1305.1719,…

The purpose of this work is to generalize part of the theory behind Faugere's "F5" algorithm. This is one of the fastest known algorithms to compute a Groebner basis of a polynomial ideal I generated by polynomials f_{1},...,f_{m}. A major…

The W-characteristic set of a polynomial ideal is the minimal triangular set contained in the reduced lexicographical Groebner basis of the ideal. A pair (G,C) of polynomial sets is a strong regular characteristic pair if G is a reduced…

The new type of ideal basis introduced herein constitutes a compromise between the Gr\"obner bases based on the Buchberger's algorithm and the characteristic sets based on the Wu's method. It reduces the complexity of the traditional…

Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\Bbb Z[X]$, $X=(x_1,\dots,x_n)$ and let $I$ be their union. We propose an algorithm to compute the Gr\"obner base of $I$ under the assumption that the…

Let R be a standard graded polynomial ring in f variables over a field and Psi be an f by g matrix of linear forms from R, where g is positive and less than f. Assume that the row vector of variables annihilates Psi and that the ideal I…

We study the weak and strong Lefschetz properties for $R/\mathrm{in}(I_t)$, where $I_t$ is the ideal of a polynomial ring $R$ generated by the $t$-minors of an $m\times n$ matrix of indeterminates, and $\mathrm{in}(I_t)$ denotes the initial…

In this paper we show that determinantal ideals of generic matrices are Knutson ideals. This fact leads to a useful result about Gr\"obner bases of certain sums of determinantal ideals. More specifically, given $I=I_1+\ldots+I_k$ a sum of…

We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…

Schubert patch ideals are a class of generalized determinantal ideals. They are prime defining ideals of open patches of Schubert varieties in the type $A$ flag variety. In this paper, we adapt the linkage-theoretic approach of E. Gorla, J.…

The maximal minors of a matrix of indeterminates are a universal Gr\"obner basis by a theorem of Bernstein, Sturmfels and Zelevinsky. On the other hand it is known that they are not always a universal Sagbi basis. By an experimental…

In this paper we study classes of monomial ideals for which all of its powers have a linear resolution. Let K[x_{1},x_{2}] be the polynomial ring in two variables over the field K, and let L be the generalized mixed product ideal induced by…

In this paper, we draw a connection between ideal lattices and Gr\"{o}bner bases in the multivariate polynomial rings over integers. We study extension of ideal lattices in $\mathbb{Z}[x]/\langle f \rangle$ (Lyubashevsky \& Micciancio,…

In this paper, we study the family of determinantal ideals of "close" cuts of Hankel matrices, say $ \mathcal{f} $. We show that the multi-Rees algebra of ideals in $ \mathcal{f} $ is defined by a quadratic Gr\"{o}bner basis, it is Koszul,…

We show that the universal Gr\"obner basis and the Graver basis of a binomial edge ideal coincide. We provide a description for this basis set in terms of certain paths in the underlying graph. We conjecture a similar result for a parity…

Associated to any vector configuration A is a toric ideal encoded by vectors in the kernel of A. Each toric ideal has two special generating sets: the universal Gr\"obner basis and the Graver basis. While the former is generally a proper…

In a recent paper by Harada, Seceleanu, and \c{S}ega, the Hilbert function, betti table, and graded minimal free resolution of a general principal symmetric ideal are determined when the number of variables in the polynomial ring is…

In this work we introduce a new set of invariants associated to the linear strands of a minimal free resolution of a $\mathbb{Z}$-graded ideal $I\subseteq R=\Bbbk[x_1, \ldots, x_n]$. We also prove that these invariants satisfy some…

We study an inductive method of computing initial ideals and Gr\"obner bases for families of ideals in a polynomial ring. This method starts from a given set of pairs $(I,J)$ where $I$ is any ideal and $J$ is a monomial ideal contained in…