Tight triangulated manifolds are generalisations of neighborly triangulations of closed surfaces and are interesting objects in Combinatorial Topology. Tight triangulated manifolds are conjectured to be minimal. Except few, all the known tight triangulated manifolds are stacked. It is known that locally stacked tight t…
Paper presents a method to create tight triangulations of manifolds.
problem Finding tight triangulations of manifolds in higher dimensions.
method Combinatorial scheme to generate tight triangulations.
result New examples of tight triangulations in dimensions 3, 4, and 5.
The paper proves conditions for tight triangulations in 3-manifolds.
problem Characterizing tight triangulations in 3-manifolds.
method Analyzing properties of triangulations in terms of orientability, neighbourliness, and stacking.
result Triangulations of closed 3-manifolds are tight if they are orientable, neighbourly, and stacked.
3-manifold triangulations are Golod and tight, proven through a topological characterization.
problem Understanding Golodness and tightness in 3-manifold triangulations.
method Topological characterization of a polyhedral product for a tight-neighborly manifold triangulation.
result Golodness and tightness are equivalent for 3-manifold triangulations.
Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into euclidean space is "as convex as possible". It can thus be understood as a generalization of the concept of convexity. In even dimensions, super-neighborliness is known to be …
It is well known that a triangulation of a closed 2-manifold is tight with respect to a field of characteristic two if and only if it is neighbourly; and it is tight with respect to a field of odd characteristic if and only if it is neighbourly and orientable. No such characterization of tightness was previously known …
We give an explicit construction of vertex-transitive tight triangulations of d-manifolds for d≥2. More explicitly, for each d≥2, we construct two (d2+5d+5)-vertex neighborly triangulated d-manifolds whose vertex-links are stacked spheres. The only other non-trivial series of such tight triangulated …
Every noncompact surface has a 3-rigid triangulation.
problem Classifying noncompact surfaces and proving their rigidity.
method Triangulation and minimally rigid structures.
result Every noncompact surface has a (3,6)-tight triangulation that is minimally 3-rigid.
Research shows finiteness in triangulations with girth constraints.
problem Finiteness of cellular partial triangulations with girth constraints.
method Characterization of sparse graphs and contraction-minimal graphs.
result There are finitely many (3,6)-tight and (3,3)-tight graphs.
A triangulated d-manifold K, satisfies the inequality (2f0(K)−d−1)≥(2d+2)β1(K;Z2) for d≥3. The triangulated d-manifolds that meet the bound with equality are called {\em tight neighborly}. In this paper, we present tight neighborly triangulations of 4-manifolds on 15 vertic…
We introduce the k-stellated spheres and consider the class Wk(d) of triangulated d-manifolds all whose vertex links are k-stellated, and its subclass Wk∗(d) consisting of the (k+1)-neighbourly members of Wk(d). We introduce the mu-vector of any simplicial complex and show th…
Walkup's class K(d) consists of the d-dimensional simplicial complexes all whose vertex links are stacked (d−1)-spheres. According to a result of Walkup, the face vector of any triangulated 4-manifold X with Euler characteristic χ satisfies f1≥5f0−15/2χ, with equality only for $X \in {\cal …
We find vertex bounds for triangulated manifolds and apply them to 4-manifold complexity.
problem Finding vertex bounds for triangulated manifolds in arbitrary dimensions.
method Analyzing face numbers and proving bounds for triangulations of manifolds.
result We prove tight bounds for odd-dimensional manifolds and conjecture for even dimensions, with applications to 4-manifold complexity.
We present a necessary condition for (ℓ−1)-connected combinatorial (2ℓ+1)-manifolds to be tight. As a corollary, we show that there is no tight combinatorial three-manifold with Betti number at most two other than the boundary of the four-simplex and the nine-vertex triangulation of the three-dimensional Kle…
Minimal Delaunay triangulations on hyperbolic surfaces have linear number of vertices.
problem Finding the minimum number of vertices in Delaunay triangulations of hyperbolic surfaces.
method Analyzing the genus g of hyperbolic surfaces to derive bounds on the number of vertices. result The number of vertices in minimal Delaunay triangulations of hyperbolic surfaces is linear in the genus g. We prove two results on stacked triangulated manifolds in this paper: (a) every stacked triangulation of a connected manifold with or without boundary is obtained from a simplex or the boundary of a simplex by certain combinatorial operations; (b) in dimension d≥4, if Δ is a tight connected closed homology d…
For d≥2, Walkup's class K(d) consists of the d-dimensional simplicial complexes all whose vertex-links are stacked (d−1)-spheres. Kalai showed that for d≥4, all connected members of K(d) are obtained from stacked d-spheres by finitely many elementary handle additions. According to …
In 1987, Kalai proved that stacked spheres of dimension d≥3 are characterised by the fact that they attain equality in Barnette's celebrated Lower Bound Theorem. This result does not extend to dimension d=2. In this article, we give a characterisation of stacked 2-spheres using what we call the {\em separatio…
For d≥2, Walkup's class $\Kd$ consists of the d-dimensional simplicial complexes whose vertex-links are stacked (d−1)-spheres. Recently Lutz, Sulanke and Swartz have shown that all F-orientable triangulated d-manifolds satisfy the inequality (2f0−d−1)≥(2d+2)β1 for $d\geq …
We introduce the k-stellated spheres and compare and contrast them with k-stacked spheres. It is shown that for d≥2k, any k-stellated sphere of dimension d bounds a unique and canonically defined k-stacked ball. In parallel, any k-stacked polytopal sphere of dimension d≥2k bounds a unique and c…
The paper explores triangulations of spheres and projective spaces, focusing on Hopf triangulations and equilibrium structures.
problem Investigating simplicial versions of sphere decompositions and their applications to projective spaces.
method Developing Hopf triangulations and equilibrium triangulations of spheres and projective spaces, focusing on the central torus and its properties.
result No perfect equilibrium triangulation of CP3 exists, while CP2 has a unique perfect equilibrium triangulation. The paper studies families of curves on surfaces that realize all types of pants decompositions.
problem Finding the minimal size of families of curves on surfaces that realize all types of pants decompositions.
method Investigates exponential and superlinear bounds for surfaces without punctures, and provides bounds for surfaces with punctures.
result Provides bounds for the minimal size of families of curves on surfaces with and without punctures.
Connected flip graphs for triangulations on hyperbolic surfaces.
problem Connecting triangulations on hyperbolic surfaces via flips.
method Proving connectedness of flip graphs and giving bounds on edge flips.
result Flip graphs of geometric triangulations are connected.
New isolated geometric triangulations found in once-punctured torus bundles.
problem Identifying isolated geometric triangulations in 3-manifolds.
method Examining ideal triangulations and their moves to find isolated geometric ones.
result Infinite family of once-punctured torus bundles with isolated geometric triangulations.
Efficient triangulations help in understanding 3-manifold boundaries.
problem Understanding boundary slopes in 3-manifolds.
method Introducing and studying boundary-efficient triangulations and inflating ideal triangulations.
result There are only finitely many boundary slopes for incompressible and \(\partial\)-incompressible surfaces in compact 3-manifolds.
A 6-regular triangulation for hyperbolic plane created.
problem Creating a 6-regular triangulation for hyperbolic plane.
method Constructed a 6-regular geodesic triangulation.
result A 6-regular geodesic triangulation of the hyperbolic plane was successfully created.
The study proves poor ideal three-edge triangulations are minimal for certain 3-manifolds.
problem Finding minimal ideal triangulations for specific 3-manifolds.
method Analyzing properties of poor ideal three-edge triangulations and applying them to construct minimal triangulations.
result Poor ideal three-edge triangulations are proven to be minimal for certain 3-manifolds.
A family of one-vertex triangulations of 3-manifolds, layered-triangulations, is defined. Layered-triangulations are first described for handlebodies and then extended to all 3-manifolds via Heegaard splittings. A complete and detailed analysis of layered-triangulations is given in the cases of the solid torus and lens…
Geometric triangulations can be transformed by bistellar moves.
problem Transforming geometric triangulations of different manifolds.
method Using bistellar moves, a type of local change to triangulations.
result Geometric triangulations of compact manifolds can be connected by bistellar moves.
Triangulations without degree one edges are connected via moves.
problem Connectivity of triangulations without degree one edges.
method 2-3 and 3-2 moves.
result Subgraph of Pachner graph without degree one edges is connected.
A triangulation of a connected closed surface is called weakly regular if the action of its automorphism group on its vertices is transitive. A triangulation of a connected closed surface is called degree-regular if each of its vertices have the same degree. Clearly, a weakly regular triangulation is degree-regular. In…
Minimal triangulations for 229 hyperbolic census knots discovered.
problem Finding minimal triangulations for hyperbolic census knots.
method Ideal triangulations of the magic manifold, low-complexity triangulations for partial fillings, sorting into families.
result Minimal triangulations for 229 hyperbolic census knots discovered, conjectured to be minimal for all 42 families.
Agol recently introduced the concept of a veering taut triangulation, which is a taut triangulation with some extra combinatorial structure. We define the weaker notion of a "veering triangulation" and use it to show that all veering triangulations admit strict angle structures. We also answer a question of Agol, givin…
Smooth structures enable solving PDEs via optimized triangulations.
problem Solving partial differential equations (PDEs) on complex spaces.
method Introducing Frölicher space structure on CW complexes and spaces of triangulations to enable differential methods.
result Optimized triangulations can be used to solve standard PDEs.
Authors find small triangulations for specific 4-manifolds.
problem Finding optimal triangulations for 4-manifolds.
method Triangulated connected sums of CP^2 and S^2×S^2, conjectured minimal pentachora.
result Triangulations have the smallest number of pentachora for their types.
Combinatorial description of 3-manifolds using ordered triangulations.
problem Understanding closed 3-manifolds through ideal triangulations.
method Combining ordered ideal triangulations and Pachner moves.
result Closed 3-manifolds can be described via ordered triangulations and moves.
Minimal ideal triangulations studied for hyperbolic 3-manifolds.
problem Finding minimal triangulations of hyperbolic 3-manifolds.
method Characterization of low degree edges, layered solid torus subcomplexes, and 1-dimensional cohomology.
result Monodromy ideal triangulations of once-punctured torus bundles are minimal.
The paper constructs triangulations for double twist knots using geometric methods.
problem Constructing explicit triangulations of double twist knots.
method Using triangulating Dehn fillings, layered solid tori, and their double covers.
result Proves both triangulations are geometric, using conjecturally minimal triangulation to present A-polynomial equations.
New bounds show triangulated surfaces are evenly distributed in moduli space.
problem Distribution of triangulated surfaces in moduli space as genus increases.
method Proved upper and lower bounds for the number of triangulated surfaces in Teichmüller balls.
result Number of triangulated surfaces in a Teichmüller unit ball is at most exponential in the number of triangles, independent of genus.
Experimental results on veering triangulations of 3-manifolds.
problem Understanding the combinatorial structure of veering triangulations.
method Algorithmic construction and experimental analysis.
result Experimental insights into the structure of veering triangulations and their relation to topological invariants.
We investigate a type of distance between triangulations on finite type surfaces where one moves between triangulations by performing simultaneous flips. We consider triangulations up to homeomorphism and our main results are upper bounds on distance between triangulations that only depend on the topology of the surfac…
Researchers found the minimum number of tetrahedra needed to triangulate elliptic and sol 3-manifolds.
problem Finding the minimum number of tetrahedra in triangulations of 3-manifolds.
method Computed the triangulation complexity of all elliptic and sol 3-manifolds, within a bounded error.
result Computed the triangulation complexity of all elliptic and sol 3-manifolds.
With the [0,1,2]-family of cyclic triangulations we introduce a rich class of vertex-transitive triangulations of surfaces. In particular, there are infinite series of cyclic q-equivelar triangulations of orientable and non-orientable surfaces for every q=3k, k≥2, and every q=3k+1, k≥3. Series of cy…
New loom spaces link flows and triangulations.
problem Understanding flows and triangulations in 3D.
method Introducing loom spaces and proving associated triangulations.
result Locally veering triangulations can be associated to loom spaces.
New method connects veering triangulations to dynamic pairs.
problem Understanding veering triangulations and their properties.
method Shearing decomposition of veering triangulations.
result Canonically associated dynamic pairs of branched surfaces.
New triangulations encode flows with vanishing polynomial.
problem Constructing veering triangulations with vanishing taut polynomial.
method Using connections between veering triangulations and pseudo-Anosov flows.
result Created arbitrarily large veering triangulations with vanishing taut polynomial.
Proofs contractibility of geodesic triangulations spaces and non-trivial homotopy groups.
problem Contractibility and homotopy groups of geodesic triangulations.
method Short proofs and existence proofs for specific cases.
result Existence of polygon triangulations with non-trivial nth homotopy groups.
This paper derives formulas for Chern classes of triangulated circle bundles using combinatorial necklaces.
problem Calculating Chern classes for triangulated circle bundles over polyhedra.
method Using triangulations and necklace combinatorics, the paper derives rational parity formulas for Chern classes.
result Rational parity formulas for Chern classes of triangulated circle bundles are derived.