English
Related papers

Related papers: Small examples of non-constructible simplicial bal…

200 papers

The number of nonisomorphic simplicial complexes with up to $n$ vertices increases super-exponentially with $n$, which makes exhaustive computation of invariants associated with such complexes a daunting task. In this paper we provide a…

Algebraic Topology · Mathematics 2025-11-05 Dejan Govc , Wacław Marzantowicz , Łukasz Patryk Michalak , Petar Pavešić

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

We disprove a long-standing open conjecture due to Simon stating that all skeleta of simplices are extendably shellable. In particular, for every $d \geq 3$ we provide a pure $d$-dimensional shellable simplicial complex which is not…

Combinatorics · Mathematics 2026-05-26 Davide Bolognini , Paolo Sentinelli

We introduce the class $\Sigma_k(d)$ of $k$-stellated (combinatorial) spheres of dimension $d$ ($0 \leq k \leq d + 1$) and compare and contrast it with the class ${\cal S}_k(d)$ ($0 \leq k \leq d$) of $k$-stacked homology $d$-spheres. We…

Geometric Topology · Mathematics 2013-05-17 Bhaskar Bagchi , Basudeb Datta

We introduce topological prismatoids, a combinatorial abstraction of the (geometric) prismatoids recently introduced by the second author to construct counter-examples to the Hirsch conjecture. We show that the `strong $d$-step Theorem'…

Combinatorics · Mathematics 2022-08-05 Francisco Criado , Francisco Santos

In 1995, Jockusch constructed an infinite family of centrally symmetric $3$-dimensional simplicial spheres that are cs-$2$-neighborly. Here we generalize his construction and show that for all $d\geq 3$ and $n\geq d+1$, there exists a…

Combinatorics · Mathematics 2020-04-24 Isabella Novik , Hailun Zheng

It is known that the $(2k-1)$-sphere has at most $2^{O(n^k \log n)}$ combinatorially distinct triangulations with $n$ vertices, for every $k\ge 2$. Here we construct at least $2^{\Omega(n^k)}$ such triangulations, improving on the previous…

Combinatorics · Mathematics 2016-03-10 Eran Nevo , Francisco Santos , Stedman Wilson

For each $d\geq 3$ we construct cube complexes homeomorphic to the $d$-sphere with $n$ vertices in which the number of facets (assuming $d$ constant) is $\Omega(n^{5/4})$. This disproves a conjecture of Kalai's stating that the number of…

Combinatorics · Mathematics 2025-03-25 Sergey Avvakumov , Alfredo Hubard

We construct embeddings of simplicial complexes into a (surface of a) simplicial ball whose triangulation has bounded degrees and low volume. This construction can be used either to efficiently "simplify a complicated space" by realizing it…

Geometric Topology · Mathematics 2022-11-29 Aleksandr Berdnikov

For $d\geq 4$, Kalai (1987) characterized all simplicial $(d-1)$-spheres with $g_2=0$, and for $k\geq 2$ and $d\geq 2k$, Murai and Nevo (2013) characterized all simplicial $(d-1)$-spheres with $g_k=0$. In addition, for $d\geq 4$, Nevo and…

Combinatorics · Mathematics 2026-01-16 Isabella Novik , Hailun Zheng

We establish several new lower bounds on the $g$-numbers of simplicial spheres without large missing faces. For this class of spheres, we derive bounds on the $g$-numbers in terms of the independence numbers of their graphs, extending a…

Combinatorics · Mathematics 2026-04-21 Isabella Novik , Hailun Zheng

We give an explicit construction of vertex-transitive tight triangulations of $d$-manifolds for $d\geq 2$. More explicitly, for each $d\geq 2$, we construct two $(d^2+5d+5)$-vertex neighborly triangulated $d$-manifolds whose vertex-links…

Geometric Topology · Mathematics 2013-06-17 Basudeb Datta , Nitin Singh

The degree of a map between orientable manifolds is a fundamental concept in topology, providing deep insights into the structure of manifolds and the behavior of maps between them. Recently, this notion has been extensively studied,…

Geometric Topology · Mathematics 2026-03-24 Biplab Basak , Raju Kumar Gupta , Ayushi Trivedi

It is known that the suspension of a simplicial complex can be realized with only one additional point. Suitable iterations of this construction generate highly symmetric simplicial complexes with various interesting combinatorial and…

Combinatorics · Mathematics 2007-05-23 Michael Joswig , Frank H. Lutz

For a $(d-1)$-dimensional simplicial complex $\Delta$ and $1\leq i\leq d$, let $f_{i-1}$ be the number of $(i-1)$-faces of $\Delta$ and $m_i$ be the number of missing $i$-faces of $\Delta$. In the nineties, Kalai asked for a…

Combinatorics · Mathematics 2025-09-24 Isabella Novik , Hailun Zheng

For positive integers $n,d$, let $\lambda(n,d)$ be the minimal number of vertices of a triangulation of $n$-sphere which admits a degree $d$ simplicial map to the boundary of $(n+1)$-simplex. We show that…

Combinatorics · Mathematics 2025-12-02 Andrey Ryabichev

We provide a simple characterization of simplicial complexes on few vertices that embed into the $d$-sphere. Namely, a simplicial complex on $d+3$ vertices embeds into the $d$-sphere if and only if its non-faces do not form an intersecting…

Combinatorics · Mathematics 2023-11-10 Florian Frick , Mirabel Hu , Verity Scheel , Steven Simon

The $g$-vector of a simplicial complex contains a lot of information about the combinatorial and topological structure of that complex. Several classification results regarding the structure of normal pseudomanifolds and homology manifolds…

Combinatorics · Mathematics 2025-10-20 Biplab Basak , Sourav Sarkar

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

For fixed $d\geq 3$, we construct subsets of the $d$-dimensional lattice cube $[n]^d$ of size $n^{\frac{3}{d + 1} - o(1)}$ with no $d+2$ points on a sphere or a hyperplane. This improves the previously best known bound of…

Combinatorics · Mathematics 2024-12-05 Andrew Suk , Ethan Patrick White