English
Related papers

Related papers: Obstructions to Shellability

200 papers

For a simplicial complex K on m vertices and simplicial complexes K1,...,Km a composed simplicial complex K(K1,...,Km) is introduced. This construction generalizes an iterated simplicial wedge construction studied by A. Bahri, M. Bendersky,…

Combinatorics · Mathematics 2015-05-08 Ayzenberg Anton

We give a simple proof that some iterated derived subdivision of every PL sphere is combinatorially equivalent to the boundary of a simplicial polytope, thereby resolving a problem of Billera (personal communication).

Combinatorics · Mathematics 2014-03-21 Karim A. Adiprasito , Ivan Izmestiev

We show that the order complex of intervals of a poset, ordered by inclusion, is a Tchebyshev triangulation of the order complex of the original poset. Besides studying the properties of this transformation, we show that the dual of the…

Combinatorics · Mathematics 2020-07-21 Gábor Hetyei

We prove that, for every $\ell\geq 4$, there exists an $\ell$-vertex graph and a first order sentence having a quantifier depth at most $\ell-1$ defining the property of having an induced subgraph isomorphic to the given one. We prove that…

Combinatorics · Mathematics 2019-02-12 E. D. Kudryavtsev , M. V. Makarov , A. S. Shlychkova , M. E. Zhukovskii

A simplicial complex $\Delta$ is a virtually Cohen-Macaulay simplicial complex if its associated Stanley-Reisner ring $S$ has a virtual resolution, as defined by Berkesch, Erman, and Smith, of length ${\rm codim}(S)$. We provide a…

Commutative Algebra · Mathematics 2024-12-10 Jay Yang , Adam Van Tuyl

Let $\Delta$ be simplicial complex and let $k[\Delta]$ denote the Stanley--Reisner ring corresponding to $\Delta$. Suppose that $k[\Delta]$ has a pure free resolution. Then we describe the Betti numbers and the Hilbert--Samuel multiplicity…

Combinatorics · Mathematics 2011-02-08 Gabor Hegedüs

We describe topology of random simplicial complexes in the lower and upper models in the medial regime, i.e. under the assumption that the probability parameters $p_\sigma$ approach neither $0$ nor $1$. We show that nontrivial Betti numbers…

Algebraic Topology · Mathematics 2019-07-23 Michael Farber , Lewis Mead

The PL geometric category of a polyhedron $P$, denoted $\hbox{plgcat}(P)$, provides a natural upper bound for the Lusternik--Schnirelmann category and it is defined as the minimum number of PL collapsible subpolyhedra of $P$ that cover $P$.…

Computational Geometry · Computer Science 2023-03-31 Michael Skotnica , Martin Tancer

We investigate the combinatorial discrepancy of geometric set systems having bounded shallow cell complexity in the \emph{Beck-Fiala} setting, where each point belongs to at most $t$ ranges. For set systems with shallow cell complexity…

Computational Geometry · Computer Science 2023-01-10 Kunal Dutta , Arijit Ghosh

For every simple Hermitian Lie group $G$, we consider a certain maximal parabolic subgroup whose unipotent radical $N$ is either abelian (if $G$ is of tube type) or two-step nilpotent (if $G$ is of non-tube type). By the generalized…

Representation Theory · Mathematics 2024-01-15 Jan Frahm , Gestur Ólafsson , Bent Ørsted

The shellability status of previously investigated simplicial complexes with up to 24 facets is settled. In case of shellability the exact number of shellings is determined. Our algorithm merely relies on the facets, and not on additional…

Combinatorics · Mathematics 2018-11-29 Marcel Wild

Hypertrees and noncrossing trees are well-established objects in the combinatorics literature, but the hybrid notion of a noncrossing hypertree has received less attention. In this article I investigate the poset of noncrossing hypertrees…

Combinatorics · Mathematics 2017-07-21 Jon McCammond

We study combinatorial and algebraic properties of $t$-clique-free complexes, a family of simplicial complexes associated with finite simple graphs that generalize the classical independence complex. For a graph $G$ and an integer $t \ge…

Combinatorics · Mathematics 2026-02-11 Rakesh Ghosh , S Selvaraja

We show that the separative quotient of the poset (P(L),\subset) of isomorphic suborders of a countable scattered linear order L is \sigma-closed and atomless. So, under the CH, all these posets are forcing-equivalent (to P(\omega)/Fin).

Logic · Mathematics 2017-09-26 Milos S. Kurilic

This paper considers the problem of determining the smallest (as measured by the second Betti number) smooth negative-definite filling of a lens space. The main result is to classify those lens spaces for which the associated…

Geometric Topology · Mathematics 2024-10-18 Paolo Aceto , Duncan McCoy , JungHwan Park

We systematically classify all possible poles of superconformal blocks as a function of the scaling dimension of intermediate operators, for all superconformal algebras in dimensions three and higher. This is done by working out the…

High Energy Physics - Theory · Physics 2020-03-06 Kallol Sen , Masahito Yamazaki

In 1992 Thomas Bier presented a strikingly simple method to produce a huge number of simplicial (n-2)-spheres on 2n vertices as deleted joins of a simplicial complex on n vertices with its combinatorial Alexander dual. Here we interpret his…

Combinatorics · Mathematics 2007-05-23 Anders Björner , Andreas Paffenholz , Jonas Sjöstrand , Günter M. Ziegler

We prove that the fundamental group of any integer homology 3-sphere different from the 3-sphere admits irreducible representations of its fundamental group in SL(2,C). For hyperbolic integer homology spheres this comes with the definition,…

Geometric Topology · Mathematics 2018-07-18 Raphael Zentner

Fix a field $k$. When $\Delta$ is a simplicial complex on $n$ vertices with Stanley-Reisner ideal $I_\Delta$, we define and study an invariant called the $\textit{type defect}$ of $\Delta$. Except when $\Delta$ is of a single simplex, the…

Commutative Algebra · Mathematics 2019-01-30 Hailong Dao , Jay Schweig

Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…

Combinatorics · Mathematics 2013-06-18 T. Kyle Petersen