Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn spherical codes with inner products in a prescribed interval
64
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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 cardinality of codes with inner products in $[ell,s]$ and lower bounds on the potential energy (for absolutely monotone interactions) for codes with inner products in $[ell,1)$ (when the cardinality of the code is kept fixed) is revealed and explained. Thereby, we obtain a new extension of Levenshtein bounds for such codes. The universality of our bounds is exhibited by a unified derivation and their validity for a wide range of codes and potential functions.
rate research
Read More
Let $X$ be a finite set in a complex sphere of $d$ dimension. Let $D(X)$ be the set of usual inner products of two distinct vectors in $X$. A set $X$ is called a complex spherical $s$-code if the cardinality of $D(X)$ is $s$ and $D(X)$ contains an imaginary number. We would like to classify the largest possible $s$-codes for given dimension $d$. In this paper, we consider the problem for the case $s=3$. Roy and Suda (2014) gave a certain upper bound for the cardinalities of $3$-codes. A $3$-code $X$ is said to be tight if $X$ attains the bound. We show that there exists no tight $3$-code except for dimensions $1$, $2$. Moreover we make an algorithm to classify the largest $3$-codes by considering representations of oriented graphs. By this algorithm, the largest $3$-codes are classified for dimensions $1$, $2$, $3$ with a current computer.
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 by the other conditions). We show that any set inner product can be embedded into an inner product space on the associated support functions, thereby extending fundamental results of Hormander and Radstrom. The set inner product provides a geometry on the space of convex bodies. We explore some of the properties of that geometry, and discuss an application of these ideas to the reconstruction of ancestral ecological niches in evolutionary biology.
In this paper we present the results of computer searches using a variation of an energy minimization algorithm used by Kottwitz for finding good spherical codes. We prove that exact codes exist by representing the inner products between the vectors as algebraic numbers. For selected interesting cases, we include detailed discussion of the configurations. Of particular interest are the 20-point code in $mathbb{R}^6$ and the 24-point code in $mathbb{R}^7$, which are both the union of two cross polytopes in parallel hyperplanes. Finally, we catalogue all of the codes we have found.
Given an infinite set of special divisors satisfying a mild regularity condition, we prove the existence of a Borcherds product of non-zero weight whose divisor is supported on these special divisors. We also show that every meromorphic Borcherds product is the quotient of two holomorphic ones. The proofs of both results rely on the properties of vector valued Eisenstein series for the Weil representation.
We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be improved by employing polynomials of the same or lower degrees in the Delsarte-Yudin method. However, improvements are sometimes possible and we provide a necessary and sufficient condition for the existence of such better bounds. All our bounds can be obtained in a unified manner that does not depend on the potential function, provided the potential is given by an absolutely monotone function of the inner product between pairs of points, and this is the reason for us to call them universal. We also establish a criterion for a given code of dimension $n$ and cardinality $N$ not to be LP-universally optimal, e.g. we show that two codes conjectured by Ballinger et al to be universally optimal are not LP-universally optimal.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
