Answers are grounded in this paper and cite their sources.
Theoretical and computational analysis demonstrates bounds and exact values for dynamic Schur numbers under circle rotations, highlighting new connections in combinatorial dynamics.
We introduce a dynamical analog of Schur’s problem by defining the dynamic Schur number S ( k , f ), the smallest integer n such that every k -coloring of a space Y and every orbit segment Oₙ(x₀,f) O n ( x 0 , f ) under a transformation f :Y→ Y f : Y → Y contains a monochromatic triple ᵃ(x₀),fᵇ(x₀),fᵃ⁺ᵇ(x₀)\ { f a ( x 0 ) , f b ( x 0 ) , f a + b ( x 0 ) } with a,b,a+b ≤ n a , b , a + b ≤ n . This framework extends classical additive Ramsey theory to dynamical systems. We establish general bounds relating S ( k , f ) to the classical Schur numbers and determine some exact values for circle rotations T_α (x)=x+α 1 T α ( x ) = x + α ( mod 1 ) under uniform and refined partitions. Computational experiments based on a late acceptance Hill-Climbing heuristic recover all known Schur numbers in the dynamic setting, motivating further exploration through combinatorial dynamics.
No takes yet. Share an insight, caveat, or question.
Lozano-Piña et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: