activity
20202026
collaborators

11 papers

math.MG2026

On the weighted hard-core model and Rado's covering problem for congruent Euclidean balls

Chengfei Xie, Gennian Ge

Let be a symmetric convex body in and let denote the largest constant such that every finite collection of translates of contains a pairwise disjo…

cs.IT2026

New bounds for covering codes under insertions or deletions

Chengfei Xie, Yubo Sun, Gennian Ge

Covering codes for insertions and deletions arise naturally in the study of synchronization errors and differ substantially from their classical counterparts in the Hamming metric.…

math.CO2025

Dot-product graphs in finite fields

Chengfei Xie, Gennian Ge

In this paper, we study the dot-product graphs in . We prove that if the size of the product of two adjacent sets is large enough, then the set of dot-product graph…

math.CO2023

Some results on similar configurations in subsets of

Chengfei Xie, Gennian Ge

In this paper, we study problems about the similar configurations in . Let be a graph, where and . For a s…

math.MG2022

On the lower bound for kissing numbers of -spheres in high dimensions

Chengfei Xie, Gennian Ge

In this paper, we give some new lower bounds for the kissing number of -spheres. These results improve the previous work due to Xu (2007). Our method is based on coding the…

cs.IT2022

Covering Grassmannian Codes: Bounds and Constructions

Bingchen Qian, Xin Wang, Chengfei Xie +1

Grassmannian is the set of all -dimensional subspaces of the vector space Recently, Etzion and Zhang introduced a new notion called coveri…

math.MG2022

On the lower bound for packing densities of superballs in high dimensions

Chengfei Xie, Gennian Ge

Define the superball with radius and center in to be the set $$ \left\{{\boldsymbol x}\in\mathbb{R}^n:\sum_{j=1}^{m}\left(x_{k_j+1}^2+x_{k_j+2}…

math.CO2021

Some sum-product estimates in matrix rings over finite fields

Chengfei Xie, Gennian Ge

We study some sum-product problems over matrix rings. Firstly, for , we have whenever $|A||B||C|\gtrsim q^{3n^2-\fr…

math.CO2021

On the minimal degree condition of graphs implying some properties of subgraphs

Bingchen Qian, Chengfei Xie, Gennian Ge

Erdős posed the problem of finding conditions on a graph that imply the largest number of edges in a triangle-free subgraph is equal to the largest number of edges in a biparti…

math.CO2021

Some Results on -Turán-good Graphs

Bingchen Qian, Chengfei Xie, Gennian Ge

For a graph and a -chromatic graph if the Turán graph has the maximum number of copies of among all -vertex -free graphs (for large enough),…

math.CO2020

On the size of Nikodym sets in spaces over rings

Chengfei Xie, Gennian Ge

A Nikodym set is a set containing for every , where is a line passing thr…