Related papers: Enumeration and random realization of triangulated…

We prove that for a given flat surface with conical singularities, any pair of geometric triangulations can be connected by a chain of flips.

We present a, hopefully, elementary mathematical treatment of the computational aspects of congruent numbers, such that an amateur could understand the problem and perform their own calculations.

Normal surface theory is a central tool in algorithmic three-dimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important algorithms. However, it is not well understood how the number…

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…

The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this…

Enumerating all 3-manifold triangulations of a given size is a difficult but increasingly important problem in computational topology. A key difficulty for enumeration algorithms is that most combinatorial triangulations must be discarded…

We investigate the crossover between weak and strong self-avoidance in a simulation of random surfaces with extrinsic curvature. We consider both dynamically triangulated and rigid surfaces with the two possible discretizations of the…

Motivated by the enumeration of a class of plane partitions studied by Proctor and by considerations about symmetry classes of plane partitions, we consider the problem of enumerating lozenge tilings of a hexagon with ``maximal staircases''…

We present some old and new results in the enumeration of random walks in one dimension, mostly developed in works of enumerative combinatorics. The relation between the trace of the $n$-th power of a tridiagonal matrix and the enumeration…

In this talk I review some of the recent developments in the field of random surfaces and the Dynamical Triangulation approach to simplicial quantum gravity. In two dimensions I focus on the c=1 barrier and the fractal dimension of…

The aim of the paper is to show algorithms for geometrical manipulations on NURBS surfaces. These include generating NURBS surfaces that pass through given points, calculating the minimum distance to a point and include line to surface and…

In this paper we prove that the surface of the cuboctahedron can be triangulated into 8 non-obtuse triangles and 12 acute triangles. Furthermore, we show that both bounds are the best possible.

The quest for regular models of arithmetic surfaces allows different viewpoints and approaches: using valuations or a covering by charts. In this article, we sketch both approaches and then show in a concrete example, how surprisingly…

Tight triangulated manifolds are generalisations of neighborly triangulations of closed surfaces and are interesting objects in Combinatorial Topology. Tight triangulated manifolds are conjectured to be minimal. Except few, all the known…

A topologically minimal surface may be isotoped into a normal form with respect to a fixed triangulation. If the intersection with each tetrahedron is simply connected, then the pieces of this normal form are triangles, quadrilaterals, and…

There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both…

We review some of our recent work on the conformal geometry corresponding to the triangulated surfaces used in 2-dimensional simplicial quantum gravity. In particular, we discuss the regularized Liouville action associated with random Regge…

The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed…

In this work for the first time we enumerate unlabelled maps on orientable genus $g$ surfaces with respect to all homeomorphisms, including both orientation-preserving and orientation-reversing. We show that in the latter case as an…

Laman graphs model planar frameworks which are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. In a recent paper we provide a recursion…