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...
主要な著者: | Groenland, C, Johnston, T, Korandi, D, Roberts, A, Scott, A, Tan, J |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
Society for Industrial and Applied Mathematics
2023
|
類似資料
-
On Decomposing Regular Graphs Into Isomorphic Double-Stars
著者:: El-Zanati Saad I., 等
出版事項: (2015-02-01) -
The lengths for which bicrucial square-free permutations exist
著者:: Carla Groenland, 等
出版事項: (2022-01-01) -
Exceptional graphs for the random walk
著者:: Aru, J, 等
出版事項: (2020) -
Fragmenting random permutations
著者:: Goldschmidt, C, 等
出版事項: (2007) -
On the First-Order Complexity of Induced Subgraph Isomorphism
著者:: Oleg Verbitsky, 等
出版事項: (2019-03-01)