English
Related papers

Related papers: The Kadets 1/4 theorem for polynomials

200 papers

Given positive integers m,n,s,t, let z(m,n,s,t) be the maximum number of ones in a (0,1) matrix of size m-by-n that does not contain an all ones submatrix of size s-by-t. We find a flexible upper bound on z(m,n,s,t) that implies the known…

Combinatorics · Mathematics 2009-04-01 Vladimir Nikiforov

We prove $L^p$ bounds, $\frac{d^2 + 4d + 2}{(d+1)^2} < p < 2(d+1)$, for maximal linear modulations of singular integrals along paraboloids with frequencies in certain subspaces of $\mathbb{R}^{d+1}$, for $d \geq 2$. This generalizes…

Classical Analysis and ODEs · Mathematics 2025-10-02 Lars Becker

Given a map f:Z-->Z and an initial argument alpha, we can iterate the map to get a finite set of iterates modulo a prime p. In particular, for a quadratic map f(z)=z^2 +c, c constant, work by Pollard suggests that this set should have…

Number Theory · Mathematics 2012-01-26 William Worden

The following ``Key Lemma'' plays an important role in Parusinski's work on the existence of Lipschitz stratifications in the class of semianalytic sets: For any positive integer n, there is a finite set of homogeneous symmetric polynomials…

Algebraic Geometry · Mathematics 2007-05-23 Zinovy Reichstein , Boris Youssin

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n,$ where the coefficients $a_j,$ $j \in \{0,1,2,\cdots n\},$ may be complex. We impose some restriction on the coefficients of the real part of the given polynomial…

Complex Variables · Mathematics 2016-09-27 Eze R. Nwaeze

The Collatz Conjecture (also known as the 3x+1 Problem) proposes that the following algorithm will, after a certain number of iterations, always yield the number 1: given a natural number, multiply by three and add one if the number is odd,…

Number Theory · Mathematics 2020-01-28 Matt Hohertz , Bahman Kalantari

What is the maximum possible value of the lead coefficient of a degree $d$ polynomial $Q(x)$ if $|Q(1)|,|Q(2)|,\ldots,|Q(k)|$ are all less than or equal to one? More generally we write $L_{d,[x_k]}(x)$ for what we prove to be the unique…

Number Theory · Mathematics 2015-06-11 Karl Levy

The well-known Hermite-Biehler theorem claims that a univariate monic polynomial s of degree k has all roots in the open upper half-plane if and only if s=p+iq where p and q are real polynomials of degree k and k-1 resp. with all real,…

Classical Analysis and ODEs · Mathematics 2025-07-01 V. Kostov , B. Shapiro , M. Tyaglov

Let K/Q be Galois, and let eta in K* whose conjugates are multiplicatively independent. For a prime p, unramified, prime to eta, let np be the residue degree of p and gp the number of P I p, then let o\_P(eta) and o\_p(eta) be the orders of…

Number Theory · Mathematics 2021-08-06 Georges Gras

We improve by an exponential factor the lower bound of Korner and Muzi for the cardinality of the largest family of Hamilton paths in a complete graph of n vertices in which the union of any two paths has degree 4. The improvement is…

Combinatorics · Mathematics 2015-05-05 Janos Korner , Angelo Monti

We study the roots of a random polynomial over the field of p-adic numbers. For a random monic polynomial with coefficients in $\mathbb{Z}_p$, we obtain an asymptotic formula for the factorial moments of the number of roots of this…

Number Theory · Mathematics 2022-04-08 Roy Shmueli

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n$ having no zeros in the unit disk. ~Then it is well known that for $R\geq 1,$ $\displaystyle{\max_{|z|=R}|p(z)|}\leq…

Complex Variables · Mathematics 2016-10-27 Eze R. Nwaeze

In this paper, we extend the Marcinkiewicz--Zygmund inequality to the setting of Orlicz and Lorentz spaces. Furthermore, we generalize a Kadec--Pe{\l}czy\'nski-type result -- originally established by the first and third authors for $L^p$…

Functional Analysis · Mathematics 2026-03-16 Istvan Berkes , Eduard Stefanescu , Robert Tichy

We study the maximum modulus set, $\mathcal{M}(p)$, of a polynomial $p$. We are interested in constructing $p$ so that $\mathcal{M}(p)$ has certain exceptional features. Jassim and London gave a cubic polynomial $p$ such that…

Complex Variables · Mathematics 2020-07-16 L. Pardo-Simón , D. J. Sixsmith

We prove several results about zeros of paraorthogonal polynomials using the theory of rank one perturbations of unitary operators. In particular, we obtain new details on the interlacing of zeros for successive POPUC.

Spectral Theory · Mathematics 2007-05-23 Barry Simon

We give a Schinzel-Zassenhaus-type lower bound for the maximum modulus of roots of a monic integer polynomial with all roots symmetric with respect to the unit circle. Our results extend a recent work of Dimitrov, who proved the general…

Number Theory · Mathematics 2021-01-19 Igor E. Pritsker

We develop an effective version of Kronecker's Theorem on the splitting of polynomials, based on asymptotic arguments proposed by the Chudnovsky brothers, coming from Hermite-Pad\'e approximation. In conjunction with Honda's proof of the…

Number Theory · Mathematics 2026-03-13 Florian Fürnsinn , Lucas Pannier

Extending the methods developed in the author's previous paper and using adapted coordinate systems in two variables, an L^p boundedness theorem is proven for maximal operators over hypersurfaces in R^3 when p > 2. When the best possible p…

Classical Analysis and ODEs · Mathematics 2010-08-25 Michael Greenblatt

We introduce a sequence P_d of monic reciprocal polynomials with integer coefficients having the central coefficients fixed as well as the peripheral coefficients. We prove that the ratio between number of nonunimodular roots of P_d and its…

Number Theory · Mathematics 2022-03-16 Dragan Stankov

The Zarankiewicz problem asks for an estimate on $z(m, n; s, t)$, the largest number of $1$'s in an $m \times n$ matrix with all entries $0$ or $1$ containing no $s \times t$ submatrix consisting entirely of $1$'s. We show that a classical…

Combinatorics · Mathematics 2021-07-01 David Conlon