Further results on staircase (cyclic) words
Sela Fried

TL;DR
This paper derives a two-variable generating function for counting variations in staircase cyclic words, refining previous results on staircase words with bounded variation between consecutive letters.
Contribution
It extends prior work by providing generating functions for cyclic staircase words, a new class with bounded variations in a cyclic context.
Findings
Derived the two-variable generating function for cyclic staircase words.
Extended previous results to include cyclic words.
Refined enumeration techniques for words with bounded variations.
Abstract
We find the two-variables generating function for the statistic which counts the number of variations in a word bounded by . Thus, we refine and extend previous results concerning staircase words, which are words in which the variation between all consecutive letters is bounded by . We obtain the analogue results for cyclic words.
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.
Taxonomy
Topicssemigroups and automata theory · Advanced Algebra and Logic
