Related papers: Fast associated classical orthogonal polynomial tr…
We consider multiple orthogonal polynomials associated with the exponential cubic weight e^{-x^3} over two contours in the complex plane. We study the basic properties of these polynomials, including the Rodrigues formula and…
Exact eigenvalue correlation functions are computed for large $N$ hermitian one-matrix models with eigenvalues distributed in two symmetric cuts. An asymptotic form for orthogonal polynomials for arbitrary polynomial potentials that support…
This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some output variables are also input variables, linked by a linear dependency. Fundamental examples include the…
We consider the disjoint bilinear programming problem in which one of the disjoint subsets has the structure of an acute-angled polytope. An optimality criterion for such a problem is formulated and proved, and based on this, a polynomial…
It is known that the unified transform method may be used to solve any well-posed initial-boundary value problem for a linear constant-coefficient evolution equation on the finite interval or the half-line. In contrast, classical methods…
Utilizing an appropriate ansatz to the wave function, we reproduce the exact bound-state solutions of the radial Schrodinger equation to various exactly solvable sextic anharmonic oscillator and confining perturbed Coulomb models in…
In this paper, we consider the problem of accelerating the numerical simulation of time dependent problems by time domain decomposition. The available algorithms enabling such decompositions present severe efficiency limitations and are an…
The class of differential-equation eigenvalue problems $-y''(x)+x^{2N+2}y(x)=x^N Ey(x)$ ($N=-1,0,1,2,3,...$) on the interval $-\infty<x<\infty$ can be solved in closed form for all the eigenvalues $E$ and the corresponding eigenfunctions…
A new (algebraic) approximation scheme to find {\sl global} solutions of two point boundary value problems of ordinary differential equations (ODE's) is presented. The method is applicable for both linear and nonlinear (coupled) ODE's whose…
Orthogonal polynomials on the real line always satisfy a three-term recurrence relation. The recurrence coefficients determine a tridiagonal semi-infinite matrix (Jacobi matrix) which uniquely characterizes the orthogonal polynomials. We…
We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…
Recently there has been a renewed interest in an extension of the notion of orthogonal polynomials known as multiple orthogonal polynomials. This notion comes from simultaneous rational approximation (Hermite-Pade approximation) of a system…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
We revisit the classical problem of construction of a fundamental system of solutions to a linear ODE whose elements remain analytic and linearly independent for all values of the roots of the characteristic polynomial.
In this paper we study sharp estimates for the Schr\"odinger operator via the framework of orthogonal polynomials. We use spherical harmonics and Gegenbauer polynomials to prove a new weighted inequality for the Schr\"odinger equation that…
We study the inverse problem in the theory of (standard) orthogonal polynomials involving two polynomials families $(P_n)_n$ and $(Q_n)_n$ which are connected by a linear algebraic structure such as $$P_n(x)+\sum_{i=1}^N…
Constrained orthogonal polynomials have been recently introduced in the study of the Hohenberg-Kohn functional to provide basis functions satisfying particle number conservation for an expansion of the particle density. More generally, we…
We present an algorithm to find invariant poynomial transformations of integer sequences, using the classical invariant theory approach.
In this paper, we establish a connection between Apollonian packings and knot theory. We introduce new representations of links realized in the tangency graph of the regular crystallographic sphere packings. Particularly, we prove that any…
Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…