An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
From MaRDI portal
Publication:3919721
DOI10.1112/jlms/s2-20.3.567zbMath0467.05008OpenAlexW2019198417MaRDI QIDQ3919721
David M. Jackson, Ian P. Goulden
Publication date: 1979
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-20.3.567
inclusion-exclusion principlecluster generating functionSimon Newcomb problemreduced sequencesSmirnov problem
Related Items
Wilf equivalence relations for consecutive patterns, Shift equivalence in the generalized factor order, The \(q\)-exponential generating function for permutations by consecutive patterns and inversions, A generalized Goulden-Jackson cluster method and lattice path enumeration, Counting words with Laguerre series, Wilf equivalences for patterns in rooted labeled forests, Tree series and pattern avoidance in syntax trees, A natural bijection for contiguous pattern avoidance in words, String overlaps, pattern matching, and nontransitive games, Enumeration of words by their number of mistakes, Residues and telescopers for bivariate rational functions, Growth properties of power-free languages, On cyclic strings avoiding a pattern, A necessary condition for c-Wilf equivalence, A Logarithmic Connection for Circular Permutation Enumeration, Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics, Clusters, generating functions and asymptotics for consecutive patterns in permutations, The symbolic Goulden-Jackson cluster method, Pattern avoidance in binary trees, Generalizations of the Goulden–Jackson cluster method, Extension of Goulden–Jackson cluster method on pattern occurrences in random sequences and comparison with Régnier–Szpankowski method, The Goulden—Jackson cluster method: extensions, applications and implementations, Phase Coexistence for the Hard-Core Model on ℤ2, Increasing consecutive patterns in words, Systematic Counting of Restricted Partitions, Dimensions of fractals related to languages defined by tagged strings in complete genomes, The Goulden-Jackson cluster method for cyclic words, Bounds for the growth rate of meander numbers, Classical and consecutive pattern avoidance in rooted forests, Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson, From Hertzsprung's problem to pattern-rewriting systems, An application of the Goulden-Jackson cluster theorem, A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra
