
doi: 10.37236/2385
For sufficiently large subsets $\mathcal{A}, \mathcal{B}, \mathcal{C}, \mathcal{D}$ of $\mathbb{F}_q$, Gyarmati and Sárközy (2008) showed the solvability of the equations $a + b= c d$ and $a b + 1 = c d$ with $a \in \mathcal{A}$, $b \in\mathcal{B}$, $c \in \mathcal{C}$, $d \in \mathcal{D}$. They asked whether one can extend these results to every $k \in \mathbb{N}$ in the following way: for large subsets $\mathcal{A}, \mathcal{B}, \mathcal{C}, \mathcal{D}$ of $\mathbb{F}_q$, there are $a_1, \ldots, a_k, a_1', \ldots, a_k' \in\mathcal{A}$, $b_1, \ldots, b_k, b_1', \ldots, b_k' \in \mathcal{B}$ with $a_i + b_j, a_i' b_j' + 1 \in \mathcal{C}\mathcal{D}$ (for $1 \leq i, j\leq k)$. The author (2010) gave an affirmative answer to this question using Fourier analytic methods. In this paper, we will extend this result to the setting of finite cyclic rings using tools from spectral graph theory.
Extremal problems in graph theory, sum-product sets, residue rings, graph theory, Paths and cycles
Extremal problems in graph theory, sum-product sets, residue rings, graph theory, Paths and cycles
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
