Permutation classes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1409.5159 v3 pith:CPX64NRQ submitted 2014-09-17 math.CO

Vincent Vatter This is my paper · ORCID

classification math.CO

keywords classespermutationbookcombinatoricsenumerativehandbooksurveyupcoming

verification ladder T0 review T1 audit T2 compute T3 formal

No signed human review yet.

0 comments

read the original abstract

This is a survey on permutation classes for the upcoming book Handbook of Enumerative Combinatorics.

Forward citations

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Permutation patterns in streams
cs.DS 2025-07 accept novelty 8.0 of 10

Streaming permutation pattern matching needs Θ(k log n) bits for monotone patterns, about sqrt(n) bits for four length-3 patterns, and linear bits for all larger non-monotone patterns.
The price of incrementality in k-center clustering
cs.DS 2026-06 unverdicted novelty 7.0 of 10

Incremental k-center clustering admits no better than 2-approximation even for non-polynomial algorithms, via a new lower-bound construction.
Finding and counting permutations via CSPs
cs.DS 2019-08 conditional novelty 7.0 of 10

Permutation Pattern Matching can be solved in n^{k/4+o(k)} time and in O(1.6181^n) polynomial-space time, with matching counting algorithms and an ETH-based near-optimal lower bound for the counting problem.