English
Related papers

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

200 papers

Let F be a Siegel cusp form of weight k and genus n>1 with Fourier-Jacobi coefficients f_m. In this article, we estimate the growth of the Petersson norms of f_m, where m runs over an arithmetic progression. This result sharpens a recent…

Number Theory · Mathematics 2013-12-06 Sanoli Gun , Narasimha Kumar

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

Number Theory · Mathematics 2021-11-10 Borys Kuca

Let $K[x,y]$ be the polynomial algebra in two variables over an algebraically closed field $K$. We generalize to the case of any characteristic the result of Furter that over a field of characteristic zero the set of automorphisms $(f,g)$…

Algebraic Geometry · Mathematics 2008-07-07 Vesselin Drensky , Jie-Tai Yu

We show that the decreasing rearrangement of the Fourier series with respect to the Jacobi polynomials for functions in $L_p$ does not converge unless $p=2$. As a by-product of our work on quasi-greedy bases in $L_{p}(\mu)$, we show that no…

Functional Analysis · Mathematics 2015-07-22 Fernando Albiac , José L. Ansorena , Óscar Ciaurri , Juan L. Varona

We study functions satisfying the composition law $F(xy)+F(x/y)=P(F(x),F(y))$ with a symmetric polynomial combiner $P$. We prove that symmetry together with a quadratic degree bound on $P$ forces a composition law of d'Alembert type. We…

Classical Analysis and ODEs · Mathematics 2026-04-22 Jonathan Washburn , Milan Zlatanović , Elshad Allahyarov

We count the algebraic numbers of fixed degree by their $\mathbf{w}$-weighted $l_p$-norm which generalizes the na\"ive height, the length, the Euclidean and the Bombieri norms. For non-negative integers $k,l$ such that $k+2l\leq n$ and a…

Number Theory · Mathematics 2019-10-08 Friedrich Götze , Denis Koleda , Dmitry Zaporozhets

We study the harmonically weighted one-level density of low-lying zeros of $L$-functions in the family of holomorpic newforms of fixed even weight $k$ and prime level $N$ tending to infinity. For this family, Iwaniec, Luo and Sarnak proved…

Number Theory · Mathematics 2025-06-18 Lucile Devin , Daniel Fiorilli , Anders Södergren

This work is a thorough investigation of skew-orthogonal polynomials with respect to a quartic Freud weight. We provide an explicit method to evaluate skew-orthogonal polynomials of any degree as linear combinations of orthogonal…

Classical Analysis and ODEs · Mathematics 2026-04-27 Costanza Benassi , Marta Dell'Atti

We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $\Gamma_1,\ldots,\Gamma_j$ of low-degree…

We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…

Classical Analysis and ODEs · Mathematics 2015-01-20 Marc Carnovale

We show that an arbitrary nilprogression can be approximated by a proper coset nilprogression in upper-triangular form. This can be thought of as a nilpotent version of the Freiman-Bilu result that a generalised arithmetic progression can…

Group Theory · Mathematics 2018-11-07 Romain Tessera , Matthew Tointon

We study the growth of the central polynomials for the algebras $G$ and $M_k(F)$, the infinite dimensional Grassmann algebra and the $k\times k$ matrices over a field $F$ of characteristic zero. In particular it follows that $M_k(F)$…

Representation Theory · Mathematics 2015-04-28 Amitai Regev

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be any linearly independent polynomials with zero constant term. We show that there exists a $\gamma>0$ such that any subset of $\mathbb{F}_q$ of size at least $q^{1-\gamma}$ contains a nontrivial…

Number Theory · Mathematics 2019-05-29 Sarah Peluse

Convex polyominoes can be refined according to the number of direction changes in monotone paths connecting pairs of cells, leading to the notion of $k$-convexity. In particular, the cases $k=1$ and $k=2$ correspond to $L$-convex and…

Combinatorics · Mathematics 2026-03-30 Nicholas Beaton , Simone Rinaldi

We study graphs of polynomial growth from the perspective of asymptotic geometry and descriptive set theory. The starting point of our investigation is a theorem of Krauthgamer and Lee who showed that every connected graph of polynomial…

Combinatorics · Mathematics 2025-04-08 Anton Bernshteyn , Jing Yu

We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…

Combinatorics · Mathematics 2009-07-14 Saugata Basu , Richard Pollack , Marie-Francoise Roy

For every sufficiently well-behaved function $g:\mathbb{R}_{\ge 0}\rightarrow\mathbb{R}_{\ge 0}$ that grows at least linearly and at most exponentially we construct a tree $T$ of uniform volume growth $g$, that is, $$C_1\cdot g(r/4)\le…

Combinatorics · Mathematics 2023-11-10 George Kontogeorgiou , Martin Winter

We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A|^(1+epsilon) where epsilon depends only on the Lie rank of L, or AAA=L. This implies that for a family of simple…

Group Theory · Mathematics 2010-01-27 László Pyber , Endre Szabó

For an odd prime $p$, we say $f(X) \in {\mathbb F}_p[X]$ computes square roots in $\mathbb F_p$ if, for all nonzero perfect squares $a \in \mathbb F_p$, we have $f(a)^2 = a$. When $p \equiv 3 \mod 4$, it is well known that $f(X) =…

Number Theory · Mathematics 2024-01-24 Kiran Kedlaya , Swastik Kopparty

We give a pseudorandom generator that fools degree-$d$ polynomial threshold functions over $n$-dimensional Gaussian space with seed length $\mathrm{poly}(d)\cdot \log n$. All previous generators had a seed length with at least a $2^d$…

Computational Complexity · Computer Science 2022-02-10 Ryan O'Donnell , Rocco A. Servedio , Li-Yang Tan , Daniel Kane
‹ Prev 1 3 4 5 6 7 10 Next ›