Related papers: On Euclidean designs and the potential energy
Finding the largest code with a given minimum distance is one of the most basic problems in coding theory. In this paper, we study the linear programming bound for codes in the Lee metric. We introduce refinements on the linear programming…
A spherical three-distance set is a finite collection $X$ of unit vectors in $\mathbb{R}^{n}$ such that for each pair of distinct vectors has three inner product values. We use the semidefinite programming method to improve the upper bounds…
Explicit characterization and computation of the multi-source network coding capacity region (or even bounds) is long standing open problem. In fact, finding the capacity region requires determination of the set of all entropic vectors…
In the framework of Clifford analysis, a chain of harmonic and monogenic potentials in the upper half of Euclidean space R^{m+1} was constructed recently, including a higher dimensional analogue of the logarithmic function in the complex…
Let $(X,d)$ be a finite metric space with $|X|=n$. For a positive integer $k$ we define $A_k(X)$ to be the quotient set of all $k$-subsets of $X$ by isometry, and we denote $|A_k(X)|$ by $a_k$. The sequence $(a_1,a_2,\ldots,a_{n})$ is…
This work explores methods to identify energy system designs for infeasible control co-design optimization problems. Control co-design, or CCD, has been recognized as a powerful tool to maximize energy system capabilities through…
The hull of a linear code is defined as the intersection of the code and its dual. This concept was initially introduced to classify finite projective planes. The hull plays a crucial role in determining the complexity of algorithms used to…
We study the computational complexity of exact cardinality-constrained minimum Riesz $s$-energy subset selection in finite metric spaces: given $n$ points, select $k<n$ points of minimum Riesz $s$-energy. The objective sums inverse-power…
We use linear programming techniques to find points of absolute minimum over the unit sphere $S^{d}$ in $\mathbb R^{d+1}$ of the total potential of a point configuration $\omega_N\subset S^{d}$ which is a spherical $(2m-1)$-design contained…
Euclidean preferences are a widely studied preference model, in which decision makers and alternatives are embedded in d-dimensional Euclidean space. Decision makers prefer those alternatives closer to them. This model, also known as…
Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consists of an incomplete set of distances, and the output is a set of points in…
The sphere packing problem asks for the greatest density of a packing of congruent balls in Euclidean space. The current best upper bound in all sufficiently high dimensions is due to Kabatiansky and Levenshtein in 1978. We revisit their…
Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…
Shannon gave a lower bound in 1959 on the binary rate of spherical codes of given minimum Euclidean distance $\rho$. Using nonconstructive codes over a finite alphabet, we give a lower bound that is weaker but very close for small values of…
For $t \in [-1, 1)$, a set of points on the $(n-1)$-dimensional unit sphere is called $t$-almost equiangular if among any three distinct points there is a pair with inner product $t$. We propose a semidefinite programming upper bound for…
The conditions for superintegrable systems in two-dimensional Euclidean space admitting separation of variables in an orthogonal coordinate system and a functionally independent third-order integral are studied. It is shown that only…
We determine explicit formulas for geodesics (in the Euclidean metric) in the configuration space of ordered pairs (x,x') of points in R^n which satisfy d(x,x')>=epsilon. We interpret this as two or three (depending on the parity of n)…
We study a discrete model of repelling particles, and we show using linear programming bounds that many familiar families of error-correcting codes minimize a broad class of potential energies when compared with all other codes of the same…
Borrowing inspiration from Marcone and Mont\'{a}lban's one-one correspondence between the class of signed trees and the equimorphism classes of indecomposable scattered linear orders, we find a subclass of signed trees which has an…
We consider point sets in the affine plane $\mathbb{F}_q^2$ where each Euclidean distance of two points is an element of $\mathbb{F}_q$. These sets are called integral point sets and were originally defined in $m$-dimensional Euclidean…