Kevin Ford
We establish an analog of the Hardy-Ramanujan inequality for counting members of sifted sets with a given number of distinct prime factors. In particular, we establish a bound for the number of shifted primes p+a below x with k distinct prime factors, uniformly for all positive integers k.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The Hardy--Ramanujan inequality for sifted sets and its applications
本文建立了适用于筛集的Hardy-Ramanujan不等式加权版本，并将其应用于多个数论问题，包括大偏差、乘法表问题和移位素数因数等。
Let $p_{r,s}(n)$ denote the number of partitions of a positive integer $n$ into parts containing no multiples of $r$ or $s$, where $r>1$ and $s>1$ are square-free, relatively prime integers. We use classical methods to derive a Hardy-Ramanujan-Rademacher-type infinite series for $p_{r,s}(n)$.
In this article, we investigate the bound of the valency of the Cayley graphs of the generalized quaternion groups which guarantees to be Ramanujan. As is the cases of the cyclic and dihedral groups in our previous studies, we show that the determination of the bound in a special setting is related to the classical Hardy-Littlewood conjecture for primes represented by a quadratic polynomial.
Let $b$ be a numeration base. A $b$-additive Ramanujan-Hardy number $N$ is an integer for which there exists at least an integer $M$, called additive multiplier, such that the product of $M$ and the sum of base $b$ digits of $N$, added to the reversal of the product, gives $N$. We show that for any $b$ there exists an infinity of $b$-additive Ramanujan-Hardy numbers and an infinity of additive multipliers. A $b$-multiplicative Ramanujan-Hardy number $N$ is an integer for which there exists at least an integer $M$, called multiplicative multiplier, such that the product of $M$ and the sum of ba…
On Diophantine equations with Fibonacci and Lucas sequences associated to Hardy-Ramanujan problem
该研究围绕哈代-拉马努金问题，探究涉及斐波那契序列和卢卡斯序列的两类三次丢番图方程，找出了兼具哈代-拉马努金数属性的斐波那契数与卢卡斯数。
We describe how the Hardy-Ramanujan-Rademacher formula can be implemented to allow the partition function $p(n)$ to be computed with softly optimal complexity $O(n^{1/2+o(1)})$ and very little overhead. A new implementation based on these techniques achieves speedups in excess of a factor 500 over previously published software and has been used by the author to calculate $p(10^{19})$, an exponent twice as large as in previously reported computations. We also investigate performance for multi-evaluation of $p(n)$, where our implementation of the Hardy-Ramanujan-Rademacher formula becomes superi…
We study the $q$-series $F(q) = \sum q^{m(m+1)/2}/(q)_m^2$ and offer some commentary on why Ramanujan may have thought $F(q)$ does not "close."
We derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $\sqrt{n}$. This is an extension of the classical Hardy-Ramanujan formula and Szekeres' formula. The proof relies on the saddle point method.
In this paper, we introduce some explicit approximations for the summation $\sum_{k\leq n}Ω(k)$, where $Ω(k)$ is the total number of prime factors of $k$.
Let $Q(n)$ denote the number of integers $1 \leq q \leq n$ whose prime factorization $q= \prod^{t}_{i=1}p^{a_i}_i$ satisfies $a_1\geq a_2\geq \ldots \geq a_t$. Hardy and Ramanujan proved that $$ \log Q(n) \sim \frac{2π}{\sqrt{3}} \sqrt{\frac{\log(n)}{\log\log(n)}}\;. $$ Before proving the above precise asymptotic formula, they studied in great detail what can be obtained concerning $Q(n)$ using purely elementary methods, and were only able to obtain much cruder lower and upper bounds using such methods. In this paper we show that it is in fact possible to obtain a purely elementary (and much s…
In this paper, we determine the bound of the valency of the odd circulant graph which guarantees to be a Ramanujan graph for each fixed number of vertices. In almost of the cases, the bound coincides with the trivial bound, which comes from the trivial estimate of the largest non-trivial eigenvalue of the circulant graph. As exceptional cases, the bound in fact exceeds the trivial one by two. We then prove that such exceptionals occur only in the cases where the number of vertices has at most two prime factors and is represented by a quadratic polynomial in a finite family and, moreover, under…
The convergence of an alternating series of Erdős, assuming the Hardy--Littlewood prime tuples conjecture
本文针对Erdős提出的某交错级数收敛性的公开问题，结合素数随机筛选模型与Gallagher计算变体，在强版本Hardy–Littlewood素数元组猜想下证明了该级数条件收敛。
Sometimes we need the approximate value of the partition number in a simple and efficient way. There are already several formulae to calculate the partition number p(n). But they are either inconvenient for most people (not majored in math) who do not want do write programs, or unsatisfying in accuracy. By bringing in two parameters in the Hardy-Ramanujan's Asymptotic formula and fitting the data of the two parameters by least square method, iteration method and some other special designed methods, several revised elementary estimation formulae with high accuracy for p(n) are obtained. With th…
On the Hardy-Ramanujan Theorem
本文证明了Hardy-Ramanujan定理的有效版本，通过Poisson分布点态控制ω(n)的移位经验分布，并推导了平方自由数类似结果、Chernoff估计、高斯窗口估计、中偏差上界和一致矩估计。
A celebrated theorem of Delange gives a sufficient condition for an arithmetic function to be the sum of the associated Ramanujan expansion with the coefficients provided by a previous result of Wintner. By applying the Delange theorem to the correlation of the von Mangoldt function with its incomplete form, we deduce an inequality involving the counting function of the prime numbers in arithmetic progressions. A remarkable aspect is that such an inequality is equivalent to the famous conjectural formula by Hardy and Littlewood for the twin primes.
A new class of integrals involving the product of $Ξ$-functions associated with primitive Dirichlet characters is considered. These integrals give rise to transformation formulas of the type $F(z, α,χ)=F(-z, β,\barχ)=F(-z,α,\barχ)=F(z,β,χ)$, where $αβ=1$. New character analogues of transformation formulas of Guinand and Koshliakov as well as those of a formula of Ramanujan and its recent generalization are shown as particular examples. Finally, character analogues of a conjecture of Ramanujan, Hardy and Littlewood involving infinite series of Möbius functions are derived.
Sums of two squares and the tau-function: Ramanujan's trail
本文为综述，梳理了拉马努金在两平方数和计数、tau函数素数不可整除性方面的论断，补充相关历史细节并介绍后续进展，展现其在数论领域的探索性贡献。
A new class of integrals involving the confluent hypergeometric function ${}_1F_{1}(a;c;z)$ and the Riemann $Ξ$-function is considered. It generalizes a class containing some integrals of S. Ramanujan, G.H. Hardy and W.L. Ferrar and gives as by-products, transformation formulas of the form $F(z,α)=F(iz,β)$, where $αβ=1$. As particular examples, we derive an extended version of the general theta transformation formula and generalizations of certain formulas of Ferrar and Hardy. A one-variable generalization of a well-known identity of Ramanujan is also given. We conclude with a generalization o…
A number field extension of Ramanujan's identity and its integral representation via the generalized Riemann $Ξ$-function
本文建立拉马努金恒等式的数域类似物，得到戴德金ζ函数高次幂变换公式的积分表示，重现Hardy的雅可比θ关系积分表示，还得到扩展拉马努金-科什利亚科夫公式的数域类似物。
All the $F:$N$\rightarrow $C having Ramanujan expansion $F(a)=\sum_{q=1}^{\infty}G(q)c_q(a)$ (here $c_q(a)$ is the Ramanujan sum) pointwise converging in $a\in $N, with $G:$N$\rightarrow $C a multiplicative function, may be factored into two Ramanujan expansions, one of which is a finite Euler product : details in our Main Theorem. This is a general result, with unexpected and useful consequences, esp., for the Ramanujan expansion of null-function, say 0. The Main Theorem doesn't require other analytic assumptions, as pointwise convergence suffices; this depends on a general property of Euler …
Simple error bounds for an asymptotic expansion of the partition function
本文为整数划分函数 $p(n)$ 的 Poincaré 型简化渐近展开建立了可计算的误差界，该界比近期文献更尖锐且推导更简单。
Efficient computation of the overpartition function and applications
本研究提出基于Hardy-Rademacher-Ramanujan型公式的超分拆函数高效计算方法，并用其发现了大量Treneer预测存在的新Ramanujan型同余式，补充了相关领域的已知结果。
We use the celebrated circle method of Hardy and Ramanujan to develop convergent formulae for counting a restricted class of partitions that arise from the Göllnitz--Gordon identities.
We deduce from the strong form of the Hardy--Ramanujan asymptotics for the partition function $p(n)$ an asymptotics for $p_{-S}(n)$, the number of partitions of $n$ that do not use parts from a finite set $S$ of positive integers. We apply this to construct highly oscillating partition ideals.
In 1916, Riesz proved that the Riemann hypothesis is equivalent to the bound $\sum_{n=1}^\infty \frac{μ(n)}{n^2} \exp\left( - \frac{x}{n^2} \right) = O_ε \left( x^{-\frac{3}{4} + ε} \right)$, as $x \rightarrow\infty$, for any $ε>0$. Around the same time, Hardy and Littlewood gave another equivalent criteria for the Riemann hypothesis while correcting an identity of Ramanujan. In the present paper, we establish a one-variable generalization of the identity of Hardy and Littlewood and as an application, we provide Riesz-type criteria for the Riemann hypothesis. In particular, we obtain the bound…
A Rademacher-type convergent series formula which generalizes the Hardy-Ramanujan-Rademacher formula for the number of partitions of $n$ and the Zuckerman formula for the Fourier coefficients of $\vartheta_4(0\vert τ)^{-1}$ is presented.
We focus on three pages in Ramanujan's lost notebook, pages 336, 335, and 332, in decreasing order of attention. On page 336, Ramanujan proposes two identities, but the formulas are wrong -- each is vitiated by divergent series. We concentrate on only one of the two incorrect "identities", which may have been devised to attack the extended divisor problem. We prove here a corrected version of Ramanujan's claim, which contains the convergent series appearing in it. The convergent series in Ramanujan's faulty claim is similar to one used by G.F. Voronoi, G.H. Hardy, and others in their study of …
A new class of Correlations insisting on Ramanujan expansions
本文提出了一种新的双季节相关性类，用于研究孪生素数和相关算术问题。
We give an upper bound for the error term in the Hardy-Ramanujan-Rademacher formula for the partition function. The main input is a new hybrid subconvexity bound for the central value $L(\tfrac 12,f\times (\tfrac{q}{\cdot}))$ in the $q$ and spectral parameter aspects, where $f$ is a Hecke-Maass cusp form for $Γ_0(N)$ and $q$ is a fundamental discriminant.
On divisor sums due to Erdős and Ramanujan
本文研究了埃尔多斯和拉马努金除数和的混合形式，通过结合戈尔本的估计和塔兰的定量化形式，证明了除数和的渐进行为。
Proof of a Conjectured Ramanujan Type Master Theorem for Powers of the Cosecant
该研究证明了Bradshaw和Atale关于余割幂的拉马努金型主定理猜想，通过归纳微分递推建立洛朗级数恒等式完成证明，所得定理在更弱增长假设下成立，还得到余割幂积分表示等应用。
We give a number field analogue of a result of Ramanujan, Hardy and Littlewood, thereby obtaining a modular relation involving the non-trivial zeros of the Dedekind zeta function. We also provide a Riesz-type criterion for the Generalized Riemann Hypothesis for $ζ_K(s)$. New elegant transformations are obtained when $K$ is a quadratic extension, one of which involves the modified Bessel function of the second kind.
In 1918, Hardy and Ramanujan published a seminal paper which included an asymptotic formula for the partition function. In their paper, they also claim without proof an asymptotic equivalence for $p^k(n)$, the number of partitions of a number $n$ into $k$-th powers. In this paper, we provide an asymptotic formula for $p^k(n)$, using the Hardy-Littlewood Circle Method. We also provide a formula for the difference function $p^k(n+1)-p^k(n)$. As a necessary step in the proof, we obtain a non-trivial bound on exponential sums of the form $\sum_{m=1}^q e(\frac{am^k}{q})$.
Number Field Analogue of Jacobi Theta Relation And Zeros of Dedekind zeta function on Re$(s)=1/2$
本文建立Jacobi theta关系的数域类比，并据此证明任意数域的Dedekind zeta函数在临界线Re$(s)=1/2$上均有无穷多个非平凡零点。
Let $ω(n)$ (resp. $Ω(n)$) denote the number of prime divisors (resp. with multiplicity) of a natural number $n$. In 1917, Hardy and Ramanujan proved that the normal order of $ω(n)$ is $\log\log n$, and the same is true of $Ω(n)$; roughly speaking, a typical natural number $n$ has about $\log\log n$ prime factors. We prove a similar result for $ω(s(n))$, where $s(n)$ denotes the sum of the proper divisors of $n$: For any $ε> 0$ and all $n \leq x$ not belonging to a set of size $o(x)$, \[ |ω(s(n)) - \log\log s(n)| < ε\log\log s(n) \] and the same is true for $Ω(s(n))$.
Voronoi summation formulas, oscillations of Riesz sums, and Ramanujan-Guinand and Cohen type identities
本研究推导了刘维尔函数、莫比乌斯函数及除数函数平方的Voronoi求和公式，得到多类恒等式特例，并在相关数论猜想假设下证明了对应Riesz和及其误差项的振荡性质。
We celebrate the 100th anniversary of Srinivasa Ramanujan's election as a Fellow of the Royal Society, which was largely based on his work with G. H. Hardy on the asymptotic properties of the partition function. After recalling this revolutionary work, marking the birth of the "circle method", we present a contemporary example of its legacy in topology. We deduce the equidistribution of Hodge numbers for Hilbert schemes of suitable smooth projective surfaces.
The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of $n$ is reviewed. Next, the steps for finding analogous formulas for certain restricted classes of partitions or overpartiitons is examined, bearing in mind how these calculations can be automated in a CAS. Finally, a number of new formulas of this type which were conjectured with the aid of \emph{Mathematica} are presented along with results of a test for their numerical accuracy.
Asymptotics for partitions over the Fibonacci numbers and related sequences
本文结合经典分拆理论与 Fibonacci Dirichlet 级数的新结果，首次给出整数表示为非互异斐波那契数之和的方式数 $p_F(n)$ 的渐近公式，并将类似结果推广到一般线性递推序列。
Erdős-Kac type theorem for the number of scattering geodesics on modular surface
本文受经典 Erdős-Kac 定理启发，证明模曲面上具有共同停留时间的散射测地线数量满足一种 Erdős-Kac 型高斯分布规律。
Asymptotics of the d'Arcais Numbers at Small $k$
研究小k时d'Arcais数的渐进行为，推导出其渐近表达式，并验证关于数列比值的猜想在不同k值下的成立情况。
On asymptotics of shifted sums of Dirichlet convolutions
本文利用哈代-利特尔伍德圆法研究满足拉马努金猜想的乘性函数卷积的平移和，在广泛范围内证明了几乎对所有平移参数成立的渐近公式，并给出加权指数和的新上界。
This paper exploits the connection between the quantum many-particle density of states and the partitioning of an integer in number theory. For $N$ bosons in a one dimensional harmonic oscillator potential, it is well known that the asymptotic (N -> infinity) density of states is identical to the Hardy-Ramanujan formula for the partitions p(n), of a number n into a sum of integers. We show that the same statistical mechanics technique for the density of states of bosons in a power-law spectrum yields the partitioning formula for p^s(n), the latter being the number of partitions of n into a sum…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。