Gennian Ge

activity

20242026

most citedThe Frankl-Pach upper bound is not tight for any uniformity

1 citations · 1 across the 17 of their papers we have counts for

collaborators

Showing 2026Show all

11 papers · 1 filter

math.CO2026

The maximum $t$ -diversity of $t$ -intersecting families of permutations

Yuhang Cao, Gennian Ge, Jian Wang +2

The study of $t$ -intersecting families in symmetric groups received lots of attention in the last two decades. In this paper, we study two different kinds of stability results for…

math.CO2026

Economical lattice coverings by determined segments

Gennian Ge, Yang Shu, Zixiang Xu

For fixed $d \geq 2$ , let $τ_{d} (n)$ be the minimum size of a set $S \subseteq {0, \dots, n}^{d}$ such that the affine lines determined by pairs of distinct points of $S$ cover the grid.…

math.CO2026

Largest Sperner families with restricted differences

Gennian Ge, Zixiang Xu, Xiaochen Zhao

Let $L$ be a fixed set of positive integers. A family $F \subseteq 2^{[n]}$ is called $L$ -differencing if $∣ A ∖ B ∣ \in L$ for every ordered pair of distin…

math.CO2026

All simplices exhibit canonical Ramsey property

Gennian Ge, Yang Shu, Zixiang Xu +1

We prove that all nondegenerate simplices have the canonical Ramsey property, thereby resolving a central open problem in canonical Euclidean Ramsey theory and providing a canonica…

math.CO2026

Recursive Lifting Beyond the Ahlswede--Khachatrian Construction

Xiaochen Zhao, Gennian Ge

For the Erdős--Frankl--Pach problem on uniform set systems of bounded VC-dimension, the Ahlswede--Khachatrian/Mubayi--Zhao construction has long served as the standard lower-bound…

math.CO2026

Tverberg's theorem for unions of convex sets: Sharp bounds and colored extensions

Gennian Ge, Yang Shu, Zixiang Xu

Let $f_{r} (d, s_{1}, \dots, s_{r})$ be the least $N$ such that every $N$ -point set $P \subseteq R^{d}$ has an $r$ -partition $P = P_{1} ⊔ \dots ⊔ P_{r}$ with the followin…

math.CO2026

Extremal Deletion-Ball Intersections under Run-Count and Lower-Order Deletion-Ball Intersection Constraints

Yubo Sun, Gennian Ge

Motivated by sequence reconstruction and reconstruction codes, we study extremal intersections of deletion balls over a fixed $q$ -ary alphabet. Let $Σ_{q}^{n}$ be the set of sequences…

math.CO2026

Recursive lower bounds for uniform set systems of bounded VC-dimension

Xiaochen Zhao, Gennian Ge

For integers $n \geq d + 1$ , let $M_{d} (n)$ denote the maximum size of a $(d + 1)$ -uniform family on an $n$ -element ground set with VC-dimension at most $d$ . For $n \geq 2 d + 2$ , the c…

math.CO2026

Universal Fourier-inertia bounds for prescribed even distances

Xiaochen Zhao, Gennian Ge

The study of set families with restricted Hamming distances is a classical topic of extremal combinatorics and coding theory. Let $H=\{A\subseteq[n]: |A|\text{ is even}\}$ be the…

math.CO2026

Monochromatic unit equilateral triangle on low-dimensional spheres

Xiaochen Zhao, Gennian Ge

A result of Matoušek and Rödl in 1995 states that for every $ε > 0$ and every triangle $T$ with circumradius $ρ (T)$ , there exists a dimension $n = n (ε, T)$ such that…

math.CO2026

Improvement on the Erdős-Kleitman conjecture via the KKL theorem

Gennian Ge, Jialuo Wang, Zixiang Xu

In 1974, Erdős and Kleitman conjectured that if a family $F \subseteq 2^{[n]}$ contains no matching of size $s$ and is maximal with respect to this property, then $ |\ma…

The maximum t-diversity of t-intersecting families of permutations

Economical lattice coverings by determined segments

Largest Sperner families with restricted differences

All simplices exhibit canonical Ramsey property

Recursive Lifting Beyond the Ahlswede--Khachatrian Construction

Tverberg's theorem for unions of convex sets: Sharp bounds and colored extensions

Extremal Deletion-Ball Intersections under Run-Count and Lower-Order Deletion-Ball Intersection Constraints

Recursive lower bounds for uniform set systems of bounded VC-dimension

Universal Fourier-inertia bounds for prescribed even distances

Monochromatic unit equilateral triangle on low-dimensional spheres

Improvement on the Erdős-Kleitman conjecture via the KKL theorem

The maximum $t$ -diversity of $t$ -intersecting families of permutations