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...
Huvudupphovsmän: | Groenland, C, Johnston, T, Korandi, D, Roberts, A, Scott, A, Tan, J |
---|---|
Materialtyp: | Journal article |
Språk: | English |
Publicerad: |
Society for Industrial and Applied Mathematics
2023
|
Liknande verk
Liknande verk
-
On Decomposing Regular Graphs Into Isomorphic Double-Stars
av: El-Zanati Saad I., et al.
Publicerad: (2015-02-01) -
The lengths for which bicrucial square-free permutations exist
av: Carla Groenland, et al.
Publicerad: (2022-01-01) -
Exceptional graphs for the random walk
av: Aru, J, et al.
Publicerad: (2020) -
Fragmenting random permutations
av: Goldschmidt, C, et al.
Publicerad: (2007) -
On the First-Order Complexity of Induced Subgraph Isomorphism
av: Oleg Verbitsky, et al.
Publicerad: (2019-03-01)