• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Shellable nonpure complexes and posets (1996)

by A Björner, M Wachs
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 183
Next 10 →

Resolutions Of Stanley-Reisner Rings And Alexander Duality

by John A. Eagon, Victor Reiner , 1996
"... Associated to any simplicial complex \Delta on n vertices is a square-free monomial ideal I \Delta in the polynomial ring A = k[x 1 ; : : : ; xn ], and its quotient k[\Delta] = A=I \Delta known as the Stanley-Reisner ring. This note considers a simplicial complex which is in a sense a canonical ..."
Abstract - Cited by 120 (2 self) - Add to MetaCart
Associated to any simplicial complex \Delta on n vertices is a square-free monomial ideal I \Delta in the polynomial ring A = k[x 1 ; : : : ; xn ], and its quotient k[\Delta] = A=I \Delta known as the Stanley-Reisner ring. This note considers a simplicial complex which is in a sense a canonical Alexander dual to \Delta, previously considered in [Ba, BrHe]. Using Alexander duality and a result of Hochster computing the Betti numbers dim k Tor i (k[\Delta]; k), it is shown (Proposition 1) that these Betti numbers are computable from the homology of links of faces in \Delta . As corollaries, we prove that I \Delta has a linear resolution as A-module if and only if \Delta is Cohen-Macaulay over k, and show how to compute the Betti numbers dim k Tor i (k[\Delta]; k) in some cases where \Delta is well-behaved (shellable, Cohen-Macaulay, or Buchsbaum). Some other applications of the notion of shellability are also discussed.

The LCM-lattice in monomial resolutions

by Vesselin Gasharov, Irena Peeva, Volkmar Welker , 1999
"... Describing the properties of the minimal free resolution of a monomial ideal I is a difficult problem posed in the early 1960’s. The main directions of progress on this problem were: ..."
Abstract - Cited by 61 (7 self) - Add to MetaCart
Describing the properties of the minimal free resolution of a monomial ideal I is a difficult problem posed in the early 1960’s. The main directions of progress on this problem were:

On the radical of a monomial ideal

by Jürgen Herzog, Yukihide Takayama, Naoki Terai - J. ALGEBRA , 2004
"... Algebraic and combinatorial properties of a monomial ideal and its radical are compared. ..."
Abstract - Cited by 61 (9 self) - Add to MetaCart
Algebraic and combinatorial properties of a monomial ideal and its radical are compared.

How to compute the Stanley depth of a monomial ideal

by Jürgen Herzog, Marius Vladoiu, Xinxian Zheng - J. ALGEBRA , 2007
"... ..."
Abstract - Cited by 58 (3 self) - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

... the number of 2-sets in Pm is at least 4×2 = 8, a contradiction. Hence, our assumption is false and consequently sdepthm = 2 = ⌈4/2⌉. (b) Let n = 5. Obviously A = [1,123]∪ [2,234]∪ [3,345]∪ [4,145]∪ =-=[5,125]-=- is a disjoint union of intervals which contains all 1- and 2-sets of Pm. Then A∪ ⋃ a∈Pm\A[a,a] is a partition of Pm and applying Corollary 2.5 we obtain that sdepthm≥ 3. With the same arguments given...

On the Charney-Davis and Neggers-Stanley Conjectures

by Victor Reiner, Volkmar Welker
"... For a graded naturally labelled poset P, it is shown that the P-Eulerian polynomial ... counting linear extensions of P by their number of descents has symmetric and unimodal coefficient sequence, verifying the motivating consequence of the Neggers-Stanley conjecture on real zeroes for W (P, t) in t ..."
Abstract - Cited by 43 (6 self) - Add to MetaCart
For a graded naturally labelled poset P, it is shown that the P-Eulerian polynomial ... counting linear extensions of P by their number of descents has symmetric and unimodal coefficient sequence, verifying the motivating consequence of the Neggers-Stanley conjecture on real zeroes for W (P, t) in these cases. The result is deduced from McMullen's g-Theorem, by exhibiting a simplicial polytopal sphere whose h-polynomial is W (P, t). Whenever this...
(Show Context)

Citation Context

...ts corresponding simplex in ∆J(P ) which is not contained in a lexicographically earlier simplex is spanned by the ideals {w1, w2, . . . , wi} where i ∈ Des(w). Using basic facts about shellings (see =-=[3]-=-), part (iv) of the preceding proposition implies that one can re-interpret the polynomial W (P, t): (2.1) W (P, t) := � t des(w) = h(∆J(P ), t) w∈L(P ) This connection with J(P ) also allows one to r...

Algebraic properties of edge ideals via combinatorial topology

by Anton Dochtermann, Alexander Engström , 2009
"... ..."
Abstract - Cited by 41 (2 self) - Add to MetaCart
Abstract not found

Finite filtrations of modules and shellable multicomplexes

by Jürgen Herzog, Dorin Popescu - MANUSCRIPTA MATH , 2005
"... We introduce pretty clean modules, extending the notion of clean modules by Dress, and show that pretty clean modules are sequentially Cohen-Macaulay. We also extend a theorem of Dress on shellable simplicial complexes to multicomplexes. ..."
Abstract - Cited by 39 (7 self) - Add to MetaCart
We introduce pretty clean modules, extending the notion of clean modules by Dress, and show that pretty clean modules are sequentially Cohen-Macaulay. We also extend a theorem of Dress on shellable simplicial complexes to multicomplexes.
(Show Context)

Citation Context

... algebraic counterpart of shellability for simplicial complexes. Indeed, let ∆ be a simplicial complex and K a field. Dress [4] showed that ∆ is (non-pure) shellable in the sense of Björner and Wachs =-=[2]-=-, if and only if the Stanley-Reisner ring K[∆] is clean. On the other hand Stanley [15] showed that if ∆ is shellable, then K[∆] is sequentially Cohen-Macaulay. In this paper we show more generally th...

Simplicial trees are sequentially Cohen-Macaulay

by Sara Faridi - J. Pure Appl. Algebra
"... This paper uses dualities between facet ideal theory and Stanley-Reisner theory to show that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay. The proof involves showing that the Alexander dual (or the cover dual, as we call it here) of a sim-plicial tree is a componentwise linear ..."
Abstract - Cited by 38 (8 self) - Add to MetaCart
This paper uses dualities between facet ideal theory and Stanley-Reisner theory to show that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay. The proof involves showing that the Alexander dual (or the cover dual, as we call it here) of a sim-plicial tree is a componentwise linear ideal. We conclude with additional combinatorial properties of simplicial trees. The main result of the this paper is that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay. Sequentially Cohen-Macaulay modules were introduced by Stanley [S] (following the introduction of nonpure shellability by Bjorner and Wachs [BW]) so that a nonpure shellable simplicial complex had a sequentially Cohen-Macaulay Stanley-Reisner ideal. Herzog and Hibi ([HH]) then dened the notion of a componentwise linear ideal, which extended a criterion of Eagon and Reiner ([ER]) for Cohen-Macaulayness of an ideal to a criterion for sequential Cohen-Macaulayness. Simplicial trees, on the other hand, were introduced in [F1] in the context of Rees rings, and their facet ideals were studied further in [F2] for their Cohen-Macaulay properties, and
(Show Context)

Citation Context

... ideal of a simplicial tree is sequentially Cohen-Macaulay. Sequentially Cohen-Macaulay modules were introduced by Stanley [S] (following the introduction of nonpure shellability by Björner and Wachs =-=[BW]-=-) so that a nonpure shellable simplicial complex had a sequentially Cohen-Macaulay Stanley-Reisner ideal. Herzog and Hibi ([HH]) then defined the notion of a componentwise linear ideal, which extended...

SHELLABLE GRAPHS AND SEQUENTIALLY COHEN-MACAULAY BIPARTITE GRAPHS

by Adam Van Tuyl, Rafael H. Villarreal , 2007
"... Associated to a simple undirected graph G is a simplicial complex ∆G whose faces correspond to the independent sets of G. We call a graph G shellable if ∆G is a shellable simplicial complex in the non-pure sense of Björner-Wachs. We are then interested in determining what families of graphs have t ..."
Abstract - Cited by 36 (7 self) - Add to MetaCart
Associated to a simple undirected graph G is a simplicial complex ∆G whose faces correspond to the independent sets of G. We call a graph G shellable if ∆G is a shellable simplicial complex in the non-pure sense of Björner-Wachs. We are then interested in determining what families of graphs have the property that G is shellable. We show that all chordal graphs are shellable. Furthermore, we classify all the shellable bipartite graphs; they are precisely the sequentially Cohen-Macaulay bipartite graphs. We also give an inductive procedure to build all such shellable bipartite graphs. Because shellable implies that the associated Stanley-Reisner ring is sequentially Cohen-Macaulay, our results complement and extend recent work on the problem of determining when the edge ideal of a graph is (sequentially) Cohen-Macaulay. We also give a new proof for a result of Faridi on the sequentially Cohen-Macaulayness of simplicial forests.

Discrete Morse Theory for Cellular Resolutions

by E. Batzies, V. Welker - J. Reine Angew. Math , 2000
"... We develop an analog of Forman's discrete Morse theory for cell complexes in the setting of cellular resolutions of multigraded monomial modules. In particular, using discrete Morse theory for cellular resolutions of multigraded ideals we are able to give minimal cellular resolutions for gen ..."
Abstract - Cited by 34 (2 self) - Add to MetaCart
We develop an analog of Forman's discrete Morse theory for cell complexes in the setting of cellular resolutions of multigraded monomial modules. In particular, using discrete Morse theory for cellular resolutions of multigraded ideals we are able to give minimal cellular resolutions for generic and shellable monomial modules. The latter ones are introduced in this paper and include stable, squarefree stable monomial ideals and Stanley-Reisner ideals I such that is the combinatorial Alexander-dual of a non-pure shellable simplicial complex. For generic monomial ideals the given resolution is the resolution determined by the Scarf-complex as shown by Bayer & Sturmfels and Bayer, Peeva & Sturmfels and by Miller, Sturmfels & Yanagawa in its most general form. For stable and squarefree-stable monomial ideals the minimal resolution had been determined by Eliahou & Kervaire respectively Aramova, Herzog & Hibi and Peeva by algebraic means. In great detail we examplify our method for powers of the maximal ideal. Parallel to our work Skoldberg has constructed minimal free resolutions for a class of ideals that includes the shellable ones by algebraic means. The preceding constructions can be viewed as a generalization of a result by Lyubeznik which gives a resolution that is a subcomplex of the Taylor resolution. For ane semigroup rings k[] we are able to give a minimal free resolution of the eld k in case all lower intervals in the poset are non-pure shellable. This is a condition which implies in the pure case, in other words k[] is homogeneous, that k[] is Koszul. 1.
(Show Context)

Citation Context

... [d] j [d] n 62 g is the combinatorial Alexander-dual of , then the minimal non-faces of are the complements of the maximal faces of . The simplicial complex is called shellable (see [3] for background on nonpure shellable simplicial complexes) if there is a linear order \v" on the set MaxFac( ) of its maximal faces such that if 0 @ then there is a 00 @ with 0 \ 00...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University