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...
Autors principals: | Groenland, C, Johnston, T, Korandi, D, Roberts, A, Scott, A, Tan, J |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
Society for Industrial and Applied Mathematics
2023
|
Ítems similars
-
On Decomposing Regular Graphs Into Isomorphic Double-Stars
per: El-Zanati Saad I., et al.
Publicat: (2015-02-01) -
Exceptional graphs for the random walk
per: Aru, J, et al.
Publicat: (2020) -
Fragmenting random permutations
per: Goldschmidt, C, et al.
Publicat: (2007) -
On the First-Order Complexity of Induced Subgraph Isomorphism
per: Oleg Verbitsky, et al.
Publicat: (2019-03-01) -
Orderings and Boolean algebras not isomorphic to recursive ones
per: Feiner, Lawrence, 1942-
Publicat: (2011)