English

Abelian Squares and Their Progenies

Combinatorics 2021-08-09 v2 Classical Analysis and ODEs

Abstract

A polynomial PC[z1,,zd]P \in \mathbb{C}[z_1, \ldots, z_d] is strongly Dd\mathbb{D}^d-stable if PP has no zeroes in the closed unit polydisc Dd.\overline{\mathbb{D}}^d. For such a polynomial define its spectral density function as SP(z)=(P(z)P(1/z))1.\mathcal{S}_P(\mathbf{z}) = \left(P(\mathbf{z})\overline{P(1/\overline{\mathbf{z}})}\right)^{-1}. An abelian square is a finite string of the form wwww' where ww' is a rearrangement of w.w. 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 dd-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, L2(Td)L^2(\mathbb{T}^d)-valued operator. Integral representations, divisibility properties, and recurrent and asymptotic behavior of the coefficients of these generating functions are given as consequences. Tools in the derivations of our asymptotic formulas include a version of Laplace's method for sums over lattice point translations due to Greenhill, Janson, and Ruci\'{n}ski, a version of stationary phase method for oscillatory integrals with complex phase due to Pemantle and Wilson, and various polynomial identities related to powers of modified Bessel functions of the first kind due to Moll and Vignat.

Keywords

Cite

@article{arxiv.1609.05580,
  title  = {Abelian Squares and Their Progenies},
  author = {Charles Burnette and Chung Wong},
  journal= {arXiv preprint arXiv:1609.05580},
  year   = {2021}
}

Comments

Chapters 1 and 6 were substantially revised to have a more focused, self-contained exposition. New results were added to chapter 4. Some material from the previous draft will be saved for a future paper. Notation and definitions have been updated

R2 v1 2026-06-22T15:53:42.375Z