SZShengtong Zhang

Shengtong Zhang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Shengtong Zhang has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    EULER-KRONECKER CONSTANTS FOR CYCLOTOMIC FIELDS

    by Letong Hong, Ken Ono, Shengtong Zhang

    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

    Log-concavity in powers of infinite series close to $(1 - z)^{-1}$

    by Shengtong Zhang

    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$$ f ( z ) = ∑ n a n z n is an infinite series with $$a_n \ge 1$$ a n ≥ 1 and $$a_0 + \cdots + a_n = O(n + 1)$$ a 0 + ⋯ + a n = O ( n + 1 ) for all n, we prove that a super-polynomially long initial segment of $$f^k(z)$$ f k ( z ) is log-concave. Furthermore, if there exists constants $$C > 1$$ C > 1 and $$\alpha < 1$$ α < 1 such that $$a_0 + \cdots + a_n = C(n + 1) - R_n$$ a 0 + ⋯ + a n = C ( n + 1 ) - R n where $$0 \le R_n \le O((n + 1)^{\alpha })$$ 0 ≤ R n ≤ O ( ( n + 1 ) α ) , we show that an exponentially long initial segment of $$f^k(z)$$ 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)$$ Q n ( z ) are unimodal for sufficiently large n.


  • Open Access

    Log-Concavity in Powers of Infinite Series Close to $(1-z)^{-1}$

    by Shengtong Zhang

    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

    by Letong Hong, Ken Ono, Shengtong Zhang

    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

    No extremal square-free words over large alphabets

    by Letong Hong, Shengtong Zhang

    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

    by Letong Hong, Michael H. Mertens, Ken Ono, Shengtong Zhang

    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

    by Tanmay Khale, Cooper O'Kuhn, Apoorva Panidapu, Alec Sun, Shengtong Zhang

    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 Access

    Note on the Turán number of the $3$-linear hypergraph $C_{13}$

    by Chaoliang Tang, Hehui Wu, Shengtong Zhang, Zeyu Zheng

    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

    by Letong Hong, Shengtong Zhang

    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.