Pages that link to "Item:Q308970"
From MaRDI portal
The following pages link to Generalized Pascal triangle for binomial coefficients of words (Q308970):
Displaying 19 items.
- Relations on words (Q505060) (← links)
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles (Q512556) (← links)
- Behavior of digital sequences through exotic numeration systems (Q521363) (← links)
- Integrating across Pascal's triangle (Q607296) (← links)
- Weighted prefix normal words: mind the gap (Q832931) (← links)
- Convergence of Pascal-like triangles in Parry-Bertrand numeration systems (Q1755585) (← links)
- Asymptotic analysis of \(q\)-recursive sequences (Q2165029) (← links)
- Pascal's triangle on a torus and on a binary tree (Q2639856) (← links)
- On digital sequences associated with Pascal's triangle (Q2696006) (← links)
- Scattered Factor-Universality of Words (Q5041246) (← links)
- Sums of products of binomial coefficients mod 2 and run length transforms of sequences (Q5042422) (← links)
- Some combinatorics of factorial base representations (Q5109542) (← links)
- From Combinatorial Games to Shape-Symmetric Morphisms (Q5141334) (← links)
- Counting Subwords Occurrences in Base-b Expansions (Q5384333) (← links)
- Computing the \(k\)-binomial complexity of the Thue-Morse word (Q5918904) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- The number of ways to construct a connected graph: a graph-based generalization of the binomial coefficients (Q6135999) (← links)
- On the 2-binomial complexity of the generalized Thue-Morse words (Q6138835) (← links)
- Characterizations of families of morphisms and words via binomial complexities (Q6201915) (← links)
