English
Related papers

Related papers: Small polynomials with integer coefficients

200 papers

Let $\Gamma$ be a $C^{2+}$ Jordan arc and let $\Gamma_0$ be the open arc which consists of interior points of $\Gamma$. We find concrete upper and lower bounds for the limit of Widom factors for $L_2(\mu)$ extremal polynomials on $\Gamma$…

Classical Analysis and ODEs · Mathematics 2021-08-05 Gökalp Alpan

We use recent results about linking the number of zeros on algebraic varieties over $\mathbb{C}$, defined by polynomials with integer coefficients, and on their reductions modulo sufficiently large primes to study congruences with products…

Number Theory · Mathematics 2022-07-25 Bryce Kerr , Jorge Mello , Igor Shparlinski

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Computational Geometry · Computer Science 2014-03-20 Orit E. Raz , Micha Sharir , József Solymosi

We consider the problem of minimizing a polynomial function over the integer lattice. Though impossible in general, we use a known sufficient condition for the existence of continuous minimizers to guarantee the existence of integer…

Optimization and Control · Mathematics 2015-02-19 Sönke Behrends , Ruth Hübner , Anita Schöbel

In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polynomials have small degree. Their idea is to use Karatsuba's…

Computational Complexity · Computer Science 2013-09-10 Pascal Giorgi

To analyze the absolute condition number of multivariate polynomial interpolation on Lissajous-Chebyshev node points, we derive upper and lower bounds for the respective Lebesgue constant. The proof is based on a relation between the…

Numerical Analysis · Mathematics 2017-11-13 Peter Dencker , Wolfgang Erb , Yurii Kolomoitsev , Tetiana Lomako

We introduce quantized Chebyshev polynomials as deformations of generalized Chebyshev polynomials previously introduced by the author in the context of acyclic coefficient-free cluster algebras. We prove that these quantized polynomials…

Representation Theory · Mathematics 2010-06-02 G. Dupont

A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…

Data Structures and Algorithms · Computer Science 2017-02-10 Nima Anari , Shayan Oveis Gharan

For a measure on a subset of the complex plane we consider $L^p$-optimal weighted polynomials, namely, monic polynomials of degree $n$ with a varying weight of the form $w^n = {\rm e}^{-n V}$ which minimize the $L^p$-norms, $1 \leq p \leq…

Classical Analysis and ODEs · Mathematics 2009-10-23 F. Balogh , M. Bertola

Uniform polynomial approximation, also called minimax approximation or Chebyshev approximation, consists in searching polynomial approximation that minimizes the worst case error. Optimality conditions for the uniform approximation of…

Numerical Analysis · Mathematics 2026-05-29 Alexandre Goldsztejn

In this paper we follow the general approach, proposed earlier by the first author, which is derived from the invariant theory field and provides a way of obtaining of the polynomial identities for any arbitrary polynomial family. We…

Combinatorics · Mathematics 2019-10-25 Leonid Bedratyuk , Nataliia Luno

We obtain new effective results in best approximation theory, specifically moduli of uniqueness and constants of strong unicity, for the problem of best uniform approximation with bounded coefficients, as first considered by Roulier and…

Classical Analysis and ODEs · Mathematics 2021-12-30 Andrei Sipos

Let $f,g_1,\dots,g_m$ be polynomials with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Denote by $\text{diag}(g)$ the diagonal matrix with coefficients $g=(g_1,\dots,g_m)$ and denote by $\nabla g$ the Jacobian of $g$. Let…

Optimization and Control · Mathematics 2023-01-24 Ngoc Hoang Anh Mai

In this paper we evaluate Chebyshev polynomials of the second-kind on a class of symmetric integer matrices, namely on adjacency matrices of simply laced Dynkin and extended Dynkin diagrams. As an application of these results we explicitly…

Representation Theory · Mathematics 2010-10-20 Karin Erdmann , Sibylle Schroll

The first part of this paper complements previous results on characterization of polynomials of least deviation from zero in Sobolev $p$-norm ($1<p<\infty$) for the case $p=1$. Some relevant examples are indicated. The second part deals…

Complex Variables · Mathematics 2021-12-17 Abel Díaz-González , Héctor Pijeira-Cabrera , Javier Quintero-Roba

The classical P\'olya-Tchebotarev problem, commonly stated as a max-min logarithmic energy problem, asks for finding a compact of minimal capacity in the complex plane which connects a prescribed collection of fixed points. Variants of this…

Classical Analysis and ODEs · Mathematics 2025-03-25 Victor Alves , Guilherme Silva

We obtain polylogarithmic bounds in the polynomial Szemer\'{e}di theorem when the polynomials have distinct degrees and zero constant terms. Specifically, let $P_1, \dots, P_m \in \mathbb Z[y]$ be polynomials with distinct degrees, each…

Number Theory · Mathematics 2025-11-12 Xuancheng Shao , Mengdi Wang

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…

Classical Analysis and ODEs · Mathematics 2007-05-23 Igor Rivin

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

Symbolic Computation · Computer Science 2011-11-10 Jean-Guillaume Dumas

We investigate Chebyshev polynomials corresponding to Jacobi weights and determine monotonicity properties of their related Widom factors. This complements work by Bernstein from 1930-31 where the asymptotical behavior of the related…

Classical Analysis and ODEs · Mathematics 2024-09-05 Jacob S. Christiansen , Olof Rubin
‹ Prev 1 4 5 6 7 8 10 Next ›