English
Related papers

Related papers: Polynomial mean complexity and Logarithmic Sarnak …

200 papers

We present a simple proof on the existence of $L^1$-flat analytic polynomials with coefficients $0,1$ on the circle and on the real line and we give an example of a conservative ergodic map and flow whose unitary operators admits a simple…

Dynamical Systems · Mathematics 2023-06-20 el Houcein el Abdalaoui

We study the stability of the mesoscopic fluctuations of certain orthogonal polynomial ensembles on the real line utilizing the recurrence relation of the associated orthogonal polynomials. We prove that under a sparse enough decaying…

Mathematical Physics · Physics 2024-10-11 Daniel Ofner

We consider a translation and dilation invariant system consisting of k diagonal equations of degrees 1,2,...,k with integer coefficients in s variables, where s is sufficiently large in terms of k. We show via the Hardy-Littlewood circle…

Number Theory · Mathematics 2010-10-11 Matthew L. Smith

The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…

Computational Complexity · Computer Science 2026-03-02 Lianna Hambardzumyan , Shachar Lovett , Morgan Shirley

Let $\tau_k$ be the $k$-fold divisor function. By constructing an approximant of $\tau_k$, denoted as $\tau_k^*$, which is a normalized truncation of the $k$-fold divisor function, we prove that when $\exp\left(C\log^{1/2}X(\log\log…

Number Theory · Mathematics 2024-07-09 Mengdi Wang

We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…

Computational Complexity · Computer Science 2015-08-11 Hing Yin Tsang , Ning Xie , Shengyu Zhang

We establish a generalization of Bourgain double recurrence theorem and ergodic Bourgain-Sarnak's theorem by proving that for any aperiodic $1$-bounded multiplicative function $\boldsymbol{\nu}$, for any map $T$ acting on a probability…

Dynamical Systems · Mathematics 2025-01-27 el Houcein el Abdalaoui

In this paper, we investigate the mean square estimate for the logarithmic derivative of the Godement--Jacquet $L$-function $L_f(s)$ assuming the Riemann hypothesis for $L_f(s)$ and Rudnick--Sarnak conjecture.

Number Theory · Mathematics 2023-10-09 Amrinder Kaur , Ayyadurai Sankaranarayanan

We prove Carlos Simpson's "semi-strictification" (or "weak unit") conjecture in the case of infinity-groupoids. More precisely, we introduce two precise versions of the conjecture, the "general" and the "regular" conjecture, involving two…

Category Theory · Mathematics 2018-07-10 Simon Henry

The logarithmic coefficients $\gamma_n$ of 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$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

Complex Variables · Mathematics 2016-08-25 Md. Firoz Ali , A. Vasudevarao

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Information Theory · Computer Science 2022-12-08 C. Sinan Güntürk , Weilin Li

A system of linear equations in $\mathbb{F}_p^n$ is \textit{Sidorenko} if any subset of $\mathbb{F}_p^n$ contains at least as many solutions to the system as a random set of the same density, asymptotically as $n\to \infty$. A system of…

Combinatorics · Mathematics 2026-01-14 Daniel Altman

We establish an asymptotic formula for the logarithmic mean value of a 1-bounded multiplicative function that is sharp in many cases of interest. We derive from it a variety of applications, making progress on several old problems. As a…

Number Theory · Mathematics 2026-04-09 Oleksiy Klurman , Alexander P. Mangerel

We address the Uniform Boundedness Conjecture of Morton and Silverman in the case of unicritical polynomials, assuming a generalization of the $abc$-conjecture. For unicritical polynomials of degree at least five, we require only the…

Number Theory · Mathematics 2019-01-15 Nicole Looper

Broadhurst conjectured that the Feynman integral associated to the polynomial corresponding to $t=1$ in the one-parameter family $(1+x_1+x_2+x_3)(1+x_1^{-1}+x_2^{-1}+x_3^{-1})-t$ is expressible in terms of $L(f,2),$ where $f$ is a cusp form…

Number Theory · Mathematics 2016-03-03 Detchat Samart

We formulate the generalized Sarnak's M\"obius disjointness conjecture for an arbitrary number field $K$, and prove a quantitative disjointness result between polynomial nilsequences $(\Phi(g(n)\Gamma))_{n\in\mathbb{Z}^{D}}$ and aperiodic…

Number Theory · Mathematics 2023-01-16 Wenbo Sun

Let $\lambda$ denote the Liouville function. The Chowla conjecture asserts that $$ \sum_{n \leq X} \lambda(a_1 n + b_1) \lambda(a_2 n+b_2) \dots \lambda(a_k n + b_k) = o_{X \to \infty}(X) $$ for any fixed natural numbers $a_1,a_2,\dots,a_k$…

Number Theory · Mathematics 2016-05-17 Terence Tao

We investigate the arithmetic formula complexity of the elementary symmetric polynomials S(k,n). We show that every multilinear homogeneous formula computing S(k,n) has size at least k^(Omega(log k))n, and that product-depth d multilinear…

Computational Complexity · Computer Science 2009-07-16 Pavel Hrubes , Amir Yehudayoff

J.C.Lagarias (2000) conjectured that if $\mu$ is a complex measure on p-dimensional Euclidean space with a uniformly discrete support and its spectrum (Fourier transform) is also a measure with a uniformly discrete support, then the support…

Classical Analysis and ODEs · Mathematics 2015-03-03 Sergii Yu. Favorov

We show that tools from circuit complexity can be used to study decompositions of global constraints. In particular, we study decompositions of global constraints into conjunctive normal form with the property that unit propagation on the…

Artificial Intelligence · Computer Science 2009-05-26 Christian Bessiere , George Katsirelos , Nina Narodytska , Toby Walsh