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 math.COShow all

4 papers · 1 filter

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…

math.CO2017★ 2 cited

Some intriguing upper bounds for separating hash families

Gennian Ge, Chong Shangguan, Xin Wang

An $N \times n$ matrix on $q$ symbols is called ${w_{1}, \dots, w_{t}}$ -separating if for arbitrary $t$ pairwise disjoint column sets $C_{1}, \dots, C_{t}$ with $∣ C_{i} ∣ = w_{i}$ for $1\le i\le t…

math.CO2017★ 7 cited

Sparse hypergraphs: new bounds and constructions

Gennian Ge, Chong Shangguan

Let $f_{r} (n, v, e)$ denote the maximum number of edges in an $r$ -uniform hypergraph on $n$ vertices, in which the union of any $e$ distinct edges contains at least $v + 1$ vertices. The…

math.CO2016★ 2 cited

Maximum subsets of $F_{q}^{n}$ containing no right angles

Gennian Ge, Chong Shangguan

Recently, Croot, Lev, and Pach (Ann. of Math., 185:331--337, 2017.) and Ellenberg and Gijswijt (Ann. of Math., 185:339--443, 2017.) developed a new polynomial method and used it to…

Thresholds and spread in set systems of bounded VC-dimension

Some intriguing upper bounds for separating hash families

Sparse hypergraphs: new bounds and constructions

Maximum subsets of Fqn​ containing no right angles

Maximum subsets of $F_{q}^{n}$ containing no right angles