Results 131 to 136 of about 176,018 (136)
We define a q-analogue of the Calkin–Wilf tree and the Calkin–Wilf sequence. We show that the nth term f(n;q) of the q-analogue of the Calkin–Wilf sequence is the generating function for the number of hyperbinary expansions of n according to the number ...
Toufik Mansour
exaly +2 more sources
Generating functions and Wilf equivalence for generalized interval embeddings. [PDF]
In 1999 in [J. Difference Equ. Appl. 5, 355–377], Noonan and Zeilberger extended the Goulden-Jackson Cluster Method to find generating functions of word factors. Then in 2009 in [Electron. J. Combin.
Russell Chamberlain +5 more
core +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The Permutations 123 p 4 … p m and 321 p 4 … p m are Wilf-Equivalent
Graphs and Combinatorics, 2000Write p 1, p 2…p m for the permutation matrix δ pi, j . Let S n (M) be the set of n×n permutation matrices which do not contain the m×m permutation matrix M as a submatrix. In [7] Simion and Schmidt show bijectively that |S n
Eric Babson, Julian West
openaire +1 more source
Kernel-checked resolution of the last open case (3012 ≡ 3201) of the Hong–Li length-4 Wilf classification on inversion sequences — completing the length-4 classification; fifteen length-5 Wilf equivalences (first classical results at length ≥ 5); and the staircase-prefix invariant (SPI) programme: first distinguishing length, class sizes Σ c!, and the ...
openaire +1 more source
openaire +1 more source
Enumeration of 2-Wilf Classes of Four 4-letter Patterns
Turkish Journal of Analysis and Number Theory, 2017Toufik Mansour
exaly
Wilf classes for weak ascent sequences avoiding a pair or triple of length-3 patterns
Discrete MathematicsToufik Mansour, David Callan
exaly

