Related papers: Decompositions of Cellular Binomial Ideals
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…
In this paper, we give decision criteria for normal binomial difference polynomial ideals in the univariate difference polynomial ring F{y} to have finite difference Groebner bases and an algorithm to compute the finite difference Groebner…
In this paper we investigate a family of algebras endowed with a suitable non-degenerate bilinear form that can be used to define two different notions of dual for a given right ideal. We apply our results to the classification of the right…
We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…
Generalising a seminal result of Epstein and Penner for cusped hyperbolic manifolds, Cooper and Long showed that each decorated strictly convex projective cusped manifold has a canonical cell decomposition. Penner used the former result to…
We present matrices as graded BiHom-algebras and consider various characteristics of their decompositions. Specifically, we introduce a notion of connection in the support of the grading and use it to construct a family of canonical graded…
This paper computes the integral homology of real flag manifolds associated with split real forms of classical and exceptional semisimple Lie algebras. Using the cellular homology provided by the Bruhat decomposition, we introduce a unified…
We develop splitting techniques to study Lyubeznik numbers of cover ideals of graphs which allow us to describe them for large families of graphs including forests, cycles, wheels and cactus graphs. More generally we are able to compute all…
We generalize the analog of Buchberger's first criterion, stated by Boulier et al., for detecting useless S-polynomials reductions in the computation of characteristic sets of differential ideals. The original version assumes linear…
This survey of methods surrounding lattice point methods for binomial ideals begins with a leisurely treatment of the geometric combinatorics of binomial primary decomposition. It then proceeds to three independent applications whose…
Let $G$ be a finite connected simple graph with $d$ vertices and let $\Pc_G \subset \RR^d$ be the edge polytope of $G$. We call $\Pc_G$ \emph{decomposable} if $\Pc_G$ decomposes into integral polytopes $\Pc_{G^+}$ and $\Pc_{G^-}$ via a…
Let $S$ be a polynomial algebra over a field. We study classes of monomial ideals (as for example lexsegment ideals) of $S$ having minimal depth. In particular, Stanley's conjecture holds for these ideals. Also we show that if Stanley's…
In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…
Ideals in the ring of power series in three variables can be classified based on algebra structures on their minimal free resolutions. The classification is incomplete in the sense that it remains open which algebra structures actually…
In this paper we present an efficient algorithm for bivariate interpolation, which is based on the use of the partition of unity method for constructing a global interpolant. It is obtained by combining local radial basis function…
We conclude our analysis of bubble divergences in the flat spinfoam model. In [arXiv:1008.1476] we showed that the divergence degree of an arbitrary two-complex Gamma can be evaluated exactly by means of twisted cohomology. Here, we…
In this paper, we investigate the arithmetical rank of a binomial ideal $J$. We provide lower bounds for the binomial arithmetical rank and the $J$-complete arithmetical rank of $J$. Special attention is paid to the case where $J$ is the…
We show that errors in data transmitted through linear codes can be thought of as codewords of minimum weight of new linear codes. To determine errors we can then use methods specific to finding such special codewords. One of these methods…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…