Pure vertex decomposable simplicial complex associated to graphs whose 5-cycles are chorded

2016 ◽  
Vol 23 (1) ◽  
pp. 399-412 ◽  
Author(s):  
Iván D. Castrillón ◽  
Enrique Reyes
2017 ◽  
Vol 24 (04) ◽  
pp. 611-624 ◽  
Author(s):  
Ashkan Nikseresht ◽  
Rashid Zaare-Nahandi

In this paper, we study the notion of chordality and cycles in clutters from a commutative algebraic point of view. The corresponding concept of chordality in commutative algebra is having a linear resolution. We mainly consider the generalization of chordality proposed by Bigdeli et al. in 2017 and the concept of cycles introduced by Cannon and Faridi in 2013, and study their interrelations and algebraic interpretations. In particular, we investigate the relationship between chordality and having linear quotients in some classes of clutters. Also, we show that if [Formula: see text] is a clutter such that 〈[Formula: see text]〉 is a vertex decomposable simplicial complex or I([Formula: see text]) is squarefree stable, then [Formula: see text] is chordal.


2016 ◽  
Vol 118 (1) ◽  
pp. 43 ◽  
Author(s):  
Somayeh Moradi ◽  
Fahimeh Khosh-Ahang

In this paper we study the Alexander dual of a vertex decomposable simplicial complex. We define the concept of a vertex splittable ideal and show that a simplicial complex $\Delta$ is vertex decomposable if and only if $I_{\Delta^{\vee}}$ is a vertex splittable ideal. Moreover, the properties of vertex splittable ideals are studied. As the main result, it is proved that any vertex splittable ideal has a Betti splitting and the graded Betti numbers of such ideals are explained with a recursive formula. As a corollary, recursive formulas for the regularity and projective dimension of $R/I_{\Delta}$, when $\Delta$ is a vertex decomposable simplicial complex, are given. Moreover, for a vertex decomposable graph $G$, a recursive formula for the graded Betti numbers of its vertex cover ideal is presented. In special cases, this formula is explained, when $G$ is chordal or a sequentially Cohen-Macaulay bipartite graph. Finally, among the other things, it is shown that an edge ideal of a graph is vertex splittable if and only if it has linear resolution.


10.37236/4894 ◽  
2015 ◽  
Vol 22 (1) ◽  
Author(s):  
Mina Bigdeli ◽  
Jürgen Herzog ◽  
Takayuki Hibi ◽  
Antonio Macchia

Let $I\subset K[x_1,\ldots,x_n]$ be  a zero-dimensional monomial ideal, and $\Delta(I)$ be the simplicial complex whose Stanley--Reisner ideal is the polarization of $I$. It follows from a result of Soleyman Jahan that $\Delta(I)$ is shellable. We give a new short proof of this fact by providing an explicit shelling. Moreover, we show that  $\Delta(I)$ is even vertex decomposable. The ideal $L(I)$, which is defined to be the Stanley--Reisner ideal of the Alexander dual of $\Delta(I)$, has a linear resolution which is cellular and supported on a regular CW-complex. All powers of $L(I)$ have a linear resolution. We compute $\mathrm{depth}\ L(I)^k$ and show that $\mathrm{depth}\ L(I)^k=n$ for all $k\geq n$.


10.37236/1167 ◽  
2012 ◽  
Vol 19 (1) ◽  
Author(s):  
Luis Serrano ◽  
Christian Stump

We exhibit a canonical connection between maximal $(0,1)$-fillings of a moon polyomino avoiding north-east chains of a given length and reduced pipe dreams of a certain permutation. Following this approach we  show that the simplicial complex of such maximal fillings is a vertex-decomposable, and thus shellable, sphere. In particular, this implies a positivity result for Schubert polynomials. Moreover, for Ferrers shapes we construct a bijection to maximal fillings avoiding south-east chains of the same length which specializes to a bijection between $k$-triangulations of the $n$-gon and $k$-fans of Dyck paths of length $2(n-2k)$. Using this, we translate a conjectured cyclic sieving phenomenon for $k$-triangulations with rotation to the language of $k$-flagged tableaux with promotion.


10.37236/8394 ◽  
2019 ◽  
Vol 26 (3) ◽  
Author(s):  
Lorenzo Venturello

A $d$-dimensional simplicial complex is balanced if the underlying graph is $(d+1)$-colorable. We present an implementation of cross-flips, a set of local moves introduced by Izmestiev, Klee and Novik which connect any two PL-homeomorphic balanced combinatorial manifolds. As a result we exhibit a vertex minimal balanced triangulation of the real projective plane, of the dunce hat and of the real projective space, as well as several balanced triangulations of surfaces and 3-manifolds on few vertices. In particular we construct small balanced triangulations of the 3-sphere that are non-shellable and shellable but not vertex decomposable.


2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Luis Serrano ◽  
Christian Stump

International audience We exhibit a canonical connection between maximal $(0,1)$-fillings of a moon polyomino avoiding north-east chains of a given length and reduced pipe dreams of a certain permutation. Following this approach we show that the simplicial complex of such maximal fillings is a vertex-decomposable and thus a shellable sphere. In particular, this implies a positivity result for Schubert polynomials. For Ferrers shapes, we moreover construct a bijection to maximal fillings avoiding south-east chains of the same length which specializes to a bijection between $k$-triangulations of the $n$-gon and $k$-fans of Dyck paths. Using this, we translate a conjectured cyclic sieving phenomenon for $k$-triangulations with rotation to $k$-flagged tableaux with promotion. Nous décrivons un lien canonique entre les $(0,1)$-remplissages maximaux d'un polyomino-lune évitant les chaînes Nord-Est d'une longueur donnée, et les "pipe dreams'' réduits d'une certaine permutation. En suivant cette approche nous montrons que le complexe simplicial de tels remplissages maximaux est une sphère "vertex-decomposable'' et donc "shellable''. En particulier, cela entraîne un résultat de positivité sur les polynômes de Schubert. De plus, nous construisons, dans le cas des diagrammes de Ferrers, une bijection vers les remplissages maximaux évitant les chaînes Sud-Est de même longueur, qui se spécialise en une bijection entre les $k$-triangulations d'un $n$-gone et les $k$-faisceaux de chemins de Dyck. A l'aide de celle-ci, nous traduisons une instance conjecturale du phénomène de tamis cyclique pour les $k$-triangulations avec rotation dans le cadre des tableaux $k$-marqués avec promotion.


2021 ◽  
Vol 28 (03) ◽  
pp. 399-414
Author(s):  
Aming Liu ◽  
Tongsuo Wu

For every simple graph [Formula: see text], a class of multiple clique cluster-whiskered graphs [Formula: see text] is introduced, and it is shown that all such graphs are vertex decomposable; thus, the independence simplicial complex [Formula: see text] is sequentially Cohen–Macaulay. The properties of the graphs [Formula: see text] and [Formula: see text] constructed by Cook and Nagel are studied, including the enumeration of facets of the complex [Formula: see text] and the calculation of Betti numbers of the cover ideal [Formula: see text]. We also prove that the complex[Formula: see text] is strongly shellable and pure for either a Boolean graph [Formula: see text] or the full clique-whiskered graph [Formula: see text] of [Formula: see text], which is obtained by adding a whisker to each vertex of [Formula: see text]. This implies that both the facet ideal [Formula: see text] and the cover ideal [Formula: see text] have linear quotients.


10.37236/2552 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
Jennifer Biermann ◽  
Adam Van Tuyl

Given any finite simplicial complex $\Delta$, we show how to construct from a colouring $\chi$ of $\Delta$ a new simplicial complex $\Delta_{\chi}$ that is balanced and vertex decomposable. In addition, the $h$-vector of $\Delta_{\chi}$ is precisely the $f$-vector of $\Delta$.  Our construction generalizes the "whiskering'' construction of Villarreal, and Cook and Nagel. We also reverse this construction to prove a special case of a conjecture of Cook and Nagel, and Constantinescu and Varbaro on the $h$-vectors of flag complexes.


2019 ◽  
Vol 124 (2) ◽  
pp. 179-187
Author(s):  
Becky Hooper ◽  
Adam Van Tuyl

Ehrenborg, Govindaiah, Park, and Readdy recently introduced the van der Waerden complex, a pure simplicial complex whose facets correspond to arithmetic progressions. Using techniques from combinatorial commutative algebra, we classify when these pure simplicial complexes are vertex decomposable or not Cohen-Macaulay. As a corollary, we classify the van der Waerden complexes that are shellable.


2015 ◽  
Vol 15 (01) ◽  
pp. 1650004 ◽  
Author(s):  
Somayeh Moradi ◽  
Fahimeh Khosh-Ahang

For a simplicial complex Δ, we introduce a simplicial complex attached to Δ, called the expansion of Δ, which is a natural generalization of the notion of expansion in graph theory. We are interested in knowing how the properties of a simplicial complex and its Stanley–Reisner ring relate to those of its expansions. It is shown that taking expansion preserves vertex decomposable and shellable properties and in some cases Cohen–Macaulayness. Also it is proved that some homological invariants of Stanley–Reisner ring of a simplicial complex relate to those invariants in the Stanley–Reisner ring of its expansions.


Sign in / Sign up

Export Citation Format

Share Document