Related papers: Energy bounds for weighted spherical codes and des…
We provide new answers about the placement of mass on spheres so as to minimize energies of pairwise interactions. We find optimal measures for the $p$-frame energies, i.e. energies with the kernel given by the absolute value of the inner…
Many of the classic problems of coding theory are highly symmetric, which makes it easy to derive sphere-packing upper bounds and sphere-covering lower bounds on the size of codes. We discuss the generalizations of sphere-packing and…
We prove that positive solutions of the superlinear Lane-Emden system in a two-dimensional smooth bounded domain are bounded independently of the exponents in the system, provided the exponents are comparable. As a consequence, the energy…
In this paper, the approximate analitical solutions of the hyper-radial Schr\"{o}dinger equation are obtained for the generalized Wood-Saxon potential by implementing the Pekeris approximation to surmount the centrifugal term. The energy…
Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…
The Cohn-Elkies linear program for sphere packing, which was used to solve the 8 and 24 dimensional cases, is conjectured to not be sharp in any other dimension $d>2$. By mapping feasible points of this infinite-dimensional linear program…
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…
In this paper q-ary Raptor codes under ML decoding are considered. An upper bound on the probability of decoding failure is derived using the weight enumerator of the outer code, or its expected weight enumerator if the outer code is drawn…
We illustrate how computer-aided methods can be used to investigate the fundamental limits of the caching systems, which are significantly different from the conventional analytical approach usually seen in the information theory…
A general quantization rule for bound states of the Schrodinger equation is presented. Like fundamental theory of integral, our idea is mainly based on dividing the potential into many pieces, solving the Schr\"odinger equation, and…
We study parameterized Constraint Satisfaction Problem for infinite constraint languages. The parameters that we study are weight of the satisfying assignment, number of constraints, maximum number of occurrences of a variable in the…
We identify universal polar dual pairs of spherical codes $C$ and $D$ such that for a large class of potential functions $h$ the minima of the discrete $h$-potential of $C$ on the sphere occur at the points of $D$ and vice versa. Moreover,…
The Dirac Equation is solved approximately for relativistic generalized Woods-Saxon potential including Coulomb-like tensor potential in exact pseudospin and spin symmetry limits. The bound states energy eigenvalues are found by using…
We establish a majorization-based theory for bounding observables of waves with varied coherence. For any measurement, exact bounds are attained by the maximal and minimal elements in the set of input coherence spectra. The set's supremum…
We introduce a linear programming method to obtain bounds on the cardinality of codes in Grassmannian spaces for the chordal distance. We obtain explicit bounds, and an asymptotic bound that improves on the Hamming bound. Our approach…
This paper shows the usefulness of the Perov contraction theorem, which is a generalization of the classical Banach contraction theorem, for solving Markov dynamic programming problems. When the reward function is unbounded, combining an…
Weight optimization of frame structures with continuous cross-section parametrization is a challenging non-convex problem that has traditionally been solved by local optimization techniques. Here, we exploit its inherent semi-algebraic…
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…
For $\Omega\subset \mathbb{R}^2$ a smooth and bounded domain, we derive a sharp universal energy estimate for non-negative solutions of free boundary problems on $\Omega$ arising in plasma physics. As a consequence, we are able to deduce…
A new inner bound on the capacity region of a general index coding problem is established. Unlike most existing bounds that are based on graph theoretic or algebraic tools, the bound is built on a random coding scheme and optimal decoding,…