Random Fibonacci Words via Clone Schur Functions
Leonid Petrov, Jeanne Scott

TL;DR
This paper explores the probabilistic and positivity properties of Fibonacci words within a Young--Fibonacci lattice, connecting clone Schur functions to various mathematical structures and analyzing asymptotic behaviors of associated random words.
Contribution
It characterizes Fibonacci positive specializations of clone Schur functions, links positivity to multiple mathematical areas, and extends asymptotic analysis of random Fibonacci words.
Findings
Complete characterization of Fibonacci positive specializations
Connections between positivity, total positivity, and orthogonal polynomials
New limit laws for random Fibonacci words and asymptotics of the Young--Fibonacci lattice
Abstract
We study positivity and probabilistic properties arising from the Young--Fibonacci lattice , a 1-differential poset on binary (Fibonacci) words of 1's and 2's, graded by digit sum. Building on Okada's theory of clone Schur functions (Trans. Amer. Math. Soc. 346 (1994), 549--568), we define clone coherent measures on that generate random Fibonacci words of increasing length; unlike for the Young lattice (powered by the classical Schur functions), clone coherent measures are generally not extremal on . Our first main result is a complete characterization of Fibonacci positive specializations -- parameter sequences which yield positive clone Schur functions on . Second, we connect Fibonacci positivity with: (i) total positivity of tridiagonal matrices; (ii) Stieltjes moment sequences; (iii) the combinatorics of set partitions; and (iv)…
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.
