Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userComplete Intersection Lattice Ideals
111
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In this paper we completely characterize lattice ideals that are complete intersections or equivalently complete intersections finitely generated semigroups of $bz^noplus 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.
rate research
Read More
We characterize the graphs $G$ for which their toric ideals $I_G$ are complete intersections. In particular we prove that for a connected graph $G$ such that $I_G$ is complete intersection all of its blocks are bipartite except of at most two. We prove that toric ideals of graphs which are complete intersections are circuit ideals. The generators of the toric ideal correspond to even cycles of $G$ except of at most one generator, which corresponds to two edge disjoint odd cycles joint at a vertex or with a path. We prove that the blocks of the graph satisfy the odd cycle condition. Finally we characterize all complete intersection toric ideals of graphs which are normal.
We study the complete intersection property and the algebraic invariants (index of regularity, degree) of vanishing ideals on degenerate tori over finite fields. We establish a correspondence between vanishing ideals and toric ideals associated to numerical semigroups. This correspondence is shown to preserve the complete intersection property, and allows us to use some available algorithms to determine whether a given vanishing ideal is a complete intersection. We give formulae for the degree, and for the index of regularity of a complete intersection in terms of the Frobenius number and the generators of a numerical semigroup.
Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks whether its toric ideal $P_G$ is a complete intersection or not. Whenever $P_G$ is a complete intersection, the algorithm also returns a minimal set of generators of $P_G$. Moreover, we prove that if $G$ is a connected graph and $P_G$ is a complete intersection, then there exist two induced subgraphs $R$ and $C$ of $G$ such that the vertex set $V(G)$ of $G$ is the disjoint union of $V(R)$ and $V(C)$, where $R$ is a bipartite ring graph and $C$ is either the empty graph, an odd primitive cycle, or consists of two odd primitive cycles properly connected. Finally, if $R$ is $2$-connected and $C$ is connected, we list the families of graphs whose toric ideals are complete intersection.
We give a two step method to study certain questions regarding associated graded module of a Cohen-Macaulay (CM) module $M$ w.r.t an $mathfrak{m}$-primary ideal $mathfrak{a}$ in a complete Noetherian local ring $(A,mathfrak{m})$. The first step, we call it complete intersection approximation, enables us to reduce to the case when both $A$, $ G_mathfrak{a}(A) = bigoplus_{n geq 0} mathfrak{a}^n/mathfrak{a}^{n+1} $ are complete intersections and $M$ is a maximal CM $A$-module. The second step consists of analyzing the classical filtration ${Hom_A(M,mathfrak{a}^n) }_{mathbb{Z}}$ of the dual $Hom_A(M,A)$. We give many applications of this point of view. For instance let $(A,mathfrak{m})$ be equicharacteristic and CM. Let $a(G_mathfrak{a}(A))$ be the $a$-invariant of $G_mathfrak{a}(A)$. We prove: 1. $a(G_mathfrak{a}(A)) = -dim A$ iff $mathfrak{a}$ is generated by a regular sequence. 2. If $mathfrak{a}$ is integrally closed and $a(G_mathfrak{a}(A)) = -dim A + 1$ then $mathfrak{a}$ has minimal multiplicity. We extend to modules a result of Ooishi relating symmetry of $h$-vectors. As another application we prove a conjecture of Itoh, if $A$ is a CM local ring and $mathfrak{a}$ is a normal ideal with $e_3^mathfrak{a}(A) = 0$ then $G_mathfrak{a}(A)$ is CM.
Let $G$ be a simple graph on $n$ vertices and $J_G$ denote the binomial edge ideal of $G$ in the polynomial ring $S = mathbb{K}[x_1, ldots, x_n, y_1, ldots, y_n].$ In this article, we compute the second graded Betti numbers of $J_G$, and we obtain a minimal presentation of it when $G$ is a tree or a unicyclic graph. We classify all graphs whose binomial edge ideals are almost complete intersection, prove that they are generated by a $d$-sequence and that the Rees algebra of their binomial edge ideal is Cohen-Macaulay. We also obtain an explicit description of the defining ideal of the Rees algebra of those binomial edge ideals.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
