Related papers: Constructions of Large m-Distance Sets on Triangul…
Consider a compact $M \subset \mathbb{R}^d$ and $l > 0$. A maximal distance minimizer problem is to find a connected compact set $\Sigma$ of the length (one-dimensional Hausdorff measure $\mathcal H$) at most $l$ that minimizes \[ \max_{y…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
We give an algorithm for determining the distance between two vertices of the complex of curves. While there already exist such algorithms, for example by Leasure, Shackleton, and Webb, our approach is new, simple, and more effective for…
This thesis is a study of large sets of unit vectors in $\cx^n$ such that the absolute value of their standard inner products takes on only a small number of values. We begin with bounds: what is the maximal size of a set of lines with only…
We consider the number of configurations of a surface in two dimensions that has a prescribed length and encloses a prescribed perimeter with respect to a baseline. An approximate analytical treatment in a semi--continuum compares…
A Langford sequence of order $m$ and defect $d$ can be identified with a labeling of the vertices of a path of order $2m$ in which each labeled from $d$ up to $d+m-1$ appears twice and in which the vertices that have been label with $k$ are…
We construct a class of lattices in three and higher dimensions for which the number of dimer coverings can be determined exactly using elementary arguments. These lattices are a generalization of the two-dimensional kagome lattice, and the…
The lattice diameter of a bounded set $S \subset \mathbb{R}^d$ measures the maximal number of lattice points in a segment whose endpoints are lattice points in $S$. Such a segment is called a lattice diameter segment of $S$. This simple…
This article is about measuring and visualizing distances between domino tilings. Given two tilings of a simply connected square tiled surface, we're interested in the minimum number of flips between two tilings. Given a certain shape,…
Distance-increasing maps from binary vectors to permutations, namely DIMs, are useful for the construction of permutation arrays. While a simple mapping algorithm defining DIMs of even length is known, existing DIMs of odd length are either…
The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…
In this report, the explicit probability density functions of the random Euclidean distances associated with regular hexagons are given, when the two endpoints of a link are randomly distributed in the same hexagon, and two adjacent…
We study homogeneity aspects of metric spaces in which all triples of distinct points admit pairwise different distances; such spaces are called isosceles-free. In particular, we characterize all homogeneous isosceles-free spaces up to…
We consider hyperplane arrangements generated by generic points and study their intersection lattices. These arrangements are known to be equivalent to discriminantal arrangements. We show a fundamental structure of the intersection…
Enumeration of various types of lattice polygons and in particular polyominoes is of primary importance in many machine learning, pattern recognition, and geometric analysis problems. In this work, we develop a large deviation principle for…
We show that the set of all measures on any measurable space is a complete lattice, i.e. every collection of measures has both a greatest lower bound and a least upper bound.
In this paper we introduce a Wasserstein-type distance on the set of Gaussian mixture models. This distance is defined by restricting the set of possible coupling measures in the optimal transport problem to Gaussian mixture models. We…
We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of…
A strongly connected digraph is called a cactoid-type if each of its blocks is a digraph consisting of finitely many oriented cycles sharing a common directed path. In this article, we find the formula for the determinant of the distance…
Dictionary lookup methods are popular in dealing with ambiguous letters which were not recognized by Optical Character Readers. However, a robust dictionary lookup method can be complex as apriori probability calculation or a large…