LINEAR EQUATIONS IN \mathbb{Z}_{\lowercase{p}}

From MaRDI portal
Publication:5693463





For a sequence \(A=(a_1, \dots , a_k)\), \(a_i\in \mathbb Z _p\) and another \(b\in \mathbb Z _p\) let \(\mu (A,b)\) denote the cardinality of a maximal subset of \(\mathbb Z _p\) such that the equation \(a_1x_1 + \dots + a_k x_k =b\) has no solutions with \(x_i\) in the set. The author investigates the noninvariant case, where either \(b\neq 0\) or \(a_1+\dots +a_k\neq 0\). It turns out that the behaviour of this quantity is closely related to \(\ell (A)\), the smallest integer \(\ell \) for which \(b_1, \dots , b_\ell\) can be found so that each \(a_i \) has a representation \(a_i = \sum \varepsilon _j b_j\) with coefficients \(\varepsilon _j \in \{-1,0,1\}\). The main result of the paper establishes the bounds \[ p 2^{- \ell \log (2k\ell)+5} < \mu (A,b) \leq p 2^{-\ell /6} . \] For very small values of \(\ell \) this is weak, may even be weaker than the bound \(p/k+1\) easily deduced from the Cauchy-Davenport inequality. The second result improves this as follows. Let \(t\) be the number of distinct values among the coefficients \(a_i\). For \(t>t_0\) we have \[ \mu (A,b) \leq { 40 \log t \over t^{3/2}}p . \] The proof is based on Fourier analysis, the main tool is the Bourgain-Chang structure theorem for large Fourier coefficients [\textit{M. C. Chang}, Duke Math. J. 113, 399--419 (2002; Zbl 1035.11048)].











This page was built for publication: LINEAR EQUATIONS IN $\mathbb{Z}_{\lowercase{p}}$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5693463)