A lift of West's stack-sorting map to partition diagrams

DOI10.2140/PJM.2023.324.227zbMATH Open1519.05004arXiv2301.00926MaRDI QIDQ6165151FDOQ6165151

Authors: John Maxwell Campbell 

Publication date: 31 July 2023

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Abstract: We introduce a lifting of West's stack-sorting map $s$ to partition diagrams, which are combinatorial objects indexing bases of partition algebras. Our lifting $mathscrS$ of $s$ is such that $mathscrS$ behaves in the same way as $s$ when restricted to diagram basis elements in the order-$n$ symmetric group algebra as a diagram subalgebra of the partition algebra $mathscr{P}_n^{xi}$. We then introduce a lifting of the notion of $1$-stack-sortability, using our lifting of $s$. By direct analogy with Knuth's famous result that a permutation is $1$-stack-sortable if and only if it avoids the pattern $231$, we prove a related pattern-avoidance property for partition diagrams, as opposed to permutations, according to what we refer to as stretch-stack-sortability.

Full work available at URL: https://arxiv.org/abs/2301.00926

Recommendations

• Stack-sorting preimages of permutation classes
• Sorting and preimages of pattern classes
• A survey of stack sortable permutations
• A survey of stack-sorting disciplines

zbMATH Keywords

permutationpermutation patternpartition monoidstack-sortingpartition diagram

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of groups and algebras (05E16)

Cites Work

• Title not available (Why is that?)
• On tensor spaces for rook monoid algebras
• Partition algebras.
• Title not available (Why is that?)
• TEMPERLEY-LIEB ALGEBRAS FOR NON-PLANAR STATISTICAL MECHANICS — THE PARTITION ALGEBRA CONSTRUCTION
• Generators and relations for partition monoids and algebras.
• On central idempotents in the partition algebra
• The structure of the partition algebras
• A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
• Descents in \(t\)-sorted permutations
• Stack-sorting preimages of permutation classes
• The partition algebra and the Potts model transfer matrix spectrum in high dimensions
• Stack-sorting with consecutive-pattern-avoiding stacks
• Stack sorting with restricted stacks
• Stack-sorting for words
• Stack-sorting, set partitions, and Lassalle's sequence
• Fertility monotonicity and average complexity of the stack-sorting map
• Polyurethane toggles
• Stack-sorting for Coxeter groups
• Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
• Highly sorted permutations and Bell numbers

This page was built for publication: A lift of West's stack-sorting map to partition diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6165151)