Generalized Pascal triangle for binomial coefficients of words

DOI10.1016/J.AAM.2016.04.006MaRDI QIDQ308970zbMATHOpenAlexFDO

Authors Julien Leroy, Michel Rigo, Manon Stipulanti

Publication date 6 September 2016

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1705.08270

Mathematics Subject Classification ID

Hausdorff and packing measures (28A78) Fractals (28A80) Combinatorics on words (68R15) Automata sequences (11B85)

Abstract: We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi'nski gasket that can be built as the limit set, for the Hausdorff distance, of a convergent sequence of normalized compact blocks extracted from Pascal triangle modulo $2$, we describe and study the first properties of the subset of $[0,1]imes[0,1]$ associated with this extended Pascal triangle modulo a prime $p$.

Recommendations

• Convergence of Pascal-like triangles in Parry-Bertrand numeration systems
• scientific article; zbMATH DE number 46604
• Counting the number of non-zero coefficients in rows of generalized Pascal triangles
• Pascal's triangle on a torus and on a binary tree
• scientific article; zbMATH DE number 86322

Cites work

• scientific article; zbMATH DE number 3941840 (Why is no real title available?)
• scientific article; zbMATH DE number 86322 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• A noncommutative extension of Mahler's theorem on interpolation series
• An analogue of Cobham's theorem for graph directed iterated function systems
• An analogue of Cobham’s theorem for fractals
• Binomial Coefficients Modulo a Prime
• Four encounters with Sierpiński's gasket
• Hausdorff Dimension in Graph Directed Constructions
• Limit sets of automatic sequences.
• Pascal's triangle, complexity and automata
• Sur la fonction sommatoire de la fonction 'somme des chiffres'
• Thue-Morse sequence and p-adic topology for the free monoid

Cited in

(21)

• From combinatorial games to shape-symmetric morphisms
• Some combinatorics of factorial base representations
• Asymptotic analysis of \(q\)-recursive sequences
• Weighted prefix normal words: mind the gap
• Subsequences in bounded ranges: matching and analysis problems
• scientific article; zbMATH DE number 7732123 (Why is no real title available?)
• Longest Common Subsequence with Gap Constraints
• Characterizations of families of morphisms and words via binomial complexities
• Sums of products of binomial coefficients mod 2 and run length transforms of sequences
• Pascal's triangle on a torus and on a binary tree
• On the 2-binomial complexity of the generalized Thue-Morse words
• Scattered Factor-Universality of Words
• Integrating across Pascal's triangle
• Counting the number of non-zero coefficients in rows of generalized Pascal triangles
• Computing the \(k\)-binomial complexity of the Thue-Morse word
• Counting subword occurrences in base-\(b\) expansions
• Behavior of digital sequences through exotic numeration systems
• Relations on words
• Convergence of Pascal-like triangles in Parry-Bertrand numeration systems
• On digital sequences associated with Pascal's triangle
• Absent Subsequences in Words

This page was built for publication: Generalized Pascal triangle for binomial coefficients of words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q308970)