Chong Shangguan

collaborators

3 papers

math.CO2026

An ErdÅs Matching Conjecture for Vector Spaces

Baoyan Feng, Chong Shangguan, Yulin Yang +1

We study a vector-space analogue of the ErdÅs Matching Conjecture. Let $m_{q} (n, k, s)$ denote the maximum cardinality of a family of $k$ -dimensional subspaces of an $n$ -dimensional v…

math.CO2026

Balanced Sperner families via the topological Tverberg theorem

Chong Shangguan, Zixiang Xu, Yulin Yang

For every prime power $r \geq 2$ , we show that any Sperner family $F \subseteq 2^{[n]}$ with $∣ F ∣ \geq (r - 1) n + 1$ contains $r$ pairwise disjoint nonempty subfamilies wh…

cs.IT2026

Improved Rate-versus-Distance Upper Bounds for LDPC Codes

Chong Shangguan, Yulin Yang

LDPC codes play a vital role in coding theory and practical error correction. A central problem in this direction is to understand their rate--distance tradeoff. In this paper, we…

An ErdÅs Matching Conjecture for Vector Spaces

Balanced Sperner families via the topological Tverberg theorem

Improved Rate-versus-Distance Upper Bounds for LDPC Codes

An ErdÅs Matching Conjecture for Vector Spaces