Abelian Squares and Their Progenies
Charles Burnette, Chung Wong

TL;DR
This paper explores a class of polynomials related to abelian squares, analyzing their spectral density functions and Fourier coefficients to uncover combinatorial, integral, and asymptotic properties using advanced mathematical tools.
Contribution
It introduces a polynomial-valued operator linked to generalized abelian squares, providing integral representations, divisibility properties, and asymptotic behaviors of associated generating functions.
Findings
Fourier coefficients generate combinatorial classes of constrained strings.
Integral representations and divisibility properties are established.
Asymptotic behavior of generating function coefficients is characterized.
Abstract
A polynomial is strongly -stable if has no zeroes in the closed unit polydisc For such a polynomial define its spectral density function as An abelian square is a finite string of the form where is a rearrangement of We examine a polynomial-valued operator whose spectral density function's Fourier coefficients are all generating functions for combinatorial classes of constrained finite strings over a -character alphabet. These classes generalize the notion of an abelian square, and their associated generating functions are the Fourier coefficients of one, and essentially only one, -valued operator. Integral representations, divisibility properties, and recurrent and…
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
TopicsCellular Automata and Applications · Computability, Logic, AI Algorithms · DNA and Biological Computing
