English
Related papers

Related papers: Polynomial mean complexity and Logarithmic Sarnak …

200 papers

We introduce a universal weight system (a function on chord diagrams satisfying the $4$-term relation) taking values in the ring of polynomials in infinitely many variables whose particular specializations are weight systems associated with…

Combinatorics · Mathematics 2024-11-19 Maxim Kazarian , Zhuoke Yang

A log generic hypersurface in $\mathbb{P}^n$ with respect to a birational modification of $\mathbb{P}^n$ is by definition the image of a generic element of a high power of an ample linear series on the modification. A log very-generic…

Algebraic Geometry · Mathematics 2021-10-26 Nero Budur , Robin van der Veer

In this paper we present an unexpected link between the Factorial Conjecture and Furter's Rigidity Conjecture. The Factorial Conjecture in dimension $m$ asserts that if a polynomial $f$ in $m$ variables $X_i$ over $\C$ is such that ${\cal…

Algebraic Geometry · Mathematics 2013-05-28 Eric Edo , Arno van den Essen

For an analytic and univalent function $f$ in the unit disk $\mathbb{D}:=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$, the logarithmic coefficients $\gamma_n$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

Complex Variables · Mathematics 2016-10-03 Md Firoz Ali , D. K. Thomas , A. Vasudevarao

We prove uniform $L^p \to L^q$ bounds for Fourier restriction to polynomial curves in $\mathbb R^d$ with affine arclength measure, in the conjectured range.

Classical Analysis and ODEs · Mathematics 2017-10-24 Betsy Stovall

For univalent and normalized functions $f$ the logarithmic coefficients $\gamma_n(f)$ are determined by the formula $\log(f(z)/z)=\sum_{n=1}^{\infty}2\gamma_n(f)z^n$. In the paper \cite{Pon} the authors posed the conjecture that a locally…

Complex Variables · Mathematics 2020-01-31 Stanislawa Kanas , Vali Soltani Masih

We prove a probabilistic Fourier extension theorem that says Fourier extension holds when averaged over certain smooth Alpert multipliers. The proofs use smooth Alpert wavelets with the classical techniques of stationary phase and…

Classical Analysis and ODEs · Mathematics 2026-04-16 Eric T. Sawyer

Let $N$ be a fixed positive integer, and let $f\in S_k(N)$ be a primitive cusp form given by the Fourier expansion $f(z)=\sum_{n=1}^{\infty} \lambda_f(n)n^{\frac{k-1}{2}}e(nz)$. We consider the partial sum $S(x,f)=\sum_{n\leq…

Number Theory · Mathematics 2023-08-15 Claire Frechette , Mathilde Gerbelli-Gauthier , Alia Hamieh , Naomi Tanabe

Let $X$ be a fs logarithmic scheme that is generically logarithmically smooth, and that admits a strict closed embedding into a logarithmically smooth scheme $Y$ over a field $\kk$ of characteristic zero. We construct a simple and fast…

Algebraic Geometry · Mathematics 2023-11-21 Ming Hao Quek

A Littlewood polynomial is a polynomial of the form \[ f_n(x)=\sum_{k=0}^n \varepsilon_k x^k \] with $\varepsilon_k\in\{-1, 1\}$. Let $(\varepsilon_k)_{k \ge 0}$ be i.i.d. Rademacher coefficients. We show that the lower envelope of…

Probability · Mathematics 2026-05-12 Brayden Letwin , Mehtaab Sawhney

Let $f: \{0,1\}^n \to \{0, 1\}$ be a boolean function, and let $f_\land (x, y) = f(x \land y)$ denote the AND-function of $f$, where $x \land y$ denotes bit-wise AND. We study the deterministic communication complexity of $f_\land$ and show…

Computational Complexity · Computer Science 2020-10-23 Alexander Knop , Shachar Lovett , Sam McGuire , Weiqiang Yuan

Let $k_i\ (i=1,2,\ldots,t)$ be natural numbers with $k_1>k_2>\cdots>k_t>0$, $k_1\geq 2$ and $t<k_1.$ Given real numbers $\alpha_{ji}\ (1\leq j\leq t,\ 1\leq i\leq s)$, we consider polynomials of the shape…

Number Theory · Mathematics 2023-05-16 Kiseok Yeon

In this paper, using techniques developed in our earlier works on the theory of mod-Gaussian convergence, we prove precise moderate and large deviation results for the logarithm of the characteristic polynomial of a random unitary matrix.…

Probability · Mathematics 2022-02-18 Pierre-Loïc Méliot , Ashkan Nikeghbali

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…

Computational Complexity · Computer Science 2021-12-03 Mrinal Kumar , Ben Lee Volk

We prove that every infinite minimal subshift with word complexity $p(q)$ satisfying $\limsup p(q)/q < 3/2$ is measure-theoretically isomorphic to its maximal equicontinuous factor; in particular, it has measurably discrete spectrum. Among…

Dynamical Systems · Mathematics 2023-12-11 Darren Creutz , Ronnie Pavlov

The Shub-Smale Tau Conjecture is a hypothesis relating the number of integral roots of a polynomial f in one variable and the Straight-Line Program (SLP) complexity of f. A consequence of the truth of this conjecture is that, for the…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas

We study the problem of computing the isolated regular solutions of a system \((f_1,\ldots,f_n)\) of \(n\) polynomial equations in \(n\) variables \((X_1, \dots, X_n)\) over a field of characteristic zero \(k\). We focus on systems with a…

Symbolic Computation · Computer Science 2026-05-22 Thi Xuan Vu

Let f:=(f^1,\...,f^n) be a sparse random polynomial system. This means that each f^i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express…

Numerical Analysis · Mathematics 2025-10-20 Gregorio Malajovich , J. Maurice Rojas

Although Sarnak's conjecture holds for compact group rotations (irrational rotations, odometers), it is not even known whether it holds for all Jewett-Krieger models of such rotations. In this paper we show that it does, as long as the…

Dynamical Systems · Mathematics 2015-02-10 Tomasz Downarowicz , Stanislaw Kasjan

We provide evidence for a conjecture of Yamamura that the truncated logarithmic polynomials \[ F_n(x) = 1 + x + \frac{x^2}{2} + \cdots + \frac{x^n}{n} \] have Galois group $S_n$ for all $n \geq 1$.

Number Theory · Mathematics 2024-01-26 John Cullinan , Rylan Gajek-Leonard