Related papers: On Euclidean designs and the potential energy
An effective quantum number determining with high accuracy the levels ordering in arbitrary centrally symmetric potentials for any space dimensionality is introduced and calculated by means of certain universal methods based on the known…
We demonstrate relationships between the classic Euclidean algorithm and many other fields of study, particularly in the context of music and distance geometry. Specifically, we show how the structure of the Euclidean algorithm defines a…
We establish the expressibility in fixed-point logic with counting (FPC) of a number of natural polynomial-time problems. In particular, we show that the size of a maximum matching in a graph is definable in FPC. This settles an open…
We suggest a concept of generalized `angles' in arbitrary real normed vector spaces. We give for each real number a definition of an `angle' by means of the shape of the unit ball. They all yield the well known Euclidean angle in the…
A finite set of distinct vectors $\mathcal{X}$ in the $d$-dimensional Euclidean space $\mathbb{R}^d$ is called an $s$-distance set if the set of mutual distances between distinct elements of $\mathcal{X}$ has cardinality $s$. In this paper…
This article is devoted to the study of discrete potentials on the sphere in $\mathbb{R}^n$ for sharp codes. We show that the potentials of most of the known sharp codes attain the universal lower bounds for polarization for spherical…
In a domain of the Euclidean space, we estimate from below the distance to the boundary of global maximum points of solutions of elliptic and parabolic equations with homogeneous Dirichlet boundary values. As reference cases, we first…
A spherical $L$-code, where $L \subseteq [-1,\infty)$, consists of unit vectors in $\mathbb{R}^d$ whose pairwise inner products are contained in $L$. Determining the maximum cardinality $N_L(d)$ of an $L$-code in $\mathbb{R}^d$ is a…
The 2-point correlation function of the galaxy spatial distribution is a major cosmological observable that enables constraints on the dynamics and geometry of the Universe. The Euclid mission aims at performing an extensive spectroscopic…
We consider the problem of choosing Euclidean points to maximize the sum of their weighted pairwise distances, when each point is constrained to a ball centered at the origin. We derive a dual minimization problem and show strong duality…
We study the problem of searching for a target at some unknown location in $\mathbb{R}^d$ when additional information regarding the position of the target is available in the form of predictions. In our setting, predictions come as…
We extend the notion of some energy-type expressions based on two sets, developed in the abstract potential theory. We also give the discretized version of the quantities defined, similar to Chebyshev constant. This extension allows to…
In this thesis we present several results in coding theory, concerning error-correcting codes and the Shannon capacity. 1. We give a general symmetry reduction of matrices occuring in semidefinite programs in coding theory. 2. We apply the…
This paper designs an alogrithm to compute the minimal combinations of finite sets in Euclidean spaces, and applys the algorithm of study the moment maps and geometric invariant stability of hypersurfaces. The classical example of cubic…
Finding the maximum cardinality of a $2$-distance set in Euclidean space is a classical problem in geometry. Lison\v{e}k in 1997 constructed a maximum $2$-distance set in $\mathbb R^8$ with $45$ points. That $2$-distance set constructed by…
In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…
We consider the defocusing, energy subcritical wave equation $\partial_t^2 u - \Delta u = -|u|^{p-1} u$ in 4 to 6 dimensional spaces with radial initial data. We define $w=r^{(d-1)/2} u$, reduce the equation above to one-dimensional…
Polar codes are the first class of constructive channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels. But the analysis and construction of polar codes involve the complex iterative-calculation. In…
Euclidean geometry consists of straightedge-and-compass constructions and reasoning about the results of those constructions. We show that Euclidean geometry can be developed using only intuitionistic logic. We consider three versions of…
A homogeneous set of $n$ points in the $d$-dimensional Euclidean space determines at least $\Omega(n^{2d/(d^2+1)} / \log^{c(d)} n)$ distinct distances for a constant $c(d)>0$. In three-space, we slightly improve our general bound and show…