Related papers: A Groebner basis for the secant ideal of the secon…
In this note we study exceptional algebroids, focusing on their relation to type IIB superstring theory. We show that a IIB-exact exceptional algebroid (corresponding to the group $E_{n(n)}\times \mathbb{R}^+$, for $n\le 6$) locally has a…
The interpolation step of Guruswami and Sudan's list decoding of Reed-Solomon codes poses the problem of finding the minimal polynomial of an ideal with respect to a certain monomial order. An efficient algorithm that solves the problem is…
Here we study the problem of generalizing one of the main tools of Groebner basis theory, namely the flat deformation to the leading term ideal, to the border basis setting. After showing that the straightforward approach based on the…
We relate a classic algebro-geometric degeneration technique, dating at least to [Hodge 1941], to the notion of vertex decompositions of simplicial complexes. The good case is when the degeneration is reduced, and we call this a "geometric…
In this paper we study ideals generated by quite general sets of 2-minors of an $m \times n$-matrix of indeterminates. The sets of 2-minors are defined by collections of cells and include 2-sided ladders. For convex collections of cells it…
In this paper, we use the tools of Gr\"{o}bner bases and combinatorial secant varieties to study the determinantal ideals $I_t$ of the extended Hankel matrices. Denote by $c$-chain a sequence $a_1,\...,a_k$ with $a_i+c<a_{i+1}$ for all…
Kazhdan-Lusztig ideals, a family of generalized determinantal ideals investigated in [Woo-Yong '08], provide an explicit choice of coordinates and equations encoding a neighbourhood of a torus-fixed point of a Schubert variety on a type A…
Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…
We present a $p$-adic algorithm to recover the lexicographic Gr\"obner basis $\mathcal G$ of an ideal in $\mathbb Q[x,y]$ with a generating set in $\mathbb Z[x,y]$, with a complexity that is less than cubic in terms of the dimension of…
Let $F$ be a non-negatively graded free module over a polynomial ring $\mathbb{K}[x_1,\dots,x_n]$ generated by $m$ basis elements. Let $M$ be a submodule of $F$ generated by elements in $F$ with degrees bounded by $D$ and dim $F/M$=$r$. We…
In this paper, we study toric ideals associated with multichains of posets. It is shown that the comparability graph of a poset is chordal if and only if there exists a quadratic Gr\"obner basis of the toric ideal of the poset. Strong…
In Boij-Soderberg theory, it is known that for any degree sequence $\mathbf{d}$, there exists a finitely generated module that has a pure resolution of type $\mathbf{d}$. On the other hand, in the case of ideal, there are two necessary…
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…
In the article "Non-commutative Grobner bases for commutative algebras", Eisenbud-Peeva-Sturmfels proved a number of results regarding Grobner bases and initial ideals of those ideals in the free associative algebra which contain the…
Strongly robust toric ideals are the toric ideals for which the set of indispensable binomials is the Graver basis. The strongly robust simplicial complex $\Delta _T$ of a simple toric ideal $I_T$ determines the strongly robust property for…
We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture, and describe completely the solution set.
We provide a polynomial time algorithm for computing the universal Gr\"obner basis of any polynomial ideal having a finite set of common zeros in fixed number of variables. One ingredient of our algorithm is an effective construction of the…
We study the relationship between certain Groebner bases for zero dimensional ideals, and the interpolation condition functionals of ideal interpolation. Ideal interpolation is defined by a linear idempotent projector whose kernel is a…
We prove a descent result for affine/projective varieties defined over an algebraically closed field. The idea is to work with the reduced Groebner basis of the ideal where the variety vanishes and study it's behaviour under group action…
We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…