Related papers: Groebner bases via linkage

For a particular experimental design, there is interest in finding which polynomial models can be identified in the usual regression set up. The algebraic methods based on Groebner bases provide a systematic way of doing this. The algebraic…

The computation of Gr\"obner bases is an established hard problem. By contrast with many other problems, however, there has been little investigation of whether this hardness is robust. In this paper, we frame and present results on the…

We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points…

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…

For a partition $\lambda$ of $n$, the _Specht ideal_ $I_\lambda \subset K[x_1, \ldots, x_n]$ is the ideal generated by all Specht polynomials of shape $\lambda$. In their unpublished manuscript, Haiman and Woo showed that $I_\lambda$ is a…

In this article we consider the problem of finding generators of the toric ideal associated to a combinatorial object called a staged tree. Our main theorem states that toric ideals of staged trees that are balanced and stratified are…

Gr\"{o}bner bases are nowadays central tools for solving various problems in commutative algebra and algebraic geometry. A typical use of Gr\"{o}bner bases is the multivariate polynomial system solving, which enables us to construct…

Let I be either the ideal of maximal minors or the ideal of 2-minors of a row graded or column graded matrix of linear forms L. In two previous papers we showed that I is a Cartwright-Sturmfels ideal, that is, the multigraded generic…

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,…

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…

For $\Bbbk$ a field, let $X$ a $m \times n$ matrix of variables and $S=\Bbbk[X].$ We consider the determinantal ideal $I_2 \subseteq S$ generated by the $2$-minors of $X.$ In this paper we find a suitable monomial order over $S$ such that…

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…

Generic linkage is used to compute a prime ideal such that the radical of the initial ideal of the prime ideal is equal to the radical of a given codimension two monomial ideal that has a Cohen-Macaulay quotient ring.

The brain processes information about the environment via neural codes. The neural ideal was introduced recently as an algebraic object that can be used to better understand the combinatorial structure of neural codes. Every neural ideal…

The goal of this paper is to present examples of families of homogeneous ideals in the polynomial ring over a field that satisfy the following condition: every product of ideals of the family has a linear free resolution. As we will see,…

This paper presents an algorithm for computing Groebner bases based upon labeled polynomials and ideas from the algorithm F5. The main highlights of this algorithm compared with analogues are simplicity both of the algorithm and of the its…

Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…

It is known that for a monomial ideal $I$, the number of minimal generators, $\mu(I^n)$, eventually follows a polynomial pattern for increasing $n$. In general, little is known about the power at which this pattern emerges. Even less is…

We give an introduction to the theory of determinantal ideals and rings, their Groebner bases, initial ideals and algebras, respectively. The approach is based on the straightening law and the Knuth-Robinson-Schensted correspondence. The…

For a given monomial ideal $J \subset k[x_1, \ldots, x_n]$ and a given monomial order $\prec$, the moduli functor of all reduced Gr\"obner bases with respect to $\prec$ whose initial ideal is $J$ is determined. In some cases, such a functor…