Related papers: Chebyshev type lattice path weight polynomials by …
In this paper we prove that any degree $d$ deformation of a generic logarithmic polynomial differential equation with a persistent center must be logarithmic again. This is a generalization of Ilyashenko's result on Hamiltonian differential…
We express a weighted generalization of the Delannoy numbers in terms of shifted Jacobi polynomials. A specialization of our formulas extends a relation between the central Delannoy numbers and Legendre polynomials, observed over 50 years…
In earlier works on Shape Dynamics (SD), a linear method of solving a particular set of Lichnerowicz-type equations through the implicit function theorem was developed in order to implicitly construct SD's global Hamiltonian and eliminate…
We provide a representation in terms of certain canonical functions for a sequence of polynomials orthogonal with respect to a weight that is strictly positive and analytic on the unit circle. These formulas yield a complete asymptotic…
In this paper, we achieve three primary objectives related to the rigorous computational analysis of nonlinear PDEs posed on complex geometries such as disks and cylinders. First, we introduce a validated Matrix Multiplication Transform…
Let $(X_t)_{t\ge0}$ denote a non-commutative monotone L\'evy process. Let $\omega=(\omega(t))_{t\ge0}$ denote the corresponding monotone L\'evy noise.. A continuous polynomial of $\omega$ is an element of the corresponding non-commutative…
In a recent breakthrough work, Gartland and Lokshtanov [FOCS 2020] showed a quasi-polynomial-time algorithm for Maximum Weight Independent Set in $P_t$-free graphs, that is, graphs excluding a fixed path as an induced subgraph. Their…
Lattice models are valuable tools to gain insight into the statistical physics of heteropolymers. We rigorously map the partition function of these models into a vacuum expectation value of a $\mathbb{Z}_2$ lattice gauge theory (LGT), with…
In this work, we introduce a method based on piecewise polynomial interpolation to enclose rigorously solutions of nonlinear ODEs. Using a technique which we call a priori bootstrap, we transform the problem of solving the ODE into one of…
In this paper, we study the mesoscopic fluctuations at edges of orthogonal polynomial ensembles with both continuous and discrete measures. Our main result is a Central limit Theorem (CLT) for linear statistics at mesoscopic scales. We show…
The Cholesky factorization of the moment matrix is applied to discrete orthogonal polynomials on the homogeneous lattice. In particular, semiclassical discrete orthogonal polynomials, which are built in terms of a discrete Pearson equation,…
A formula expressing free cumulants in terms of the Jacobi parameters of the corresponding orthogonal polynomials is derived. It combines Flajolet's theory of continued fractions and Lagrange inversion. For the converse we discuss…
In this paper, we present a new method for the solution of those linear transport processes that may be described by a Master Equation, such as electron, neutron and photon transport, and more exotic variants thereof. We base our algorithm…
We develop Chebyshev symplectic methods based on Chebyshev orthogonal polynomials of the first and second kind separately in this paper. Such type of symplectic methods can be conveniently constructed with the newly-built theory of weighted…
This paper initiates a systematic study of connections between undirected colored graphs and associated two-variable stable polynomials obtained via Cauchy transform-type formulas. Examples of such stable polynomials have played crucial…
To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…
We study lattice point visibility along polynomial lines of sight and prove the Visibility Density Conjecture of Chaubey and Pandey for a large class of polynomials.
Matrix-valued Cauchy bi-orthogonal polynomials were proposed in this paper, together with its quasideterminant expression. It is shown that the coefficients in four-term recurrence relation for matrix-valued Cauchy bi-orthogonal polynomials…
A {\em Motzkin path} of length $n$ is a lattice path from $(0,0)$ to $(n,0)$ in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of horizontal-steps $(1, 0)$, up-steps $(1,1)$, and down-steps $(1,-1)$, which never passes…
A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…