An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences

DOI10.1112/JLMS/S2-20.3.567MaRDI QIDQ3919721zbMATH OpenOpenAlexFDO

Authors David M. Jackson, I. 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

zbMATH Keywords

cluster generating functioninclusion-exclusion principlereduced sequencesSimon Newcomb problemSmirnov problem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Cited in

(38)

• String overlaps, pattern matching, and nontransitive games
• Enumeration of words by their number of mistakes
• Dimensions of fractals related to languages defined by tagged strings in complete genomes
• The Goulden-Jackson cluster method for cyclic words
• Wilf equivalence relations for consecutive patterns
• Shift equivalence in the generalized factor order
• A generalized Goulden-Jackson cluster method and lattice path enumeration
• On cyclic strings avoiding a pattern
• A necessary condition for c-Wilf equivalence
• Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics
• Clusters, generating functions and asymptotics for consecutive patterns in permutations
• 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
• Tree series and pattern avoidance in syntax trees
• Increasing consecutive patterns in words
• Bounds for the growth rate of meander numbers
• Generalizations of the Goulden–Jackson cluster method
• A Logarithmic Connection for Circular Permutation Enumeration
• Extension of Goulden–Jackson cluster method on pattern occurrences in random sequences and comparison with Régnier–Szpankowski method
• Counting words with Laguerre series
• Residues and telescopers for bivariate rational functions
• Growth properties of power-free languages
• The symbolic Goulden-Jackson cluster method
• The Goulden—Jackson cluster method: extensions, applications and implementations
• Systematic counting of restricted partitions
• Phase coexistence for the hard-core model on \(\mathbb{Z}^2\)
• Wilf equivalences for patterns in rooted labeled forests
• A natural bijection for contiguous pattern avoidance in words
• Computation of exact probabilities associated with overlapping pattern occurrences
• Subproduct systems and Cartesian systems: new results on factorial languages and their relations with other areas
• Modified difference ascent sequences and Fishburn structures
• Asymptotics of self-overlapping permutations
• Mixed binomial moments of overlapping r-runs in multicolour Hoppe-Pólya urns
• The q-exponential generating function for permutations by consecutive patterns and inversions
• Pattern avoidance in binary trees

This page was built for publication: An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3919721)