Prime splittings of determinantal ideals

@article{Mohammadi2012PrimeSO,
  title={Prime splittings of determinantal ideals},
  author={Fatemeh Mohammadi and Johannes Rauh},
  journal={Communications in Algebra},
  year={2012},
  volume={46},
  pages={2278 - 2296}
}
ABSTRACT We consider determinantal ideals, where the generating minors are encoded in a hypergraph. We study when the generating minors form a Gröbner basis. In this case, the ideal is radical, and we can describe algebraic and numerical invariants of these ideals in terms of combinatorial data of their hypergraphs, such as the clique decomposition. In particular, we can construct a minimal free resolution as a tensor product of the minimal free resolution of their cliques. For several classes… 
Linear strands of initial ideals of determinantal facet ideals
Abstract We construct an explicit linear strand for the initial ideal of any determinantal facet ideal (DFI) with respect to any diagonal term order. We show that if the clique complex of Δ has no
Divisors on Graphs, Connected Flags, and Syzygies
We study the binomial and monomial ideals arising from linear equivalence of divisors on graphs from the point of view of Grobner theory. We give an explicit description of a minimal Grobner basis
lcm-Closed Determinantal Facet Ideals
Determinantal facet ideals are generated by a subset of the maximal minors of a generic $n\times m$ matrix indexed by the facets of a simplicial complex. We consider the more general notion of an
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 of Ideals of Minors Meeting a Submatrix
We compute the primary decomposition of certain ideals generated by subsets of minors in a generic matrix or in a generic symmetric matrix, or subsets of Pfaffians in a generic skew-symmetric matrix.
Determinantal facet ideals for smaller minors
A determinantal facet ideal (DFI) is generated by a subset of the maximal minors of a generic n×m matrix where n ≤ m indexed by the facets of a simplicial complex ∆. We consider the more general
The linear strand of determinantal facet ideals
Let $X$ be an $(m\times n)$-matrix of indeterminates, and let $J$ be the ideal generated by a set $\mathcal{S}$ of maximal minors of $X$. We construct the linear strand of the resolution of $J$. This
On the primary decomposition of some determinantal hyperedge ideal
Matroid stratifications of hypergraph varieties, their realization spaces, and discrete conditional independence models
We study conditional independence (CI) models in statistical theory, in the case of discrete random variables, from the point of view of algebraic geometry and matroid theory. Any CI model with
...
1
2
...

References

SHOWING 1-10 OF 51 REFERENCES
Ideals of adjacent minors
Free Resolutions and Sparse Determinantal Ideals
A sparse generic matrix is a matrix whose entries are distinct variables and zeros. Such matrices were studied by Giusti and Merle who computed some invariants of their ideals of maximal minors. In
Nice Initial Complexes of Some Classical Ideals
This is a survey article on Gorenstein initial complexes of extensively studied ideals in commutative algebra and algebraic geometry. These include defining ideals of Segre and Veronese varieties,
Determinantal Facet Ideals
We consider ideals generated by general sets of $m$-minors of an $m\times n$-matrix of indeterminates. The generators are identified with the facets of an $(m-1)$-dimensional pure simplicial complex.
Divisors on Graphs, Connected Flags, and Syzygies
We study the binomial and monomial ideals arising from linear equivalence of divisors on graphs from the point of view of Grobner theory. We give an explicit description of a minimal Grobner basis
The binomial edge ideal of a pair of graphs
Abstract We introduce a class of ideals generated by a set of 2-minors of an (m × n)-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of
Binomial edge ideals and conditional independence statements
Combinatorics of Maximal Minors
We continue the study of the Newton polytope ∏m,n of the product of all maximal minors of an m × n-matrix of indeterminates. The vertices of ∏m,n are encoded by coherent matching fields Λ = (Λσ),
Ideals generated by adjacent 2-minors
Ideals generated by adjacent 2-minors are studied. First, the problem when such an ideal is a prime ideal as well as the problem when such an ideal possesses a quadratic Gr\"obner basis is solved.
Generalized binomial edge ideals
  • J. Rauh
  • Mathematics
    Adv. Appl. Math.
  • 2013
...
1
2
3
4
5
...