Chong Shangguan

activity

20142026

most citedCentralized coded caching schemes: A hypergraph theoretical approach

12 citations · 43 across the 16 of their papers we have counts for

collaborators

Showing 2026Show all

4 papers · 1 filter

math.CO2026

A near-quadratic lower bound for the Brown--Erdős--Sós $(9, 6)$ -problem

Xiangliang Kong, Chong Shangguan, Xin Wang

Let $f_{3} (n, e + 3, e)$ denote the maximum number of edges in an $n$ -vertex $3$ -uniform hypergraph containing no $e$ distinct edges spanning at most $e + 3$ vertices. It has long been con…

math.CO2026

Thresholds and spread in set systems of bounded VC-dimension

Chong Shangguan

Let $p_{c} (F)$ , $q (F)$ , and $q_{f} (F)$ denote the threshold, expectation threshold, and fractional expectation threshold of a family $F$ of nonempty…

cs.IT2026

The Optimal Asymptotic Rate of Generalized Covering Codes

Hengzhuo Li, Chong Shangguan, Hengjia Wei

Let $G_{q}$ be an alphabet of size $q \geq 2$ . We determine the optimal asymptotic rate of generalized covering codes $C \subseteq G_{q}^{n}$ , whose covering centers in $G_{q}^{t \times n}$ ar…

cs.IT2026

Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets

Zeyu Guo, Roshan Raj, Chong Shangguan +1

We give new explicit constructions of several fundamental objects in linear-algebraic pseudorandomness and combinatorics, including lossless rank extractors, weak subspace designs,…

A near-quadratic lower bound for the Brown--Erdős--Sós (9,6)-problem

Thresholds and spread in set systems of bounded VC-dimension

The Optimal Asymptotic Rate of Generalized Covering Codes

Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets

A near-quadratic lower bound for the Brown--Erdős--Sós $(9, 6)$ -problem