Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
Cart
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Home
Journals
Pure Mathematics and Applications
Volume 28 (2019): Issue 1 (October 2019)
Open Access
Enumeration of permutations avoiding a triple of 4-letter patterns is almost all done
David Callan
David Callan
,
Toufik Mansour
Toufik Mansour
and
Mark Shattuck
Mark Shattuck
| Nov 01, 2019
Pure Mathematics and Applications
Volume 28 (2019): Issue 1 (October 2019)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Nov 01, 2019
Page range:
14 - 69
Received:
Jan 19, 2018
Accepted:
May 16, 2018
DOI:
https://doi.org/10.1515/puma-2015-0031
Keywords
pattern avoidance
,
Wilf-equivalence
,
generating function
,
INSENC algorithm
© 2019 David Callan et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.
David Callan
Department of Statistics, University of Wisconsin
Madison
Toufik Mansour
Department of Mathematics, University of Haifa
Haifa, Israel
Mark Shattuck
Department of Mathematics, University of Tennessee
Knoxville