Decompositions of binomial ideals

We present Binomials, a package for the computer algebra system Macaulay 2, which specializes well-known algorithms to binomial ideals. These come up frequently in algebraic statistics and commutative algebra, and it is shown that significant speedup of computations like primary decomposition is possible. While central parts of the implemented algorithms go back to a paper of Eisenbud and Sturmfels, we also discuss a new algorithm for computing the minimal primes of a binomial ideal. All decompositions make significant use of combinatorial structure found in binomial ideals, and to demonstrate the power of this approach we show how Binomials was used to compute primary decompositions of commuting birth and death ideals of Evans et al., yielding a counterexample for their conjectures.     

Generalized binomial edge ideals

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gröbner basis can be computed by studying paths in the graph. Since these Gröbner bases are square-free, generalized binomial edge ideals are radical. To find the primary decomposition a combinatorial problem involving the connected components of subgraphs has to be solved. The irreducible components of the solution variety are all rational.     

Parity binomial edge ideals

Parity binomial edge ideals of simple undirected graphs are introduced. Unlike binomial edge ideals, they do not have square-free Gröbner bases and are radical if and only if the graph is bipartite or the characteristic of the ground field is not two. The minimal primes are determined and shown to encode combinatorics of even and odd walks in the graph. A mesoprimary decomposition is determined and shown to be a primary decomposition in characteristic two.     

Log canonical thresholds of binomial ideals

We prove that the log canonical thresholds of a large class of binomial ideals, such as complete intersection binomial ideals and the defining ideals of space monomial curves, are computable by linear programming. Dedicated to Professor Toshiyuki Katsura on the occasion of his sixtieth birthday     

On the binomial arithmetical rank

The binomial arithmetical rank of a binomial ideal I is the smallest integer s for which there exist binomials f₁,..., f_s in I such that rad (I) = rad (f₁,..., f_s). We completely determine the binomial arithmetical rank for the ideals of monomial curves in P_KⁿP_K^n. In particular we prove that, if the characteristic of the field K is zero, then bar (I(C)) = n - 1 if C is complete intersection, otherwise bar (I(C)) = n. While it is known that if the characteristic of the field K is positive, then bar (I(C)) = n - 1 always.     

On the regularity of binomial edge ideals

We study the regularity of binomial edge ideals. For a closed graph G we show that the regularity of the binomial edge ideal coincides with the regularity of and can be expressed in terms of the combinatorial data of G. In addition, we give positive answers to Matsuda‐Murai conjecture 8 for some classes of graphs.     

Binomial arithmetical rank of lattice ideals

 In this paper, we will show that a lattice ideal is a complete intersection if and only if its binomial arithmetical rank equals its height, if the characteristic of the base field k is zero. And we will give the condition that a binomial ideal equals a lattice ideal up to radical in the case of char k=0. Further, we will study the upper bound of the binomial arithmetical rank of lattice ideals and give a sharp bound for the lattice ideals of codimension two. Received: 12 June 2001 / Revised version: 22 July 2002     

Unconditional ideals of finite rank operators

Let X be a Banach space. We give characterizations of when is a u-ideal in for every Banach space Y in terms of nets of finite rank operators approximating weakly compact operators. Similar characterizations are given for the cases when is a u-ideal in for every Banach space Y, when is a u-ideal in for every Banach space Y, and when is a u-ideal in for every Banach space Y.     

Gorenstein binomial edge ideals associated with scrolls

Let I_G be the binomial edge ideal on the generic 2×n - Hankel matrix associated with a closed graph G on the vertex set [n]. We characterize the graphs G for which I_G has maximal regularity and is Gorenstein.     

Hilbert-Kunz function of monomial ideals and binomial hypersurfaces

The aim of this note is to determine the Hilbert-Kunz functions of rings defined by monomial ideals and of rings defined by a single binomial equationX ^a−X^b with gcd(X ^a, X^b)=1.     

Right ideals generated by an idempotent of finite rank

Let R be a K-algebra acting densely on V_D, where K is a commutative ring with unity and V is a right vector space over a division K-algebra D. Let f(X₁,…,X_t) be an arbitrary and fixed polynomial over K in noncommuting indeterminates X₁,…,X_t with constant term 0 such that for some μK occurring in the coefficients of f(X₁,…,X_t). It is proved that a right ideal ρ of R is generated by an idempotent of finite rank if and only if the rank of f(x₁,…,x_t) is bounded above by a same natural number for all x₁,…,x_tρ. In this case, the rank of the idempotent that generates ρ is also explicitly given. The results are then applied to considering the triangularization of ρ and the irreducibility of f(ρ), where f(ρ) denotes the additive subgroup of R generated by the elements f(x₁,…,x_t) for x₁,…,x_tρ.     

The arithmetical rank of the edge ideals of cactus graphs

We prove that, for the edge ideal of a cactus graph, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes. The bound is sharp, but in many cases, it can be improved. Moreover, we show that the edge ideal of a Cohen–Macaulay graph that contains exactly one cycle or is chordal or has no cycles of length 4 and 5 is a set-theoretic complete intersection.     

Regularity,depth and arithmetic rank of bipartite edge ideals

We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of invariants of the directed graph. For some classes of unmixed edge ideals, we show that the arithmetic rank of the ideal equals projective dimension of its quotient.     

On the ideals of torsion-free rings of rank one and two

Let A be a torsion-free Abelian group of rank one or two. We use the type set of A to give necessary and sufficient conditions for the subgroups of A to be ideals in every ring on A.     

Divisors on graphs,binomial and monomial ideals,and cellular resolutions

We study various binomial and monomial ideals arising in the theory of divisors, orientations, and matroids on graphs. We use ideas from potential theory on graphs and from the theory of Delaunay decompositions for lattices to describe their minimal polyhedral cellular free resolutions. We show that the resolutions of all these ideals are closely related and that their \({\mathbb {Z}}\)-graded Betti tables coincide. As corollaries, we give conceptual proofs of conjectures and questions posed by Postnikov and Shapiro, by Manjunath and Sturmfels, and by Perkinson, Perlman, and Wilmes. Various other results related to the theory of chip-firing games on graphs also follow from our general techniques and results.