Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEffective Bounds for the Andrews spt-function
159
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In this paper, we establish an asymptotic formula with an effective bound on the error term for the Andrews smallest parts function $mathrm{spt}(n)$. We use this formula to prove recent conjectures of Chen concerning inequalities which involve the partition function $p(n)$ and $mathrm{spt}(n)$. Further, we strengthen one of the conjectures, and prove that for every $epsilon>0$ there is an effectively computable constant $N(epsilon) > 0$ such that for all $ngeq N(epsilon)$, we have begin{equation*} frac{sqrt{6}}{pi}sqrt{n},p(n)<mathrm{spt}(n)<left(frac{sqrt{6}}{pi}+epsilonright) sqrt{n},p(n). end{equation*} Due to the conditional convergence of the Rademacher-type formula for $mathrm{spt}(n)$, we must employ methods which are completely different from those used by Lehmer to give effective error bounds for $p(n)$. Instead, our approach relies on the fact that $p(n)$ and $mathrm{spt}(n)$ can be expressed as traces of singular moduli.
rate research
Read More
The spt-function spt($n$) was introduced by Andrews as the weighted counting of partitions of $n$ with respect to the number of occurrences of the smallest part. In this survey, we summarize recent developments in the study of spt($n$), including congruence properties established by Andrews, Bringmann, Folsom, Garvan, Lovejoy and Ono et al., a constructive proof of the Andrews-Dyson-Rhoades conjecture given by Chen, Ji and Zang, generalizations and variations of the spt-function. We also give an overview of asymptotic formulas of spt($n$) obtained by Ahlgren, Andersen and Rhoades et al. We conclude with some conjectures on inequalities on spt($n$), which are reminiscent of those on $p(n)$ due to DeSalvo and Pak, and Bessenrodt and Ono. Furthermore, we observe that, beyond the log-concavity, $p(n)$ and spt($n$) satisfy higher order inequalities based on polynomials arising in the invariant theory of binary forms. In particular, we conjecture that the higher order Tur{a}n inequality $4(a_n^2-a_{n-1}a_{n+1})(a_{n+1}^2-a_{n}a_{n+2})-(a_na_{n+1}-a_{n-1}a_{n+2})^2>0$ holds for $p(n)$ when $ngeq 95$ and for spt($n$) when $ngeq 108$.
We establish in this paper sharp lower bounds for the $2k$-th moment of the derivative of the Riemann zeta function on the critical line for all real $k geq 0$.
Let $E/mathbb{Q}$ be an elliptic curve. The modified Szpiro ratio of $E$ is the quantity $sigma_{m}( E) =logmaxleft{ leftvert c_{4}^{3}rightvert ,c_{6}^{2}right} /log N_{E}$ where $c_{4}$ and $c_{6}$ are the invariants associated to a global minimal model of $E$, and $N_{E}$ denotes the conductor of $E$. In this article, we show that for each of the fifteen torsion subgroups $T$ allowed by Mazurs Torsion Theorem, there is a rational number $l_{T}$ such that if $Thookrightarrow E(mathbb{Q})_{text{tors}}$, then $sigma_{m}(E) >l_{T}$. We also show that this bound is sharp if the $ABC$ Conjecture holds.
Let $q$ be a power of a prime $p$, let $k$ be a nontrivial divisor of $q-1$ and write $e=(q-1)/k$. We study upper bounds for cyclotomic numbers $(a,b)$ of order $e$ over the finite field $mathbb{F}_q$. A general result of our study is that $(a,b)leq 3$ for all $a,b in mathbb{Z}$ if $p> (sqrt{14})^{k/ord_k(p)}$. More conclusive results will be obtained through separate investigation of the five types of cyclotomic numbers: $(0,0), (0,a), (a,0), (a,a)$ and $(a,b)$, where $a eq b$ and $a,b in {1,dots,e-1}$. The main idea we use is to transform equations over $mathbb{F}_q$ into equations over the field of complex numbers on which we have more information. A major tool for the improvements we obtain over known results is new upper bounds on the norm of cyclotomic integers.
We look at upper bounds for the count of certain primes related to the Fermat numbers $F_n=2^{2^n}+1$ called elite primes. We first note an oversight in a result of Krizek, Luca and Somer and give the corrected, slightly weaker upper bound. We then assume the Generalized Riemann Hypothesis for Dirichlet L functions and obtain a stronger conditional upper bound.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
