The following pages link to Permutation classes (Q2949156):
Displaying 18 items.
- An exact characterization of saturation for permutation matrices (Q5886259) (← links)
- On the effective and automatic enumeration of polynomial permutation classes (Q5963395) (← links)
- (Q6065422) (← links)
- Hereditary classes of ordered binary structures (Q6136170) (← links)
- A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs (Q6170800) (← links)
- Burstein’s permutation conjecture, Hong and Li’s inversion sequence conjecture and restricted Eulerian distributions (Q6180594) (← links)
- Hereditary classes of ordered sets of width at most two (Q6563997) (← links)
- Generalized coloring of permutations (Q6582372) (← links)
- A logical limit law for \(231\)-avoiding permutations (Q6606908) (← links)
- Long increasing subsequences and non-algebraicity (Q6606910) (← links)
- Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns (Q6611742) (← links)
- Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024 (Q6613409) (← links)
- Computational complexity of counting coincidences (Q6614012) (← links)
- Permutations avoiding bipartite partially ordered patterns have a regular insertion encoding (Q6614156) (← links)
- Most principal permutation classes, and \(t\)-stack sortable permutations, have nonrational generating functions (Q6621165) (← links)
- Thresholds for patterns in random permutations with a given number of inversions (Q6635161) (← links)
- On the permutations that strongly avoid the pattern 312 or 231 (Q6661735) (← links)
- Decidability of well quasi-order and atomicity for equivalence relations under embedding orderings (Q6663927) (← links)
