中文
相关论文

相关论文: Chebyshev approximation of $x^m (-\log x)^l$ in th…

200 篇论文

Let $(f_n)_{n=1}^\infty$ be a sequence of nonlinear polynomials satisfying some mild conditions. Furthermore, let $F_m(z)=(f_m\circ f_{m-1}\ldots \circ f_1)(z)$ and $\rho_m$ be the leading coefficient for $F_m$. It is shown that on the…

动力系统 · 数学 2016-09-01 Gökalp Alpan

Integrals involving derivatives of Legendre polynomials frequently arise in applications ranging from multipole expansions for processes involving electromagnetic probes to spectral methods in numerical physics. Despite their practical…

数学物理 · 物理学 2025-09-30 Yannick Wunderlich , Kyungseon Joo , Victor I. Mokeev

For an integer $a$ consider the sequence $(T_{n}(a)-1)_{n=1}^{\infty}$ defined by the Chebyshev polynomials $T_{n}$. We list all pairs $(n,a)$ for which the term $T_{n}(a)-1$ has no primitive prime divisor.

数论 · 数学 2021-12-07 Stefan Barańczuk

In the present work, we present a new discrete logarithm algorithm, in the same vein as in recent works by Joux, using an asymptotically more efficient descent approach. The main result gives a quasi-polynomial heuristic complexity for the…

密码学与安全 · 计算机科学 2013-11-27 Razvan Barbulescu , Pierrick Gaudry , Antoine Joux , Emmanuel Thomé

We improve the unconditional explicit bounds for the error term in the prime counting function $\psi(x)$. In particular, we prove that, for all $x>2$, we have \[ \left| \psi(x)-x \right| < 9.22106 \, x \, (\log x)^{3/2}…

数论 · 数学 2023-05-18 Andrew Fiori , Habiba Kadiri , Joshua Swidinsky

We present an algorithm for computing asymptotic approximations of roots of polynomials with exp-log function coefficients. The real and imaginary parts of the approximations are given as explicit exp-log expressions. We provide a method…

符号计算 · 计算机科学 2019-04-16 Adam Strzeboński

We discuss a general approach producing quantitative bounds on the number of sign changes of the weighted sums $$\sum_{n\le x}f(n)w_n$$ where $f:\mathbb{N}\to \mathbb{R}$ is a family of multiplicative functions and $w_n\in\mathbb{R}$ are…

数论 · 数学 2024-10-18 Oleksiy Klurman , Youness Lamzouri , Marc Munsch

We present a method to determine the impurity Greens function of the interacting resonant level model (IRLM) using numerical simulation techniques based on the expansion of a resolvent expression in terms of Chebyshev polynomials. The…

强关联电子 · 物理学 2015-06-17 Alexander Braun , Peter Schmitteckert

The finite n-th polylogarithm li_n(z) in Z/p[z] is defined as the sum on k from 1 to p-1 of z^k/k^n. We state and prove the following theorem. Let Li_k:C_p to C_p be the p-adic polylogarithms defined by Coleman. Then a certain linear…

数论 · 数学 2007-05-23 Amnon Besser

In this paper we study a family of polynomials $$S_n^{(m)}(x):=\sum_{i,j=0}^n\binom ni^m\binom nj^m\binom{i+j}ix^{i+j}\ \ (m,n=0,1,2,\ldots).$$ For example, we show that $$\sum_{k=0}^{p-1}S_k^{(0)}(x)\equiv\frac…

数论 · 数学 2026-02-11 Zhi-Wei Sun

Laguerre's theorem regarding the number of non-real zeros of a polynomial and its image under certain linear operators is generalized. This generalization is then used to (1) exhibit a number of previously undiscovered complex zero…

The aim of the present work is to show that the results obtained earlier on the approximation of distributions of sums of independent summands by infinitely divisible laws may be transferred to the estimation of the closeness of…

概率论 · 数学 2022-08-04 Friedrich Götze , Andrei Yu. Zaitsev , Dmitry Zaporozhets

Using Chebyshev polynomialsof both kinds, we construct rational fractions which are convergents of the smallest root of $x^2-\alpha x+1$ for $\alpha=3,4,5,\dots$.Some of the underlying identities suggest an identity involving…

组合数学 · 数学 2015-10-01 Roland Bacher

We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials, and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves…

经典分析与常微分方程 · 数学 2007-05-23 Igor Rivin

An extension of the theory of the Iterated Logarithmic Algebra gives the logarithmic analog of a Sheffer or Appell sequence of polynomials. This leads to several examples including Stirling's formula and a logarithmic version of the…

组合数学 · 数学 2016-09-06 Daniel E. Loeb

For 0 < x < 1, take the binary expansion with infinitely many 0's, replace each 0 with -1, this gives the polarized binary expansion of x. Let R_i(x) be the ith "polarized bit" and let S_n(x) be the sum of the first n R_i(x). {S_n} is the…

概率论 · 数学 2019-11-13 Vladimir Dobric , Marina Skyers , Lee J. Stanley

In this article, we give explicit bounds of order $\log t$ for $\sigma$ close to $1$, for two quantities: $|\zeta'(\sigma +it)/\zeta(\sigma +it)|$ and $|1/\zeta(\sigma +it)|$. We correct an error in the literature, and especially in the…

数论 · 数学 2026-02-03 Nicol Leong

$\bar\partial$-extension of the matrix Riemann-Hilbert method is used to study asymptotics of the polynomials $P_n(z)$ satisfying orthogonality relations \[ \int_{-1}^1 x^lP_n(x)\frac{\rho(x)dx}{\sqrt{1-x^2}}=0, \quad l\in\{0,\ldots,n-1\},…

经典分析与常微分方程 · 数学 2022-02-22 Maxim L. Yattselev

We give upper and lower bounds for weighted Chebyshev and residual polynomials on subsets of the real line. As an application, we prove a Szeg\H{o}-type theorem in the setting of Parreau--Widom sets.

经典分析与常微分方程 · 数学 2025-02-18 Jacob S. Christiansen , Barry Simon , Maxim Zinchenko

The Chernoff approximation method is a powerful and flexible tool of functional analysis, which allows in many cases to express exp(tL) in terms of variable coefficients of a linear differential operator L. In this paper, we prove a theorem…

泛函分析 · 数学 2025-03-31 Ivan D. Remizov