相关论文: Newton-Hensel Interpolation Lifting

The $p$-adic Newton polygon is a visual tool that encodes information about the roots and factorization of a polynomial relative to a prime $p$. In this article, we investigate how the Newton polygon changes under polynomial composition. If…

We recently introduced the Fast Newton Transform (FNT), an hierarchical algorithm for performing multivariate Newton interpolation in arbitrary downward closed polynomial spaces of spatial dimension $m$. Here, we analyze the FNT in the…

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

The classical division algorithm for polynomials requires $O(n^2)$ operations for inputs of size $n$. Using reversal technique and Newton iteration, it can be improved to $O({M}(n))$, where ${M}$ is a multiplication time. But the method…

A pattern of interpolation nodes on the disk is studied, for which the interpolation problem is theoretically unisolvent, and which renders a minimal numerical condition for the collocation matrix when the standard basis of Zernike…

Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…

Let $\mathbb{R}=(-\infty,\infty)$, and let $Q\in C^1(\mathbb{R}): \mathbb{R}\rightarrow \mathbb{R^+}=[0,\infty)$ be an even function, which is an exponent. We consider the weight $w_\rho(x)=|x|^{\rho} e^{-Q(x)}$, $\rho\geqslant 0$, $x\in…

In this paper we revisit the classical problem of polynomial interpolation, with a slight twist; namely, polynomial evaluations are available up to a group action of the unit circle on the complex plane. It turns out that this new setting…

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…

For $m,n \in \mathbb{N}$, $m\geq 1$ and a given function $f : \mathbb{R}^m\longrightarrow \mathbb{R}$, the polynomial interpolation problem (PIP) is to determine a unisolvent node set $P_{m,n} \subseteq \mathbb{R}^m$ of…

Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…

We consider the problem of recovering (that is, interpolating) and identity testing of a "hidden" monic polynomial $f$, given an oracle access to $f(x)^e$ for $x\in{\mathbb F_q}$ (extension fields access is not permitted). The naive…

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

Given a prime $p\geq 5$, we reduce modulo p a convolution of order p-1 of powers of two weighted Bernoulli numbers with Bernoulli numbers in terms of harmonic numbers and generalized harmonic numbers. Our proof is based on studying the…

Let k>1 be an integer and let p be a prime. We show that if $p^a\le k<2p^a$ or $k=p^aq+1$ (with 2q<p) for some a=1,2,..., then the set {\binom{n}{k}: n=0,1,2,...} is dense in the ring Z_p of p-adic integers, i.e., it contains a complete…

We present a new closed form for the interpolating polynomial of the general univariate Hermite interpolation that requires only calculation of polynomial derivatives, instead of derivatives of rational functions. This result is used to…

Lifting theorems are theorems that bound the communication complexity of a composed function $f\circ g^{n}$ in terms of the query complexity of $f$ and the communication complexity of $g$. Such theorems constitute a powerful generalization…

Recently Brownawell and the second author proved a "non-degenerate" case of the (unproved) "Zilber Nullstellensatz" in connexion with "Strong Exponential Closure". Here we treat some significant new cases. In particular these settle…

Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…