Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Computational Approaches to Consecutive Pattern Avoidance in Permutations

From MaRDI portal
Publication:2915627
Jump to:navigation, search

zbMath1265.05019arXiv1102.2480MaRDI QIDQ2915627

Brian Nakamura

Publication date: 18 September 2012

Full work available at URL: https://arxiv.org/abs/1102.2480

zbMATH Keywords

enumerationpermutationconsecutive pattern avoidancecounting permutationsCAVcluster tail generating functionsingle pattern avoidance


Mathematics Subject Classification ID

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


Related Items

Wilf equivalence relations for consecutive patterns, Consecutive patterns in inversion sequences II: avoiding patterns of relations, A probabilistic approach to consecutive pattern avoiding in permutations, Consecutive patterns in Coxeter groups, Inversion sequences avoiding consecutive patterns, 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, Increasing consecutive patterns in words, CAV


Uses Software

  • Maple


Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2915627&oldid=15890284"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki