arXiv Analytics

Sign in

arXiv:1608.06398 [math.CO]AbstractReferencesReviewsResources

An improvement on the number of simplices in $\mathbb{F}_q^d$

Thang Pham, Duc Hiep Pham, Anh Vinh Le

Published 2016-08-23Version 1

Let $\mathcal{E}$ be a set of points in $\mathbb{F}_q^d$. Bennett, Hart, Iosevich, Pakianathan, and Rudnev (2016) proved that if $|\mathcal{E}|\gg q^{d-\frac{d-1}{k+1}}$ then $\mathcal{E}$ determines a positive proportion of all $k$-simplices. In this paper, we give an improvement of this result in the case when $\mathcal{E}$ is the Cartesian product of sets. More precisely, we show that if $\mathcal{E}$ is the Cartesian product of sets and $q^{\frac{kd}{k+1-1/d}}=o(|\mathcal{E}|)$, the number of congruence classes of $k$-simplices determined by $\mathcal{E}$ is at least $(1-o(1))q^{\binom{k+1}{2}}$, and in some cases our result is sharp.

Related articles: Most relevant | Search more
arXiv:0711.1189 [math.CO] (Published 2007-11-08, updated 2011-09-23)
Clique Minors in Cartesian Products of Graphs
arXiv:1504.01975 [math.CO] (Published 2015-04-08)
On the b-chromatic number of the Cartesian product of two complete graphs
arXiv:1806.04628 [math.CO] (Published 2018-06-12)
The Game of Zombies and Survivors on the Cartesian Products of Trees