Box Progressions, Abelian Power-Free Morphisms and A Sieve Technique for the Template Method
Sad{\i}k Eyido\u{g}an, Haydar G\"oral, Nihan Tan{\i}sal{\i}

TL;DR
The paper develops a sieve technique based on the template method to identify abelian power-free morphisms, providing new examples of morphisms with fixed points exhibiting stronger abelian power-freeness properties.
Contribution
It introduces a new sieve technique that simplifies verifying abelian power-freeness of morphisms and presents novel morphisms with fixed points of enhanced abelian power-freeness.
Findings
Identified a binary morphism that is abelian 16-power free but not 15-power free.
Constructed a morphism with an abelian 14-power free fixed point.
Provided an example of a morphism not abelian power-free but with an abelian 5-power free fixed point.
Abstract
Given balls and boxes both enumerated by the positive integers, we consider a sequential allocation of the balls into the boxes. We fix . Proceeding in increasing order of box labels, assign to each box the next smallest balls for some . Given an integer , is there a natural number such that in any placement of balls into boxes, there exist balls whose labels and box labels each form a -term arithmetic progression? We address this question by identifying abelian power-free fixed points of morphisms over a binary alphabet. We present sufficient conditions under which a morphism is abelian -power-free. Our conditions extend Dekking's result over a binary alphabet and offer a weaker, yet more effective alternative to Carpi's. Combining Dekking's result with the template method of Currie and Rampersad, we develop a sieve technique…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
