English
Related papers

Related papers: Sharp bounds for some segments of bounded power se…

200 papers

Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…

Algebraic Geometry · Mathematics 2025-06-09 Yifan Zhang , Joe Kileel

We investigate power series that converge to a bounded function on the real line. First, we establish relations between coefficients of a power series and boundedness of the resulting function; in particular, we show that boundedness can be…

Classical Analysis and ODEs · Mathematics 2024-01-26 Davide Sclosa

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

Commutative Algebra · Mathematics 2021-08-31 Wei Li , Alexey Ovchinnikov , Gleb Pogudin , Thomas Scanlon

In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…

Algebraic Geometry · Mathematics 2024-12-24 Kartoue Mady Demdah , Ibrahim Nonkane

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.

Classical Analysis and ODEs · Mathematics 2025-02-18 Jacob S. Christiansen , Barry Simon , Maxim Zinchenko

Assume that $V_h$ is a space of piecewise polynomials of degree less than $r\geq 1$ on a family of quasi-uniform triangulation of size $h$. Then the following well-known upper bound holds for a sufficiently smooth function $u$ and $p\in [1,…

Numerical Analysis · Mathematics 2011-06-23 Qun Lin , Hehu Xie , Jinchao Xu

We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…

Numerical Analysis · Mathematics 2010-04-22 Richard P. Brent

In this note, we shall give an improved lower bound for the argument of a power of a given algebraic number which has absolute value one but is not a root of unity.

Number Theory · Mathematics 2025-06-03 Tomohiro Yamada

This paper is mainly concerned with the disk of convergence of a power series s(x) representing an algebraic function of x and specifically with the relation between this disk and the branch points of the function. We shall focus especially…

Number Theory · Mathematics 2025-12-02 Francesco Veneziano , Umberto Zannier

We study polynomials with no zeros on the unit ball in complex Euclidean space with a view toward characterizing when a rational function is bounded on the ball. We give a complete local description of such polynomials in two variables near…

Complex Variables · Mathematics 2026-02-25 Greg Knese , James Eldred Pascoe , Alan Sola

In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative weakly irreducible tensor. We also apply these bounds to the adjacency spectral radius and signless Laplacian spectral radius of a uniform…

Combinatorics · Mathematics 2018-07-31 Lihua You , Xiaohua Huang , Xiying Yuan

This article is devoted to the sharp improvement of the classical Bohr inequality for bounded analytic functions defined on the unit disk. We also prove two other sharp versions of the Bohr inequality by replacing the constant term by the…

Complex Variables · Mathematics 2020-04-21 Amir Ismagilov , Ilgiz R Kayumov , Saminathan Ponnusamy

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Grégoire Lecerf , Éric Schost

In this paper, we prove effective upper bounds for effective sections of line bundles on projective varieties and hermitian line bundles on arithmetic varieties in terms of the volumes. They are effective versions of the Hilbert--Samuel…

Number Theory · Mathematics 2014-01-23 Xinyi Yuan , Tong Zhang

We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.

Combinatorics · Mathematics 2025-10-06 Ritesh Goenka , Kenneth Moore , Ethan Patrick White

We prove uniform linear bounds on the volume variation under drilling and filling operations on finite volume hyperbolic 3-manifolds.

Geometric Topology · Mathematics 2026-02-12 Gabriele Viaggi

In this paper, we provide an efficient method for computing the Taylor coefficients of $1-p_n f$, where $p_n$ denotes the optimal polynomial approximant of degree $n$ to $1/f$ in a Hilbert space $H^2_\omega$ of analytic functions over the…

Complex Variables · Mathematics 2019-11-22 Catherine Bénéteau , Myrto Manolaki , Daniel Seco

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…

Number Theory · Mathematics 2019-02-12 Gareth Boxall , Gareth Jones , Harry Schmidt

We introduce two explicit examples of polynomials orthogonal on the unit circle. Moments and the reflection coefficients are expressed in terms of Jacobi elliptic functions. We find explicit expression for these polynomials in terms of a…

Classical Analysis and ODEs · Mathematics 2007-12-18 Alexei Zhedanov

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

Combinatorics · Mathematics 2015-02-10 Aleksi Saarela
‹ Prev 1 3 4 5 6 7 10 Next ›