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...
Asıl Yazarlar: | Groenland, C, Johnston, T, Korandi, D, Roberts, A, Scott, A, Tan, J |
---|---|
Materyal Türü: | Journal article |
Dil: | English |
Baskı/Yayın Bilgisi: |
Society for Industrial and Applied Mathematics
2023
|
Benzer Materyaller
-
On Decomposing Regular Graphs Into Isomorphic Double-Stars
Yazar:: El-Zanati Saad I., ve diğerleri
Baskı/Yayın Bilgisi: (2015-02-01) -
Exceptional graphs for the random walk
Yazar:: Aru, J, ve diğerleri
Baskı/Yayın Bilgisi: (2020) -
Fragmenting random permutations
Yazar:: Goldschmidt, C, ve diğerleri
Baskı/Yayın Bilgisi: (2007) -
On the First-Order Complexity of Induced Subgraph Isomorphism
Yazar:: Oleg Verbitsky, ve diğerleri
Baskı/Yayın Bilgisi: (2019-03-01) -
Orderings and Boolean algebras not isomorphic to recursive ones
Yazar:: Feiner, Lawrence, 1942-
Baskı/Yayın Bilgisi: (2011)