Related papers: Minimal set of binomial generators for certain Ver…

We describe explicitly all multisets of weights whose defining projective toric varieties are self-dual. In addition, we describe a remarkable and unexpected combinatorial behaviour of the defining ideals of these varieties. The toric ideal…

We study the syzygies of secant ideals of Veronese subrings of a fixed commutative graded algebra over a field of characteristic 0. One corollary is that the degrees of the minimal generators of the ith syzygy module of the coordinate ring…

Let $F$ be a homogeneous polynomial of degree $d$ in $m+1$ variables defined over an algebraically closed field of characteristic zero and suppose that $F$ belongs to the $s$-th secant varieties of the standard Veronese variety…

We obtain tight bounds for the minimal number of generators of an ideal with bounded-degree generators in a polynomial ring $K[X_1,\dots,X_n],$ as well as a sharp quantification of the maximum possible size of a minimal generating set of…

For a finite lattice $L$, let Gm($L$) denote the least $n$ such that $L$ can be generated by $n$ elements. For integers $r>2$ and $k>1$, denote by FD$(r)^k$ the $k$-th direct power of the free distributive lattice FD($r$) on $r$ generators.…

Adem and Reichstein introduced the ideal of truncated symmetric polynomials to present the permutation invariant subring in the cohomology of a finite product of projective spaces. Building upon their work, I describe a generating set of…

In this paper, binomial difference ideals are studied. Three canonical representations for Laurent binomial difference ideals are given in terms of the reduced Groebner basis of Z[x]-lattices, regular and coherent difference ascending…

It has been conjectured that the toric ideal of the base ring of a discrete polymatroid is generated by symmetric exchange binomials. In the present paper, we give several classes of discrete polymatroids which yield toric ideals generated…

The maximal degree of monomials belonging to the unique minimal system of monomial generators of the canonical module $\omega(K[{\mathcal P}])$ of the toric ring $K[{\mathcal P}]$ defined by a lattice polytope ${\mathcal P}$ will be…

We study quotients of the Weyl algebra by left ideals whose generators consist of an arbitrary Z^d-graded binomial ideal I along with Euler operators defined by the grading and a parameter in C^d. We determine the parameters for which these…

Motivated by the behavior of the trace pairing over tame cyclic number fields, we introduce the notion of tame lattices. Given an arbitrary non-trivial lattice $\mathcal{L}$ we construct a parametric family of full-rank sub-lattices…

We study the homogeneous artinian ideals of the polynomial ring $K[x,y,z]$, generated by the homogenous polynomials of degree $d$ which are invariant under an action of the cyclic group $\mathbb Z/d\mathbb Z$, for any $d\geq 3$. We prove…

In this article, we present a new algorithm for computing a generating set of a lattice ideal. This algorithm is based on a project-and-lift approach and is implemented in 4ti2. We also include a computational comparison of several existing…

A smooth $d$-dimensional projective variety $X$ can always be embedded into $2d+1$-dimensional space. In contrast, a singular variety may require an arbitrary large ambient space. If we relax our requirement and ask only that the map is…

In this paper, we provide a complete description of the minimal primes of ideals generated by adjacent $2$-minors, in terms of the so-called admissible sets and associated lattice ideals. We prove that for these ideals, the properties of…

In 2008, L\'aszl\'o Z\'adori proved that the lattice Sub$(V)$ of all subspaces of a vector space $V$ of finite dimension at least 3 over a finite field $F$ has a 5-element generating set; in other words, Sub$(V)$ is 5-generated. We prove…

We describe a polynomial time algorithm for, given an undirected graph G, finding the minimum dimension d such that G may be isometrically embedded into the d-dimensional integer lattice Z^d.

Let $I$ be a monomial ideal in two variables generated by three monomials and let $\mathcal{R}(I)$ be its Rees ideal. We describe an algorithm to compute the minimal generating set of $\mathcal{R}(I)$. Based on the data obtained by this…

A distributive lattice $L$ with minimum element $0$ is called decomposable if $a$ and $b$ are not comparable elements in $L$ then there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…

In this article, we define a class of binomial ideals associated to a simplicial complex. This class of ideals appears in the presentation of fiber cones of codimension 2 lattice ideals \cite{hm}, and in the work of Barile and Morales…