Related papers: Some spherical codes in S2 and their algebraic num…
In this short review paper the detailed analysis of six two-dimensional quantum {\it superintegrable} systems in flat space is presented. It includes the Smorodinsky-Winternitz potentials I-II (the Holt potential), the Fokas-Lagerstrom…
Classical (maximal) superintegrable systems in $n$ dimensions are Hamiltonian systems with $2n-1$ independent constants of the motion, globally defined, the maximum number possible. They are very special because they can be solved…
We adress the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to find the error locator polynomial in terms of the syndroms of the…
New inverse and half-inverse problems: {\it sliding problems} are introduced. In this way several physically important equations are recovered from the quantum defect. In particular, sliding problems are solved for radial Schr\"odinger…
We report on a new computer study into the existence of d^2 equiangular lines in d complex dimensions. Such maximal complex projective codes are conjectured to exist in all finite dimensions and are the underlying mathematical objects…
A celebrated result of Beck shows that for any set of $N$ points on $\mathbb{S}^d$ there always exists a spherical cap $B \subset \mathbb{S}^d$ such that number of points in the cap deviates from the expected value $\sigma(B) \cdot N$ by at…
A widely used method for solving SOS (Sum Of Squares) decomposition problem is to reduce it to the problem of semi-definite programs (SDPs) which can be efficiently solved in theory. In practice, although many SDP solvers can work out some…
In many applications data are measured or defined on a spherical manifold; spherical harmonic transforms are then required to access the frequency content of the data. We derive algorithms to perform forward and inverse spin spherical…
We prove an asymptotic formula for the number of integral points of bounded log anticanonical height on a singular quartic del Pezzo surface over arbitrary number fields, with respect to the largest admissible boundary divisor. The…
Enumerative algebraic geometry counts the solutions to certain geometric constraints. Numerical algebraic geometry determines these solutions for any given instance. This article illustrates how these two fields complement each other. Our…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
Relying on the classical second moment formula of Rogers we give an effective asymptotic formula for the number of integer vectors $v$ in a ball of radius $t$, with value $Q(v)$ in a shrinking interval of size $t^{-\kappa}$, that is valid…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
This paper aims at studying how finitely many generalized polarization tensors of an algebraic domain can be used to determine its shape. Precisely, given a planar set with real algebraic boundary, it is shown that the minimal polynomial…
Detailed numerical results for the structural properties of three-dimensional classical Coulomb clusters confined in a spherical parabolic trap are presented. Based on extensive high accuracy computer simulations the shell configurations…
A spherical n-gon is a bordered surface homeomorphic to a closed disk, with n distinguished boundary points called corners, equipped with a Riemannian metric of constant curvature 1, except at the corners, and such that the boundary arcs…
2nd-order conformal superintegrable systems in $n$ dimensions are Laplace equations on a manifold with an added scalar potential and $2n - 1$ independent 2nd order conformal symmetry operators. They encode all the information about…
Three-point semidefinite programming bounds are one of the most powerful known tools for bounding the size of spherical codes. In this paper, we use them to prove lower bounds for the potential energy of particles interacting via a pair…
This article surveys the development of the theory of algebraic geometry codes since their discovery in the late 70's. We summarize the major results on various problems such as: asymptotic parameters, improved estimates on the minimum…
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic problems of a code. While these problems are known to be hard for…