Jing-Jun Yu

activity

20242026

collaborators

4 papers

math.CO2026

The Maximum Number of Shortest Paths in Graphs

Jing Yu, Jie-Xiang Zhu

Benjamini and Tzalik obtained an upper bound on the number of shortest paths between two vertices at distance $t$ in a multigraph of maximum degree at most $Δ$ , and proposed a conj…

math.CO2025

Maximum in-general-position set in a random subset of $F_{q}^{d}$

Yaobin Chen, Jiaxi Nie, Jing Yu +1

Let $α (F_{q}^{d}, p)$ be the maximum possible size of a point set in general position in a $p$ -random subset of $F_{q}^{d}$ . We determine the order of magnitude of $α(\m…

math.CO2025

Counting degree-constrained orientations

Jing Yu, Jie-Xiang Zhu

We study the enumeration of graph orientations under local degree constraints. Given a finite graph $G = (V, E)$ and a family of admissible sets $\{\mathsf P_v \subseteq \mathbb{Z}…

math.NT2024

$v$ -adic periods of Carlitz motives and Chowla-Selberg formula revisited

Chieh-Yu Chang, Fu-Tsun Wei, Jing Yu

Let $v$ be a finite place of $F_{q} (θ)$ . In this paper, we interpret $v$ -adic arithmetic gamma values in terms of the $v$ -adic crystalline-de Rham periods of Carlitz motives…

The Maximum Number of Shortest Paths in Graphs

Maximum in-general-position set in a random subset of Fqd​

Counting degree-constrained orientations

v-adic periods of Carlitz motives and Chowla-Selberg formula revisited

Maximum in-general-position set in a random subset of $F_{q}^{d}$

$v$ -adic periods of Carlitz motives and Chowla-Selberg formula revisited