Lower bounds for periods of Ducci sequences

TL;DR

This paper establishes lower bounds on the maximum periods of Ducci sequences by analyzing partitions, contributing to understanding their long-term behavior.

Contribution

It introduces a method to derive lower bounds for Ducci sequence periods using partition counting techniques.

Findings

Derived lower bounds for P(n) for various n

Connected sequence periods to combinatorial partition counts

Provided insights into the long-term dynamics of Ducci sequences

Abstract

A Ducci sequence is a sequence of integer $n$-tuples obtained by iterating the map \[ D : (a_1, a_2, \ldots, a_n) \mapsto \big(|a_1-a_2|,|a_2-a_3|,\ldots,|a_n-a_1|\big). \] Such a sequence is eventually periodic and we denote by $P(n)$ the maximal period of such sequences for given $n$. We prove lower bounds for $P(n)$ by counting certain partitions.