English
Related papers

Related papers: Shellability is hard even for balls

200 papers

In this thesis, we use normal surface theory to understand certain properties of minimal triangulations of compact orientable 3-manifolds. We describe the collapsing process of normal 2-spheres and disks. Using some geometrical…

Geometric Topology · Mathematics 2009-09-29 Alexander Barchechat

We show that the problem of determining whether a knot in the 3-sphere is non-trivial lies in NP. This is a consequence of the following more general result. The problem of determining whether the Thurston norm of a second homology class in…

Geometric Topology · Mathematics 2021-04-13 Marc Lackenby

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

Durhuus and Jonsson (1995) introduced the class of "locally constructible" (LC) 3-spheres and showed that there are only exponentially-many combinatorial types of simplicial LC 3-spheres. Such upper bounds are crucial for the convergence of…

Combinatorics · Mathematics 2011-08-19 Bruno Benedetti , Günter M. Ziegler

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

A triangulation of a $3$-manifold can be shown to be homeomorphic to the $3$-sphere by describing a discrete Morse function on it with only two critical faces, that is, a sequence of elementary collapses from the triangulation with one…

Geometric Topology · Mathematics 2019-10-24 João Paixão , Jonathan Spreer

We prove the computational intractability of rotating and placing $n$ square tiles into a $1 \times n$ array such that adjacent tiles are compatible--either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as…

Computational Complexity · Computer Science 2017-01-03 Jeffrey Bosboom , Erik D. Demaine , Martin L. Demaine , Adam Hesterberg , Pasin Manurangsi , Anak Yodpinyanee

The triangulation complexity of a closed orientable 3-manifold is the minimal number of tetrahedra in any triangulation of the manifold. The main theorem of the paper gives upper and lower bounds on the triangulation complexity of any…

Geometric Topology · Mathematics 2024-07-24 Marc Lackenby , Jessica S. Purcell

In this article, we prove that the commensurability class of a closed, orientable, hyperbolic 3-manifold is determined by the surface subgroups of its fundamental group. Moreover, we prove that there can be only finitely many closed,…

Geometric Topology · Mathematics 2018-05-16 D. B. McReynolds , A. W. Reid

Following D.B. Karaguezian, V. Reiner, and M.L. Wachs (Matching Complexes, Bounded Degree Graph Complexes, and Weight Spaces of $GL$-Complexes, Journal of Algebra 2001) we study the connectivity degree and shellability of multiple…

Combinatorics · Mathematics 2015-10-20 Duško Jojić , Siniša T. Vrećica , Rade T. Živaljević

We consider a $q$-analogue of abstract simplicial complexes, called $q$-complexes, and discuss the notion of shellability for such complexes. It is shown that $q$-complexes formed by independent subspaces of a $q$-matroid are shellable.…

Combinatorics · Mathematics 2021-05-20 Sudhir R. Ghorpade , Rakhi Pratihar , Tovohery H. Randrianarisoa

We show that {\sc Heegaard Genus $\leq g$}, the problem of deciding whether a triangulated 3-manifold admits a Heegaard splitting of genus less than or equal to $g$, is NP-hard. The result follows from a quadratic time reduction of the…

Geometric Topology · Mathematics 2016-11-30 David Bachman , Ryan Derby-Talbot , Eric Sedgwick

We complete the explicit study of a three-fold divisorial contraction whose exceptional divisor contracts to a point, by treating the case where the point downstairs is a singularity of index $n \ge 2$. We prove that if this singularity is…

Algebraic Geometry · Mathematics 2007-05-23 Masayuki Kawakita

The notions Golodness and tightness for simplicial complexes come from algebra and geometry, respectively. We prove these two notions are equivalent for 3-manifold triangulations, through a topological characterization of a polyhedral…

Combinatorics · Mathematics 2023-08-02 Kouyemon Iriye , Daisuke Kishimoto

We prove that given two compact oriented $3$-manifolds $N$ and $M,$ with $M$ satisfying only a mild hypothesis, there is a hyperbolic $3$-manifold $N'$ arbitrarily ``closely related'' to $N,$ and such that $N'$ does not embed in $M.$ For…

Geometric Topology · Mathematics 2026-04-27 Giulio Belletti , Renaud Detcherry

We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment problem where the elements are points in a Cartesian space and where the cost coefficients are the perimeters of the corresponding triangles…

Optimization and Control · Mathematics 2014-09-03 Ante Ćustić , Bettina Klinz , Gerhard J. Woeginger

We compute for all orientable irreducible geometric 3-manifolds certain complexity functions that approximate from above Matveev's natural complexity, known to be equal to the minimal number of tetrahedra in a triangulation. We can show…

Geometric Topology · Mathematics 2011-09-06 Bruno Martelli , Carlo Petronio

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 define an invariant, which we call surface-complexity, of closed 3-manifolds by means of Dehn surfaces. The surface-complexity of a manifold is a natural number measuring how much the manifold is complicated. We prove that it fulfils…

Geometric Topology · Mathematics 2019-01-30 Gennaro Amendola

Building on the results published in arxiv:2004.12849 we present a general framework for demonstrating the NP-hardness of satisfying many genres of loop and path puzzles using a 'T-metacell' gadget. We then use this to prove the…

Computational Complexity · Computer Science 2022-02-07 Hadyn Tang