中文
相关论文

相关论文: Small polynomials with integer coefficients

200 篇论文

We introduce and study the unconstrained polarization (or Chebyshev) problem which requires to find an $N$-point configuration that maximizes the minimum value of its potential over a set $A$ in $p$-dimensional Euclidean space. This problem…

经典分析与常微分方程 · 数学 2021-06-30 Douglas P. Hardin , Mircea Petrache , Edward B. Saff

The main aim of this work is to apply the matrix approach of ortho\-gonal polynomials associated with infinite Hermitian definite positive matrices in relation with an important question regarding the location of zeros of Sobolev orthogonal…

泛函分析 · 数学 2025-03-20 Carmen Escribano , Raquel Gonzalo

We give a short and elementary proof of an inverse Bernstein-type inequality found by S. Khrushchev for the derivative of a polynomial having all its zeros on the unit circle. The inequality is used to show that equally-spaced points solve…

度量几何 · 数学 2015-09-23 Tamás Erdélyi , Douglas P. Hardin , Edward B. Saff

Let H(N) denote the set of all polynomials with positive integer coefficients which have their zeros in the open left half-plane. We are looking for polynomials in H(N) whose largest coefficients are as small as possible and also for…

复变函数 · 数学 2013-08-02 Albrecht Boettcher

This article is concerned with an extension of univariate Chebyshev polynomials of the first kind to the multivariate setting, where one chases best approximants to specific monomials by polynomials of lower degree relative to the uniform…

The principal character of a representation of the free group of rank two into PSL(2, C) is a triple of complex numbers that determines an irreducible representation uniquely up to conjugacy. It is a central problem in the geometry of…

复变函数 · 数学 2022-05-10 Hala Alaqad , Jianhua Gong , Gaven Martin

In this paper we present the result of successively applying a Chebyshev polynomial to a continuous random variable. In particular we show that under mild assumptions the limiting distribution will be the same as the weight with respect to…

数值分析 · 数学 2023-10-27 Javier Chico Vazquez , Andrew J. Horning

Given $n$ polynomials $p_1, \dots, p_n$ of degree at most $n$ with $\|p_i\|_\infty \le 1$ for $i \in [n]$, we show there exist signs $x_1, \dots, x_n \in \{-1,1\}$ so that \[\Big\|\sum_{i=1}^n x_i p_i\Big\|_\infty < 30\sqrt{n}, \] where…

经典分析与常微分方程 · 数学 2020-09-30 Victor Reis

We consider polynomials which take integer values on the integers (IVPs), and satisfy an additional growth condition on the natural numbers. Elkies and Speyer, answering a question by Dimitrov, showed there is a critical exponential growth…

数论 · 数学 2025-08-26 Avner Kiro , Alon Nishry

Finding point configurations, that yield the maximum polarization (Chebyshev constant) is gaining interest in the field of geometric optimization. In the present article, we study the problem of unconstrained maximum polarization on compact…

最优化与控制 · 数学 2023-03-20 Jan Rolfes , Robert Schüler , Marc Christian Zimmermann

Minimax and maximin problems are investigated for a special class of functions on the interval $[0,1]$. These functions are sums of translates of positive multiples of one kernel function and a very general external field function. Due to…

经典分析与常微分方程 · 数学 2023-02-23 Bálint Farkas , Béla Nagy , Szilárd Gy. Révész

The even and odd Zernike Polynomials R_n^m(x) can be expanded into sums of even and odd Chebyshev Polynomials T_i(x). This manuscript provides closed forms for the rational expansion coefficients c_{n,m,i} for a set of small 0 <= n-m <= 6…

经典分析与常微分方程 · 数学 2025-11-21 Richard J. Mathar

We consider the problem of estimating the support size of a discrete distribution whose minimum non-zero mass is at least $ \frac{1}{k}$. Under the independent sampling model, we show that the sample complexity, i.e., the minimal sample…

统计理论 · 数学 2016-12-13 Yihong Wu , Pengkun Yang

We solve the problem of factoring polynomials $V_n(x) \pm 1$ and $W_n(x) \pm 1$ where $V_n(x)$ and $W_n(x)$ are Chebyshev polynomials of the third and fourth kinds. The method of proof is based on previous work by Wolfram [12] for factoring…

经典分析与常微分方程 · 数学 2022-03-22 D. A. Wolfram

We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…

最优化与控制 · 数学 2024-07-25 Boulos El Hilany , Elias Tsigaridas

The century old extremal problem, solved by Carath\'eodory and Fej\'er, concerns a nonnegative trigonometric polynomial normalized by a0 = 1, and the quantity to be maximized is the coefficient a1. In the complex exponential form, the…

偏微分方程分析 · 数学 2015-05-05 Sándor Krenedits , Szilárd Gy. Révész

Ordinary differential equations and boundary value problems arise in many aspects of mathematical physics. Chebyshev differential equation is one special case of the Sturm-Liouville boundary value problem. Generating function, recursive…

历史与综述 · 数学 2020-02-05 N. Karjanto

The aim of the present work is to introduce a method based on Chebyshev polynomials for the numerical solution of a system of Cauchy type singular integral equations of the first kind on a finite segment. Moreover, an estimation error is…

数值分析 · 数学 2015-08-11 Sedaghat Shahmorad , Samad Ahdiaghdam

Consider a polynomial of large degree n whose coefficients are independent, identically distributed, nondegenerate random variables having zero mean and finite moments of all orders. We show that such a polynomial has exactly k real zeros…

概率论 · 数学 2017-04-03 Amir Dembo , Bjorn Poonen , Qi-Man Shao , Ofer Zeitouni

We consider Chebyshev polynomials, $T_n(z)$, for infinite, compact sets $\frak{e} \subset \mathbb{R}$ (that is, the monic polynomials minimizing the sup-norm, $\Vert T_n \Vert_{\frak{e}}$, on $\frak{e}$). We resolve a $45+$ year old…

经典分析与常微分方程 · 数学 2019-11-06 Jacob S. Christiansen , Barry Simon , Maxim Zinchenko