English
Related papers

Related papers: Coefficient growth in square chains

200 papers

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Number Theory · Mathematics 2022-09-12 Arghya Datta

Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…

Number Theory · Mathematics 2018-04-05 Kevin Chen , Jianqiang Zhao

The coefficients c(n,k) defined by (1-k^2x)^(-1/k) = sum c(n,k) x^n reduce to the central binomial coefficients for k=2. Motivated by a question of H. Montgomery and H. Shapiro for the case k=3, we prove that c(n,k) are integers and study…

Number Theory · Mathematics 2015-05-13 Armin Straub , Tewodros Amdeberhan , Victor H. Moll

We show that every subset of SL_2(Z/pZ) grows rapidly when it acts on itself by the group operation. It follows readily that, for every set of generators A of SL_2(Z/pZ), every element of SL_2(Z/pZ) can be expressed as a product of at most…

Group Theory · Mathematics 2008-01-08 H. A. Helfgott

We resolve two open problems on Kronecker coefficients $g(\lambda,\mu,\nu)$ of the symmetric group. First, we prove that for partitions $\lambda,\mu,\nu$ with fixed Durfee square size, the Kronecker coefficients grow at most polynomially.…

Combinatorics · Mathematics 2022-12-23 Igor Pak , Greta Panova

In this paper, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$.…

Number Theory · Mathematics 2022-01-25 Shivarajkumar

Let $m$ and $n>0$ be integers. Suppose that $p$ is a prime dividing $m-4$ but not dividing $m$. We show that $\nu_p(\sum_{k=0}^{n-1}\frac{\binom{2k}k}{m^k})$ and $\nu_p(\sum_{k=0}^{n-1}\binom{n-1}{k}(-1)^k\frac{\binom{2k}k}{m^k})$ are at…

Number Theory · Mathematics 2011-04-14 Zhi-Wei Sun

Let M denote the maximal function along the polynomial curve p(t)=(t,t^2,...,t^d) in R^d: M(f)=sup_{r>0} (1/2r) \int_{|t|<r} |f(x-p(t))| dt. We show that the L^2-norm of this operator grows at most logarithmically with the parameter d:…

Classical Analysis and ODEs · Mathematics 2013-10-14 Ioannis Parissis

We will show that for $q<p$ there exists an $\al < \infty$ such that \[ \pi_{pq}(T) \pl \le c_{pq} \pi_{pq}^{[n^{\alpha}]}(T) \mbox{for all $T$ of rank $n$.}\] Such a polynomial number is only possible if $q=2$ or $q<p$. Furthermore, the…

Functional Analysis · Mathematics 2016-09-06 M. Defant , Marius Junge

Let $\alpha\in]0,1]$ and let $Q_j$ $(1\leqslant j\leqslant r)$ denote distinct irreducible polynomials with integer coefficients. We show that, for vectors with coordinates not exceeding a constant multiple of their mean, the joint local…

Number Theory · Mathematics 2018-01-18 Gérald Tenenbaum

We prove that, for $1\leq p< 2$, if a $W^{1,p}$-quasiconvex integrand $\,f\colon\mathbb{R}^{N\times n}\rightarrow\mathbb{R}$ has linear growth from above on the rank-one cone, then it must satisfy this growth for all matrices in…

Analysis of PDEs · Mathematics 2014-10-09 Parth Soneji

We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that…

Commutative Algebra · Mathematics 2012-10-25 William Messing , Victor Reiner

Let $(\mathcal{A}_i)_{i \in [s]}$ be a sequence of dense subsets of the Boolean cube $\{0,1\}^n$ and let $p$ be a prime. We show that if $s$ is assumed to be superpolynomial in $n$ then we can find distinct $i,j$ such that the two…

Combinatorics · Mathematics 2023-09-26 Thomas Karam

Let G=SL_3(Z/pZ), p a prime. Let A be a set of generators of G. Then A grows under the group operation. To be precise: denote by |S| the number of elements of a finite set S. Assume |A| < |G|^{1-\epsilon} for some \epsilon>0. Then |A\cdot…

Group Theory · Mathematics 2009-06-08 H. A. Helfgott

Let $a$ and $b$ be positive integers and let $p$ be an odd prime such that $p=ax^2+by^2$ for some integers $x$ and $y$. Let $\lambda(a,b;n)$ be given by $q\prod_{k=1}^\infty (1-q^{ak})^3(1-q^{bk})^3 = \sum_{n=1}^\infty \lambda(a,b;n)q^n$.…

Number Theory · Mathematics 2010-12-20 Zhi-Hong Sun

In Pacific J. Math. 292 (2018), 223-238, Shareshian and Woodroofe asked if for every positive integer $n$ there exist primes $p$ and $q$ such that, for all integers $k$ with $1 \leq k \leq n-1$, the binomial coefficient $\binom{n}{k}$ is…

Number Theory · Mathematics 2019-06-19 Sílvia Casacuberta

The Littlewood-Richardson coefficients $c^\nu_{\lambda,\mu}$ are the multiplicities in the tensor product decomposition of two irreducible representations of the general linear group GL$(n, {\mathbb C})$. They are parametrized by the…

Algebraic Geometry · Mathematics 2022-06-08 Pierre-Emmanuel Chaput , Nicolas Ressayre

We analyse the recursive formula found for various Ext groups for $\SL_2(k)$, $k$ a field of characteristic $p$, and derive various generating functions for these groups. We use this to show that the growth rate for the cohomology of…

Representation Theory · Mathematics 2012-12-07 Karin Erdmann , Keith C. Hannabuss , Alison E. Parker

We prove that if $g(x,y)$ is a polynomial of constant degree $d$ that $y_2-y_1$ does not divide $g(x_1,y_1)-g(x_2,y_2)$, then for any finite set $A \subset \mathbb{R}$ \[ |X| \gg_d |A|^2, \quad \text{where} \…

Combinatorics · Mathematics 2019-05-29 Mehdi Makhul

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

Number Theory · Mathematics 2016-09-02 Jie Wu , Ping Xi