English
Related papers

Related papers: On locally constructible spheres and balls

200 papers

Durhuus and Jonsson (1995) introduced the class of "locally constructible" (LC) triangulated manifolds and showed that all the LC 2- and 3-manifolds are spheres. We show here that for each d>3 some LC d-manifolds are not spheres. We prove…

Geometric Topology · Mathematics 2011-07-12 Bruno Benedetti

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

We construct non-constructible simplicial $d$-spheres with $d+10$ vertices and non-constructible, non-realizable simplicial $d$-balls with $d+9$ vertices for $d\geq 3$.

Combinatorics · Mathematics 2007-05-23 Frank H. Lutz

We construct 2^{\Omega(n^{5/4})} combinatorial types of triangulated 3-spheres on n vertices. Since by a result of Goodman and Pollack (1986) there are no more than 2^{O(n log n)} combinatorial types of simplicial 4-polytopes, this proves…

Metric Geometry · Mathematics 2007-05-23 Julian Pfeifle , Günter M. Ziegler

We introduce a version of discrete Morse theory specific for manifolds with boundary. The idea is to consider Morse functions for which all boundary cells are critical. We obtain "Relative Morse Inequalities" relating the homology of the…

Algebraic Topology · Mathematics 2010-10-05 Bruno Benedetti

In 1995, Josckusch constructed an infinite family of centrally symmetric (cs, for short) triangulations of $3$-spheres that are cs-$2$-neighborly. Recently, Novik and Zheng extended Jockusch's construction: for all $d$ and $n>d$, they…

Combinatorics · Mathematics 2022-01-11 Isabella Novik , Hailun Zheng

In 1971, McMullen and Walkup posed the following conjecture, which is called the generalized lower bound conjecture: If $P$ is a simplicial $d$-polytope then its $h$-vector $(h_0,h_1,...,h_d)$ satisfies $h_0 \leq h_1 \leq ... \leq…

Combinatorics · Mathematics 2012-04-06 Satoshi Murai , Eran Nevo

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

Nevo, Santos, and Wilson constructed $2^{\Omega(N^d)}$ combinatorially distinct simplicial $(2d-1)$-spheres with $N$ vertices. We prove that all spheres produced by one of their methods are shellable. Combining this with prior results of…

Combinatorics · Mathematics 2024-05-21 Yirong Yang

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

It is proven that the partition function of 3-dimensional simplicial gravity has an exponential upper bound with the following assumption: any three dimensional sphere $S^3$ is constructed by repeated identification of neighboring links and…

High Energy Physics - Lattice · Physics 2017-02-01 MOGAMI , Tsuguo

We prove that the second derived subdivision of any rectilinear triangulation of any convex polytope is shellable. Also, we prove that the first derived subdivision of every rectilinear triangulation of any convex 3-dimensional polytope is…

Combinatorics · Mathematics 2015-03-20 Karim Alexander Adiprasito , Bruno Benedetti

We give a simple combinatoric proof of an exponential upper bound on the number of distinct 3-manifolds that can be constructed by successively identifying nearest neighbour pairs of triangles in the boundary of a simplicial 3-ball and show…

High Energy Physics - Theory · Physics 2009-10-28 Bergfinnur Durhuus , Thordur Jonsson

We introduce "$t$-LC triangulated manifolds" as those triangulations obtainable from a tree of $d$-simplices by recursively identifying two boundary $(d-1)$-faces whose intersection has dimension at least $d-t-1$. The $t$-LC notion…

Combinatorics · Mathematics 2022-03-25 Bruno Benedetti , Marta Pavelka

In this paper, we consider constructibility of simplicial 3-balls. In many cases, examining 1-dimensional subcomplexes of a simplicial 3-ball is efficient to solve the decision problem whether the simplicial 3-ball is constructible or not.…

Combinatorics · Mathematics 2012-02-20 Satoshi Kamei

Given a set $\Sigma$ of spheres in $\mathbb{E}^d$, with $d\ge{}3$ and $d$ odd, having a fixed number of $m$ distinct radii $\rho_1,\rho_2,...,\rho_m$, we show that the worst-case combinatorial complexity of the convex hull $CH_d(\Sigma)$ of…

Computational Geometry · Computer Science 2011-06-14 Menelaos I. Karavelas , Eleni Tzanaki

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

The aim of this paper is to verify that the study of generic conformally flat hypersurfaces in 4-dimensional space forms is reduced to a surface theory in the standard 3-sphere. The conformal structure of generic conformally flat…

Differential Geometry · Mathematics 2020-08-27 Yoshihiko Suyama

We show that every countable Borel equivalence relation structurable by $n$-dimensional contractible simplicial complexes embeds into one which is structurable by such complexes with the further property that each vertex belongs to at most…

Logic · Mathematics 2017-09-22 Ruiyuan Chen

Several recent papers have addressed the problem of characterizing the $f$-vectors of cubical polytopes. This is largely motivated by the complete characterization of the $f$-vectors of simplicial polytopes given by Stanley, Billera, and…

Combinatorics · Mathematics 2007-05-23 E. Babson , C. Chan
‹ Prev 1 2 3 10 Next ›