cycle_labeling_complete
def
Placing the labels L (a permutation of 1, …, n) in order around an n-cycle gives a complete cycle: every k ∈ {1, …, n(n+1)/2} is the sum of the labels on some arc (l ∈ {1, …, n} consecutive positions starting at some position i < n).
Statement
def cycle_labeling_complete (n : ℕ) (L : List ℕ) : Prop
- Defined in
- arXiv:2610.08889 (Consecutive Cycle Sums), Sec. 1–2 (complete n-cycle; arcs and arc sums), for an arbitrary placement of 1, …, n around the cycle as in list entry OP-121 (the paper places them in increasing order). Arcs are all windows of length 1..n of the doubled list.
- Verified
- 09 Oct 2026
- Axioms
- none listed
- Used by 6
- not_cycle_labeling_complete_range_sixThe 6-cycle labelled 1, …, 6 in order is not complete (8 and 13 are not arc sums).
- exists_cycle_labeling_complete_ge_eightThere is an n ≥ 8 and a placement of 1, …, n around the n-cycle that is complete: for n = 8, the order 1, 2, 3, 4, 5, 6, 8, 7.
- cycle_labeling_complete_tenThe 10-cycle labelled 1, 2, 3, 4, 5, 9, 7, 8, 6, 10 in order is complete.
- not_cycle_labeling_complete_range_eightThe 8-cycle labelled 1, …, 8 in order is not complete (17 and 19 are not arc sums).
- cycle_labeling_complete_nineThe 9-cycle labelled 1, 2, 3, 4, 5, 6, 8, 9, 7 in order is complete.
- cycle_labeling_complete_range_fiveThe 5-cycle labelled 1, 2, 3, 4, 5 in order is complete.
Lean source view module on GitHub
/-- The labels `L` (a list of length `n`), placed in order around an `n`-cycle, form a complete cycle: `L` is a permutation of `1, …, n`, and every `k ∈ {1, …, n(n+1)/2}` is the sum of the labels on some arc, i.e. on `l ∈ {1, …, n}` consecutive positions of the cycle starting at a position `i < n`. -/ def cycle_labeling_complete (n : ℕ) (L : List ℕ) : Prop := L.Perm (List.range' 1 n) ∧ ∀ k ∈ Finset.Icc 1 (n * (n + 1) / 2), ∃ i < n, ∃ l ∈ Finset.Icc 1 n, (((L ++ L).drop i).take l).sum = k