Related papers: Minimal Sum of Powered Distances from the Sides of…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…
Tile the unit square with $n$ small squares. We determine the minimum of the sum of the side lengths of the $n$ small squares, where the minimum is taken over all tilings of the unit square with $n$ squares.
The idea of minimum distance, familiar from R <-> 1/R duality when the string target space is a circle, is analyzed for less trivial geometries. The particular geometry studied is that of a blown-up quotient singularity within a Calabi-Yau…
We show that every thin position for a connected sum of small knots is obtained in an obvious way: place each summand in thin position so that no two summands intersect the same level surface, then connect the lowest minimum of each summand…
In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to…
Finite trigonometric sums occur in various branches of physics, mathematics, and their applications. These sums may contain various powers of one or more trigonometric functions. Sums with one trigonometric function are known, however sums…
We compute the minimum distance of the parameterized code of order 1 over an even cycle.
Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…
In this paper we investigate the sums of reciprocals to an arithmetic progression taken modulo one, that is sums of $\{n\alpha-\gamma\}^{-1}$, where $\alpha$ and $\gamma$ are real parameters and $\{\,\cdot\,\}$ is the fractional part of a…
For probability measures on a complete separable metric space, we present sufficient conditions for the existence of a solution to the Kantorovich transportation problem. We also obtain sufficient conditions (which sometimes also become…
An exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle is given.
Two simple proofs of the triangle inequality for the Jaccard distance in terms of nonnegative, monotone, submodular functions are given and discussed.
Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two…
The minimum distance of a code is an important concept in information theory. Hence, computing the minimum distance of a code with a minimum computational cost is a crucial process to many problems in this area. In this paper, we present…
Twisted permutation codes, introduced recently by the second and third authors, are frequency permutation arrays. They are similar to repetition permutation codes, in that they are obtained by a repetition construction applied to a smaller…
Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation. The flip distance between two triangulations is the…
We give a review of the status of the global effort to measure the sides of the CKM Unitarity Triangle.
An inequality is derived for the average $t$-energy of pinned distance measures, where $0 < t < 1$. This refines Mattila's theorem on distance sets to pinned distance sets, and gives an analogue of Liu's theorem for pinned distance sets of…
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum-weight triangulation (MWT) problem, we are looking for a triangulation of a given point set that minimizes the sum of the edge…