Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[S_r] of a symmetric group S_r. If for a class of tensors T such a W is known, the elements of the orthogonal subspace W^{\bot} of W within the dual space of K[S_r] yield linear identities needed for a treatment of the term combination problem for the coordinates of the T. We give the structure of these W for every situation which appears in symbolic tensor calculations by computer. Characterizing idempotents of such W can be determined by means of an ideal decomposition algorithm which works in every semisimple ring up to an isomorphism. Furthermore, we use tools such as the Littlewood-Richardson rule, plethysms and discrete Fourier transforms for S_r to increase the efficience of calculations. All described methods were implemented in a Mathematica package called PERMS.
Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct decompositions that are direct combinatorial analogues of binomial irreducible decompositions, and for binomial ideals we construct decompositions into ideals that are as irreducible as possible while remaining binomial. We provide an example of a binomial ideal that is not an intersection of binomial irreducible ideals, thus answering a question of Eisenbud an…
Irreducible decomposition of monomial ideals has an increasing number of applications from biology to pure math. This paper presents the Slice Algorithm for computing irreducible decompositions, Alexander duals and socles of monomial ideals. The paper includes experiments showing good performance in practice.
Without any restrictions on the base field, we compute the hull and prove a conjecture of Eisenbud and Sturmfels giving an unmixed decomposition of a cellular binomial ideal. Over an algebraically closed field, we further obtain an explicit (but not necessarily minimal) primary decomposition of such an ideal.
Primary decomposition of commutative monoid congruences is insensitive to certain features of primary decomposition in commutative rings. These features are captured by the more refined theory of mesoprimary decomposition of congruences, introduced here complete with witnesses and associated prime objects. The combinatorial theory of mesoprimary decomposition lifts to arbitrary binomial ideals in monoid algebras. The resulting binomial mesoprimary decomposition is a new type of intersection decomposition for binomial ideals that enjoys computational efficiency and independence from ground fiel…
The paper that was here is a preprint that was never turned into a proper paper. In particular it does not have enough citations to the literature. The paper "The Slice Algorithm For Irreducible Decomposition of Monomial Ideals" contains a much better description of the Label algorithm than this preprint did. If you still wish to read the original preprint then access the arXiv's version 1 of this paper, instead of version 2 which is what you are reading now.
We define nice partitions of the multicomplex associated to a Stanley ideal. As the main result we show that if the monomial ideal $I$ is a CM Stanley ideal, then $I^p$ is a Stanley ideal as well, where $I^p$ is the polarization of $I$.
We study the Castelnuovo-Mumford regularity of the vanishing ideal over a bipartite graph endowed with a decomposition of its edge set. We prove that, under certain conditions, the regularity of the vanishing ideal over a bipartite graph obtained from a graph by attaching a path of length $\ell$ increases by $\lfloor \frac{\ell}{2}\rfloor (q-2)$, where $q$ is the order of the field of coefficients. We use this result to show that the regularity of the vanishing ideal over a bipartite graph, $G$, endowed with a weak nested ear decomposition is equal to $$\textstyle \frac{|V_G|+ ε-3}{2}(q-2),$$ …
In this paper, we give a complete description of the associated primes of every power of the edge ideal in terms of generalized ear decompositions of the graph. This result establishes a surprising relationship between two seemingly unrelated notions of Commutative Algebra and Combinatorics. It covers all previous major results in this topic and has several interesting consequences.
The ideal (tagged resp.) triangulation of bounded surface with marked points are associated with skew-symmetric (skew-symmetrizable) exchange matrices. An algo- rithm is established to decompose the graph associated to such matrix. There are finite many graph with non-unique decomposition. We find all such graphs and their decompositions. In addition, we also find the associated ideal (tagged) triangulations to different decompositions.
A normal (respectively, graded normal) vector configuration $A$ defines the toric ideal $I_A$ of a normal (respectively, projectively normal) toric variety. These ideals are Cohen-Macaulay, and when $A$ is normal and graded, $I_A$ is generated in degree at most the dimension of $I_A$. Based on this, Sturmfels asked if these properties extend to initial ideals -- when $A$ is normal, is there an initial ideal of $I_A$ that is Cohen-Macaulay, and when $A$ is normal and graded, does $I_A$ have a Gröbner basis generated in degree at most $dim(I_A)$ ? In this paper, we answer both questions positive…
In this paper we show that the lowest two-sided ideal of an affine Hecke algebra is affine cellular for all choices of parameters. We explicitely describe the cellular basis and we show that the basis elements have a nice decomposition when expressed in the Kazhdan-Lusztig basis. In type $A$ we provide a combinatorial description of this decomposition in term of number of paths.
We describe the use of pyramid decomposition in Normaliz, a software tool for the computation of Hilbert bases and enumerative data of rational cones and affine monoids. Pyramid decomposition in connection with efficient parallelization and streamlined evaluation of simplicial cones has enabled Normaliz to process triangulations of size $\approx 5\cdot 10^{11}$ that arise in the computation of Hilbert series related to combinatorial voting theory.
An explicit lattice point realization is provided for the primary components of an arbitrary binomial ideal in characteristic zero. This decomposition is derived from a characteristic-free combinatorial description of certain primary components of binomial ideals in affine semigroup rings, namely those that are associated to faces of the semigroup. These results are intimately connected to hypergeometric differential equations in several variables.
The paper has two goals: the study the associated graded ring of contracted homogeneous ideals in $K[x,y]$ and the study of the Groebner fan of the ideal $P$ of the rational normal curve in ${\bf P}^d$. These two problems are, quite surprisingly, very tightly related. We completely classify the contracted ideals with a Cohen-Macaulay associated graded rings in terms of the numerical invariants arising from Zariski's factorization. We determine explicitly all the initial ideals (monomial or not) of $P$ that are Cohen-Macaulay.
We generalize the Bernstein-Sato polynomials of Budur, Mustata and Saito to ideals in normal semigroup rings. In the case of monomial ideals, we also relate the roots of the Bernstein-Sato polynomial to the jumping coefficients of the corresponding multiplier ideals. In order to prove the latter result, we obtain a new combinatorial description for the multiplier ideals of a monomial ideal in a normal semigroup ring.
Recent results of Kahle and Miller give a method of constructing primary decompositions of binomial ideals by first constructing "mesoprimary decompositions" determined by their underlying monoid congruences. Monoid congruences (and therefore, binomial ideals) can present many subtle behaviors that must be carefully accounted for in order to produce general results, and this makes the theory complicated. In this paper, we examine their results in the presence of a positive $A$-grading, where certain pathologies are avoided and the theory becomes more accessible. Our approach is algebraic: whil…
Continuing a well established tradition of associating convex bodies to monomial ideals, we initiate a program to construct asymptotic Newton polyhedra from decompositions of monomial ideals. This is achieved by forming a graded family of ideals based on a given decomposition. We term these graded families powers since they generalize the notions of ordinary and symbolic powers. Asymptotic invariants for these graded families are expressed as solutions to linear optimization problems on the respective convex bodies. This allows to establish a lower bound on the Waldschmidt constant of a monomi…
Let C be a uniform clutter and let I=I(C) be its edge ideal. We prove that if C satisfies the packing property (resp. max-flow min-cut property), then there is a uniform Cohen-Macaulay clutter C1 satisfying the packing property (resp. max-flow min-cut property) such that C is a minor of C1. For arbitrary edge ideals of clutters we prove that the normality property is closed under parallelizations. Then we show some applications to edge ideals and clutters which are related to a conjecture of Conforti and Cornuéjols and to max-flow min-cut problems.
We consider quantum Schubert cells in the quantum grassmannian and give a cell decomposition of the prime spectrum via the Schubert cells. As a consequence, we show that all primes are completely prime in the generic case where the deformation parameter q is not a root of unity. There is a torus H that acts naturally on the quantum grassmannian and the cell decomposition of the set of H-primes leads to a parameterisation of the H-spectrum via certain diagrams on partitions associated to the Schubert cells. Interestingly, the same parameterisation occurs for the non-negative cells in recent stu…
