An inverse theorem in Z/pZ and rainbow-free colorings

MaRDI QIDQ1681900zbMATH OpenFDO

Authors Mario Huicochea

Publication date 24 November 2017

Published in Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1511.09126, http://mjcnt.phystech.edu/en/article.php?id=131

zbMATH Keywords

additive number theoryanti-Ramsey theoryrainbow coloring

Mathematics Subject Classification ID

Ramsey theory (05D10) Other combinatorial number theory (11B75)

Abstract: Let $mathbb{F}_p$ be the field with $p$ elements with $p$ prime, $X_1,ldots,X_n$ pairwise disjoint subsets of $mathbb{F}_p$with at least $3$ elements such that $su{m}_{i=1}^n|X_i|leqp-5$, and $mathbb{S}_n$ the set of permutations of $1,2,ldots,n$. If $a_1,ldots,a_{n}inmathbb{F}_p^{\ast }$ are not all equal, we characterize the subsets $X_1,ldots,X_n$ which satisfy �egin{equation*} Bigg|�igcup_{sigmainmathbb{S}_n}sum_{i=1}^na_{sigma(i)}X_iBigg|leq sum_{i=1}^n|X_i|. end{equation*} This result has the following application: For $ngeq2$, $binmathbb{F}_p$ and $a_1,ldots,a_n$ as above, we characterize the colorings $$ where each color class has at least 3 elements such that $su{m}_{i=1}^n{a}_i{x}_i=b$ has not rainbow solutions.

Review text

Let \(p\) be a prime and let \(\mathbb{Z}/p\mathbb{Z}\) denote the set of congruence classes modulo \(p\). An \(n\)-coloring of \(\mathbb{Z}/p\mathbb{Z}\) is a partition of \(\mathbb{Z}/p\mathbb{Z}\) into \(n\) nonempty subsets. A subset of \(\mathbb{Z}/p\mathbb{Z}\) is called rainbow if it contains at least one element from every color class. In this paper the author improves a previous result of \textit{D. Conlon} [Discrete Math. 306, No. 17, 2056--2063 (2006; Zbl 1220.05131)] about the existence of rainbow solutions of linear equations over \(\mathbb{Z}/p\mathbb{Z}\). Namely, he proves that if the set \(\mathbb{Z}/p\mathbb{Z}\) is colored with \(n \ge 3\) different colors such that each color class has at least four elements, then for any nonzero \(a_{1}, \dots, a_{n} \in \mathbb{Z}/p\mathbb{Z}\) with not all of them being equal, and for any \(b \in \mathbb{Z}/p\mathbb{Z}\), there is a rainbow solution of the equation \(\sum_{i=1}^{n}a_{i}x_{i} = b\). The proof uses some results of additive number theory. The key tool is an inverse theorem due to the author.

Recommendations

• Rainbow solutions of linear equations over Z_p
• scientific article; zbMATH DE number 7283881
• The structure of rainbow-free colorings for linear equations on three variables in \(\mathbb Z_{p}\)
• Rainbow-free colorings for x+y=cz in Z_p
• Rainbow numbers of \(\mathbb{Z}_n\) for \(a_1x_1+a_2x_2+a_3x_3 =b\)

Cited in

(6)

• The structure of rainbow-free colorings for linear equations on three variables in \(\mathbb Z_{p}\)
• On rainbow solutions to an equation with a quadratic term
• Rainbow-free colorings for x+y=cz in Z_p
• scientific article; zbMATH DE number 7283881 (Why is no real title available?)
• Rainbow numbers of \(\mathbb{Z}_n\) for \(a_1x_1+a_2x_2+a_3x_3 =b\)
• Rainbow solutions of a linear equation with coefficients in \(\mathbb{Z}/p\mathbb{Z}\)

This page was built for publication: An inverse theorem in \(\mathbb{Z}/p\mathbb{Z}\) and rainbow-free colorings

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