相关论文: Computing Matveev's complexity via crystallization…

Let $G$ be a simply connected solvable Lie group with a lattice $\Gamma$ and $N$ the nilradical of $G$. For a complex valued representation $\rho: G\to GL(V_{\rho})$ such that the restriction $\rho_{|_{N}}$ is unipotent, as an advanced…

We determine which 3-manifolds admit a unitary representation such that the corresponding twisted chain complex is acyclic.

A new lower bound on the complexity of a 3-manifold is given using the Z2-Thurston norm. This bound is shown to be sharp, and the minimal triangulations realising it are characterised using normal surfaces consisting entirely of…

Refining the notion of an ideal triangulation of a compact three-manifold, we provide in this paper a combinatorial presentation of the set of pairs (M,a), where M is a three-manifold and a is a collection of properly embedded arcs. We also…

I give a formula for computing the number of regular $\Gamma$-coverings of closed orientable Seifert 3-manifolds, for a given finite group $\Gamma$. The number is computed using a 3d TQFT with finite gauge group, through a cut-and-glue…

A link between Kolmogorov Complexity and geometry is uncovered. A similar concept of projection and vector decomposition is described for Kolmogorov Complexity. By using a simple approximation to the Kolmogorov Complexity, coded in…

This paper shows that the Seifert volume of each closed non-trivial graph manifold is virtually positive. As a consequence, for each closed orientable prime 3-manifold $N$, the set of mapping degrees $\c{D}(M,N)$ is finite for any…

Fix a finite group $G$. We analyze the computational complexity of the problem of counting homomorphisms $\pi_1(X) \to G$, where $X$ is a topological space treated as computational input. We are especially interested in requiring $G$ to be…

The BKMP conjecture (2006-2008), proposed a new method to compute closed and open Gromov-Witten invariants for every toric Calabi-Yau 3-folds, through a topological recursion based on mirror symmetry. So far, this conjecture had been…

Consider a rational family of planar rational curves in a certain region of interest. We are interested in finding an approximation to the implicit representation of the envelope. Since exact implicitization methods tend to be very costly,…

We present an algorithm for the following problem. Given a triangulated 3-manifold M and a (possibly non-simple) closed curve on the boundary of M, decide whether this curve is contractible in M. Our algorithm runs in space polynomial in…

We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…

We show that in the quantum query model the complexity of detecting a triangle in an undirected graph on $n$ nodes can be done using $O(n^{1+{3\over 7}}\log^{2}n)$ quantum queries. The same complexity bound applies for outputting the…

By complexity of a finite graph we mean the number of spanning trees in the graph. The aim of the present paper is to give a new approach for counting complexity $\tau(n)$ of cyclic $n$-fold coverings of a graph. We give an explicit…

The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.

We introduce a representation of compact 3-manifolds without spherical boundary components via (regular) 4-colored graphs, which turns out to be very convenient for computer aided study and tabulation. Our construction is a direct…

We have introduced the weight of a group which has a presentation with number of relations is at most the number of generators. We have shown that the number of facets of any contracted pseudotriangulation of a connected closed 3-manifold…

Krylov complexity measures operator growth with respect to a basis, which is adapted to the Heisenberg time evolution. The construction of that basis relies on the Lanczos algorithm, also known as the recursion method. The mathematics of…

According to Mostow's celebrated rigidity theorem, the geometry of closed hyperbolic 3-manifolds is already determined by their topology. In particular, the volume of such manifolds is a topological invariant and, as such, has been…

We study a model of 3d gravity relevant to the open sector of a CFT ensemble. The quantum theory is the open Virasoro TQFT, obtained by restricting the full open-closed Virasoro TQFT to a subclass of admissible manifolds. We show that it…