English
Related papers

Related papers: Fourier growth of structured $\mathbb{F}_2$-polyno…

200 papers

Let $N$ be a large prime and $P, Q \in \mathbb{Z}[x]$ two linearly independent polynomials with $P(0) = Q(0) = 0$. We show that if a subset $A$ of $\mathbb{Z}/N\mathbb{Z}$ lacks a progression of the form $(x, x + P(y), x + Q(y), x + P(y) +…

Number Theory · Mathematics 2024-05-22 James Leng

The multivariable autoregressive filter problem asks for a polynomial $p(z)=p(z_1, \ldots , z_d)$ without roots in the closed $d$-disk based on prescribed Fourier coefficients of its spectral density function $1/|p(z)|^2$. The conditions…

Classical Analysis and ODEs · Mathematics 2021-01-05 Jeffrey S. Geronimo , Hugo J. Woerdeman , Chung Y. Wong

In this note we compare two measures of the complexity of a class $\mathcal F$ of Boolean functions studied in (unconditional) pseudorandomness: $\mathcal F$'s ability to distinguish between biased and uniform coins (the coin problem), and…

Computational Complexity · Computer Science 2020-09-01 Rohit Agrawal

We study growth of absolute and homological $k$-dimensional systoles of arithmetic $n$-manifolds along congruence coverings. Our main interest is in the growth of systoles of manifolds whose real rank $r > 1$. We observe, in particular,…

Geometric Topology · Mathematics 2024-05-02 Mikhail Belolipetsky , Shmuel Weinberger

We study the problem of L^p-boundedness (1 < p < \infty) of operators of the form m(L_1,...,L_n) for a commuting system of self-adjoint left-invariant differential operators L_1,...,L_n on a Lie group G of polynomial growth, which generate…

Functional Analysis · Mathematics 2013-03-08 Alessio Martini

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

Computational Complexity · Computer Science 2009-11-29 Ido Ben-Eliezer , Shachar Lovett , Ariel Yadin

We characterize lower growth estimates for subsolutions in halfspaces of fully nonlinear partial differential equations on the form $$ F(x,u,Du,D^2u) = 0 $$ in terms of solutions to ordinary differential equations built solely upon a growth…

Analysis of PDEs · Mathematics 2021-12-22 Niklas L. P. Lundström

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset $A$ of $\{1,\dots,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots,x+P_m(y)$ has size…

Number Theory · Mathematics 2021-01-06 Sarah Peluse

We show that for a number of parameterized problems for which only $2^{O(k)} n^{O(1)}$ time algorithms are known on general graphs, subexponential parameterized algorithms with running time $2^{O(k^{1-\frac{1}{1+\delta}} \log^2 k)}…

Data Structures and Algorithms · Computer Science 2016-10-26 Dániel Marx , Marcin Pilipczuk

Let ${\sf G}$ be a locally compact group with polynomial growth of order $d$, a polynomial weight $\nu$ on ${\sf G}$ and a Fell bundle $\mathscr C\overset{q}{\to}{\sf G}$. We study the Banach $^*$-algebras $L^1({\sf G}\,\vert\,\mathscr C)$…

Functional Analysis · Mathematics 2025-03-17 Felipe I. Flores

We study independent long-range percolation on $\mathbb{Z}^d$ where the nearest-neighbor edges are always open and the probability that two vertices $x,y$ with $\|x-y\|>1$ are connected by an edge is proportional to…

Probability · Mathematics 2025-09-11 Johannes Bäumler

We present a new approach to constructing unconditional pseudorandom generators against classes of functions that involve computing a linear function of the inputs. We give an explicit construction of a pseudorandom generator that fools the…

Computational Complexity · Computer Science 2015-11-19 Parikshit Gopalan , Daniel Kane , Raghu Meka

We study the connection between the dimension of certain spaces of harmonic functions on a group and its geometric and algebraic properties. Our main result shows that (for sufficiently "nice" random walk measures) a connected, compactly…

Group Theory · Mathematics 2020-07-31 Idan Perl , Ariel Yadin

In this note, we prove that the following function space with absolutely convergent Fourier series \[ F_d:=\left\{ f\in L^2([0,1)^d)\:\middle| \: \|f\|:=\sum_{\boldsymbol{k}\in \mathbb{Z}^d}|\hat{f}(\boldsymbol{k})| \max\left(1,\min_{j\in…

Numerical Analysis · Mathematics 2023-06-28 Takashi Goda

In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…

Number Theory · Mathematics 2015-05-13 Alina Ostafe , Igor Shparlinski

Let $F$ be a fixed field of characteristic zero containing an element $i$ such that $i^2 = -1$. In this paper we consider finite dimensional superalgebras over $F$ endowed with a pseudoautomorphism $p$ and we investigate the asymptotic…

Rings and Algebras · Mathematics 2025-08-28 Elena Campedel , Ginevra Giordani , Antonio Ioppolo

Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost…

Number Theory · Mathematics 2022-05-16 Vitaly Bergelson , Joanna Kułaga-Przymus , Mariusz Lemańczyk , Florian K. Richter

In this paper, two structural results concerning low degree polynomials over finite fields are given. The first states that over any finite field $\mathbb{F}$, for any polynomial $f$ on $n$ variables with degree $d \le \log(n)/10$, there…

Computational Complexity · Computer Science 2014-04-03 Gil Cohen , Avishay Tal

The paper focuses on the behaviour of unimodular Fourier multipliers with exponential growth in the context of weighted $L^p$-spaces. Our main result shows that much of the general theory of multipliers is approachable through the theory of…

Functional Analysis · Mathematics 2026-05-12 María Jesús Carro , Alberto Salguero-Alarcón

Alexopoulos proved that on a finitely generated virtually nilpotent group, the restriction of a harmonic function of polynomial growth to a torsion-free nilpotent subgroup of finite index is always a polynomial in the Mal'cev coordinates of…

Group Theory · Mathematics 2018-05-10 Tom Meyerovitch , Idan Perl , Matthew Tointon , Ariel Yadin