English
Related papers

Related papers: Non-extendably shellable skeleta of simplices

200 papers

Let L be a lattice admitting a left-modular chain of length r, not necessarily maximal. We show that if either L is graded or the chain is modular, then the (r-2)-skeleton of L is vertex-decomposable (hence shellable). This proves a…

Combinatorics · Mathematics 2012-04-03 Russ Woodroofe

In 1975 Wegner conjectured that the nerve of every finite good cover in R^d is d-collapsible. We disprove this conjecture. A good cover is a collection of open sets in R^d such that the intersection of every subcollection is either empty or…

Combinatorics · Mathematics 2010-08-12 Martin Tancer

We consider a $q$-analogue of abstract simplicial complexes, called $q$-complexes, and discuss the notion of shellability for such complexes. It is shown that $q$-complexes formed by independent subspaces of a $q$-matroid are shellable.…

Combinatorics · Mathematics 2021-05-20 Sudhir R. Ghorpade , Rakhi Pratihar , Tovohery H. Randrianarisoa

We give a new proof of an old identity of Dixon (1865-1936) that uses tools from topological combinatorics. Dixon's identity is re-established by constructing an infinite family of non-pure simplicial complexes $\Delta(n)$, indexed by the…

Combinatorics · Mathematics 2016-05-12 Ruth Davidson , Augustine O'Keefe , Daniel Parry

A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…

Combinatorics · Mathematics 2013-04-30 Jesús A. De Loera , Francisco Santos , Fumihiko Takeuchi

We show that for $d\geq 2$ every finite $d$-dimensional simplicial complex is a deformation retract of a $(2d-1)$-dimensional pseudomanifold with boundary. Moreover, it embeds as a retract in a closed $(2d-1)$-dimensional pseudomanifold.

Geometric Topology · Mathematics 2026-05-05 Kasia Jankiewicz , Kevin Schreve

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…

Combinatorics · Mathematics 2017-07-25 Becky Hooper , Adam Van Tuyl

New constructions in group homology allow us to manufacture high-dimensional manifolds with controlled simplicial volume. We prove that for every dimension bigger than 3 the set of simplicial volumes of orientable closed connected manifolds…

Geometric Topology · Mathematics 2020-07-08 Nicolaus Heuer , Clara Loeh

We study a problem of Santos about the largest possible diameter of a $d$-dimensional (abstract) simplicial complex on $n$ vertices. For dimension 2, we determine the exact value of the maximum for every $n$ using an explicit construction.…

Combinatorics · Mathematics 2025-11-14 Olaf Parczyk , Silas Rathke , Tibor Szabó

We show that there exist closed manifolds with arbitrarily small transcendental simplicial volumes. Moreover, we exhibit an explicit uncountable family of (transcendental) real numbers that are not realised as the simplicial volume of a…

Geometric Topology · Mathematics 2020-11-17 Nicolaus Heuer , Clara Loeh

Given a simplicial complex $\Delta$, we investigate how to construct a new simplicial complex $\bar{\Delta}$ such that the corresponding monomial ideals satisfy nice algebraic properties. We give a procedure to check the vertex…

Commutative Algebra · Mathematics 2023-04-25 Bijender , Ajay Kumar

In this paper we shall prove that the singular locus of a symplectic singularity has no codimension 3 irreducible components. As a corollary, a symplectic singularity is terminal if and only if its singular locus has codimension $\geq 4$.…

Algebraic Geometry · Mathematics 2007-05-23 Yoshinori Namikawa

We introduce the class of linearly shellable pure simplicial complexes. The characterizing property is the existence of a labeling of their vertices such that all linear extensions of the Bruhat order on the set of facets are shelling…

Combinatorics · Mathematics 2024-10-29 Paolo Sentinelli

We prove that a simplicial 2-sphere satisfying a certain condition is the underlying simplicial complex of a 3-dimensional non-singular complete fan. In particular, this implies that any simplicial 2-sphere with $\leq 18$ vertices is the…

Combinatorics · Mathematics 2016-04-29 Yusuke Suyama

In this article we investigate the shellability of the flag simplicial complexes attached to non-simple and thin polyominoes. As a consequence, we obtain the Cohen-Macaulayness and a combinatorial interepetation of the $h$-polynomial of the…

Commutative Algebra · Mathematics 2025-02-11 Francesco Navarra

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…

Combinatorics · Mathematics 2018-11-28 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

We present extremal constructions connected with the property of simplicial collapsibility. (1) For each $d \ge 2$, there are collapsible (and shellable) simplicial $d$-complexes with only one free face. Also, there are non-evasive…

Combinatorics · Mathematics 2016-10-12 Karim A. Adiprasito , Bruno Benedetti , Frank H. Lutz

We construct $d$-dimensional pure simplicial complexes and pseudo-manifolds (without boundary) with $n$ vertices whose combinatorial diameter grows as $c_d n^{d-1}$ for a constant $c_d$ depending only on $d$, which is the maximum possible…

Combinatorics · Mathematics 2017-09-07 Francisco Criado , Francisco Santos

The diameter of a strongly connected $d$-dimensional simplicial complex is the diameter of its dual graph. We provide a probabilistic proof of the existence of $d$-dimensional simplicial complexes with diameter $ (\frac{1}{d \cdot d!} -…

Combinatorics · Mathematics 2022-04-27 Tom Bohman , Andrew Newman

Let Y be a random d-dimensional subcomplex of the (n-1)-dimensional simplex S obtained by starting with the full (d-1)-dimensional skeleton of S and then adding each d-simplex independently with probability p=c/n. We compute an explicit…

Combinatorics · Mathematics 2011-08-04 L. Aronshtam , N. Linial , T. Luczak , R. Meshulam