Searcharxiv⌕ Search

arXiv · math/0508628

The Circuit Ideal of a Vector Configuration

Abstract

The circuit ideal, $\ica$, of a configuration $\A = \{\a_1, ..., \a_n\} \subset \Z^d$ is the ideal generated by the binomials ${\x}^{\cc^+} - {\x}^{\cc^-} \in \k[x_1, ..., x_n]$ as $\cc = \cc^+ - \cc^- \in \Z^n$ varies over the circuits of $\A$. This ideal is contained in the toric ideal, $\ia$, of $\A$ which has numerous applications and is nontrivial to compute. Since circuits can be computed using linear algebra and the two ideals often coincide, it is worthwhile to understand when equality occurs. In this paper we study $\ica$ in relation to $\ia$ from various algebraic and combinatorial perspectives. We prove that the obstruction to equality of the ideals is the existence of certain polytopes. This result is based on a complete characterization of the standard pairs/associated primes of a monomial initial ideal of $\ica$ and their differences from those for the corresponding toric initial ideal. Eisenbud and Sturmfels proved that $\ia$ is the unique minimal prime of $\ica$ and that the embedded primes of $\ica$ are indexed by certain faces of the cone spanned by $\A$. We provide a necessary condition for a particular face to index an embedded prime and a partial converse. Finally, we compare various polyhedral fans associated to $\ia$ and $\ica$. The Gröbner fan of $\ica$ is shown to refine that of $\ia$ when the codimension of the ideals is at most two.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tristram Bogart, Anders N. Jensen, Rekha R. Thomas. 2005-08-31. The Circuit Ideal of a Vector Configuration. https://doi.org/10.1016/j.jalgebra.2006.07.025

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Homology with the theme of Matlis

Matlis proved a lot of homological properties of the fraction field of an integral domain. In this paper, we simplify and extend some of them from 1-dimensional (resp. rank one) cases to the higher dimensional (resp. finite rank) cases. For example, we study the weakly co-torsion property of Ext$(-,\sim)$, and use it to present splitting criteria. These are equipped with several applications. For instance, we compute the projective dimension of $\widehat{R}$ and present some non-noetherian versions of Grothendieck's localization problem. We construct a new class of co-Hopfian modules and extend Matlis' decomposability problem to higher ranks. In particular, this paper deals with the basic properties of Matlis' quadric $(Q,Q/R, \widehat{R},\overset{\sim}R).$

math.AC↗

Descent along flat composed with radicalization

We study the following general situation. Let $R\to S$ be a finite flat morphism of regular rings of zero (resp. prime) mixed or (equi)-characteristic. For $P\in Spec R$, put $A=R/P, C=S/PS,$ and $B=S/\sqrt{PS}=C_{\mathrm{red}}.$ The basic question is whether a property of $B$ forces the same property of $A$. The main point is that ordinary finite-flat descent applies naturally to $A\to C$, whereas the passage $C\to C_{\mathrm{red}}$ may (not) destroy nilpotent information.

math.AC↗

When Hilbert functions determine generic initial ideals

Over a field of characteristic zero, we characterize the Hilbert functions that determine the degree reverse lexicographic generic initial ideal among Artinian quotients of embedding dimension $n\ge2$ with the $(n-2)$-strong Lefschetz property. The criterion is a finite arithmetic test on successive positive differences of the Hilbert function. It uses recursively defined integer vectors and requires no construction of a monomial ideal. When uniqueness holds, the same vectors recover the common generic initial ideal degree by degree. The proof reduces uniqueness successively to uniqueness of lower sets of specified cardinalities in Borel orders. In four variables, the test simplifies to avoidance of explicitly computed integer intervals. We recover the quasi-symmetry criterion of Harima and Wachi and give infinite families beyond that criterion in every number of variables at least four.

math.AC↗