Related papers: On spherical 4-distance 7-designs
We investigate universal bounds on spherical codes and spherical designs that could be obtained using Delsarte's linear programming methods. We give a lower estimate for the LP upper bound on codes, and an upper estimate for the LP lower…
We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…
We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of…
The primary distance indicators are established in our Galaxy and the Local Group. There are at least four different methods which give good distances: methods using proper motions, RR Lyraes, Cepheid variables, and Type II supernovae.…
Models like support vector machines or Gaussian process regression often require positive semi-definite kernels. These kernels may be based on distance functions. While definiteness is proven for common distances and kernels, a proof for a…
This work is devoted to the proof of the statement about the existence of palindromic continued fractions in an arbitrary dimension. In addition, it is proved the criterion that an algebraic continued fraction has proper cyclic palindromic…
In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly,…
Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…
We present mechanisms for generating conical singularities both in three and four-dimensions in the systems with copies of scalar or chiral multiplets coupled to $N=2$ or $N=1$ supergravity. Our mechanisms are useful for supersymmetry…
Components of large-scale structure (LSS) of Universe includes galaxy clusters, walls, filaments, groups and field galaxies. The question of spatial organization of all these components remains open despite of a number of recently developed…
This letter derives closed-form expressions for the probability density function of the distance between two nodes located in heterogeneous concentric geometries, namely a disk or sphere and a surrounding annulus or spherical shell. Two…
Low-dimensional embedding, manifold learning, clustering, classification, and anomaly detection are among the most important problems in machine learning. The existing methods usually consider the case when each instance has a fixed,…
Distance geometry problem belongs to a class of hard problems in classical computation that can be understood in terms of a set of inputs processed according to a given transformation, and for which the number of possible outcomes grows…
Some physics models have 10 dimensions that are usually decomposed into: 4 spacetime dimensions with local Lorentz Spin(1,3) symmetry plus a 6-dimensional compact space related to internal symmetries. A possibly useful alternative…
We develop and apply combinatorial algorithms for investigation of the feasible distance distributions of binary orthogonal arrays with respect to a point of the ambient binary Hamming space utilizing constraints imposed from the relations…
Direction relations between extended spatial objects are important commonsense knowledge. Recently, Goyal and Egenhofer proposed a formal model, known as Cardinal Direction Calculus (CDC), for representing direction relations between…
We propose a new method to construct maximin distance designs with arbitrary number of dimensions and points. The proposed designs hold interleaved-layer structures and are by far the best maximin distance designs in four or more…
A fundamental problem in spherical distance geometry aims to recover an $n$-tuple of points on a 2-sphere in $\mathbb{R}^3$, viewed up to oriented isometry, from $O(n)$ input measurements. We solve this problem using algorithms that employ…
A finite set of distinct vectors $\mathcal{X}$ in the $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a $2$-distance set, if the set of mutual distances between distinct elements of $\mathcal{X}$ has cardinality exactly $2$. In…
This paper studies the problem of identifying directions of axial symmetry in multivariate distributions. Theoretical results are derived on how the measure or cardinality of the set of symmetry directions relates to spherical symmetry. The…