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