Permutation patterns are hard to count

DOI10.1137/1.9781611974331.ch66zbMath1410.68142OpenAlexW4252991939MaRDI QIDQ4575645

Igor Pak, Scott M. Garrabrant

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch66

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Interview with Igor Pak ⋮ The number of occurrences of patterns in a random tree or forest permutation ⋮ Words in linear groups, random walks, automata and P-recursiveness ⋮ Supercritical sequences, and the nonrationality of most principal permutation classes ⋮ Combinatorial generation via permutation languages. I. Fundamentals

This page was built for publication: Permutation patterns are hard to count