Shengtong Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shengtong Zhang has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Letong Hong
Department of Mathematics, Massachusetts Institute of Technology, Cambridge, USA
7 shared publications - Ken Ono
Department of Mathematics, University of Virginia, Charlottesville, USA
3 shared publications - Alec Sun
The University of Chicago, Chicago, IL, USA
1 shared publication - Apoorva Panidapu
Stanford University, Stanford, CA, USA
1 shared publication - Chaoliang Tang1 shared publication
- Cooper O'Kuhn1 shared publication
Latest Publications
- Open Access
- 1 February 2023
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 107 (1) , 79-84
EULER-KRONECKER CONSTANTS FOR CYCLOTOMIC FIELDS
The Euler-Mascheroni constant gamma = 0.5772... is the K = Q example of an Euler-Kronecker constant gamma(K) of a number field K. In this note, we consider the size of the gamma(q) = gamma(Kq) for cyclotomic fields K-q:= Q(zeta(q)). Assuming the Elliott-Halberstam Conjecture (EH), we prove uniformly in Q that 1/Q Sigma(Q<q <= 2Q) vertical bar gamma(q) - log q vertical bar = o(log Q). In other words, under EH, the gamma(q)/log q in these ranges converge to the one point distribution at 1. This theorem refines and extends a previous result of Ford, Luca and Moree for prime q. The proof of this result is a straightforward modification of earlier work of Fouvry under the assumption of EH.
- 1 February 2023
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 107 (1) , 79-84
Open AccessEULER-KRONECKER CONSTANTS FOR CYCLOTOMIC FIELDS
The Euler-Mascheroni constant gamma = 0.5772... is the K = Q example of an Euler-Kronecker constant gamma(K) of a number field K. In this note, we consider the size of the gamma(q) = gamma(Kq) for cyclotomic fields K-q:= Q(zeta(q)). Assuming the Elliott-Halberstam Conjecture (EH), we prove uniformly in Q that 1/Q Sigma(Q<q <= 2Q) vertical bar gamma(q) - log q vertical bar = o(log Q). In other words, under EH, the gamma(q)/log q in these ranges converge to the one point distribution at 1. This theorem refines and extends a previous result of Ford, Luca and Moree for prime q. The proof of this result is a straightforward modification of earlier work of Fouvry under the assumption of EH.
- Open Access
- 12 September 2022
- Published by Springer Nature in Research in Number Theory
- Vol. 8 (4) , 1-17
Log-concavity in powers of infinite series close to $(1 - z)^{-1}$In this paper, we use the analytic method of Odlyzko and Richmond to study the log-concavity of power series. If $$f(z) = \sum _n a_nz^n$$ is an infinite series with $$a_n \ge 1$$ and $$a_0 + \cdots + a_n = O(n + 1)$$ for all n, we prove that a super-polynomially long initial segment of $$f^k(z)$$ is log-concave. Furthermore, if there exists constants $$C > 1$$ and $$\alpha < 1$$ such that $$a_0 + \cdots + a_n = C(n + 1) - R_n$$ where $$0 \le R_n \le O((n + 1)^{\alpha })$$ , we show that an exponentially long initial segment of $$f^k(z)$$ is log-concave. This resolves a conjecture proposed by Letong Hong and the author, which implies another conjecture of Heim and Neuhauser that the Nekrasov-Okounkov polynomials $$Q_n(z)$$ are unimodal for sufficiently large n.- 12 September 2022
- Published by Springer Nature in Research in Number Theory
- Vol. 8 (4) , 1-17
Open AccessLog-concavity in powers of infinite series close to $(1 - z)^{-1}$In this paper, we use the analytic method of Odlyzko and Richmond to study the log-concavity of power series. If $$f(z) = \sum _n a_nz^n$$ is an infinite series with $$a_n \ge 1$$ and $$a_0 + \cdots + a_n = O(n + 1)$$ for all n, we prove that a super-polynomially long initial segment of $$f^k(z)$$ is log-concave. Furthermore, if there exists constants $$C > 1$$ and $$\alpha < 1$$ such that $$a_0 + \cdots + a_n = C(n + 1) - R_n$$ where $$0 \le R_n \le O((n + 1)^{\alpha })$$ , we show that an exponentially long initial segment of $$f^k(z)$$ is log-concave. This resolves a conjecture proposed by Letong Hong and the author, which implies another conjecture of Heim and Neuhauser that the Nekrasov-Okounkov polynomials $$Q_n(z)$$ are unimodal for sufficiently large n. - Open AccessLog-Concavity in Powers of Infinite Series Close to $(1-z)^{-1}$In this paper, we use the analytic method of Odlyzko and Richmond to study the log-concavity of power series. If $f(z) = \sum_n a_nz^n$ is an infinite series with $a_n \geq 1$ and $a_0 + \cdots + a_n = O(n + 1)$ for all $n$, we prove that a super-polynomially long initial segment of $f^k(z)$ is log-concave. Furthermore, if there exists constants $C > 1$ and $\alpha < 1$ such that $a_0 + \cdots + a_n = C(n + 1) - R_n$ where $0 \leq R_n \leq O((n + 1)^{\alpha})$, we show that an exponentially long initial segment of $f^k(z)$ is log-concave. This resolves a conjecture proposed by Letong Hong and the author, which implies another conjecture of Heim and Neuhauser that the Nekrasov-Okounkov polynomials $Q_n(z)$ are unimodal for sufficiently large $n$.Open AccessLog-Concavity in Powers of Infinite Series Close to $(1-z)^{-1}$In this paper, we use the analytic method of Odlyzko and Richmond to study the log-concavity of power series. If $f(z) = \sum_n a_nz^n$ is an infinite series with $a_n \geq 1$ and $a_0 + \cdots + a_n = O(n + 1)$ for all $n$, we prove that a super-polynomially long initial segment of $f^k(z)$ is log-concave. Furthermore, if there exists constants $C > 1$ and $\alpha < 1$ such that $a_0 + \cdots + a_n = C(n + 1) - R_n$ where $0 \leq R_n \leq O((n + 1)^{\alpha})$, we show that an exponentially long initial segment of $f^k(z)$ is log-concave. This resolves a conjecture proposed by Letong Hong and the author, which implies another conjecture of Heim and Neuhauser that the Nekrasov-Okounkov polynomials $Q_n(z)$ are unimodal for sufficiently large $n$.
- Open Access
Euler-Kronecker constants for cyclotomic fields
The Euler-Mascheroni constant $\gamma=0.5772\dots\!$ is the $K=\mathbb{Q}$ example of an Euler-Kronecker constant $\gamma_K$ of a number field $K.$ In this note we consider the size of the $\gamma_q=\gamma_{K_q}$ for cyclotomic fields $K_q:=\mathbb{Q}(\zeta_q).$ Assuming the Elliott-Halberstam Conjecture (EH), we prove uniformly in $Q$ that $$\frac{1}{Q}\sum_{Q<q\le 2Q} \left |\gamma_q - \log q\right |= o(\log Q).$$ In other words, under EH the $\gamma_q / \log q$ in these ranges converge to the one point distribution at $1$. This theorem refines and extends a previous result of Ford, Luca, and Moree for prime $q.$Open AccessEuler-Kronecker constants for cyclotomic fields
The Euler-Mascheroni constant $\gamma=0.5772\dots\!$ is the $K=\mathbb{Q}$ example of an Euler-Kronecker constant $\gamma_K$ of a number field $K.$ In this note we consider the size of the $\gamma_q=\gamma_{K_q}$ for cyclotomic fields $K_q:=\mathbb{Q}(\zeta_q).$ Assuming the Elliott-Halberstam Conjecture (EH), we prove uniformly in $Q$ that $$\frac{1}{Q}\sum_{Q<q\le 2Q} \left |\gamma_q - \log q\right |= o(\log Q).$$ In other words, under EH the $\gamma_q / \log q$ in these ranges converge to the one point distribution at $1$. This theorem refines and extends a previous result of Ford, Luca, and Moree for prime $q.$ - Open Access
- 29 March 2022
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 2 (1)
No extremal square-free words over large alphabets
A word is square-free if it does not contain any square (a word of the form $XX$), and is extremal square-free if it cannot be extended to a new square-free word by inserting a single letter at any position. Grytczuk, Kordulewski, and Niewiadomski proved that there exist infinitely many ternary extremal square-free words. We establish that there are no extremal square-free words over any alphabet of size at least $17$.Mathematics Subject Classifications: 05A05, 05D10, 68R15- 29 March 2022
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 2 (1)
Open AccessNo extremal square-free words over large alphabets
A word is square-free if it does not contain any square (a word of the form $XX$), and is extremal square-free if it cannot be extended to a new square-free word by inserting a single letter at any position. Grytczuk, Kordulewski, and Niewiadomski proved that there exist infinitely many ternary extremal square-free words. We establish that there are no extremal square-free words over any alphabet of size at least $17$.Mathematics Subject Classifications: 05A05, 05D10, 68R15 - Open Access
Proof of the elliptic expansion Moonshine Conjecture of Căldăraru, He, and Huang
Using predictions in mirror symmetry, C\u{a}ld\u{a}raru, He, and Huang recently formulated a "Moonshine Conjecture at Landau-Ginzburg points" for Klein's modular $j$-function at $j=0$ and $j=1728.$ The conjecture asserts that the $j$-function, when specialized at specific flat coordinates on the moduli spaces of versal deformations of the corresponding CM elliptic curves, yields simple rational functions. We prove this conjecture, and show that these rational functions arise from classical $ _2F_1$-hypergeometric inversion formulae for the $j$-function.Open AccessProof of the elliptic expansion Moonshine Conjecture of Căldăraru, He, and Huang
Using predictions in mirror symmetry, C\u{a}ld\u{a}raru, He, and Huang recently formulated a "Moonshine Conjecture at Landau-Ginzburg points" for Klein's modular $j$-function at $j=0$ and $j=1728.$ The conjecture asserts that the $j$-function, when specialized at specific flat coordinates on the moduli spaces of versal deformations of the corresponding CM elliptic curves, yields simple rational functions. We prove this conjecture, and show that these rational functions arise from classical $ _2F_1$-hypergeometric inversion formulae for the $j$-function. - Open Access
A Bombieri-Vinogradov Theorem for primes in short intervals and small sectors
Let $K$ be a finite Galois extension of $\mathbb{Q}$. We count primes in short intervals represented by the norm of a prime ideal of $K$ satisfying a small sector condition determined by Hecke characters. We also show that such primes are well-distributed in arithmetic progressions in the sense of Bombieri-Vinogradov. This extends previous work of Duke and Coleman.Open AccessA Bombieri-Vinogradov Theorem for primes in short intervals and small sectors
Let $K$ be a finite Galois extension of $\mathbb{Q}$. We count primes in short intervals represented by the norm of a prime ideal of $K$ satisfying a small sector condition determined by Hecke characters. We also show that such primes are well-distributed in arithmetic progressions in the sense of Bombieri-Vinogradov. This extends previous work of Duke and Coleman. - Open AccessNote on the Turán number of the $3$-linear hypergraph $C_{13}$Let the crown $C_{13}$ be the linear $3$-graph on $9$ vertices $\{a,b,c,d,e,f,g,h,i\}$ with edges $$E = \{\{a,b,c\}, \{a, d,e\}, \{b, f, g\}, \{c, h,i\}\}.$$ Proving a conjecture of Gy\'arf\'as et. al., we show that for any crown-free linear $3$-graph $G$ on $n$ vertices, its number of edges satisfy $$\lvert E(G) \rvert \leq \frac{3(n - s)}{2}$$ where $s$ is the number of vertices in $G$ with degree at least $6$. This result, combined with previous work, essentially completes the determination of linear Tur\'an number for linear $3$-graphs with at most $4$ edges.Open AccessNote on the Turán number of the $3$-linear hypergraph $C_{13}$Let the crown $C_{13}$ be the linear $3$-graph on $9$ vertices $\{a,b,c,d,e,f,g,h,i\}$ with edges $$E = \{\{a,b,c\}, \{a, d,e\}, \{b, f, g\}, \{c, h,i\}\}.$$ Proving a conjecture of Gy\'arf\'as et. al., we show that for any crown-free linear $3$-graph $G$ on $n$ vertices, its number of edges satisfy $$\lvert E(G) \rvert \leq \frac{3(n - s)}{2}$$ where $s$ is the number of vertices in $G$ with degree at least $6$. This result, combined with previous work, essentially completes the determination of linear Tur\'an number for linear $3$-graphs with at most $4$ edges.
- Open Access
No extremal square-free words over large alphabets
A word is square-free if it does not contain any square (a word of the form $XX$), and is extremal square-free if it cannot be extended to a new square-free word by inserting a single letter at any position. Grytczuk, Kordulewski, and Niewiadomski proved that there exist infinitely many ternary extremal square-free words. We establish that there are no extremal square-free words over any alphabet of size at least 17.
Open AccessNo extremal square-free words over large alphabets
A word is square-free if it does not contain any square (a word of the form $XX$), and is extremal square-free if it cannot be extended to a new square-free word by inserting a single letter at any position. Grytczuk, Kordulewski, and Niewiadomski proved that there exist infinitely many ternary extremal square-free words. We establish that there are no extremal square-free words over any alphabet of size at least 17.
- 19 February 2021
- Published by Springer Nature in Research in Number Theory
- Vol. 7 (1) , 1-11
Towards Heim and Neuhauser’s unimodality conjecture on the Nekrasov–Okounkov polynomials
- 19 February 2021
- Published by Springer Nature in Research in Number Theory
- Vol. 7 (1) , 1-11
Towards Heim and Neuhauser’s unimodality conjecture on the Nekrasov–Okounkov polynomials