Convergence of Pascal-like triangles in Parry-Bertrand numeration systems

DOI10.1016/J.TCS.2018.08.003MaRDI QIDQ1755585zbMATH OpenOpenAlexFDO

Authors Manon Stipulanti

Publication date 10 January 2019

Published in Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Perron numbers\(\beta\)-expansionsbinomial coefficients of wordsBertrand numeration systemsParry numbersgeneralized Pascal triangles

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Fractals (28A80) Combinatorics on words (68R15) Binomial coefficients; factorials; (q)-identities (11B65)

Abstract: We pursue the investigation of generalizations of the Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a finite word appears as a subsequence of another finite word. The finite words occurring in this paper belong to the language of a Parry numeration system satisfying the Bertrand property, i.e., we can add or remove trailing zeroes to valid representations. It is a folklore fact that the Sierpi'{n}ski gasket is the limit set, for the Hausdorff distance, of a convergent sequence of normalized compact blocks extracted from the classical Pascal triangle modulo $2$. In a similar way, we describe and study the subset of $[0,1]imes[0,1]$ associated with the latter generalization of the Pascal triangle modulo a prime number.

Recommendations

• Generalized Pascal triangle for binomial coefficients of words
• Counting the number of non-zero coefficients in rows of generalized Pascal triangles
• scientific article; zbMATH DE number 86322
• scientific article; zbMATH DE number 4215386
• scientific article; zbMATH DE number 46604

Cites work

• scientific article; zbMATH DE number 6382928 (Why is no real title available?)
• scientific article; zbMATH DE number 5707089 (Why is no real title available?)
• 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 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• Behavior of digital sequences through exotic numeration systems
• Counting subword occurrences in base-\(b\) expansions
• Counting the number of non-zero coefficients in rows of generalized Pascal triangles
• Formal Languages, Automata and Numeration Systems 1
• Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
• Generalized Pascal triangle for binomial coefficients of words
• How to write integers in a non-integral basis
• Hyperbolic Pascal triangles
• On theβ-expansions of real numbers
• SELF-SIMILAR CORRECTIONS TO THE ERGODIC THEOREM FOR THE PASCAL-ADIC TRANSFORMATION
• The minimal automaton recognizing \(m\mathbb N\) in a linear numeration system
• The on-line encyclopedia of integer sequences

Cited in

(3)

• A full characterization of Bertrand numeration systems
• Generalized Pascal triangle for binomial coefficients of words
• On digital sequences associated with Pascal's triangle

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Convergence of Pascal-like triangles in Parry-Bertrand numeration systems

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