Related papers: Bisectors and pinned distances
A lower bound for the number of 3-periodical billiard trajectories in a manifold embedded in Euclidean space is obtained.
Quantitative bounds for random embeddings of $\mathbb{R}^{k}$ into Lorentz sequence spaces are given, with improved dependence on $\varepsilon$.
A set $U$ of unit vectors is selectively balancing if one can find two disjoint subsets $U^+$ and $U^-$, not both empty, such that the Euclidean distance between the sum of $U^+$ and the sum of $U^-$ is smaller than $1$. We prove that the…
The electrostatic configurations of the Born-Infeld field in the 2-dimensional Euclidean plane are obtained by means of a non-analytical complex mapping which captures the structure of equipotential and field lines. The electrostatic field…
We establish a lower bound for the surface area of a closed, convex hypersurface in Euclidean space in terms of its displacement under continuous maps. As a result, a hypothesized lower bound for the volume of a Riemannian $n$-sphere,…
A graph is called a $k$-planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investigate $u_k(n)$, the maximum number of edges of such graphs on…
Let P_1 and P_2 be two sets of points in the plane, so that P_1 is contained in a line L_1, P_2 is contained in a line L_2, and L_1 and L_2 are neither parallel nor orthogonal. Then the number of distinct distances determined by the pairs…
It is shown that a minimum weight spanning tree of a finite ultrametric space can be always found in the form of path. As a canonical representing tree such path uniquely defines the whole space and, moreover, it has much more simple…
We prove that a well-distributed subset of R^2 can have a separated distance set only if the distance is induced by a polygon.
An analog of the Falconer distance problem in vector spaces over finite fields asks for the threshold $\alpha>0$ such that $|\Delta(E)| \gtrsim q$ whenever $|E| \gtrsim q^{\alpha}$, where $E \subset {\Bbb F}_q^d$, the $d$-dimensional vector…
For $n\geq 1$, we exhibit a lower bound for the volume of a unit vector field on $\mathbb{S}^{2n+1}\backslash\{\pm p\}$ depending on the absolute values of its Poincar\'e indices around $\pm p$. We determine which vector fields achieve this…
Recently D. Buchholz and R. Verch have proposed a method for implementing in algebraic quantum field theory ideas from renormalization group analysis of short-distance (high energy) behavior by passing to certain scaling limit theories.…
The proof of the theorem, which states that the Euclidean metric on the set of random points in an $n$-dimensional Euclidean space with the distribution of a special class, converges in probability in the limit $n\rightarrow\infty$ to the…
When we represent a network of sensors in Euclidean space by a graph, there are two distances between any two nodes that we may consider. One of them is the Euclidean distance. The other is the distance between the two nodes in the graph,…
Behavioural distances provide a robust alternative to notions of equivalence such as bisimilarity in the context of probabilistic transition systems. They can be defined as least fixed points, whose universal property allows us to exhibit…
In this note, we show that in planar pointsets determining many unit distances, these unit distances must span many directions. Specifically, we show that a set of $n$ points can determine only $o(n^{4/3})$ unit distances from a set of at…
In this note we make use of some properties of vector fields on a manifold to give an alternate proof to [3] for the equivalence between connections and parallel transport on vector bundles over manifolds. Out of the proof will emerge a new…
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates as well as Boolean operations on regions, interpreted over low-dimensional Euclidean spaces. We show that the complexity of…
It is known that any $n$-point set in the $d$-dimensional Euclidean space $\mathbb{R}^d$, for $d = O(1)$, admits: 1) a $(1+\epsilon)$-spanner with maximum degree $\tilde{O}(\epsilon^{-d+1})$ and with lightness $\tilde{O}(\epsilon^{-d})$; 2)…
In this paper, we present a new technique to obtain upper bounds on undirected unicast network information capacity. Using this technique, we characterize an upper bound, called partition bound, on the symmetric rate of information flow in…