Counting the number of non-zero coefficients in rows of generalized Pascal triangles
From MaRDI portal
Publication:512556
DOI10.1016/j.disc.2017.01.003zbMath1357.05004arXiv1705.08343OpenAlexW2587059192MaRDI QIDQ512556
Julien Leroy, Manon Stipulanti, Michel Rigo
Publication date: 27 February 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.08343
Trees (05C05) Factorials, binomial coefficients, combinatorial functions (05A10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items
Cluster algebras and binary subwords, Asymptotic analysis of \(q\)-recursive sequences, Behavior of digital sequences through exotic numeration systems, Convergence of Pascal-like triangles in Parry-Bertrand numeration systems, Robustness of Pisot-regular sequences, Counting Subwords Occurrences in Base-b Expansions, Unnamed Item, Cluster algebras and binary words, MEPN, Revisiting regular sequences in light of rational base numeration systems, Regular sequences and synchronized sequences in abstract numeration systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Pascal triangle for binomial coefficients of words
- A pattern sequence approach to Stern's sequence
- On the 2-abelian complexity of the Thue-Morse word
- On the state complexity of closures and interiors of regular languages with subwords and superwords
- Locating terms in the Stern-Brocot tree
- A generalization of automatic sequences
- The ring of \(k\)-regular sequences
- Reconstructing words from subwords in linear time
- Joint spectral radius, dilation equations, and asymptotic behavior of radix-rational sequences
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
- Avoiding 2-binomial squares and cubes
- On the index of Simon's congruence for piecewise testability
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
- Minimal Elements for the Prime Numbers
- Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties
- Enumerating the Rationals from Left to Right
- An Exercise on Fibonacci Representations
- On synchronized sequences and their separators
- Systems of Numeration
- Automatic Sequences
- Formal Languages, Automata and Numeration Systems 2
- Subword Complexity and k-Synchronization
- Numeration systems on a regular language
