Related papers: Explicit enumeration of triangulations with multip…

We give a complete classification of edge-to-edge tilings of the sphere by regular polygons under a unified framework. Without assuming convexity of the tiles or polyhedrality of the underlying graph, our proof is independent of the…

We give a complete enumeration of all combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product $S^2\times S^1$ and 615…

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

An explicit expression is obtained for the generating series for the number of ramified coverings of the sphere by the torus, with elementary branch points and prescribed ramification type over infinity. This proves a conjecture of Goulden,…

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…

This article presents new enumerative results related to symmetric planar maps. In the first part a new way of enumerating rooted simple quadrangulations and rooted simple triangulations is presented, based on the description of two…

Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique…

We consider a compact hyperbolic tetrahedron of a general type. It is a convex hull of four points called vertices in the hyperbolic space $\mathbb{H}^3$. It can be determined by the set of six edge lengths up to isometry. For further…

An approach is shown that proves various theorems of plane geometry in an algorithmic manner. The approach affords transparent proofs of a generalization of the Theorem of Morley and other well known results by casting them in terms of…

We prove that the Ehrhart polynomial of a zonotope is a specialization of the multiplicity Tutte polynomial. We derive some formulae for the volume and the number of integer points of the zonotope.

We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…

We recover the Tutte polynomial of a matroid, up to change of coordinates, from an Ehrhart-style polynomial counting lattice points in the Minkowski sum of its base polytope and scalings of simplices. Our polynomial has coefficients of…

This is an example on the cohomology of threefolds.

We consider an algebraic variety and its foliation, both defined over a number field. We prove upper bounds for the geometric complexity of the intersection between a leaf of the foliation and a subvariety of complementary dimension (also…

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…

We study the double homology associated to triangulated spheres and present two results. First, we explicitly compute the double homology for minimum degree sphere triangulations. Using a spectral sequence argument, we compute the effect of…

This paper discusses the enumeration for the total number of all rooted spanning forests of the labeled complete tripartite graph. We enumerate the total number by a combinatorial decomposition.

We enumerate all dissections of an equilateral triangle into smaller equilateral triangles up to size 20, where each triangle has integer side lengths. A perfect dissection has no two triangles of the same side, counting up- and…

We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which forces a contradiction.