arXiv subjects
Publications and source records attributed to Apostolos Thoma.
Let $I_{L, ρ}$ be a lattice ideal. We provide a necessary and sufficient criterion under which a set of binomials in $I_{L, ρ}$ generate the radical of $I_{L, ρ}$ up to radical. We apply our results to the problem of determining the minimal number of generators of $I_{L, ρ}$ or of the $rad(I_{L, ρ})$ up to radical.
The universal Gröbner basis of $I$, is a Gröbner basis for $I$ with respect to all term orders simultaneously. Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the elements of the universal Gröbner basis of the toric ideal $I_G$. We provide a bound for the degree of the binomials in the universal Gröbner basis of the toric ideal of a graph. Finally we give a family of examples of circuits for which their true degrees are less than the degrees of some elements of the Graver basis.
Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the primitive, the minimal, the indispensable and the fundamental binomials of the toric ideal $I_G$.
In this article we study specializations of multigradings and apply them to the problem of the computation of the arithmetical rank of a lattice ideal $I_{L_{\mathcal{G}}} \subset K[x_{1},...,x_{n}]$. The arithmetical rank of $I_{L_{\mathcal{G}}}$ equals the $\mathcal{F}$-homogeneous arithmetical rank of $I_{L_{\mathcal{G}}}$, for an appropriate specialization $\mathcal{F}$ of $\mathcal{G}$. To the lattice ideal $I_{L_{\mathcal{G}}}$ and every specialization $\mathcal{F}$ of $\mathcal{G}$ we associate a simplicial complex. We prove that combinatorial invariants of the simplicial complex provide lower bounds for the $\mathcal{F}$-homogeneous arithmetical rank of $I_{L_{\mathcal{G}}}$.
Let $A$ be a semigroup whose only invertible element is 0. For an $A$-homogeneous ideal we discuss the notions of simple $i$-syzygies and simple minimal free resolutions of $R/I$. When $I$ is a lattice ideal, the simple 0-syzygies of $R/I$ are the binomials in $I$. We show that for an appropriate choice of bases every $A$-homogeneous minimal free resolution of $R/I$ is simple. We introduce the gcd-complex $D_{gcd}(\bf b)$ for a degree $\mathbf{b}\in \A$. We show that the homology of $D_{gcd}(\bf b)$ determines the $i$-Betti numbers of degree $\bf b$. We discuss the notion of an indispensable complex of $R/I$. We show that the Koszul complex of a complete intersection lattice ideal $I$ is the indispensable resolution of $R/I$ when the $A$-degrees of the elements of the generating $R$-sequence are incomparable.
Let $k$ be a field, $ \mathcal{L}\subset \mathbb{Z}^n$ be a lattice such that $Ł\cap \mathbb{N}^n=\{{\bf 0}\}$, and $I_Ł\subset \Bbbk[x_1,..., x_n]$ the corresponding lattice ideal. We present the generalized Scarf complex of $I_Ł$ and show that it is indispensable in the sense that it is contained in every minimal free resolution of $R/I_Ł$.
Let $A=\{{\bf a}_1,...,{\bf a}_m\} \subset \mathbb{Z}^n$ be a vector configuration and $I_A \subset K[x_1,...,x_m]$ its corresponding toric ideal. The paper consists of two parts. In the first part we completely determine the number of different minimal systems of binomial generators of $I_A$. We also prove that generic toric ideals are generated by indispensable binomials. In the second part we associate to $A$ a simplicial complex $Δ_{\ind(A)}$. We show that the vertices of $Δ_{\ind(A)}$ correspond to the indispensable monomials of the toric ideal $I_A$, while one dimensional facets of $Δ_{\ind(A)}$ with minimal binomial $A$-degree correspond to the indispensable binomials of $I_{A}$.
In this paper we give a geometric characterization of the cones of toric varieties that are complete intersections. In particular, we prove that the class of complete intersection cones is the smallest class of cones which is closed under direct sum and contains all simplex cones. Further, we show that the number of the extreme rays of such a cone, which is less than or equal to $2n-2$, is exactly $2n-2$ if and only if the cone is a bipyramidal cone, where $n>1$ is the dimension of the cone. Finally, we characterize all toric varieties whose associated cones are complete intersection cones.
In this paper we completely characterize lattice ideals that are complete intersections or equivalently complete intersections finitely generated semigroups of $\bz^n\oplus T$ with no invertible elements, where $T$ is a finite abelian group. We also characterize the lattice ideals that are set-theoretic complete intersections on binomials.
In this article we associate to every lattice ideal $I_{L,ρ}\subset K[x_1,..., x_m]$ a cone $σ$ and a graph $G_σ$ with vertices the minimal generators of the Stanley-Reisner ideal of $σ$. To every polynomial $F$ we assign a subgraph $G_σ(F)$ of the graph $G_σ$. Every expression of the radical of $I_{L,ρ}$, as a radical of an ideal generated by some polynomials $F_1,..., F_s$ gives a spanning subgraph of $G_σ$, the $\cup_{i=1}^s G_σ(F_i)$. This result provides a lower bound for the minimal number of generators of $I_{L,ρ}$ and therefore improves the generalized Krull's principal ideal theorem for lattice ideals. But mainly it provides lower bounds for the binomial arithmetical rank and the $A$-homogeneous arithmetical rank of a lattice ideal. Finally we show, by a family of examples, that the bounds given are sharp.