
We prove a conjecture of Adamaszek generalizing the seating couples problem to the case of $2n$ seats. Concretely, we prove that given a positive integer $n$ and $d_1,\ldots,d_n\in(\mathbb{Z}/2n)^*$ we can partition $\mathbb{Z}/2n$ into $n$ pairs with differences $d_1,\ldots,d_n$.
3 pages
couples, Combinatorial aspects of partitions of integers, SEATING, PARTITION, 11B13, 05B10, Exact enumeration problems, generating functions, SUMSET, partition, CAUCHY–DAVENPORT, Primes, seating, Cauchy-Davenport theorem, Other combinatorial number theory, FOS: Mathematics, https://purl.org/becyt/ford/1.1, sumset, Mathematics - Combinatorics, Combinatorics (math.CO), https://purl.org/becyt/ford/1, COUPLES
couples, Combinatorial aspects of partitions of integers, SEATING, PARTITION, 11B13, 05B10, Exact enumeration problems, generating functions, SUMSET, partition, CAUCHY–DAVENPORT, Primes, seating, Cauchy-Davenport theorem, Other combinatorial number theory, FOS: Mathematics, https://purl.org/becyt/ford/1.1, sumset, Mathematics - Combinatorics, Combinatorics (math.CO), https://purl.org/becyt/ford/1, COUPLES
| 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). | 4 | |
| 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. | Top 10% | |
| 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 |
