相关论文: Expoential bounds on the number of causal triangul…

In terms of the number of triangles, it is known that there are more than exponentially many triangulations of surfaces, but only exponentially many triangulations of surfaces with bounded genus. In this paper we provide a first geometric…

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…

We study the crossing number of links that are formed by edges of a triangulation T of the 3-sphere with n tetrahedra. We show that the crossing number is bounded from above by an exponential function of n^2. In general, this bound can not…

We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial identity due to W.T. Tutte.

It is proven that the partition function of 3-dimensional simplicial gravity has an exponential upper bound with the following assumption: any three dimensional sphere $S^3$ is constructed by repeated identification of neighboring links and…

In this paper we prove that any triangulation of a 2-dimensional sphere with a strict 4-coloring on its vertices can seen as the boundary of a triangulation of a 3-dimensional disk with the same vertices and preserving the 4-coloring.

Colored triangulations offer a generalization of combinatorial maps to higher dimensions. Just like maps are gluings of polygons, colored triangulations are built as gluings of special, higher-dimensional building blocks, such as octahedra,…

In combinatorial topology we aim to triangulate manifolds such that their topological properties are reflected in the combinatorial structure of their description. Here, we give a combinatorial criterion on when exactly triangulations of…

We establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is…

We ask whether the only multiplicities in the spectrum of the clamped round plate are trivial, i.e., whether all existing multiplicities are due to the isometries of the sphere, or, equivalently, whether any eigenfunction is separated. We…

We use polynomial method techniques to bound the number of tangent pairs in a collection of $N$ spheres in $\mathbb{R}^n$ subject to a non-degeneracy condition, for any $n \geq 3$. The condition, inspired by work of Zahl for $n=3$, asserts…

We prove that the cardinality of the torsion subgroups in homology of a closed hyperbolic manifold of any dimension can be bounded by a doubly exponential function of its diameter. It would follow from a conjecture by Bergeron and Venkatesh…

We study how the degrees of irrationality of moduli spaces of polarized K3 surfaces grow with respect to the genus $g$. We prove that the growth is bounded by a polynomial function of degree $14+\varepsilon$ for any $\varepsilon>0$ and, for…

The triangulation complexity of a closed orientable 3-manifold is the minimal number of tetrahedra in any triangulation of the manifold. The main theorem of the paper gives upper and lower bounds on the triangulation complexity of any…

We prove, for a sufficiently small subset $\mathcal{A}$ of a prime residue field, an estimate on the number of solutions to the equation $(a_1-a_2)(a_3-a_4) = (a_5-a_6)(a_7-a_8)$ with all variables in $\mathcal{A}$. We then derive new…

We construct 2^{\Omega(n^{5/4})} combinatorial types of triangulated 3-spheres on n vertices. Since by a result of Goodman and Pollack (1986) there are no more than 2^{O(n log n)} combinatorial types of simplicial 4-polytopes, this proves…

We show that the following algorithmic problem is decidable: given a $2$-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in $\mathbf{R}^3$? By a known reduction, it suffices to decide…

It is known that any two triangulations of a compact 3-manifold are related by finite sequences of certain local transformations. We prove here an upper bound for the length of a shortest transformation sequence relating any two…

Three--dimensional colored triangulations are gluings of tetrahedra whose faces carry the colors 0, 1, 2, 3 and in which the attaching maps between tetrahedra are defined using the colors. This framework makes it possible to generalize the…

A reformulation of the three circles theorem of Johnson with distance coordinates to the vertices of a triangle is explicitly represented in a polynomial system and solved by symbolic computation. A similar polynomial system in distance…