Counting the number of non-zero coefficients in rows of generalized Pascal triangles
From MaRDI portal
Abstract: This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence counting the number of positive entries on each row. By introducing a convenient tree structure, we provide a recurrence relation for . This leads to a connection with the -regular Stern-Brocot sequence and the sequence of denominators occurring in the Farey tree. Then we extend our construction to the Zeckendorf numeration system based on the Fibonacci sequence. Again our tree structure permits us to obtain recurrence relations for and the F-regularity of the corresponding sequence.
Recommendations
- scientific article; zbMATH DE number 4101189
- scientific article; zbMATH DE number 2235054
- scientific article; zbMATH DE number 3963839
- Partial row-sums of Pascal's triangle
- scientific article; zbMATH DE number 1134694
- On two families of generalizations of Pascal's triangle
- Linear recurrence relations associated with multinomial Pascal triangles
- scientific article; zbMATH DE number 7640039
- Generalized Pascal's triangles and associated \(k\)-Padovan-like sequences
- Generalized Pascal triangle for binomial coefficients of words
Cites work
- scientific article; zbMATH DE number 5707089 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1548996 (Why is no real title available?)
- scientific article; zbMATH DE number 1916667 (Why is no real title available?)
- scientific article; zbMATH DE number 3397597 (Why is no real title available?)
- A generalization of automatic sequences
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
- A pattern sequence approach to Stern's sequence
- An Exercise on Fibonacci Representations
- Automatic Sequences
- Avoiding 2-binomial squares and cubes
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
- Decision algorithms for Fibonacci-automatic words. III: Enumeration and abelian properties.
- Enumerating the rationals from left to right
- Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
- Generalized Pascal triangle for binomial coefficients of words
- Joint spectral radius, dilation equations, and asymptotic behavior of radix-rational sequences
- Locating terms in the Stern-Brocot tree
- Minimal elements for the prime numbers
- Noncommutative rational series with applications
- Numeration systems on a regular language
- On synchronized sequences and their separators
- On the 2-abelian complexity of the Thue-Morse word
- On the index of Simon's congruence for piecewise testability
- On the state complexity of closures and interiors of regular languages with subwords and superwords
- Reconstructing words from subwords in linear time
- Subword complexity and \(k\)-synchronization
- Systems of Numeration
- The On-Line Encyclopedia of Integer Sequences
- The ring of \(k\)-regular sequences
Cited in
(13)- Some combinatorics of factorial base representations
- Asymptotic analysis of \(q\)-recursive sequences
- scientific article; zbMATH DE number 7004526 (Why is no real title available?)
- Cluster algebras and binary words
- Robustness of Pisot-regular sequences
- MEPN
- Generalized Pascal triangle for binomial coefficients of words
- Counting subword occurrences in base-\(b\) expansions
- Cluster algebras and binary subwords
- Behavior of digital sequences through exotic numeration systems
- Revisiting regular sequences in light of rational base numeration systems
- Regular sequences and synchronized sequences in abstract numeration systems
- Convergence of Pascal-like triangles in Parry-Bertrand numeration systems
This page was built for publication: Counting the number of non-zero coefficients in rows of generalized Pascal triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512556)
