Related papers: Triangulations into Groups
We show that given a partially flat angled ideal triangulation for a 3-manifold $M$ with boundary (as defined by Lackenby), there is an algorithm to produce a list of Heegaard splittings for $M$ such that below a given genus $g$, each…
The method of group quantization described in the preceeding paper I is extended so that it becomes applicable to some parametrized systems that do not admit a global transversal surface. A simple completely solvable toy system is studied…
Spherical $t$-designs on $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ provide $N$ nodes for an equal weight numerical integration rule which is exact for all spherical polynomials of degree at most $t$. This paper considers the generation of…
Polygons are cycles embedded into the plane; their vertices are associated with $x$- and $y$-coordinates and the edges are straight lines. Here, we consider a set of polygons with pairwise non-overlapping interior that may touch along their…
Regular algebraic surfaces isogenous to a higher product of curves can be obtained from finite groups with ramification structures. We find unmixed ramification structures for finite groups constructed as p-quotients of particular infinite…
Following work of Jaco and Rubinstein (2006), which (non-constructively) proved that any 3-manifold admits a one-vertex layered triangulation, we present an algorithm, with implementation using Regina, that uses a combinatorial presentation…
Motivated by recent work on Delaunay triangulations of hyperbolic surfaces, we consider the minimal number of vertices of such triangulations. First, we will show that every hyperbolic surface of genus $g$ has a simplicial Delaunay…
A smooth cuboid can be identified with a $3\times 3$ matrix of linear forms, with coefficients in a field $K$, whose determinant describes a smooth cubic in the projective plane. To each such matrix one can associate a group scheme over…
An ideal triangulation $\mathcal{T}$ of a hyperbolic 3-manifold $M$ with one cusp is non-peripheral if no edge of $\mathcal{T}$ is homotopic to a curve in the boundary torus of $M$. For such a triangulation, the gluing and completeness…
Let $$1 \to H \to G \to Q \to 1$$ be an exact sequence where $H= \pi_1(S)$ is the fundamental group of a closed surface $S$ of genus greater than one, $G$ is hyperbolic and $Q$ is finitely generated free. The aim of this paper is to provide…
We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved…
We propose a new refinement algorithm to generate size-optimal quality-guaranteed Delaunay triangulations in the plane. The algorithm takes $O(n \log n + m)$ time, where $n$ is the input size and $m$ is the output size. This is the first…
We provide "growth schemes" for inductively generating uniform random $2p$-angulations of the sphere with $n$ faces, as well as uniform random simple triangulations of the sphere with $2n$ faces. In the case of $2p$-angulations, we provide…
We consider the problem of triangulating a polygon with $n$ vertices and $h$ holes, or relatedly the problem of computing the trapezoidal decomposition of a collection of $h$ disjoint simple polygonal chains with $n$ vertices total.…
A solution to the effectiveness problem in Kohn's algorithm for generating subelliptic multipliers is provided for domains that include those given by sums of squares of holomorphic functions (also including infinite sums). These domains…
We consider elliptic surfaces $\mathcal{E}$ over a field $k$ equipped with zero section $O$ and another section $P$ of infinite order. If $k$ has characteristic zero, we show there are only finitely many points where $O$ is tangent to a…
With the $[0,1,2]$-family of cyclic triangulations we introduce a rich class of vertex-transitive triangulations of surfaces. In particular, there are infinite series of cyclic $q$-equivelar triangulations of orientable and non-orientable…
Counting the number of triangles in a graph has many important applications in network analysis. Several frequently computed metrics like the clustering coefficient and the transitivity ratio need to count the number of triangles in the…
Topological triangulations of orientable and non-orientable surfaces with arbitrary genus have important applications in quantum geometry, graph theory and statistical physics. However, until now only the asymptotics for 2-spheres are known…
Our main result is the determination of the respective groups $ Aut_\mathbb{Z}(S) $ of cohomologically trivial automorphisms and $ Aut_\mathbb{Q}(S) $ of numerically trivial automorphisms for the reducible fake quadrics, that is, the…