相关论文: Computing Matveev's complexity via crystallization…
Heegaard splittings provide a natural representation of closed 3-manifolds by gluing two handlebodies along a common surface. These splittings can be equivalently given by two finite sets of meridians lying on the surface, which define a…
We investigate the complexity of finding an embedded non-orientable surface of Euler genus $g$ in a triangulated $3$-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance…
We investigate operator growth in quantum systems with two-dimensional Schr\"odinger group symmetry by studying the Krylov complexity. While feasible for semisimple Lie algebras, cases such as the Schr\"odinger algebra which is…
We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with O(n) Kolmogorov complexity of its n-by-n squares. We construct tile sets for which this…
In this paper we are interested in computing representations of the fundamental group of a 3-manifold into PSL(3;C) (in particular in PSL(2;C); PSL(3;R) and PU(2; 1)). The representations are obtained by gluing decorated tetrahedra of…
We give a detailed explicit computation of weights of Kontsevich graphs which arise from connection and curvature terms within the globalization picture for the special case of symplectic manifolds. We will show how the weights for the…
In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how "simple" or "thin" a given graph or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs, or the concept of…
Let the complexity of a closed manifold M be the minimal number of simplices in a triangulation of M. Such a quantity is clearly submultiplicative with respect to finite coverings, and by taking the infimum on all finite coverings of M…
We describe an algorithm to subdivide automatically a given set of PL n-manifolds (via coloured triangulations or, equivalently, via crystallizations) into classes whose elements are PL-homeomorphic. The algorithm, implemented in the case…
Following Matveev, a k-normal surface in a triangulated 3-manifold is a generalization of both normal and (octagonal) almost normal surfaces. Using spines, complexity, and Turaev-Viro invariants of 3-manifolds, we prove the following…
We classify all closed non-orientable $\mathbb{P}^2$-irreducible 3-manifolds obtained by identifying the faces of a cube. These turn out to be the closed non-orientable $\mathbb{P}^2$-irreducible 3-manifolds with surface-complexity one. We…
Let $\Omega$ be a smooth real analytic submanifold of a complex manifold $X$. We establish and study the link between the following 3 subjects: 1) topological properties of smooth families of attached analytic discs, the manifold $\Omega$…
We define and study Conformal Turaev-Viro (CTV) theory, a dual formulation of Virasoro TQFT based on triangulating 3-manifolds with tetrahedra. Edges of the triangulation are labeled by continuous conformal weights, and tetrahedra are glued…
The Golodness of a simplicial complex is defined algebraically in terms of the Stanley-Reisner ring, and it has been a long-standing problem to find its combinatorial characterization. The tightness of a simplicial complex is a…
A family of closed manifolds is called cohomologically rigid if a cohomology ring isomorphism implies a diffeomorphism for any two manifolds in the family. We establish cohomological rigidity for large families of 3-dimensional and…
A special spine of a three-manifold is said to be poor if it does not contain proper simple subpolyhedra. Using the Turaev-Viro invariants, we establish that every compact three-dimensional manifold M with connected nonempty boundary has a…
Matveev and Piergallini independently showed that, with a small number of known exceptions, any triangulation of a three-manifold can be transformed into any other triangulation of the same three-manifold with the same number of vertices,…
Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the…
Quantum topological invariants have played an important role in computational topology, and they are at the heart of major modern mathematical conjectures. In this article, we study the experimental problem of computing large $r$ values of…
We show that no minimal vertex triangulation of a closed, connected, orientable 2-manifold of genus 6 admits a polyhedral embedding in R^3. We also provide examples of minimal vertex triangulations of closed, connected, orientable…