中文
相关论文

相关论文: The dunce hat in a minimal non-extendably collapsi…

200 篇论文

We construct the first explicit example of a simplicial 3-ball B_{15,66} that is not collapsible. It has only 15 vertices. We exhibit a second 3-ball B_{12,38} with 12 vertices that is collapsible and evasive, but not shellable. Finally, we…

组合数学 · 数学 2014-04-21 Bruno Benedetti , Frank H. Lutz

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…

几何拓扑 · 数学 2019-10-24 João Paixão , Jonathan Spreer

Let $M$ be an $n$-vertex combinatorial triangulation of a $\ZZ_2$-homology $d$-sphere. In this paper we prove that if $n \leq d + 8$ then $M$ must be a combinatorial sphere. Further, if $n = d + 9$ and $M$ is not a combinatorial sphere then…

几何拓扑 · 数学 2012-05-29 Bhaskar Bagchi , Basudeb Datta

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…

计算几何 · 计算机科学 2024-07-26 Pavel Paták , Martin Tancer

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.…

组合数学 · 数学 2012-02-20 Satoshi Kamei

We show that any finite triangulation of the real projective plane or the dunce hat is partitionable. To prove this, we introduce simple yet useful gluing tools that allow us to reduce partitionability of a given complex to that of smaller…

组合数学 · 数学 2022-07-19 Andrés D. Santamaría-Galvis

A \emph{generalized dunce hat} is a 2-dimensional polyhedron created by attaching the boundary of a disk $\Delta$ to a circle $J$ via a map $f:\partial \Delta \to J$ with the property that there is a point $v \in J$ such that…

几何拓扑 · 数学 2018-03-05 Fredric Ancel , Pete Sparks

We give a complete enumeration of all combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product $S^2\times S^1$ and 615…

组合数学 · 数学 2007-05-23 Frank H. Lutz

It was conjectured by Ulam that the ball has the lowest optimal packing fraction out of all convex, three-dimensional solids. Here we prove that any origin-symmetric convex solid of sufficiently small asphericity can be packed at a higher…

度量几何 · 数学 2014-08-05 Yoav Kallus

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…

几何拓扑 · 数学 2009-09-29 Alexander Barchechat

In 1967, Chillingworth proved that all convex simplicial 3-balls are collapsible. Using the classical notion of tightness, we generalize this to arbitrary manifolds: We show that all tight simplicial 3-manifolds admit some perfect discrete…

几何拓扑 · 数学 2012-04-10 Karim Adiprasito , Bruno Benedetti

In this paper we define a family of topological spaces, which contains and vastly generalizes the higher-dimensional Dunce hats. Our definition is purely combinatorial, and is phrased in terms of identifications of boundary simplices of…

代数拓扑 · 数学 2018-01-19 Dmitry N. Kozlov

It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is…

度量几何 · 数学 2019-02-08 Milica Stojanović

Let A be an idempotent algebra on a 3-element domain D that omits a G-set for a factor. Suppose A is not \alpha\beta-projective (for some alpha, beta subsets of D) and is not collapsible. It follows that A is switchable. We prove that, for…

计算机科学中的逻辑 · 计算机科学 2015-10-22 Barnaby Martin , Dmitriy Zhuk

We define and study the notion of a minimal Cohen-Macaulay simplicial complex. We prove that any Cohen-Macaulay complex is shelled over a minimal one in our sense, and we give sufficient conditions for a complex to be minimal…

组合数学 · 数学 2019-05-14 Hailong Dao , Joseph Doolittle , Justin Lyle

We present a collection of results on (weak) $m$-extremals and $m$-geodesics, concerning general properties, the planar case, quasi-balanced pseudoconvex domains, complex ellipsoids, the Euclidean ball and boundary properties. We prove…

复变函数 · 数学 2024-07-31 Tomasz Warszawski

A triangulation of a surface is \emph{irreducible} if there is no edge whose contraction produces another triangulation of the surface. We prove that every irreducible triangulation of a surface with Euler genus $g\geq1$ has at most $13g-4$…

组合数学 · 数学 2011-05-19 Gwenaël Joret , David R. Wood

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…

组合数学 · 数学 2015-03-20 Karim Alexander Adiprasito , Bruno Benedetti

We prove that for any knot $K$, there exists a one-vertex triangulation of the $3$-sphere containing an edge forming $K$. The proof is constructive, and based on fully augmented links. We use our method to produce ``complicated'' simplicial…

几何拓扑 · 数学 2024-12-02 Dionne Ibarra , Daniel V. Mathews , Jessica S. Purcell , Jonathan Spreer

Collapsibility is a combinatorial strengthening of contractibility. We relate this property to metric geometry by proving the collapsibility of any complex that is CAT(0) with a metric for which all vertex stars are convex. This strengthens…

度量几何 · 数学 2019-09-11 Karim Adiprasito , Bruno Benedetti
‹ 上一页 1 2 3 10 下一页 ›