Florian Luca, Sibusiso Mabaso, Pantelimon Stanica
In this paper, for a positive integer $n\ge 1$, we look at the size and prime factors of the iterates of the Ramanujan $τ$ function applied to $n$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We determine asymptotically the maximal order of log d(d(n)), where d(n) is the number of positive divisors of n. This solves a problem first put forth by Ramanujan in 1915.
We study the Ramanujan-prime-counting function along the lines of Ramanujan's original work on Bertrand's Postulate. We show that the number of Ramanujan primes between x and 2x tends to infinity with x. This analysis leads us to define a new sequence of prime numbers, which we call derived Ramanujan primes. For n greater than or equal to 1 we define the nth derived Ramanujan prime as the smallest positive integer with the property that if x is greater than or equal to the nth derived Ramanujan prime, then the number of Ramanujan primes in the interval from x to x/2 is greater than or equal to…
Considering Ramanujan primes and the symmetric to them so-called Labos primes, we study their parallel properties, we study all primes with these properties (generalized Ramanujan and Labos primes) and construct two kinds of sieves for them. Finally, we give a further natural generalization of these constructions and pose some conjectures and open problems.
In this paper we establish an explicit upper bound for the first $k$-Ramanujan prime $R_1^{(k)}$ by using a recent result concerning the existence of prime numbers in small intervals.
In this paper we establish several results concerning the generalized Ramanujan primes. For $n\in\mathbb{N}$ and $k \in \mathbb{R}_{> 1}$ we give estimates for the $n$th $k$-Ramanujan prime which lead both to generalizations and to improvements of the results presently in the literature. Moreover, we obtain results about the distribution of $k$-Ramanujan primes. In addition, we find explicit formulae for certain $n$th $k$-Ramanujan primes. As an application, we prove that a conjecture of Mitra, Paul and Sarkar concerning the number of primes in certain intervals holds for every sufficiently la…
The $n$th Ramanujan prime is the smallest positive integer $R_n$ such that for all $x \geq R_n$ the interval $(x/2, x]$ contains at least $n$ primes. In this paper we undertake a study of the sequence $(π(R_n))_{n \in \mathbb{N}}$, which tells us where the $n$th Ramanujan prime appears in the sequence of all primes. In the first part we establish new explicit upper and lower bounds for the number of primes up to the $n$th Ramanujan prime, which imply an asymptotic formula for $π(R_n)$ conjectured by Yang and Togbé. In the second part of this paper, we use these explicit estimates to derive a r…
In this paper, we give a new upper bound for the number $N_{\mathcal{R}}$ which is defined to be the smallest positive integer such that a certain inequality due to Ramanujan involving the prime counting function $π(x)$ holds for every $x \geq N_{\mathcal{R}}$.
A prime p is called Sophie Germain prime if 2p+1 is also prime. A formula for the density of such primes is given in a more general setting using a new approach. This method uses the Ramanujan-Fourier series for a modified von Mangoldt function. The proof remains heuristic as interchange of certain limits has not been justified. Experimental evidence using computer calculations is provided for the plausibility of the result.
The $n$th Ramanujan prime is the smallest positive integer $R_n$ such that if $x \ge R_n$, then the interval $(x/2,x]$ contains at least $n$ primes. We sharpen Laishram's theorem that $R_n < p_{3n}$ by proving that the maximum of $R_n/p_{3n}$ is $R_5/p_{15} = 41/47$. We give statistics on the length of the longest run of Ramanujan primes among all primes $p<10^n$, for $n\le9$. We prove that if an upper twin prime is Ramanujan, then so is the lower; a table gives the number of twin primes below $10^n$ of three types. Finally, we relate runs of Ramanujan primes to prime gaps. Along the way we st…
Universal Ramanujan-type congruences for prime-detecting quasimodular forms
该研究证明了素数检测拟模形式全Z-模上存在无穷多个通用拉马努金型同余式，且对每个素数p均存在对应算术级数使相关系数被p整除。
In this paper, we propose the use of Ramanujan class of polynomials for the construction of prime order elliptic curves using the CM-method. We compare (theoretically and experimentally) the efficiency of using this new class against the use of the Weber, $M_{D,l}(x)$ and $M_{D,p_1,p_2}(x)$ polynomials and show that they clearly outweigh all of them in the generation of prime order elliptic curves.
In this paper we use refined approximations for Chebyshev's $\vartheta$-function to establish new explicit estimates for the prime counting function $π(x)$, which improve the current best estimates for large values of $x$. As an application we find an upper bound for the number $H_0$ which is defined to be the smallest positive integer so that Ramanujan's prime counting inequality holds for every $x \geq H_0$.
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.
For $n\ge 1$, the $n^{\rm th}$ Ramanujan prime is defined as the smallest positive integer $R_n$ such that for all $x\ge R_n$, the interval $(\frac{x}{2}, x]$ has at least $n$ primes. We show that for every $ε>0$, there is a positive integer $N$ such that if $α=2n\left(1+\dfrac{\log 2+ε}{\log n+j(n)}\right)$, then $R_n< p_{[α]}$ for all $n>N$, where $p_i$ is the $i^{\rm th}$ prime and $j(n)>0$ is any function that satisfies $j(n)\to \infty$ and $nj'(n)\to 0$.
On Ramanujan Primes for Hecke-Maass Cusp Forms
本文研究了两个或三个不同原始海格尔-马克斯自拍形式同时满足拉马努金猜想的最小素数上界，以及至少一个形式满足猜想的素数自然密度下界。
We show that if $E/\mathbb{Q}$ is an elliptic curve with a rational $p$-torsion for $p=2$ or $3$, then there is a congruence relation between Ramanujan's tau function and $E$ modulo $p$. We make use of such congruences to compute the Iwasawa invariants of $2$-adic and $3$-adic Mazur--Tate elements attached to Ramanujan's tau function. We also investigate numerically the Iwasawa invariants of the Mazur--Tate elements attached to an elliptic curve with additive reduction at a fixed prime number.
We establish Ramanujan-style congruences modulo certain primes $\ell$ between an Eisenstein series of weight $k$, prime level $p$ and a cuspidal newform in the $\varepsilon$-eigenspace of the Atkin-Lehner operator inside the space of cusp forms of weight $k$ for $Γ_0(p)$. Under a mild assumption, this refines a result of Gaba-Popa. We use these congruences and recent work of Ciolan, Languasco and the third author on Euler-Kronecker constants, to quantify the non-divisibility of the Fourier coefficients involved by $\ell.$ The degree of the number field generated by these coefficients we invest…
Prime values of Ramanujan's tau function
本文研究了Ramanujan tau函数的素数值，证明了在大多数算术级数（mod 23）中素数值构成稀疏集，并得出存在Dirichlet密度为9/11的素数集不能表示为tau函数值的结论。
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.
In 1845, Bertrand conjectured that for all integers $x\ge2$, there exists at least one prime in $(x/2, x]$. This was proved by Chebyshev in 1860, and then generalized by Ramanujan in 1919. He showed that for any $n\ge1$, there is a (smallest) prime $R_n$ such that $π(x)- π(x/2) \ge n$ for all $x \ge R_n$. In 2009 Sondow called $R_n$ the $n$th Ramanujan prime and proved the asymptotic behavior $R_n \sim p_{2n}$ (where $p_m$ is the $m$th prime). In the present paper, we generalize the interval of interest by introducing a parameter $c \in (0,1)$ and defining the $n$th $c$-Ramanujan prime as the …
We prove several Ramanujan-type congruences modulo powers of $5$ for partition $k$-tuples with $5$-cores, for $k=2, 3, 4$. We also prove some new infinite families of congruences modulo powers of primes for $k$-tuples with $p$-cores, where $p$ is a prime.
We prove congruences between cuspidal newforms and Eisenstein series of prime level, which generalize Ramanujan's congruence. Such congruences were recently found by Billerey and Menares, and we refine them by specifying the Atkin-Lehner eigenvalue of the newform involved. We show that similar refinements hold for the level raising congruences between cuspidal newforms of different levels, due to Ribet and Diamond. The proof relies on studying the new subspace and the Eisenstein subspace of the space of period polynomials for the congruence subgroup $Γ_0(N)$, and on a version of Ihara's lemma.
Sondow et al have studied Ramanujan primes (RPs) and observed numerically that, while half of all primes are RPs asymptotically, one obtains runs of consecutives RPs (resp. non-RPs) which are statistically significantly longer than one would expect if one was tossing an unbiased coin. In this discussion paper we attempt a heuristic explanation of this phenomenon. Our heuristic follows naturally from the Prime Number Theorem, but seems to be only partly satisfactory. It motivates why one should obtain long runs of both RPs and non-RPs, and also longer runs of non-RPs than of RPs. However, it al…
Let $\ell$ be any fixed prime number. We define the $\ell$-Genocchi numbers by $G_n:=\ell(1-\ell^n)B_n$, with $B_n$ the $n$-th Bernoulli number. They are integers. We introduce and study a variant of Kummer's notion of regularity of primes. We say that an odd prime $p$ is $\ell$-Genocchi irregular if it divides at least one of the $\ell$-Genocchi numbers $G_2,G_4,\ldots, G_{p-3}$, and $\ell$-regular otherwise. With the help of techniques used in the study of Artin's primitive root conjecture, we give asymptotic estimates for the number of $\ell$-Genocchi irregular primes in a prescribed arithm…
We study some arithmetic properties of the Ramanujan function $τ(n)$, such as the largest prime divisor $P(τ(n))$ and the number of distinct prime divisors $ω(τ(n))$ of $τ(n)$ for various sequences of $n$. In particular, we show that \hbox{$P(τ(n)) \geq (\log n)^{33/31 + o(1)}$} for infinitely many $n$, and \begin{equation*} P(τ(p)τ(p^2)τ(p^3)) > (1+o(1))\frac{\log\log p\log\log\log p} {\log\log\log\log p} \end{equation*} for every prime $p$ with \hbox{$τ(p)\neq 0$}.
ABC implies that Ramanujan's tau function misses almost all primes
在 ABC 猜想假设下，证明了 tau 函数的素数值密度为 O(X^{13/22})，表明 tau 函数错过大部分素数，同时提出 S(X) 可能无限且有预测阶数。
The $n$th Ramanujan prime is the smallest positive integer $R_n$ such that if $x \ge R_n$, then there are at least $n$ primes in the interval $(x/2,x]$. For example, Bertrand's postulate is $R_1 = 2$. Ramanujan proved that $R_n$ exists and gave the first five values as 2, 11, 17, 29, 41. In this note, we use inequalities of Rosser and Schoenfeld to prove that $2n \log 2n < R_n < 4n \log 4n$ for all $n$, and we use the Prime Number Theorem to show that $R_n$ is asymptotic to the $2n$th prime. We also estimate the length of the longest string of consecutive Ramanujan primes among the first $n$ p…
On Proving Ramanujan's Inequality using a Sharper Bound for the Prime Counting Function $π(x)$
本文利用 Chebyshev Theta 函数 $\vartheta(x)$ 的估计导出素数计数函数 $π(x)$ 的更紧界，从而无条件证明了 Ramanujan 不等式对所有 $x\geq \exp(43.5102147)$ 成立。
In this Note we show that given any cusp form πon GL(3) over the rationals, there exist an infinite number of primes p which are Ramanujan for π, i.e., that the local components π_p are tempered for an infinite number of p. It turns out that the key structural device which is needed is the degree 8 adjoint L-function of π.
A small survey of work done on estimating the number of integers without large prime factors up to around 1950 is provided. Around 1950 N.G. de Bruijn published results that dramatically advanced the subject and started a new era in this topic.
Ramanujan's function on small primes
本文研究了拉马努金函数在小素数上的特征值振荡现象，并探讨其对勒默问题的潜在应用。
Explicit formulas involving a generalized Ramanujan sum are derived. An analogue of the prime number theorem is obtained and equivalences of the Riemann hypothesis are shown. Finally, explicit formulas of Bartz are generalized.
For all $k \geq 3$, we show how one can explicitly construct an infinite family of $k$-regular graphs all of which have second largest eigenvalue satisfying the bound $O(k^{1/2})$. This resolves an open problem of Reingold, Vadhan and Wigderson.
Ramanujan's congruence primes
本研究受拉马努金关于尖点形式傅里叶系数与素数691的同余结论启发，发现素数67出现在模5二次狄利克雷特征的L函数相关比值的分子中，导出了$Γ_0(5)$上权6尖点形式与艾森斯坦级数的模67同余关系。
The method of Murty and Cioabă shows how one can use results about gaps between primes to construct families of almost-Ramanujan graphs. In this paper we give a simpler construction which avoids the search for perfect matchings and thus eliminates the need for computation. A couple of recent explicit bounds on the gap between consecutive primes are then used to give the construction of $k$-regular families with explicit lower bounds on the spectral gaps. We then show that a result of Ben-Aroya and Ta-Shma can be improved using our simpler construction on the assumption of the Riemann Hypothesi…
We prove a number of results regarding odd values of the Ramanujan $τ$-function. For example, we prove the existence of an effectively computable positive constant $κ$ such that if $τ(n)$ is odd and $n \ge 25$ then either \[ P(τ(n)) \; > \; κ\cdot \frac{\log\log\log{n}}{\log\log\log\log{n}} \] or there exists a prime $p \mid n$ with $τ(p)=0$. Here $P(m)$ denotes the largest prime factor of $m$. We also solve the equation $τ(n)=\pm 3^{b_1} 5^{b_2} 7^{b_3} 11^{b_4}$ and the equations $τ(n)=\pm q^b$ where $3\le q < 100$ is prime and the exponents are arbitrary nonnegative integers. We make use of…
Let p be an odd prime, such that p_n<p/2<p_{n+1}, where p_n is the n-th prime. We study the following question: with what probability does there exist a prime in the interval (p, 2p_{n+1})? After the strong definition of the probability with help of the Ramanujan primes ([11], [12])and the introducing pseudo-Ramanujan primes, we show, that if such probability P exists, then P>=0.5. We also study a symmetrical case of the left intervals, which connected with sequence A080359 at OEIS.
On some values which do not belong to the image of Ramanujan's tau-function
本文证明了Ramanujan tau函数在n≥1时，除14种情况外，不取±ℓ, ±2ℓ, ±4ℓ, ±8ℓ这些值，其中ℓ<1000为奇素数，推广了Lehmer猜想的相关结果。
We shall show that, for any positive integer $D>0$ and any primes $p_1, p_2$ not dividing $D$, the diophantine equation $x^2+D=2^s p_1^k p_2^l$ has at most $63$ integer solutions $(x, k, l, s)$ with $x, k, l\geq 0$ and $s\in \{0, 2\}$.
Recently Lachterman, Schayer, and Younger published an elegant proof of the Ramanujan congruences for the partition function $p(n)$. Their proof uses only the classical theory of modular forms as well as a beautiful result of Choie, Kohnen, and Ono, without need for Hecke operators. In this paper we give a method for generalizing Lachterman, Schayer, and Younger's proof to include Ramanujan congruences for multipartition functions $p_k(n)$, and Ramanujan congruences for $p(n)$ modulo certain prime powers.
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 the sixth chapter of his notebooks Ramanujan introduced a method of summing divergent series which assigns to the series the value of the associated Euler-MacLaurin constant that arises by applying the Euler-MacLaurin summation formula to the partial sums of the series. This method is now called the Ramanujan summation process. In this paper we calculate the Ramanujan sum of the exponential generating functions $\sum_{n\geq 1}\log n e^{nz}$ and $\sum_{n\geq 1}H_n^{(j)} e^{-nz}$ where $H_n^{(j)}=\sum_{m=1}^n \frac{1}{m^j}$. We find a surprising relation between the two sums when $j=1$ from w…
Let $τ(n)$ be the Ramanujan $τ$-function. We prove that for any integer $N$ the diophantine equation $$ \sum_{i=1}^{74000}τ(n_i)=N $$ has a solution in positive integers $n_1, n_2,..., n_{74000}$ satisfying the condition $$ \max_{1\le i\le 74000}n_i\ll |N|^{2/11}+1. $$ We also consider similar questions in the residue ring modulo a large prime $p.$
We introduce a fast algorithm to compute the Ramanujan-Deninger gamma function and its logarithmic derivative at positive values. Such an algorithm allows us to greatly extend the numerical investigations about the Euler-Kronecker constants $\mathfrak{G}_q$, $\mathfrak{G}_q^+$ and $M_q=\max_{χ\ne χ_0} \vert L^\prime/L(1,χ)\vert$, where $q$ is an odd prime, $χ$ runs over the primitive Dirichlet characters $\bmod\ q$, $χ_0$ is the trivial Dirichlet character $\bmod\ q$ and $L(s,χ)$ is the Dirichlet $L$-function associated to $χ$. Using such algorithms we obtained that $\mathfrak{G}_{50 040 955 6…
Towards the end of his life Ramanujan wrote a manuscript on properties of the partition and tau functions, some parts of which remained unpublished until very recently. Nevertheless, this manuscript gave rise to a lot of subsequent work. In it Ramanujan considers congruences for $τ(n)$ modulo some special primes q. He proves for example that $τ(n)\equiv \sum_{d|n}d^{11}({\rm mod}691)$. He defines $t_n=1$ if $τ(n)$ is not divisible by q and $t_n=0$ otherwise. He then typically writes: "It can be shown by transcendental methods that $$ \sum_{k=1}^n t_k=C\int_1^n {dx\over (\log x)^δ}+O({n\over (\…
Following Wigert, various authors, including Ramanujan, Gronwall, Erdős, Ivić, Schwarz, Wirsing, and Shiu, determined the maximal order of several multiplicative functions, generalizing Wigert's result $$\max_{n\leq x} \log d(n) = \frac{\log x}{\log \log x} (\log 2 + o(1)). $$ On the contrary, for many multiplicative functions, the maximal order of iterations of the functions remains widely open. The case of the iterated divisor function was only solved recently, answering a question of Ramanujan from 1915. Here we determine the maximal order of $\log f(f(n))$ for a class of multiplicative fun…
We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these established expansions generating sums of the form $\sum_{d: (d,n)=1} f(d)$ (type I) and the Anderson-Apostol sums $\sum_{d|(m,n)} f(d) g(n/d)$ (type II) for any arithmetic functions $f$ and $g$. Our treatment of the type II sums includes a matrix-based factorization method relating the partition function $p(n)$ to arbitrary arithmetic functions $f$. We also conclude…
On Ramanujan smooth expansions for a general arithmetic function
本文详细研究了一般算术函数的 Ramanujan smooth 展开，提出了针对无平方因子且素因子不超过 $P$ 的自变量的 $P-$local 展开方法，并给出了特定算术函数子集的局部与全局展开一般结果。
Let $k$ be a positive integer. In this paper, using the modular approach, we prove that if $k\equiv 0 \pmod{4}$, $30< k<724$ and $2k-1$ is an odd prime power, then under the GRH, the equation $x^2+(2k-1)^y=k^z$ has only one positive integer solution $(x,y,z)=(k-1,1,2)$. The above results solve some difficult cases of Terai's conecture concerning this equation.
The Hardy--Ramanujan inequality for sifted sets and its applications
本文建立了适用于筛集的Hardy-Ramanujan不等式加权版本，并将其应用于多个数论问题，包括大偏差、乘法表问题和移位素数因数等。
In this paper, we are going to prove a famous problem concerning prime numbers. Bertrand postulate states that there is always a prime p with n < p < 2n, if n > 1. Bertrand postulate is not a newer one to be proven, in fact, after his assumption and numerical evidence, Chebyshev was the first person who proved it. Subsequently, Ramanujan proved it using properties of Gamma function, and Erdös published a simpler proof with the help of Primorial function, p#. Our approach is unique in the sense that we have used mathematical induction for finding the upper and lower bounds for the second Chebys…
Landau and Ramanujan approximations for divisor sums and coefficients of cusp forms
本文通过计算 Euler-Kronecker 常数得到除数和函数计数函数渐近展开的二阶项，并确定 Ramanujan 逼近优于 Landau 逼近的条件，进而研究六个尖形式 Fourier 系数的不可整除性。
A continued fraction $v(τ)$ of Ramanujan is evaluated at certain arguments in the field $K = \mathbb{Q}(\sqrt{-d})$, with $-d \equiv 1$ (mod $8$), in which the ideal $(2) = \wp_2 \wp_2'$ is a product of two prime ideals. These values of $v(τ)$ are shown to generate the inertia field of $\wp_2$ or $\wp_2'$ in an extended ring class field over the field $K$. The conjugates over $\mathbb{Q}$ of these same values, together with $0, -1 \pm \sqrt{2}$, are shown to form the exact set of periodic points of a fixed algebraic function $\hat F(x)$, independent of $d$. These are analogues of similar resul…
Sums of two squares and the tau-function: Ramanujan's trail
本文为综述，梳理了拉马努金在两平方数和计数、tau函数素数不可整除性方面的论断，补充相关历史细节并介绍后续进展，展现其在数论领域的探索性贡献。
This article considers the eta power $\prod {(1-q^k)}^{b-1}$. It is proved that the coefficients of $\frac{q^n}{n!}$ in this expression, as polynomials in $b$, exhibit equidistribution of the coefficients in the nonzero residue classes mod 5 when $n=5j+4$. Other symmetries, as well as symmetries for other primes and prime powers, are proved, and some open questions are raised.
The null-function $0(a):=0$, $\forall a\in $N, has Ramanujan expansions: $0(a)=\sum_{q=1}^{\infty}(1/q)c_q(a)$ (where $c_q(a):=$ Ramanujan sum), given by Ramanujan, and $0(a)=\sum_{q=1}^{\infty}(1/φ(q))c_q(a)$, given by Hardy ($φ:=$ Euler's totient function). Both converge pointwise (not absolutely) in N. A $G:$N $\rightarrow $C is called a Ramanujan coefficient, abbrev. R.c., iff (if and only if) $\sum_{q=1}^{\infty}G(q)c_q(a)$ converges in all $a\in $N; given $F:$N $\rightarrow $C, we call $<F>$, the set of its R.c.s, the Ramanujan cloud of $F$. Our Main Theorem in arxiv:1910.14640, for Rama…
Laurent coefficients of Zagier-type zeta function {à} la Ishibashi and arithmetic aspects of extended Ramanujan period function
本文仿照Ishibashi方法推导Zagier型zeta函数$\tilde{\mathcal{Z}}$在$s=1$处的全部Laurent系数，并研究其中涉及的函数$\mathfrak{F}_k^0(x)$的函数方程、Hecke算子作用及积分联系。
We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property, and it depends on new criteria ensuring all iterates of f are irreducible. In particular when F is a number field in which the ideal (2) is not a square, we construct infinitely many families of quadratic f such that every iterate f^n is irreducible over F, but f^n is reducible modulo all primes of F for n at least 2. We also give an example for each n of a q…
Small Primes And The Tau Function
本文研究 Ramanujan tau 函数取小素数值的问题，证明 τ(n)=±p 不会取到任何不超过 8.0×10^25 的素数 p。
In the spirit of Lehmer's speculation that Ramanujan's tau-function never vanishes, it is natural to ask whether any given integer $α$ is a value of $τ(n)$. For odd $α$, Murty, Murty, and Shorey proved that $τ(n)\neq α$ for sufficiently large $n$. Several recent papers have identified explicit examples of odd $α$ which are not tau-values. Here we apply these results (most notably the recent work of Bennett, Gherga, Patel, and Siksek) to offer the first examples of even integers that are not tau-values. Namely, for primes $\ell$ we find that $$ τ(n)\not \in \{ \pm 2\ell \ : \ 3\leq \ell< 100\} …
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。