Related papers: Minimal triangulations for an infinite family of l…
In this article Ehrhart quasi-polynomials of simplices are employed to determine isospectral lens spaces in terms of a finite set of numbers. Using the natural lattice associated with a lens space the associated toric variety of a lens…
A rational triangle $T$ (one whose angles are rational multiples of $\pi$) unfolds to a translation surface $(X_T,\omega_T)$. The lattice triangle problem asks to classify those $T$ for which $(X_T,\omega_T)$ is a Veech (lattice) surface,…
A simple graph is triangular if every edge is contained in a triangle. A sequence of integers is graphical if it is the degree sequence of a simple graph. Egan and Nikolayevsky recently conjectured that every graphical sequence whose terms…
A line packing is optimal if its coherence is as small as possible. Most interesting examples of optimal line packings are achieving equality in some of the known lower bounds for coherence. In this paper two infinite families of real and…
In this paper we discuss face numbers of generalised triangulations of manifolds in arbitrary dimensions. This is motivated by the study of triangulations of simply connected $4$-manifolds: We observe that, for a triangulation $\mathcal{T}$…
Every lens space has a locally flat embedding in a connected sum of 8 copies of the complex projective plane and a smooth embedding in n copies of the complex projective plane for some positive integer n. We show that there is no n such…
Let $M$ be a compact 3--manifold with boundary a single torus. We present upper and lower complexity bounds for closed 3--manifolds obtained as even Dehn fillings of $M.$ As an application, we characterise some infinite families of even…
A tensor space is a vector space equipped with a finite collection of multilinear forms. The length of a tensor space is its length as a representation of its symmetry group. Infinite dimension tensor spaces of finite length are special,…
We derive conditions on the products of stochastic matrices guaranteeing the existence of a unique limit invariant distribution. Belying our approach is the hereby defined notion of restricted triangulated Laman graphs. The main idea is the…
The Circle Pattern Theorem characterizes the existence and rigidity of circle patterns with prescribed intersection angles on simplicial triangulations of closed surfaces. In this paper we extend the theorem to quasi-simplicial…
In this article we make the concept of a continuous family of triangles precise and prove the moduli functor classifying oriented triangles admits a fine moduli space but the functor classifying non-oriented triangles only admits a coarse…
It is important to have effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex before we…
We study surfaces in Euclidean space ${\mathbb R}^3$ that are minimal for a log-linear density $\phi(x,y,z)=\alpha x+\beta y+\gamma y$, where $\alpha,\beta,\gamma$ are real numbers not all zero. We prove that if a surface is $\phi$-minimal…
We prove the existence of a one parameter family of minimal embedded hypersurfaces in $R^{n+1}$, for $n \geq 3$, which generalize the well known 2 dimensional "Riemann minimal surfaces". The hypersurfaces we obtain are complete, embedded,…
A vector space S of linear operators between finite-dimensional vector spaces U and V is called locally linearly dependent (in abbreviate form: LLD) when every vector x in U is annihilated by a non-zero operator in S. By a duality argument,…
The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3). This bound is tight in the…
Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…
To every $n$-dimensional lens space $L$, we associate a congruence lattice $\mathcal L$ in $\mathbb Z^m$, with $n=2m-1$ and we prove a formula relating the multiplicities of Hodge-Laplace eigenvalues on $L$ with the number of lattice…
Mantel's theorem states that every $n$-vertex graph with $\lfloor \frac{n^2}{4} \rfloor +t$ edges, where $t>0$, contains a triangle. The problem of determining the minimum number of triangles in such a graph is usually referred to as the…
In answering questions from arXiv:0901.2337v1 we prove a triangulation result that is of independent interest. In more detail, let R be an o-minimal field with a proper convex subring V, and let st: V \to k be the corresponding standard…