相关论文: Simplification paths in the Pachner graphs of clos…
In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…
A Heegaard diagram for a 3-manifold is regarded as a pair of simplexes in the complex of curves on a surface and a Heegaard splitting as a pair of subcomplexes generated by the equivalent diagrams. We relate geometric and combinatorial…
Trivalent $2$-stratifolds are a generalization of $2$-manifolds in that there are disjoint simple closed curves where three sheets meet. We develop operations on their associated labeled graphs that will effectively construct from a single…
We study trisections of 4-manifolds obtained by spinning and twist-spinning 3-manifolds, and we show that, given a (suitable) Heegaard diagram for the 3-manifold, one can perform simple local modifications to obtain a trisection diagram for…
For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basic idea is to approximate the configuration space by the vertex-edge graph of its cell decomposition discovered by the first author. The…
A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if…
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
Let $M$ be any compact four-dimensional PL-manifold with or without boundary (e.g. the four-dimensional sphere or ball). Consider the space $T(M)$ of all simplicial isomorphism classes of triangulations of $M$ endowed with the metric…
The spine of a trisected 4-manifold is a singular 3-dimensional set from which the trisection itself can be reconstructed. 3-manifolds embedded in the trisected 4--manifold can often be isotoped to lie almost or entirely in the spine of the…
We introduce TriSearch, a reinforcement learning framework for optimizing objectives over triangulations of a polytope via bistellar flips. The key idea is a circuit-supported subtriangulation action representation: feasible flips are…
We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number $k \ge 0$ of hamiltonian cycles, which is especially efficient for small $k$. Our main findings, combining applications of this algorithm…
The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…
We study closed orientable manifolds whose topological complexity is at most 3 and determine their cohomology rings. For some of admissible cohomology rings we are also able to identify corresponding manifolds up to homeomorphism.
Real-world graphs often manifest as a massive temporal stream of edges. The need for real-time analysis of such large graph streams has led to progress on low memory, one-pass streaming graph algorithms. These algorithms were designed for…
From its creation in 1989 through subsequent extensions, the widely-used "SnapPea census" now aims to represent all cusped finite-volume hyperbolic 3-manifolds that can be obtained from <= 8 ideal tetrahedra. Its construction, however, has…
This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a…
This paper introduces even triangulations of n-dimensional pseudo-manifolds and links their combinatorics to the topology of the pseudo-manifolds. This is done via normal hypersurface theory and the study of certain symmetric…
We describe an algorithm for the enumeration of (candidates of) vertex-transitive combinatorial $d$-manifolds. With an implementation of our algorithm, we determine, up to combinatorial equivalence, all combinatorial manifolds with a…
Triangulations of the cube into a minimal number of simplices without additional vertices have been studied by several authors over the past decades. For $3\leq n\leq 7$ this so-called simplexity of the unit cube $I^n$ is now known to be…
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…