Related papers: Inside s-inner product sets and Euclidean designs
We show that every finite-dimensional Euclidean space contains compact universal differentiability sets of upper Minkowski dimension one. In other words, there are compact sets $S$ of upper Minkowski dimension one such that every Lipschitz…
A finite subset of a Euclidean space is called an $s$-distance set if there exist exactly $s$ values of the Euclidean distances between two distinct points in the set. In this paper, we prove that the maximum cardinality among all…
Motivated by the model theory of higher order logics, a certain kind of topological spaces had been introduced on ultraproducts. These spaces are called ultratopologies. Ultratopologies provide a natural extra topological structure for…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
We develop a framework for obtaining linear programming bounds for spherical codes whose inner products belong to a prescribed subinterval $[\ell,s]$ of $[-1,1)$. An intricate relationship between Levenshtein-type upper bounds on…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
In an Euclidean $d$-space, the container problem asks to pack $n$ equally sized spheres into a minimal dilate of a fixed container. If the container is a smooth convex body and $d\geq 2$ we show that solutions to the container problem can…
A finite subset $X$ of the Euclidean space is called an $m$-distance set if the number of distances between two distinct points in $X$ is equal to $m$. An $m$-distance set $X$ is said to be maximal if any vector cannot be added to $X$ while…
A subset $X$ in the $d$-dimensional Euclidean space is called a $k$-distance set if there are exactly $k$ distinct distances between two distinct points in $X$ and a subset $X$ is called a locally $k$-distance set if for any point $x$ in…
A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…
A construction of product measures is given for an arbitrary sequence of measure spaces via outer measure techniques without imposing any condition on the underlying measure spaces. This approach concludes finally the problem of the…
The purpose of this paper is to give an effective construction for some induced structures on spheres or product of spheres of codimension 1, 2 or 3, respectively, in Euclidean space endowed with an almost product structure.
Based on the intuitive notion of convexity, we formulate a universal property defining interval objects in a category with finite products. Interval objects are structures corresponding to closed intervals of the real line, but their…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
We prove that the existence of best coapproximation to any element of the normed linear space out of any one dimensional subspace and its coincidence with the best approximation to that element out of that subspace characterizes a real…
We generalize an inequality for the determinant of a real matrix proved by A. Schinzel, to more general exterior products of vectors in Euclidean space. We apply this inequality to the logarithmic embedding of $S$-units contained in a…
The notion of the magnitude of a metric space was introduced by Leinster in [8] and developed in [10], [9], [11] and [16], but the magnitudes of familiar sets in Euclidean space are only understood in relatively few cases. In this paper we…
We define a set inner product to be a function on pairs of convex bodies which is symmetric, Minkowski linear in each dimension, positive definite, and satisfies the natural analogue of the Cauchy-Schwartz inequality (which is not implied…
In this paper we present a new criterion on characterization of real inner product spaces. We conclude that a real normed space $(X, \|...\|)$ is an inner product space if $$\sum_{\epsilon_i \in \{-1,1\}} \|x_1 +…
Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…