Identifier
Mp00058:
Perfect matchings
—to permutation⟶
Permutations
Mp00237: Permutations —descent views to invisible inversion bottoms⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00237: Permutations —descent views to invisible inversion bottoms⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Images
=>
Cc0012;cc-rep-0Cc0020;cc-rep-3
[(1,2)]=>[2,1]=>[2,1]=>([(0,1)],2)
[(1,2),(3,4)]=>[2,1,4,3]=>[2,1,4,3]=>([(0,3),(1,2)],4)
[(1,3),(2,4)]=>[3,4,1,2]=>[4,1,3,2]=>([(0,3),(1,2),(1,3),(2,3)],4)
[(1,4),(2,3)]=>[4,3,2,1]=>[2,3,4,1]=>([(0,3),(1,3),(2,3)],4)
[(1,2),(3,4),(5,6)]=>[2,1,4,3,6,5]=>[2,1,4,3,6,5]=>([(0,5),(1,4),(2,3)],6)
[(1,3),(2,4),(5,6)]=>[3,4,1,2,6,5]=>[4,1,3,2,6,5]=>([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
[(1,4),(2,3),(5,6)]=>[4,3,2,1,6,5]=>[2,3,4,1,6,5]=>([(0,1),(2,5),(3,5),(4,5)],6)
[(1,5),(2,3),(4,6)]=>[5,3,2,6,1,4]=>[6,3,5,1,2,4]=>([(0,4),(0,5),(1,2),(1,3),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
[(1,6),(2,3),(4,5)]=>[6,3,2,5,4,1]=>[4,3,5,6,1,2]=>([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
[(1,6),(2,4),(3,5)]=>[6,4,5,2,3,1]=>[3,5,2,6,4,1]=>([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
[(1,5),(2,4),(3,6)]=>[5,4,6,2,1,3]=>[2,6,1,5,4,3]=>([(0,1),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
[(1,4),(2,5),(3,6)]=>[4,5,6,1,2,3]=>[6,1,2,4,5,3]=>([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
[(1,3),(2,5),(4,6)]=>[3,5,1,6,2,4]=>[5,6,3,2,1,4]=>([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
[(1,2),(3,5),(4,6)]=>[2,1,5,6,3,4]=>[2,1,6,3,5,4]=>([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
[(1,2),(3,6),(4,5)]=>[2,1,6,5,4,3]=>[2,1,4,5,6,3]=>([(0,1),(2,5),(3,5),(4,5)],6)
[(1,3),(2,6),(4,5)]=>[3,6,1,5,4,2]=>[6,4,3,5,1,2]=>([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
[(1,4),(2,6),(3,5)]=>[4,6,5,1,3,2]=>[5,3,1,4,6,2]=>([(0,5),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
[(1,5),(2,6),(3,4)]=>[5,6,4,3,1,2]=>[3,1,4,6,5,2]=>([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
[(1,6),(2,5),(3,4)]=>[6,5,4,3,2,1]=>[2,3,4,5,6,1]=>([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
[(1,2),(3,4),(5,6),(7,8)]=>[2,1,4,3,6,5,8,7]=>[2,1,4,3,6,5,8,7]=>([(0,7),(1,6),(2,5),(3,4)],8)
[(1,4),(2,3),(5,8),(6,7)]=>[4,3,2,1,8,7,6,5]=>[2,3,4,1,6,7,8,5]=>([(0,7),(1,7),(2,7),(3,6),(4,6),(5,6)],8)
Map
to permutation
Description
Returns the fixed point free involution whose transpositions are the pairs in the perfect matching.
Map
descent views to invisible inversion bottoms
Description
Return a permutation whose multiset of invisible inversion bottoms is the multiset of descent views of the given permutation.
This map is similar to Mp00235descent views to invisible inversion bottoms, but different beginning with permutations of six elements.
An invisible inversion of a permutation $\sigma$ is a pair $i < j$ such that $i < \sigma(j) < \sigma(i)$. The element $\sigma(j)$ is then an invisible inversion bottom.
A descent view in a permutation $\pi$ is an element $\pi(j)$ such that $\pi(i+1) < \pi(j) < \pi(i)$, and additionally the smallest element in the decreasing run containing $\pi(i)$ is smaller than the smallest element in the decreasing run containing $\pi(j)$.
This map is a bijection $\chi:\mathfrak S_n \to \mathfrak S_n$, such that
This map is similar to Mp00235descent views to invisible inversion bottoms, but different beginning with permutations of six elements.
An invisible inversion of a permutation $\sigma$ is a pair $i < j$ such that $i < \sigma(j) < \sigma(i)$. The element $\sigma(j)$ is then an invisible inversion bottom.
A descent view in a permutation $\pi$ is an element $\pi(j)$ such that $\pi(i+1) < \pi(j) < \pi(i)$, and additionally the smallest element in the decreasing run containing $\pi(i)$ is smaller than the smallest element in the decreasing run containing $\pi(j)$.
This map is a bijection $\chi:\mathfrak S_n \to \mathfrak S_n$, such that
- the multiset of descent views in $\pi$ is the multiset of invisible inversion bottoms in $\chi(\pi)$,
- the set of left-to-right maximima of $\pi$ is the set of maximal elements in the cycles of $\chi(\pi)$,
- the set of global ascent of $\pi$ is the set of global ascent of $\chi(\pi)$,
- the set of maximal elements in the decreasing runs of $\pi$ is the set of deficiency positions of $\chi(\pi)$, and
- the set of minimal elements in the decreasing runs of $\pi$ is the set of deficiency values of $\chi(\pi)$.
Map
graph of inversions
Description
The graph of inversions of a permutation.
For a permutation of $\{1,\dots,n\}$, this is the graph with vertices $\{1,\dots,n\}$, where $(i,j)$ is an edge if and only if it is an inversion of the permutation.
For a permutation of $\{1,\dots,n\}$, this is the graph with vertices $\{1,\dots,n\}$, where $(i,j)$ is an edge if and only if it is an inversion of the permutation.
searching the database
Sorry, this map was not found in the database.