Related papers: A functional view of upper bounds on codes
The purpose of the present article is the study of duals of functional codes on algebraic surfaces. We give a direct geometrical description of them, using differentials. Even if this geometrical description is less trivial, it can be…
In this article we present a unified treatment for obtaining bounds on the potential energy of codes in the general context of polynomial metric spaces (PM-spaces). The lower bounds we derive via the linear programming (LP) techniques of…
The Delsarte extremal problem for positive definite functions, originally introduced by Delsarte in coding theory to bound the size of error-correcting codes, has since found applications in diverse areas such as sphere packing, Fuglede's…
Understanding the maximum size of a code with a given minimum distance is a major question in computer science and discrete mathematics. The most fruitful approach for finding asymptotic bounds on such codes is by using Delsarte's theory of…
We study solutions of uniformly elliptic PDE with Lipschitz leading coefficients and bounded lower order coefficients. We extend previous results of A. Logunov concerning nodal sets of harmonic functions and, in particular, prove polynomial…
We obtain pointwise lower bounds for heat kernels of higher order differential operators with Dirichlet boundary conditions on bounded domains in $\R^N$. The bounds exhibit explicitly the nature of the spatial decay of the heat kernel close…
We study the Delsarte problem for even functions continuous on [-1,1], nonpositive on [-1/2,1/2], and representable as series with respect to the ultraspherical polynomials. The value of the Delsarte problem gives an upper bound for the…
This paper provides a semidefinite programming hierarchy based on state polynomial optimization to determine the existence of quantum codes with given parameters. The hierarchy is complete, in the sense that a $(\!(n, K, {\delta})\!)_2$…
A longstanding open problem in coding theory is to determine the best (asymptotic) rate $R_2(\delta)$ of binary codes with minimum constant (relative) distance $\delta$. An existential lower bound was given by Gilbert and Varshamov in the…
By selecting different filter functions, spectral algorithms can generate various regularization methods to solve statistical inverse problems within the learning-from-samples framework. This paper combines distributed spectral algorithms…
In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…
The classical Moment-Sum Of Squares hierarchy allows to approximate a global minimum of a polynomial optimization problem through semidefinite relaxations of increasing size. However, for many optimization instances, solving higher order…
We study orthogonal polynomials with periodically modulated Jacobi parameters in the case when $0$ lies on the soft edge of the spectrum of the corresponding periodic Jacobi matrix. We determine when the orthogonality measure is absolutely…
This paper makes two main contributions. First, we present a pedagogical review of the derivation of the three-term recurrence relation for Legendre polynomials, without relying on the classical Legendre differential equation, Rodrigues'…
Kernel-based approach to operator approximation for partial differential equations has been shown to be unconditionally stable for linear PDEs and numerically exhibit unconditional stability for non-linear PDEs. These methods have the same…
The aim of this paper is to find the numerical solutions of the second order linear and nonlinear differential equations with Dirichlet, Neumann and Robin boundary conditions. We use the Bernoulli polynomials as linear combination to the…
This paper develops a correspondence relating convex hulls of fractional functions with those of polynomial functions over the same domain. Using this result, we develop a number of new reformulations and relaxations for fractional…
We consider polynomial Bergman kernels with respect to exponentially varying weights $e^{-n \mathscr Q(z)}$ depending on a potential $\mathscr Q:\mathbb C^d\to\mathbb R$. We use these kernels to construct determinantal point processes on…
Integration operational matrix methods based on Zernike polynomials are used to determine approximate solutions of a class of non-homogeneous partial differential equations (PDEs) of first and second order. Due to the nature of the Zernike…
We study scaling limits of deterministic Jacobi matrices at a fixed point, $x_0$, and their connection to the scaling limits of the Christoffel-Darboux kernel at that point. We show that in the case that the orthogonal polynomials are…