English
Related papers

Related papers: Extendability of $1$-decomposable complexes

200 papers

Imposing a strong condition on the linear order of shellable complexes, we introduce strong shellability. Basic properties, including the existence of dimension-decreasing strong shelling orders, are developed with respect to nonpure…

Combinatorics · Mathematics 2016-04-20 Jin Guo , Yi-Huang Shen , Tongsuo Wu

For a metric space $(X, d)$ and a scale parameter $r \geq 0$, the Vietoris-Rips complex $\mathcal{VR}(X;r)$ is a simplicial complex on vertex set $X$, where a finite set $\sigma \subseteq X$ is a simplex if and only if diameter of $\sigma$…

Combinatorics · Mathematics 2023-05-16 Samir Shukla

For a simplicial complex $X$, the $d$-clique complex $\Delta_d(X)$ is the simplicial complex having all subsets of vertices whose $(d + 1)$-subsets are contained by $X$ as its faces. We prove that if $p = n^{\alpha}$, with $\alpha <…

Combinatorics · Mathematics 2018-06-07 Demet Taylan

The main goal of this paper is to show that shellability is NP-hard for triangulated d-balls (this also gives hardness for triangulated d-manifolds/d-pseudomanifolds with boundary) as soon as d is at least 3. This extends our earlier work…

Computational Geometry · Computer Science 2024-07-26 Pavel Paták , Martin Tancer

If a pure simplicial complex is partitionable, then its $h$-vector has a combinatorial interpretation in terms of any partitioning of the complex. Given a non-partitionable complex $\Delta$, we construct a complex $\Gamma \supseteq \Delta$…

Combinatorics · Mathematics 2021-11-01 Joseph Doolittle , Bennet Goeckner , Alexander Lazar

Multidimensional persistence has been proposed to study the persistence of topological features in data indexed by multiple parameters. In this work, we further explore its algebraic complications from the point of view of higher…

Representation Theory · Mathematics 2020-12-07 Mickaël Buchet , Emerson G. Escolar

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

We study finite foldable cubical complexes of nonpositive curvature (in the sense of A.D. Alexandrov). We show that such a complex X admits a graph of spaces decomposition. It is also shown that when dim X=3, X contains a closed rank one…

Metric Geometry · Mathematics 2014-10-01 Xiangdong Xie

Let $\Phi$ be a finite root system of rank $n$ and let $m$ be a nonnegative integer. The generalized cluster complex $\Delta^m (\Phi)$ was introduced by S. Fomin and N. Reading. It was conjectured by these authors that $\Delta^m (\Phi)$ is…

Combinatorics · Mathematics 2007-05-23 Christos A. Athanasiadis , Eleni Tzanaki

Shellings of simplicial complexes have long been a useful tool in topological and algebraic combinatorics. Shellings of a complex expose a large amount of information in a helpful way, but are not easy to construct, often requiring deep…

Combinatorics · Mathematics 2021-08-24 Andrés Santamaría-Galvis , Russ Woodroofe

In this work we study the decomposability property of branched coverings of degree $d$ odd, over the projective plane, where the covering surface has Euler characteristic $\leq 0$. The latter condition is equivalent to say that the defect…

Geometric Topology · Mathematics 2021-12-06 Natalia A. Viana Bedoya , Daciberg Lima Gonçalves , Elena Kudryavtseva

Let $W$ be a Weyl group corresponding to the root system $A_{n-1}$ or $B_n$. We define a simplicial complex $ \Delta^m_W $ in terms of polygon dissections for such a group and any positive integer $m$. For $ m=1 $, $ \Delta^m_W$ is…

Combinatorics · Mathematics 2007-05-23 Eleni Tzanaki

Let Delta_{n-1} denote the (n-1)-dimensional simplex. Let Y be a random k-dimensional subcomplex of Delta_{n-1} obtained by starting with the full (k-1)-dimensional skeleton of Delta_{n-1} and then adding each k-simplex independently with…

Combinatorics · Mathematics 2007-05-23 R. Meshulam , N. Wallach

Let $G$ be a finite abelian group of order $n$ and let $\Delta_{n-1}$ denote the $(n-1)$-simplex on the vertex set $G$. The sum complex $X_{A,k}$ associated to a subset $A \subset G$ and $k < n$, is the $k$-dimensional simplicial complex…

Combinatorics · Mathematics 2018-01-22 Orr Beit-Aharon , Roy Meshulam

We investigate the question of whether any $d$-colorable simplicial $d$-polytope can be octahedralized, i.e., it can be subdivided to a $d$-dimensional geometric cross-polytopal complex. We give a positive answer in dimension $3$, with the…

Combinatorics · Mathematics 2019-12-19 Giulia Codenotti , Lorenzo Venturello

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

We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a…

Combinatorics · Mathematics 2016-07-05 Krzysztof Przesławski , David Yost

For every fixed dimension $d$ and sufficiently large $n$, we determine the maximum possible diameter of a strongly connected $d$-dimensional simplicial complex on $n$ vertices. This improves on a sequence of previous results and settles a…

Combinatorics · Mathematics 2026-02-25 Stefan Glock , Olaf Parczyk , Silas Rathke , Tibor Szabó

Given an infinite field $\mathbb{k}$ and a simplicial complex $\Delta$, a common theme in studying the $f$- and $h$-vectors of $\Delta$ has been the consideration of the Hilbert series of the Stanley--Reisner ring $\mathbb{k}[\Delta]$…

Combinatorics · Mathematics 2019-07-31 Connor Sawaske

The problem of decomposing non-manifold object has already been studied in solid modeling. However, the few proposed solutions are limited to the problem of decomposing solids described through their boundaries. In this thesis we study the…

Graphics · Computer Science 2019-04-03 Franco Morando