本文研究了有限域上两个向量空间子集生成的点积集的基数。我们注意到，一个集合的点积问题的结果可以简单地推广到两个集合。设E和F是有限域F_q上的d维向量空间F_q^d的子集。作为一个新的结果，我们证明了：如果E和F是抛物面的子集，且|E| |F| \geq C q^d对某个大的C>1，则|（英、法）|\geq c q，其中0<c<1。特别地，我们发现了点积集的大小与通过给定集合E中的原点和非零点的线的数目之间的联系。作为这一观察的应用，我们得到了广义点积集问题的更尖锐的结果。离散的傅里叶分析和几何观察在证明我们的结果中起着至关重要的作用。
英文摘要：
In this paper we study the cardinality of the dot product set generated by two subsets of vector spaces over finite fields. We notice that the results on the dot product problems for one set can be simply extended to two sets. Let E and F be subsets of the d-dimensional vector space F_q^d over a finite field F_q with q elements. As a new result, we prove that if E and F are subsets of the paraboloid and |E||F|\geq C q^d for some large C>1, then |Π(E,F)|\geq c q for some 0<c<1. In particular, we find a connection between the size of the dot product set and the number of lines through both the origin and a nonzero point in the given set E. As an application of this observation, we obtain more sharpened results on the generalized dot product set problems. The discrete Fourier analysis and geometrical observation play a crucial role in proving our results.
Let $G$ be a finite $D$-quasirandom group and $A \subset G^{k}$ a $δ$-dense subset. Then the density of the set of side lengths $g$ of corners \[ \{(a_{1},\dots,a_{k}),(ga_{1},a_{2},\dots,a_{k}),\dots,(ga_{1},\dots,ga_{k})\} \subset A \] converges to $1$ as $D\to\infty$.
Let $E \subseteq \mathbb{F}_q^2$ be a set in the 2-dimensional vector space over a finite field with $q$ elements, which satisfies $|E| > q$. There exist $x,y \in E$ such that $|E \cdot (y-x)| > q/2.$ In particular, $(E+E) \cdot (E-E) = \mathbb{F}_q$.
In 1989, Rota conjectured that, given $n$ bases $B_1,\dots,B_n$ of the vector space $\mathbb{F}^n$ over some field $\mathbb{F}$, one can always decompose the multi-set $B_1\cup \dots \cup B_n$ into transversal bases. This conjecture remains wide open despite of a lot of attention. In this paper, we consider the setting of random bases $B_1,\dots,B_n$. More specifically, our first result shows that Rota's basis conjecture holds with probability $1-o(1)$ as $n\to \infty$ if the bases $B_1,\dots,B_n$ are chosen independently uniformly at random among all bases of $\mathbb{F}_q^n$ for some finite …
For every $ε> 0$ and $k \in \mathbb{N}$, Haight constructed a set $A \subset \mathbb{Z}_N$ ($\mathbb{Z}_N$ stands for the integers modulo $N$) for a suitable $N$, such that $A-A = \mathbb{Z}_N$ and $|kA| < εN$. Recently, Nathanson posed the problem of constructing sets $A \subset \mathbb{Z}_N$ for given polynomials $p$ and $q$, such that $p(A) = \mathbb{Z}_N$ and $|q(A)| < εN$, where $p(A)$ is the set $\{p(a_1, a_2, \dots, a_n)\phantom{.}\colon\phantom{.}a_1, a_2, \dots, a_n \in A\}$, when $p$ has $n$ variables. In this paper, we give a partial answer to Nathanson's question. For every $k \in …
We study a family of variants of Erd\H os' unit distance problem, concerning distances and dot products between pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, we look for bounds on how many subsets of $k$ points satisfy a set of relationships between point pairs based on distances or dot products. We survey some of the recent work in the area and present several new, more general families of bounds.
$q$-analogues of quantities in mathematics involve perturbations of classical quantities using the parameter $q$, and revert to the original quantities when $q$ goes $1$. An important example is the $q$-analogues of binomial coefficients which give the number of $k$-dimensional subspaces in $\mathbb{F}_{q}^{n}$. When $q$ goes to $1$, this reverts to the binomial coefficients which measure the number of $k$-sets in $\left [ n \right ]$. Dot-analogues of $q$-binomial coefficients were studied by Yoo (2019) in order to investigate combinatorics of quadratic spaces over finite fields. The number o…
给定一个大的有限点集，$P\subset \mathbb R^2$，我们得到的上界的点，确定一个给定的点积对的三元组的数量。也就是说，对于任何一对正实数$(α, β)$，我们限制了集合$$\left\{(p,q,r)\in P \times P \times P : p \cdot q = α, p \cdot r = β\right\}.$$的大小
In this paper, we study dot-product sets and $k$-simplices in vector spaces over finite rings. We show that if $E$ is sufficiently large then the dot-product set of $E$ covers the whole ring. In higher dimensional cases, if $E$ is sufficiently large then the set of simplices and the set of dot-product simplices determined by $E$, up to congurence, have positive densities.
Let $n$ be a positive integer, let $\boldsymbol{X}=(X_1,\dots,X_n)$ be a random vector in $\mathbb{R}^n$ with bounded entries, and let $(θ_1,\dots,θ_n)$ be a vector in $\mathbb{R}^n$. We show that the subgaussian behavior of the random variable $θ_1 X_1+\dots +θ_n X_n$ is essentially determined by the subgaussian behavior of the random variables $\sum_{i\in H} θ_i X_i$ where $H$ is a random subset of $\{1,\dots,n\}$.
Let $n\ge 1$, $r\ge 2$, and $s\ge 0$ be integers and ${\cal P}=\{P_1,\dots, P_l\}$ be a partition of $[n]=\{1,\dots, n\}$ with $|P_i|\le r$ for $i=1,\dots, l$. Also, let $\cal F$ be a family of non-empty subsets of $[n]$. The $r$-uniform Kneser-type hypergraph $\mbox{KG}^r({\cal F}, {\cal P},s)$ is the hypergraph with the vertex set of all $\cal P$-admissible elements $F\in {\cal F}$, that is $|F\cap P_i|\le 1$ for $i=1,\dots, l$ and the edge set of all $r$-subsets $\{F_1,\dots, F_r\}$ of the vertex set that $|F_i\cap F_j|\le s$ for all $1\le i<j\le r$. In this article, we extend the equitable…
我们得到的三元组的数量上的界限，确定一个给定的一对点的产品出现在一个向量空间在一个有限域或一个模块的集合上的整数模幂的素数。更准确地说，给定$E\subset \mathbb F_q^d$或$\mathbb Z_q^d$，我们为单元$α$和$β$提供集合\[\left\{(u,v,w)\in E \times E \times E : u\cdot v = α, u \cdot w = β\right\}\]大小的界限。
We study the typical behavior of the size of the ratio set $A/A$ for a random subset $A\subset \{1,\dots , n\}$. For example, we prove that $|A/A|\sim \frac{2\text{Li}_2(3/4)}{π^2}n^2 $ for almost all subsets $A \subset\{1,\dots ,n\}$. We also prove that the proportion of visible lattice points in the lattice $A_1\times\cdots \times A_d$, where $A_i$ is taken at random in $[1,n]$ with $\mathbb P(m\in A_i)=α_i$ for any $m\in [1,n]$, is asymptotic to a constant $μ(α_1,\dots,α_d)$ that involves the polylogarithm of order $d$.
We generalize to sets with cardinality more than $p$ a theorem of Rédei and Szőnyi on the number of directions determined by a subset $U$ of the finite plane $\mathbb F_p^2$. A $U$-rich line is a line that meets $U$ in at least $\#U/p+1$ points, while a $U$-poor line is one that meets $U$ in at most $\#U/p-1$ points. The slopes of the $U$-rich and $U$-poor lines are called $U$-special directions. We show that either $U$ is contained in the union of $n=\lceil\#U/p\rceil$ lines, or it determines `many' $U$-special directions. The core of our proof is a version of the polynomial method in which w…
Let $p$ be an odd prime and $A \subseteq \mathbb{F}_p$ be a subset of the finite field with $p$ elements. We show that $A \times A \subseteq \mathbb{F}_p^2$ determines at least a constant multiple of $\min\{p, |A|^{3/2}\}$ distinct pinned algebraic distances.
We explore variants of Erd\H os' unit distance problem concerning dot products between successive pairs of points chosen from a large finite subset of either $\mathbb F_q^d$ or $\mathbb Z_q^d,$ where $q$ is a power of an odd prime. Specifically, given a large finite set of points $E$, and a sequence of elements of the base field (or ring) $(α_1,\ldots,α_k)$, we give conditions guaranteeing the expected number of $(k+1)$-tuples of distinct points $(x_1,\dots, x_{k+1})\in E^{k+1}$ satisfying $x_j \cdot x_{j+1}=α_j$ for every $1\leq j \leq k$.
Let $G$ be an abelian group. A set $A \subset G$ is a \emph{$B_k^+$-set} if whenever $a_1 + \dots + a_k = b_1 + \dots + b_k$ with $a_i, b_j \in A$ there is an $i$ and a $j$ such that $a_i = b_j$. If $A$ is a $B_k$-set then it is also a $B_k^+$-set but the converse is not true in general. Determining the largest size of a $B_k$-set in the interval $\{1, 2, \dots, N \} \subset \integers$ or in the cyclic group $\integers_N$ is a well studied problem. In this paper we investigate the corresponding problem for $B_k^+$-sets. We prove non-trivial upper bounds on the maximum size of a $B_k^+$-set con…
The maximum size, $La(n,P)$, of a family of subsets of $[n]=\{1,2,...,n\}$ without containing a copy of $P$ as a subposet, has been intensively studied. Let $P$ be a graded poset. We say that a family $\mathcal{F}$ of subsets of $[n]=\{1,2,...,n\}$ contains a \emph{rank-preserving} copy of $P$ if it contains a copy of $P$ such that elements of $P$ having the same rank are mapped to sets of same size in $\mathcal{F}$. The largest size of a family of subsets of $[n]=\{1,2,...,n\}$ without containing a rank-preserving copy of $P$ as a subposet is denoted by $La_{rp}(n,P)$. Clearly, $La(n,P) \le L…
Given a set $E \subset {\Bbb F}_q^3$, where ${\Bbb F}_q$ is the field with $q$ elements. Consider a set of "classifiers" ${\mathcal H}^3_t(E)=\{h_y: y \in E\}$, where $h_y(x)=1$ if $x \cdot y=t$, $x \in E$, and $0$ otherwise. We are going to prove that if $|E| \ge Cq^{\frac{11}{4}}$, with a sufficiently large constant $C>0$, then the Vapnik-Chervonenkis dimension of ${\mathcal H}^3_t(E)$ is equal to $3$. In particular, this means that for sufficiently large subsets of ${\Bbb F}_q^3$, the Vapnik-Chervonenkis dimension of ${\mathcal H}^3_t(E)$ is the same as the Vapnik-Chervonenkis dimension of …
Given integers $1 \le k_1 < \cdots < k_l \le n-1$, let $\text{Fl}_{k_1,\dots,k_l;n}$ denote the type $A$ partial flag variety consisting of all chains of subspaces $(V_{k_1}\subset\cdots\subset V_{k_l})$ inside $\mathbb{R}^n$, where each $V_k$ has dimension $k$. Lusztig (1994, 1998) introduced the totally positive part $\text{Fl}_{k_1,\dots,k_l;n}^{>0}$ as the subset of partial flags which can be represented by a totally positive $n\times n$ matrix, and defined the totally nonnegative part $\text{Fl}_{k_1,\dots,k_l;n}^{\ge 0}$ as the closure of $\text{Fl}_{k_1,\dots,k_l;n}^{>0}$. On the other …
For nonempty subsets $S_0, \dots, S_{n-1}$ of a (large enough) finite field $\mathbb{F}$ satisfying $$|S_1|, \dots, |S_{n-1}| > 2 \quad \mathrm{or} \quad |S_1|,|S_{n-1}| > n - 1,$$ we show that there exist $a_0 \in S_0, \dots, a_{n-1} \in S_{n-1}$ such that $$ T^n + a_{n-1}T^{n-1} + \dots + a_1T + a_0 \in \mathbb{F}[T] $$ is a squarefree polynomial.
We consider the problem of determining the maximum cardinality of a subset containing no arithmetic progressions of length $k$ in a given set of size $n$. It is proved that it is sufficient, in a certain sense, to consider the interval $[1,\dots, n]$. The study continues the work of Komlós, Sulyok, and Szemerédi.
Cameron and Erdős asked whether the number of \emph{maximal} sum-free sets in $\{1, \dots , n\}$ is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of $2^{\lfloor n/4 \rfloor }$ for the number of maximal sum-free sets. Here, we prove the following: For each $1\leq i \leq 4$, there is a constant $C_i$ such that, given any $n\equiv i \mod 4$, $\{1, \dots , n\}$ contains $(C_i+o(1)) 2^{n/4}$ maximal sum-free sets. Our proof makes use of container and removal lemmas of Green, a structural result of Deshouillers, Freiman, Sós and Temkin and a recent bound on…
Let $P \subset \mathbb R^2$ be a point set with cardinality $N$. We give an improved bound for the number of dot products determined by $P$, proving that, \[ |\{ p \cdot q :p,q \in P \}| \gg N^{2/3+c}. \] A crucial ingredient in the proof of this bound is a new superquadratic expander involving products and shifts. We prove that, for any finite set $X \subset \mathbb R$, there exist $z,z' \in X$ such that \[ \left|\frac{(zX+1)^{(2)}(z'X+1)^{(2)}}{(zX+1)^{(2)}(z'X+1)}\right| \gtrsim |X|^{5/2}. \] This is derived from a more general result concerning growth of sets defined via convexity and sum …
For a finite abelian group $G$ with subsets $A$ and $B$, the sumset $AB$ is $\{ab \mid a\in A, b \in B\}$. A fundamental problem in additive combinatorics is to find a lower bound for the cardinality of $AB$ in terms of the cardinalities of $A$ and $B$. This article addresses the analogous problem for sequences in abelian groups and flags in field extensions. For a positive integer $n$, let $[n]$ denote the set $\{0,\dots,n-1\}$. To a finite abelian group $G$ of cardinality $n$ and an ordering $G = \{1=v_0,\dots,v_{n-1}\}$, associate the function $T \colon [n] \times [n] \rightarrow [n]$ defin…
A set $A$ of natural numbers possesses property $\mathcal{P}_h$, if there are no distinct elements $a_0,a_1,\dots ,a_h\in A$ with $a_0$ dividing the product $a_1a_2\dots a_h$. Erdős determined the maximum size of a subset of $\{1,\ldots, n\}$ possessing property $\mathcal{P}_2$. More recently, Chan, Győri and Sárközy solved the case $h=3$, finally the general case also got resolved by Chan, the maximum size is $π(n)+Θ_h(\frac{n^{2/(h+1)}}{(\log n)^{2}})$. In this note we consider the counting version of this problem and show that the number of subsets of $\{1,\ldots, n\}$ possessing property $…
