Perturbation method for determining the group of invariance of hierarchical models

We propose a perturbation method for determining the (largest) group of invariance of a toric ideal defined in [S. Aoki, A. Takemura, The largest group of invariance for Markov bases and toric ideals, J. Symbolic Comput. 43 (5) (2008) 342–358]. In the perturbation method, we investigate how a generic element in the row space of the configuration defining a toric ideal is mapped by a permutation of the indeterminates. Compared to the proof by Aoki and Takemura which was based on stabilizers of a subset of indeterminates, the perturbation method gives a much simpler proof of the group of invariance. In particular, we determine the group of invariance for a general hierarchical model of contingency tables in statistics, under the assumption that the numbers of the levels of the factors are generic. We prove that it is a wreath product indexed by a poset related to the intersection poset of the maximal interaction effects of the model.     

A Gröbner basis characterization for chordal comparability graphs

In this paper, we study toric ideals associated with multichains of posets. It is shown that the comparability graph of a poset is chordal if and only if there exists a quadratic Gröbner basis of the toric ideal of the poset. Strong perfect elimination orderings of strongly chordal graphs play an important role.     

Laurent polynomials and Eulerian numbers

Duistermaat and van der Kallen show that there is no nontrivial complex Laurent polynomial all of whose powers have a zero constant term. Inspired by this, Sturmfels poses two questions: Do the constant terms of a generic Laurent polynomial form a regular sequence? If so, then what is the degree of the associated zero-dimensional ideal? In this note, we prove that the Eulerian numbers provide the answer to the second question. The proof involves reinterpreting the problem in terms of toric geometry.     

Rational points of lattice ideals on a toric variety and toric codes

We show that the number of rational points of a subgroup inside a toric variety over a finite field defined by a homogeneous lattice ideal can be computed via Smith normal form of the matrix whose columns constitute a basis of the lattice. This generalizes and yields a concise toric geometric proof of the same fact proven purely algebraically by Lopez and Villarreal for the case of a projective space and a standard homogeneous lattice ideal of dimension one. We also prove a Nullstellensatz type theorem over a finite field establishing a one to one correspondence between subgroups of the dense split torus and certain homogeneous lattice ideals. As application, we compute the main parameters of generalized toric codes on subgroups of the torus of Hirzebruch surfaces, generalizing the existing literature.     

The toric ideal of a graphic matroid is generated by quadrics

Describing minimal generating sets of toric ideals is a well-studied and difficult problem. Neil White conjectured in 1980 that the toric ideal associated to a matroid is generated by quadrics corresponding to single element symmetric exchanges. We give a combinatorial proof of White’s conjecture for graphic matroids.     

Generic lattice ideals

A concept of genericity is introduced for lattice ideals (and hence for ideals defining toric varieties) which ensures nicely structured homological behavior. For a generic lattice ideal we construct its minimal free resolution and we show that it is induced from the Scarf resolution of any reverse lexicographic initial ideal.

     

Gr?bner bases of contraction ideals

We investigate Gr?bner bases of contraction ideals under monomial homomorphisms. As an application, we generalize the result of Aoki?CHibi?COhsugi?CTakemura and Ohsugi?CHibi for toric ideals of nested configurations.     

Rationality for generic toric rings

We study generic toric rings. We prove that they are Golod rings, so the Poincaré series of the residue field is rational. We classify when such a ring is Koszul, and compute its rate. Also resolutions related to the initial ideal of the toric ideal with respect to reverse lexicographic order are described. Received August 13, 1997; in final form October 23, 1998     

Incidence combinatorics of resolutions

We introduce notions of combinatorial blowups, building sets, and nested sets for arbitrary meet-semilattices. This gives a~common abstract framework for the incidence combinatorics occurring in the context of De Concini-Procesi models of subspace arrangements and resolutions of singularities in toric varieties. Our main theorem states that a sequence of combinatorial blowups, prescribed by a building set in linear extension compatible order, gives the face poset of the corresponding simplicial complex of nested sets. As applications we trace the incidence combinatorics through every step of the De Concini-Procesi model construction, and we introduce the notions of building sets and nested sets to the context of toric varieties. There are several other instances, such as models of stratified manifolds and certain graded algebras associated with finite lattices, where our combinatorial framework has been put to work; we present an outline at the end of this paper.     

Representations of torsion-free arithmetic matroids

We study the representability problem for torsion-free arithmetic matroids. After introducing a “strong gcd property” and a new operation called “reduction”, we describe and implement an algorithm to compute all essential representations, up to equivalence. As a consequence, we obtain an upper bound to the number of equivalence classes of representations. In order to rule out equivalent representations, we describe an efficient way to compute a normal form of integer matrices, up to left-multiplication by invertible matrices and change of sign of the columns (we call it the “signed Hermite normal form”). Finally, as an application of our algorithms, we disprove two conjectures about the poset of layers and the independence poset of a toric arrangement.     

Hilbert Polynomial of a Certain Ladder-Determinantal Ideal

A ladder-shaped array is a subset of a rectangular array which looks like a Ferrers diagram corresponding to a partition of a positive integer. The ideals generated by the p-by-p minors of a ladder-type array of indeterminates in the corresponding polynomial ring have been shown to be hilbertian (i.e., their Hilbert functions coincide with Hilbert polynomials for all nonnegative integers) by Abhyankar and Kulkarni [3, p 53–76]. We exhibit here an explicit expression for the Hilbert polynomial of the ideal generated by the two-by-two minors of a ladder-type array of indeterminates in the corresponding polynomial ring. Counting the number of paths in the corresponding rectangular array having a fixed number of turning points above the path corresponding to the ladder is an essential ingredient of the combinatorial construction of the Hilbert polynomial. This gives a constructive proof of the hilbertianness of the ideal generated by the two-by-two minors of a ladder-type array of indeterminates.     

Decomposition theorem for the cd-index of Gorenstein<Superscript>*</Superscript> posets

We prove a decomposition theorem for the cd-index of a Gorenstein^* poset analogous to the decomposition theorem for the intersection cohomology of a toric variety. From this we settle a conjecture of Stanley that the cd-index of Gorenstein* lattices is minimized on Boolean algebras.     

Multigraded commutative algebra of graph decompositions

The toric fiber product is a general procedure for gluing two ideals, homogeneous with respect to the same multigrading, to produce a new homogeneous ideal. Toric fiber products generalize familiar constructions in commutative algebra like adding monomial ideals and the Segre product. We describe how to obtain generating sets of toric fiber products in non-zero codimension and discuss persistence of normality and primary decompositions under toric fiber products. Several applications are discussed, including (a) the construction of Markov bases of hierarchical models in many new cases, (b) a new proof of the quartic generation of binary graph models associated to K ₄-minor free graphs, and (c) the recursive computation of primary decompositions of conditional independence ideals.     

Order series of labelled posets

Order series of labelled posets are multi-analogues of the more familiar order polynomials; the corresponding multi-analogues of the related representation polynomials are calledE-series. These series can be used to describe the effect of composition of labelled posets on their order polynomials, whence their interest for us. We give a reciprocity theorem forE-series, and show that for an unlabelled poset the form of theE-series depends only upon the comparability graph of the poset. We also prove that theE-series of any labelled poset is a rational power series (in many indeterminates) and give an algorithm for computing it which runs in polynomial time when the poset is strictly labelled and of bounded width. Finally, we give an explicit product formula for theE-series of strictly labelled interval posets.This research was supported by the Natural Sciences and Engineering Research Council of Canada under operating grant #0105392.     

Class numbers of cyclic 2-extensions and Gross conjecture over ℚ

The Gross conjecture over ? was first claimed by Aoki in 1991. However, the original proof contains too many mistakes and false claims to be considered as a serious proof. This paper is an attempt to find a sound proof of the Gross conjecture under the outline of Aoki. We reduce the conjecture to an elementary conjecture concerning the class numbers of cyclic 2-extensions of ?.     

在环面同态作用下零维理想的性质

本文以矩阵变换和整理论为工具，研究了在环面同态作用下零维理想的性质，证明了零维理想的环面同态矩阵是满秩的，并且刻画了零维理想在环面作用下的对应关系．     

Mixed toric residues and tropical degenerations

Building on our earlier work on toric residues and reduction, we give a proof of the mixed toric residue conjecture of Batyrev and Materov. We simplify and streamline our technique of tropical degenerations, which allows one to interpolate between two localization principles: one appearing in the intersection theory of toric quotients and the other in the calculus of toric residues. This quickly leads to the proof of the conjecture, which gives a closed formula for the summation of a generating series whose coefficients represent a certain naive count of the numbers of rational curves on toric complete intersection Calabi-Yau manifolds.     

Class numbers of cyclic 2-extensions and Gross conjecture over Q

The Gross conjecture over Q was first claimed by Aoki in 1991.However,the original proof contains too many mistakes and false claims to be considered as a serious proof.This paper is an attempt to find a sound proof of the Gross conjecture under the outline of Aoki.We reduce the conjecture to an elementary conjecture concerning the class numbers of cyclic 2-extensions of Q.     

Quaternionic geometry of matroids

Building on a recent paper [8], here we argue that the combinatorics of matroids are intimately related to the geometry and topology of toric hyperkähler varieties. We show that just like toric varieties occupy a central role in Stanley’s proof for the necessity of McMullen’s conjecture (or g-inequalities) about the classification of face vectors of simplicial polytopes, the topology of toric hyperkähler varieties leads to new restrictions on face vectors of matroid complexes. Namely in this paper we will give two proofs that the injectivity part of the Hard Lefschetz theorem survives for toric hyperkähler varieties. We explain how this implies the g-inequalities for rationally representable matroids. We show how the geometrical intuition in the first proof, coupled with results of Chari [3], leads to a proof of the g-inequalities for general matroid complexes, which is a recent result of Swartz [20]. The geometrical idea in the second proof will show that a pure O-sequence should satisfy the g-inequalities, thus showing that our result is in fact a consequence of a long-standing conjecture of Stanley.