Searcharxiv⌕ Search

arXiv subjects

Anargyros Katsabekis

Publications and source records attributed to Anargyros Katsabekis.

At least 19 recordsLinked to original sources

Admissible bases and generic lattice ideals

We introduce the notion of an admissible basis for rank-three positive lattices in $\mathbb{Z}^4$, namely a $\mathbb{Z}$-basis $\{{\bf c}_1,{\bf c}_2,{\bf c}_3\}$ satisfying three explicit sign conditions \textup{(I)}, \textup{(II)}, and \textup{(III)} on the coordinates of the basis vectors. We study lattice vectors of the form ${\bf u}^{(μ,λ)}=μ{\bf c}_1+{\bf c}_2+λ{\bf c}_3,$ where $μ$ and $λ$ are positive integers. Under conditions \textup{(I)}, \textup{(II)}, and \textup{(III)}, we obtain a complete characterization of the vectors ${\bf u}^{(μ,λ)}$ with positive first and fourth coordinates that are neighbors of the origin: such a vector is a neighbor if and only if $μ=1$ and $λ\le2$. As an application, for every integer $m\ge1$ we construct a positive lattice $L(m)\subseteq \mathbb{Z}^4$ admitting an admissible basis whose associated lattice ideal is generic. This yields an infinite family of generic lattice ideals with exactly seven minimal binomial generators. This family shows that the characterization is sharp, since both ${\bf u}^{(1,1)}$ and ${\bf u}^{(1,2)}$ occur as neighbors of the origin.

math.AC↗

On complete intersection projective closures of monomial curves

In this paper, we study the complete intersection property of projective closures of affine monomial curves. For monomial curves in the four-dimensional affine space, we give a complete and explicit characterization of when the defining ideals of their projective closures are complete intersections. We also investigate when the projective closures are arithmetically Cohen--Macaulay.

math.AC↗

Radical splittings of toric ideals

Let $I_A \subset K[x_1,\ldots,x_n]$ be a toric ideal. In this paper, we provide a necessary and sufficient condition for the toric variety $V(I_A)$, over an algebraically closed field, to be expressed as the set-theoretic intersection of other toric varieties. We also introduce the radical splitting number of $I_A$, denoted by ${\rm Split}_{\rm rad}(I_A)$, and compute its exact value in several cases, with particular emphasis on toric ideals arising from graphs. In particular, we show that ${\rm Split}_{\rm rad}(I_A)=3$ for toric ideals of complete bipartite graphs. Additionally, we prove that ${\rm Split}_{\rm rad}(I_A)$ coincides with the binomial arithmetical rank of $I_A$ when the height of $I_A$ is equal to 2.

math.AC↗

Splittings of toric ideals of graphs

Let $G$ be a simple graph on the vertex set $\{v_{1},\ldots,v_{n}\}$. An algebraic object attached to $G$ is the toric ideal $I_G$. We say that $I_G$ is subgraph splittable if there exist subgraphs $G_1$ and $G_2$ of $G$ such that $I_G=I_{G_1}+I_{G_2}$, where both $I_{G_1}$ and $I_{G_2}$ are not equal to $I_G$. We show that $I_G$ is subgraph splittable if and only if it is edge splittable. We also prove that the toric ideal of a complete bipartite graph is not subgraph splittable. In contrast, we show that the toric ideal of a complete graph $K_n$ is always subgraph splittable when $n \geq 4$. Additionally, we show that the toric ideal of $K_n$ has a minimal splitting if and only if $4 \leq n \leq 5$. Finally, we prove that any minimal splitting of $I_G$ is also a reduced splitting.

math.AC↗

Toric splittings

The toric ideal $I_A$ is splittable if it has a toric splitting; namely, if there exist toric ideals $I_{A_1}, I_{A_2}$ such that $I_A=I_{A_1}+I_{A_2}$ and $I_{A_i}\not =I_{A}$ for all $1 \leq i \leq 2$. We provide a necessary and sufficient condition for a toric ideal to be splittable in terms of $A$, and we apply it to prove or disprove that certain classes of toric ideals are splittable.

math.AC↗

Cohen-Macaulayness of associated graded rings of Gorenstein monomial curves

Let $C$ be a Gorenstein noncomplete intersection monomial curve in the 4-dimensional affine space with defining ideal $I(C)$. In this article, we use the minimal generating set of $I(C)$ to give a criterion for determining whether the tangent cone of $C$ is Cohen-Macaulay. We also show that if the tangent cone of $C$ is Cohen-Macaulay, then the minimal number of generators of the ideal $I(C)_{\ast}$ is either $5$ or an even integer of the form $2d+2$, for a suitable integer $d$. Additionally, we provide a family of Gorenstein noncomplete intersection monomial curves $C$ whose tangent cone is Cohen-Macaulay and the minimal number of generators of $I(C)_{\ast}$ is large.

math.AC↗

Projective closure of Gorenstein monomial curves and the Cohen-Macaulay property

Let $C({\bf a})$ be a Gorenstein non-complete intersection monomial curve in the 4-dimensional affine space. There is a vector ${\bf v} \in \mathbb{N}^{4}$ such that for every integer $m \geq 0$, the monomial curve $C({\bf a}+m{\bf v})$ is Gorenstein non-complete intersection whenever the entries of ${\bf a}+m{\bf v}$ are relatively prime. In this paper, we study the arithmetically Cohen-Macaulay property of the projective closure of $C({\bf a}+m{\bf v})$.

math.AG↗

Arithmetical rank and cohomological dimension of generalized binomial edge ideals

Let $G$ be a connected and simple graph on the vertex set $[n]$. To the graph $G$ one can associate the generalized binomial edge ideal $J_{m}(G)$ in the polynomial ring $R=K[x_{ij}: i \in [m], j \in [n]]$. We provide a lower bound for the cohomological dimension of $J_{m}(G)$. We also study when $J_{m}(G)$ is a cohomologically complete intersection. Finally, we show that the arithmetical rank of $J_{2}(G)$ equals the projective dimension of $R/J_{2}(G)$ in several cases.

math.AC↗

Complete intersection monomial curves and the Cohen-Macaulayness of their tangent cones

Let $C({\bf n})$ be a complete intersection monomial curve in the 4-dimensional affine space. In this paper we study the complete intersection property of the monomial curve $C({\bf n}+w{\bf v})$, where $w>0$ is an integer and ${\bf v} \in \mathbb{N}^{4}$. Also we investigate the Cohen-Macaulayness of the tangent cone of $C({\bf n}+w{\bf v})$.

math.AC↗

Arithmetical rank of binomial ideals

In this paper, we investigate the arithmetical rank of a binomial ideal $J$. We provide lower bounds for the binomial arithmetical rank and the $J$-complete arithmetical rank of $J$. Special attention is paid to the case where $J$ is the binomial edge ideal of a graph. We compute the arithmetical rank of such an ideal in various cases.

math.AC↗

Equations defining tangent cones of Gorenstein monomial curves

Let $C$ be a Gorenstein non complete intersection monomial curve in the 4-dimensional affine space. In this paper we study the minimal number of generators of the tangent cone of $C$. Special attention will be paid to the case where $C$ has Cohen-Macaulay tangent cone at the origin.

math.AC↗

Toric ideals and diagonal 2-minors

Let $G$ be a simple graph on the vertex set $\{1,\ldots,n\}$ with $m$ edges. An algebraic object attached to $G$ is the ideal $P_{G}$ generated by diagonal 2-minors of an $n \times n$ matrix of variables. In this paper we prove that if $G$ is bipartite, then every initial ideal of $P_{G}$ is generated by squarefree monomials of degree at most $\left \lfloor{\frac{m+n+1}{2}} \right \rfloor$. Furthermore, we completely characterize all connected graphs $G$ for which $P_{G}$ is the toric ideal associated to a finite simple graph. Finally we compute in certain cases the universal Gr{ö}bner basis of $P_{G}$.

math.AC↗

An indispensable classification of monomial curves in $\mathbb{A}^4(\mathbbmss{k}) $

In this paper a new classification of monomial curves in $\mathbb{A}^4(\mathbbmss{k})$ is given. Our classification relies on the detection of those binomials and monomials that have to appear in every system of binomial generators of the defining ideal of the monomial curve; these special binomials and monomials are called indispensable in the literature. This way to proceed has the advantage of producing a natural necessary and sufficient condition for the definining ideal of a monomial curve in $\mathbb{A}^4(\mathbbmss{k})$ to have a unique minimal system of binomial generators. Furthermore, some other interesting results on more general classes of binomial ideals with unique minimal system of binomial generators are obtained.

math.AC↗

On the binomial arithmetical rank of lattice ideals

To any lattice $L \subset \mathbb{Z}^{m}$ one can associate the lattice ideal $I_{L} \subset K[x_{1},...,x_{m}]$. This paper concerns the study of the relation between the binomial arithmetical rank and the minimal number of generators of $I_{L}$. We provide lower bounds for the binomial arithmetical rank and the $\mathcal{A}$-homogeneous arithmetical rank of $I_{L}$. Furthermore, in certain cases we show that the binomial arithmetical rank equals the minimal number of generators of $I_{L}$. Finally we consider a class of determinantal lattice ideals and study some algebraic properties of them.

math.AC↗

Binomial generation of the radical of a lattice ideal

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.

math.AC↗

Arithmetical rank of toric ideals associated to graphs

Let $I_{G} \subset K[x_{1},...,x_{m}]$ be the toric ideal associated to a finite graph $G$. In this paper we study the binomial arithmetical rank and the $G$-homogeneous arithmetical rank of $I_G$ in 2 cases: $G$ is bipartite, $I_G$ is generated by quadratic binomials. In both cases we prove that the binomial arithmetical rank and the $G$-arithmetical rank coincide with the minimal number of generators of $I_G$.

math.AC↗

Specializations of multigradings and the arithmetical rank of lattice ideals

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}}}$.

math.AC↗