scientific article; zbMATH DE number 6683606

zbMATH Open1355.05025MaRDI QIDQ2959985FDOQ2959985

Authors: Miles E. Jones, Jeffrey Remmel 

Publication date: 10 February 2017

Full work available at URL: http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAO0149

Title of this publication is not available (Why is that?)

Recommendations

• A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern
• Generating functions for descents over permutations which avoid sets of consecutive patterns
• Generating functions for permutations avoiding a consecutive pattern
• A non-recursive algorithm of generating an \(r\)-permutation and its applications
• Asymptotic enumeration of permutations avoiding generalized patterns
• Applying a reciprocity method to count permutations avoiding two families of consecutive patterns
• Generalized permutation patterns -- a short survey
• On bijections for pattern-avoiding permutations
• Generating functions of permutations with respect to their alternating runs
• Generating functions for permutation representations.

zbMATH Keywords

descentexponential generating functionpattern matchsymmetric polynomialleft to right minimum

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Cited In (3)

• A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern
• Applying a reciprocity method to count permutations avoiding two families of consecutive patterns
• Generating functions for descents over permutations which avoid sets of consecutive patterns

This page was built for publication:

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