Rainbow Solutions to the Sidon Equation in Cyclic Groups

DOI10.1016/J.DISC.2024.114071MaRDI QIDQ6350842zbMATH OpenFDO

Authors Zhanar Berikkyzy, Jürgen Kritschgau

Publication date 8 October 2020

Mathematics Subject Classification ID

Sequences and sets (11Bxx) Additive number theory; partitions (11Pxx) Extremal combinatorics (05Dxx)

Abstract: Given a coloring of group elements, a rainbow solution to an equation is a solution whose every element is assigned a different color. The rainbow number of $mathbb{Z}_n$ for an equation $eq$, denoted $rb(mathbb{Z}_n,eq)$, is the smallest number of colors $r$ such that every exact $r$-coloring of $mathbb{Z}_n$ admits a rainbow solution to the equation $eq$. We prove that for every exact $4$-coloring of $mathbb{Z}_p$, where $pgeq3$ is prime, there exists a rainbow solution to the Sidon equation $x_1+x_2=x_3+x_4$. Furthermore, we determine the rainbow number of $mathbb{Z}_n$ for the Sidon equation.

Recommendations

• Rainbow solutions to the Sidon equation
• On the rainbow numbers of \(\mathbb{Z}_n\) for \(x_1 + x_2 = 4x_3\)
• Rainbow numbers of \(\mathbb{Z}_n\) for \(a_1x_1+a_2x_2+a_3x_3 =b\)
• Rainbow numbers of \([n]\) for \(\sum_{i=1}^{k-1}x_i=x_k\)
• Rainbow-free colorings for x+y=cz in Z_p

This page was built for publication: Rainbow Solutions to the Sidon Equation in Cyclic Groups

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