Lower bounds for periods of Ducci sequences

preprint2019arXivOpen access

Abstract

A Ducci sequence is a sequence of integer nn-tuples obtained by iterating the map D:(a1,a2,…,an)↦(∣a1−a2∣,∣a2−a3∣,…,∣an−a1∣). 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)P(n) the maximal period of such sequences for given nn. We prove lower bounds for P(n)P(n) by counting certain partitions.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.