Related papers: Newton-Hensel Interpolation Lifting
We define the interpolated polynomial multiple zeta values as a generalization of all of multiple zeta values, multiple zeta-star values, interpolated multiple zeta values, symmetric multiple zeta values, and polynomial multiple zeta…
The Schinzel Hypothesis is a celebrated conjecture in number theory linking polynomial values and prime numbers. In the same vein we investigate the common divisors of values $P_1(n),\ldots, P_s(n)$ of several polynomials. We deduce this…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…
Given a way to evaluate an unknown polynomial with integer coefficients, we present new algorithms to recover its nonzero coefficients and corresponding exponents. As an application, we adapt this interpolation algorithm to the problem of…
We consider the problem of uniform interpolation of functions with values in a complex inner product space of finite dimension. This problem can be casted within a modified weighted pluripotential theoretic framework. Indeed, in the…
This paper concerns a commutant lifting theorem and a Nevanlinna-Pick type interpolation result in the setting of multipliers from vector-valued Drury-Arveson space to a large class of vector-valued reproducing kernel Hilbert spaces over…
Skew polynomials are a class of non-commutative polynomials that have several applications in computer science, coding theory and cryptography. In particular, skew polynomials can be used to construct and decode evaluation codes in several…
We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
When Newton's method, or Halley's method is used to approximate the $p${th} root of $1-z$, a sequence of rational functions is obtained. In this paper, a beautiful formula for these rational functions is proved in the square root case,…
We construct level-raising congruences between $p$-ordinary automorphic representations, and apply this to the problem of symmetric power functoriality for Hilbert modular forms. In particular, we prove the existence of the $n^\text{th}$…
In this paper, we introduce the so-called elliptic Askey-Wilson polynomials which are homogeneous polynomials in two special theta functions. With regard to the significance of polynomials of such kind, we establish some general elliptic…
Here we will embark on a journey starting with some ostensibly inauspicious boxes. Carefully stacking them in different ways yields amazing identities. From humble beginnings at the integer version: `how many steps does it take to get from…
In this paper we investigate polynomial interpolation using orthogonal polynomials. We use weight functions associated with orthogonal polynomials to define a weighted form of Lagrange interpolation. We introduce an upper bound of error…
The authors of ``A note on the complexity of a phaseless polynomial interpolation'' have shown that phaseless polynomial interpolation over $\mathbf{Q}$ is possible with $n+2$ points, where $n$ is the upper-bound on the degree of a…
The classical polynomial interpolation problem in several variables can be generalized to the case of points with greater multiplicities. What is known, as yet, is essentially concentrated in the Alexander-Hirschowitz Theorem which says…
Neville's algorithm is known to provide an efficient and numerically stable solution for polynomial interpolations. In this paper, an extension of this algorithm is presented which includes the derivatives of the interpolating polynomial.
We give a new construction of q-Genocchi numbers, Euler numbers of higher order, which are different than the q-Genocchi numbers of Cangul-Ozden-Simsek. By using our q-Genoucchi, Euler nimbers of higher order, we can investigate the…
We describe all of the irreducible polynomial $\mathbb{F}_p\mathrm{SL}_2(p^r)$ representations which lift to $(\mathbb{Z}/p^s\mathbb{Z})\mathrm{SL}_2(p^r)$ representations for $s>1$, observing that they almost never do. We also show that…