The following pages link to Anders Claesson (Q215139):
Displaying 50 items.
- An involution on \(\beta (1,0)\)-trees (Q394804) (← links)
- On the inverse image of pattern classes under bubble sort (Q433475) (← links)
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns (Q444905) (← links)
- Decomposing labeled interval orders as pairs of permutations (Q463061) (← links)
- Partition and composition matrices (Q533343) (← links)
- Mesh patterns and the expansion of permutation statistics as sums of permutation patterns (Q540135) (← links)
- Pattern avoidance in partial permutations (Q625391) (← links)
- Permutations sortable by \(n - 4\) passes through a stack (Q659583) (← links)
- Descent polynomials for permutations with bounded drop size (Q709255) (← links)
- (2+2)-free posets, ascent sequences and pattern avoiding permutations (Q986124) (← links)
- Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations (Q1012156) (← links)
- A permutation group determined by an ordered set (Q1402084) (← links)
- Catalan continued fractions and increasing subsequences in permutations (Q1850064) (← links)
- Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations (Q1865264) (← links)
- Transport of patterns by Burge transpose (Q2107496) (← links)
- Weak ascent sequences and related combinatorial structures (Q2107499) (← links)
- From Hertzsprung's problem to pattern-rewriting systems (Q2109220) (← links)
- Sorting with pattern-avoiding stacks: the \(132\)-machine (Q2194083) (← links)
- A species approach to Rota's twelvefold way (Q2221496) (← links)
- Stack sorting with restricted stacks (Q2306002) (← links)
- Isomorphisms between pattern classes (Q2345763) (← links)
- Counting segmented permutations using bicoloured Dyck paths (Q2571282) (← links)
- Classification of bijections between 321- and 132-avoiding permutations (Q2654626) (← links)
- (Q2959955) (← links)
- Boolean complexes for Ferrers graphs (Q3001197) (← links)
- $n!$ matchings, $n!$ posets (Q3082312) (← links)
- A direct encoding of Stoimenow's matchings as ascent sequences (Q3090464) (← links)
- (Q3176569) (← links)
- (Q3408831) (← links)
- Coincidence among families of mesh patterns (Q3451442) (← links)
- (Q4584061) (← links)
- (Q4591294) (← links)
- (Q4591328) (← links)
- (Q4591329) (← links)
- An involution on bicubic maps and \beta(0,1)-trees (Q5245525) (← links)
- Enumerations of Permutations Simultaneously Avoiding a Vincular and a Covincular Pattern of Length 3 (Q5278240) (← links)
- Sorting and preimages of pattern classes (Q5377411) (← links)
- Conway's Napkin Problem (Q5448067) (← links)
- Enumerating permutations sortable by \(k\) passes through a pop-stack (Q5918174) (← links)
- Enumerating permutations sortable by \(k\) passes through a pop-stack (Q5925190) (← links)
- Generalized pattern avoidance (Q5949033) (← links)
- Counting Pop-Stacked Permutations in Polynomial Time (Q6042966) (← links)
- Fishburn trees (Q6094855) (← links)
- Counting tournament score sequences (Q6106038) (← links)
- Turning cycle restrictions into mesh patterns via Foata's fundamental transformation (Q6177428) (← links)
- Caylerian polynomials (Q6611729) (← links)
- Modified difference ascent sequences and Fishburn structures (Q6733071) (← links)
- Pattern-avoiding Cayley permutations via combinatorial species (Q6738295) (← links)
- Self-modified difference ascent sequences (Q6740316) (← links)
- Enumerative aspects of Caylerian polynomials (Q6753234) (← links)
