Related papers: Laurent polynomial moment problem: a case study
In this paper, we consider the problem of representing any polynomial in terms of the degenerate Bernoulli polynomials and more generally of the higher-order degenerate Bernoulli polynomials. We derive explicit formulas with the help of…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
We study the convergence of the Laurent polynomials of Lagrange interpolation on the unit circle for continuous functions satisfying a condition about their modulus of continuity. The novelty of the result is that now the nodal systems are…
The boundary problem for graphs like Pascal's but with general multiplicities of edges is related to a `backward' problem of moments of the Hausdorff type.
Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an…
Following the work of Conrey, Rubinstein and Snaith and Forrester and Witte we examine a mixed moment of the characteristic polynomial and its derivative for matrices from the unitary group U(N) (also known as the CUE) and relate the moment…
In this paper we study the consequences of overinterpolation, i.e., the situation when a function can be interpolated by polynomial, or rational, or algebraic functions in more points that normally expected. We show that in many cases such…
We study the locus of the Circumcenter of Mass of Poncelet polygons, and the limit of the Center of Mass (when we consider the polygon as a "homogeneous lamina") for degenerate Poncelet polygons. We also provide a proof for one of Dan…
This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate…
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given propositional knowledge base. We give a general algorithm, based…
Monte Carlo is famous for accepting model extensions and model refinements up to infinite dimension. However, this powerful incremental design is based on a premise which has severely limited its application so far: a state-variable can…
Starting from the moment sequences of classical orthogonal polynomials we derive the orthogonality purely algebraically. We consider also the moments of ($q=1$) classical orthogonal polynomials, and study those cases in which the…
This work provides a detailed study of Meixner-Pollaczek polynomials and employs the central difference operator to study the Sturm-Liouville problem. It presents two linearly independent solutions to the recursion relation, along with the…
We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…
The Abel differential equation $y'=p(x)y^3 + q(x) y^2$ with polynomial coefficients $p,q$ is said to have a center on $[a,b]$ if all its solutions, with the initial value $y(a)$ small enough, satisfy the condition $y(a)=y(b)$. The problem…
A classical result due to Bochner classifies the orthogonal polynomials on the real line which are common eigenfunctions of a second order linear differential operator. We settle a natural version of the Bochner problem on the unit circle…
The Poincare algebra of classical electrodynamics in one spatial dimension is studied using light-cone coordinates and ordinary Minkowski coordinates. We show that it is possible to quantize the theory by a canonical quantization procedure…
We describe various aspects of the Al-Salam-Carlitz $q$-Charlier polynomials. These include combinatorial descriptions of the moments, the orthogonality relation, and the linearization coefficients.
For any polynomial f with complex coefficients we find a remarkable subset of poles of the motivic zeta function. It is combinatorially determined by any log resolution and it admits an intrinsic interpretation in terms of contact loci of…
In this note I provide two extensions of a particular case of the classical Poncelet theorem.