English
Related papers

Related papers: Extendability of $1$-decomposable complexes

200 papers

M. Goresky and R. MacPherson intersection homology is also defined from the singular chain complex of a filtered space by H. King, with a key formula to make selections among singular simplexes. This formula needs a notion of dimension for…

Algebraic Topology · Mathematics 2025-02-21 David Chataur , Martintxo Saralegi-Aranguren , Daniel Tanré

We study bootstrap percolation processes on random simplicial complexes of some fixed dimension $d \geq 3$. Starting from a single simplex of dimension $d$, we build our complex dynamically in the following fashion. We introduce new…

Probability · Mathematics 2019-10-23 Nikolaos Fountoulakis , Michał Przykucki

After [J.Herzog, D.Popescu, Finite filtrations of modules and shellable multicomplexes, Preprint IMAR no 4/2005, Bucharest, 2005], the shellability of multicomplexes $\Gamma$ is given in terms of some special faces of $\Gamma$ called…

Commutative Algebra · Mathematics 2007-05-23 Dorin Popescu

We recently introduced a notion of tilings of geometric realizations of finite relative simplicial complexes and related those tilings to the discrete Morse theory of R. Forman, especially when they have the property of being shellable, a…

Algebraic Topology · Mathematics 2021-11-30 Jean-Yves Welschinger

Let $k$ be an algebraically closed field. Fix integers $n$ and $b$ with $n\geq 3$ and $1\leq b\leq n-1.$ Let $T^d_k$ be the moduli space of hypersurfaces $[F]$ in $\mathbb{P}^n_k$ of degree $l$ whose singular locus contains a subscheme of…

Algebraic Geometry · Mathematics 2014-10-15 Kaloyan Slavov

The (k,d)-hypersimplex is a (d-1)-dimensional polytope whose vertices are the (0,1)-vectors that sum to k. When k=1, we get a simplex whose graph is the complete graph with d vertices. Here we show how many of the well known graph…

Combinatorics · Mathematics 2008-11-19 Fred J. Rispoli

In [Bal18] a new method of constructing simplex designs based on cyclic group on $n$ elements has been proposed. One of the claims put forward therein is existence of 3-point simplex 3-design in dimension $d = 3$. In this manuscript we…

Combinatorics · Mathematics 2025-05-12 Jakub Czartowski

We study the generic volume rigidity of $(d-1)$-dimensional simplicial complexes in $\mathbb R^{d-1}$, and show that the volume rigidity of a complex can be identified in terms of its exterior shifting. In addition, we establish the volume…

Combinatorics · Mathematics 2023-05-10 Denys Bulavka , Eran Nevo , Yuval Peled

The multiplicity conjecture of Herzog, Huneke, and Srinivasan is verified for the face rings of the following classes of simplicial complexes: matroid complexes, complexes of dimension one and two, and Gorenstein complexes of dimension at…

Commutative Algebra · Mathematics 2007-05-23 Isabella Novik , Ed Swartz

Consider a simplicial complex that allows for an embedding into $\mathbb{R}^d$. How many faces of dimension $\frac{d}{2}$ or higher can it have? How dense can they be? This basic question goes back to Descartes' "Lost Theorem" and Euler's…

Combinatorics · Mathematics 2019-07-03 Karim Adiprasito

We show that local deformations, near closed subsets, of solutions to open partial differential relations can be extended to global deformations, provided all but the highest derivatives stay constant along the subset. The applicability of…

Differential Geometry · Mathematics 2021-09-01 Christian Baer , Bernhard Hanke

We prove a sufficient condition for a finite clique complex to collapse to a $k$-dimensional complex, and use this to exhibit thresholds for $(k+1)$-collapsibility in a sparse random clique complex. In particular, if every strongly…

Combinatorics · Mathematics 2019-03-13 Greg Malen

In 2017, Walter Taylor showed that there exist $2$-dimensional simplicial complexes which admit the structure of topological modular lattice but not topological distributive lattice. We give a positive answer to his question as to whether…

Rings and Algebras · Mathematics 2024-09-20 Charlotte Aten

We show that a very general hypersurface of degree d at least 4 and dimension at most $(d+1)2^{d-4}$ over a field of characteristic different from 2 does not admit a decomposition of the diagonal; hence, it is neither stably nor retract…

Algebraic Geometry · Mathematics 2026-01-14 Jan Lange , Stefan Schreieder

The shellability of the boundary complex of an unbounded polyhedron is investigated. To this end, it is necessary to pass to a suitable compactification, e.g., by one point. This observation can be exploited to prove that any tropical…

Combinatorics · Mathematics 2025-06-10 George Balla , Michael Joswig , Lena Weis

Let $X$ be a simplicial complex with $n$ vertices. A missing face of $X$ is a simplex $\sigma\notin X$ such that $\tau\in X$ for any $\tau\subsetneq \sigma$. For a $k$-dimensional simplex $\sigma$ in $X$, its degree in $X$ is the number of…

Combinatorics · Mathematics 2019-10-16 Alan Lew

The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most…

Combinatorics · Mathematics 2013-04-30 Francisco Santos

We examine the scaling of the linear dimension of the system size of a real polymer solution at constant excess free energy and in two different spacial dimensionalities, d=d0 and d=d1. Standard results for the functional form of the excess…

Soft Condensed Matter · Physics 2008-09-23 C. P. Lowe , M. W. Dreischor

We show that the tropicalization of an irreducible d-dimensional variety over a field of characteristic 0 is (d-l)-connected through codimension one, where l is the dimension of the lineality space of the tropicalization. From this we…

Algebraic Geometry · Mathematics 2021-09-23 Diane Maclagan , Josephine Yu

Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in ${{\mathbb R}}^d$ into constant-complexity subcells. In this paper, we settle in the affirmative a few…

Computational Geometry · Computer Science 2026-05-12 Pankaj K. Agarwal , Esther Ezra , Micha Sharir