English
Related papers

Related papers: Univalent polynomials and Koebe's one-quarter theo…

200 papers

Let $f_1,\dots,f_k\in\mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an integer $n<x$ such that the fractional parts $\|f_i(n)\|\ll x^{c/k}$ for all $1\le i\le k$ and for some constant…

Number Theory · Mathematics 2020-11-25 James Maynard

Given a polynomial $p$ with no zeros in the polydisk, or equivalently the poly-upper half-plane, we study the problem of determining the ideal of polynomials $q$ with the property that the rational function $q/p$ is bounded near a boundary…

Complex Variables · Mathematics 2025-07-15 Kelly Bickel , Greg Knese , James Eldred Pascoe , Alan Sola

We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zhao and Ortega-Moreno give some general information on zeros of real and complex polynomials restricted to the unit sphere. As a corollary of…

Metric Geometry · Mathematics 2022-08-16 Alexey Glazyrin , Roman Karasev , Alexandr Polyanskii

We introduce the class of analytic functions $$\mathcal{F}(\psi):= \left\{f\in \mathcal{A}: \left(\frac{zf'(z)}{f(z)}-1\right) \prec \psi(z),\; \psi(0)=0 \right\},$$ where $\psi$ is univalent and establish the growth theorem with some…

Complex Variables · Mathematics 2020-09-08 S. Sivaprasad Kumar , Kamaljeet Gangania

Let a polynomial $f \in \mathbb{Z}[X_1,\ldots,X_n]$ be given. The square sieve can provide an upper bound for the number of integral $\mathbf{x} \in [-B,B]^n$ such that $f(\mathbf{x})$ is a perfect square. Recently this has been generalized…

Number Theory · Mathematics 2026-03-25 Dante Bonolis , Lillian B. Pierce

If $f$ is a real-valued function on $[-\pi,\pi]$ that is Henstock--Kurzweil integrable, let $u_r(\theta)$ be its Poisson integral. It is shown that $\|u_r\|_p=o(1/(1-r))$ as $r\to 1$ and this estimate is sharp for $1\leq p\leq\infty$. If…

Classical Analysis and ODEs · Mathematics 2007-05-23 Erik Talvila

Jung's theorem says that planar sets of diameter $1$ can be covered by a closed circular disk of radius $\frac 1{\sqrt3}$. In this paper we consider a fractional Jung-type problem for finite planar point-sets. Let $\mathcal{P}_n$ be the…

Combinatorics · Mathematics 2025-12-03 András Bezdek , Owen Henderschedt

We prove the classical result, which goes back at least to Fourier, that a polynomial with real coefficients has all zeros real and distinct if and only if the polynomial and also all of its nonconstant derivatives have only negative minima…

Classical Analysis and ODEs · Mathematics 2020-10-30 David W. Farmer

We investigate the structure of polynomials of degree four in many variables over a fixed prime field $\mathbb{F}=\mathbb{F}_{p}$. In 2007, Green and Tao proved that if a polynomial $f:\mathbb{F}^{n}\rightarrow\mathbb{F}$ is poorly…

Combinatorics · Mathematics 2019-03-05 Amichai Lampert

Let ${\mathcal S}$ denote the set of all univalent analytic functions $f(z)=z+\sum_{n=2}^{\infty}a_n z^n$ on the unit disk $|z|<1$. In 1946 B. Friedman found that the set $\mathcal S$ of those functions which have integer coefficients…

Complex Variables · Mathematics 2012-07-17 S. Ponnusamy , J. Qiao

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

Symbolic Computation · Computer Science 2025-02-10 Nicolas Faroß , Thomas Sturm

Let function $f$ be analytic in the unit disk ${\mathbb D}$ and be normalized so that $f(z)=z+a_2z^2+a_3z^3+\cdots$. In this paper we give sharp bounds of the modulus of its second, third and fourth coefficient, if $f$ satisfies \[…

Complex Variables · Mathematics 2018-10-15 Milutin Obradovic , Nikola Tuneski

Let $f$ be function that is analytic in the unit disk ${\mathbb D}=\{z:|z|<1\}$, normalized such that $f(0)=f'(0)-1=0$, i.e., of type $f(z)=z+\sum_{n=2}^{\infty} a_n z^n$. If additionally, \[ \left| \left(\frac{z}{f(z)}\right)^2 f'(z)…

Complex Variables · Mathematics 2021-04-23 Milutin Obradović , Nikola Tuneski

We estimate the number of zeros of a polynomial in $\mathbb{C}[z]$ within any small circular disc centered on the unit circle, which improves and comprehensively extends a result established by Borwein, Erd{\'e}lyi, and Littmann~\cite{BE1}…

Complex Variables · Mathematics 2024-07-23 Mithun Kumar Das

A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…

Algebraic Geometry · Mathematics 2023-03-09 Cordian Riener , Robin Schabert

An integer-valued multiplicative function $f$ is said to be polynomially-defined if there is a nonconstant separable polynomial $F(T)\in \mathbb{Z}[T]$ with $f(p)=F(p)$ for all primes $p$. We study the distribution in coprime residue…

Number Theory · Mathematics 2023-05-31 Paul Pollack , Akash Singha Roy

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The…

Commutative Algebra · Mathematics 2014-03-03 Konstantin Ziegler

We consider degree-d forms on the Euclidean unit sphere. We specialize to our setting a genericity result by Nie obtained in a more general framework. We exhibit an homogeneous polynomial Res in the coefficients of f , such that if Res(f) =…

Algebraic Geometry · Mathematics 2021-05-05 Jean-Bernard Lasserre

We prove a nearly polynomial inverse theorem for the Gowers $U^d$ norm, over finite fields of non-small characteristic, for polynomials of degree $d+1$. The case of degree $d$ was very recently settled by Mili\'{c}evi\'{c} and…

Combinatorics · Mathematics 2026-05-01 Tomer Milo , Guy Moshkovitz

We present a new data structure to approximate accurately and efficiently a polynomial $f$ of degree $d$ given as a list of coefficients. Its properties allow us to improve the state-of-the-art bounds on the bit complexity for the problems…

Symbolic Computation · Computer Science 2021-11-30 Guillaume Moroz