2008/02/19 by Steven R. Finch, Finch, Steven, Pascal Sebah +3
Computer Science · Mathematics · #05A16 (Primary) #11B37 #11N56 #11Y60 #15A52 #37H15 #40A25 #65B10 #65C50 (Secondary) #Combinatorics (math.CO) #Dynamical Systems (math.DS) #FOS: Mathematics #History and Theory of Mathematics #Logic, programming, and type systems #Mathematics and Applications #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.0802.2654
openalex publication_date 2008/02/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The nth row of Pascal's trinomial triangle gives coefficients of (1+x+x2)n. Let g(n) denote the number of such coefficients that are odd. We review Moshe's algorithm for evaluating asymptotics of g(n) -- this involves computing the Lyapunov exponent for certain 2x2 random matrix products -- and then analyze further examples with more terms and higher powers of x.