Year: 2026
Type: preprint
Abstract: Consider placing the numbers $1, \ldots, n$ consecutively around an $n$-cycle. We ask for a given $n$, which numbers $k$ can be written as a sum of consecutive numbers on the $n$-cycle. If all numbers between $1$ and $T_n$, the $n$th triangular number, can be written as a sum this way we say the $n$-cycle is complete. Our main result shows that for $n\geq 8$, $n$-cycles are incomplete.
Source: arXiv (Cornell University)
Authors: Marotti, Jessica, Needleman, Jonathan
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7221034279