Toric Algebra Research Articles

Cellular resolutions of noncommutative toric algebras from superpotentials

This paper constructs cellular resolutions for classes of noncommutative algebras, analogous to those introduced by Bayer and Sturmfels (1998) [2] in the commutative case. To achieve this we generalise the dimer model construction of noncommutative crepant resolutions of three-dimensional toric algebras by associating a superpotential and a notion of consistency to toric algebras of arbitrary dimension. For abelian skew group algebras and algebraically consistent dimer model algebras, we introduce a cell complex Δ in a real torus whose cells describe uniformly all maps in the minimal projective bimodule resolution of A. We illustrate the general construction of Δ for an example in dimension four arising from a tilting bundle on a smooth toric Fano threefold to highlight the importance of the incidence function on Δ.

Toric ideals for high Veronese subrings of toric algebras

We prove that the defining ideal of a sufficiently high Veronese subring of a toric algebra admits a quadratic Gröbner basis consisting of binomials. More generally, we prove that the defining ideal of a sufficiently high Veronese subring of a standard graded ring admits a quadratic Gröbner basis. We give a lower bound on $d$ such that the defining ideal of $d$th Veronese subring admits a quadratic Gröbner basis. Eisenbud–Reeves–Totaro stated the same theorem without a proof with some lower bound on $d$. In many cases, our lower bound is less than Eisenbud–Reeves–Totaro’s lower bound.

Recognizing Graph Theoretic Properties with Polynomial Ideals

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of the polynomial method and show how the algorithmic theory of polynomial ideals can be used to detect $k$-colorability, unique Hamiltonicity, and automorphism rigidity of graphs. Our techniques are diverse and involve Nullstellensatz certificates, linear algebra over finite fields, Gröbner bases, toric algebra, convex programming, and real algebraic geometry.

Affine toric equivalence relations are effective

Any map of schemes defines an equivalence relation , the relation of ``being in the same fiber''. We have shown elsewhere that not every equivalence relation has this form, even if it is assumed to be finite. By contrast, we prove here that every toric equivalence relation on an affine toric variety does come from a morphism and that quotients by finite toric equivalence relations always exist in the affine case. In special cases, this result is a consequence of the vanishing of the first cohomology group in the Amitsur complex associated to a toric map of toric algebras. We prove more generally the exactness of the Amitsur complex for maps of commutative monoid rings.

Sagbi bases of Cox–Nagata rings

We degenerate Cox–Nagata rings to toric algebras by means of sagbi bases induced by configurations over the rational function field. For del Pezzo surfaces, this degeneration implies the Batyrev–Popov conjecture that these rings are presented by ideals of quadrics. For the blow-up of projective n -space at n + 3 points, sagbi bases of Cox–Nagata rings establish a link between the Verlinde formula and phylogenetic algebraic geometry, and we use this to answer questions due to D’Cruz–Iarrobino and Buczyńska–Wiśniewski. Inspired by the zonotopal algebras of Holtz and n s Ron, our study emphasizes explicit computations, and offers a new approach to Hilbert functions of fat points.

Asymptotically saturated toric algebras

We show the finite generation of certain invariant graded algebras defined on toric weak log Fano fibrations. These are the toric version of FGA algebras, recently introduced by Shokurov in connections to the existence of flips.

On the toric algebra of graphical models

We formulate necessary and sufficient conditions for an arbitrary discrete probability distribution to factor according to an undirected graphical model, or a log-linear model, or other more general exponential models. For decomposable graphical models these conditions are equivalent to a set of conditional independence statements similar to the Hammersley–Clifford theorem; however, we show that for nondecomposable graphical models they are not. We also show that nondecomposable models can have nonrational maximum likelihood estimates. These results are used to give several novel characterizations of decomposable graphical models.

Short rational functions for toric algebra and applications

We encode the binomials belonging to the toric ideal I A associated with an integral d× n matrix A using a short sum of rational functions as introduced by Barvinok (Math. Operations Research 19 (1994) 769) and Barvinok and Woods (J. Amer. Math. Soc. 16 (2003) 957). Under the assumption that d and n are fixed, this representation allows us to compute a universal Gröbner basis and the reduced Gröbner basis of the ideal I A , with respect to any term order, in time polynomial in the size of the input. We also derive a polynomial time algorithm for normal form computations which replaces in this new encoding the usual reductions typical of the division algorithm. We describe other applications, such as the computation of Hilbert series of normal semigroup rings, and we indicate applications to enumerative combinatorics, integer programming, and statistics.