Related papers: A functional view of upper bounds on codes
By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…
We prove that any given function can be smoothly approximated by functions lying in the kernel of a linear operator involving at least one fractional component. The setting in which we work is very general, since it takes into account…
Based on the Delsarte-Yudin linear programming approach, we extend Levenshtein's framework to obtain lower bounds for the minimum $h$-energy of spherical codes of prescribed dimension and cardinality, and upper bounds on the maximal…
The aim of the work is to construct new polynomial systems, which are solutions to certain functional equations which generalize the second-order differential equations satisfied by the so called classical orthogonal polynomial families of…
It is shown that eigenvalues of Laplace-Beltrami operators on compact Riemannian manifolds can be determined as limits of eigenvalues of certain finite-dimensional operators in spaces of polyharmonic functions with singularities. In…
We show that sampling or interpolation formulas in reproducing kernel Hilbert spaces can be obtained by reproducing kernels whose dual systems form molecules, ensuring that the size profile of a function is fully reflected by the size…
We introduce a linear programming framework for obtaining upper bounds for the potential energy of spherical codes of fixed cardinality and minimum distance. Using Hermite interpolation we construct polynomials to derive corresponding…
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…
As is well known the kernel of the orthogonal projector onto the polynomials of degree $n$ in $L^2(w_{\a,\b}, [-1, 1])$ with $w_{\a,\b}(t) = (1-t)^\a(1+t)^\b$ can be written in terms of Jacobi polynomials. It is shown that if the…
For orthogonal polynomials defined by compact Jacobi matrix with exponential decay of the coefficients, precise properties of orthogonality measure is determined. This allows showing uniform boundedness of partial sums of orthogonal…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
In these notes, the Christoffel-Darboux polynomial kernel is extended to infinite-dimensional Hilbert spaces, following as closely as possible its original finite-dimensional treatment.
In this paper we consider the problems of supervised classification and regression in the case where attributes and labels are functions: a data is represented by a set of functions, and the label is also a function. We focus on the use of…
This note supplements the work of Gomez-Ullate, Kamran and Milson on the X_(1)-Jacobi polynomials which are orthogonal in a weighted Hilbert function space on the the interval (-1,+1) of the real line. These polynomials are generated by a…
Different generators of a deformed oscillator algebra give rise to one-parameter families of $q$-exponential functions and $q$-Hermite polynomials related by generating functions. Connections of the Stieltjes and Hamburger classical moment…
We introduce a general method for transforming the equations of motion following from a Das-Jevicki-Sakita Hamiltonian, with boundary conditions, into a boundary value problem in one-dimensional quantum mechanics. For the particular case of…
Consider the problem of minimizing a polynomial $f$ over a compact semialgebraic set ${\mathbf{X} \subseteq \mathbb{R}^n}$. Lasserre introduces hierarchies of semidefinite programs to approximate this hard optimization problem, based on…
Some properties and relations satisfied by the polynomial solutions of a bispectral problem are studied. Given a finite order differential operator, under certain restrictions, its polynomial eigenfunctions are explicitly obtained, as well…
For a long time it has been a challenging goal to identify all orthogonal polynomial systems that occur as eigenfunctions of a linear differential equation. One of the widest classes of such eigenfunctions known so far, is given by…
We consider kernels of discrete convolution operators or, equivalently, homogeneous solutions of partial difference operators and show that these solutions always have to be exponential polynomials. The respective polynomial space in…