Decomposing random permutations into order-isomorphic subpermutations
<p>Two permutations σ and π are ℓ-similar if they can be decomposed into subpermutations σ<sup>(1)</sup>, . . . , σ<sup>(ℓ)</sup> and π<sup>(1)</sup>, . . . , π<sup>(ℓ)</sup> such that &sigma...
Auteurs principaux: | Groenland, C, Johnston, T, Korandi, D, Roberts, A, Scott, A, Tan, J |
---|---|
Format: | Journal article |
Langue: | English |
Publié: |
Society for Industrial and Applied Mathematics
2023
|
Documents similaires
-
On Decomposing Regular Graphs Into Isomorphic Double-Stars
par: El-Zanati Saad I., et autres
Publié: (2015-02-01) -
Exceptional graphs for the random walk
par: Aru, J, et autres
Publié: (2020) -
Fragmenting random permutations
par: Goldschmidt, C, et autres
Publié: (2007) -
On the First-Order Complexity of Induced Subgraph Isomorphism
par: Oleg Verbitsky, et autres
Publié: (2019-03-01) -
Orderings and Boolean algebras not isomorphic to recursive ones
par: Feiner, Lawrence, 1942-
Publié: (2011)