Central limit theorem for the prefix exchange distance under Ewens sampling formula

Autor: Simona Grusea, Anthony Labarre

Publikováno v: Discrete Mathematics
Discrete Mathematics, Elsevier, 2021, 344 (2), pp.Article 112206. ⟨10.1016/j.disc.2020.112206⟩
Discrete Mathematics, 2021, 344 (2), pp.Article 112206. ⟨10.1016/j.disc.2020.112206⟩

International audience; The prefix exchange distance of a permutation is the length of its shortest factorisation into transpositions that all contain 1. Using a probabilistic approach, we obtain expressions for the mean and the variance, and prove t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a88e7e4ef778bdbd69a58298e08cb83a
https://doi.org/10.1016/j.disc.2020.112206

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Weak-vertex-pancyclicity of (n, k)-star graphs

Autor: Jung-Sheng Fu, Dyi-Rong Duh, Tai-Ling Ye, Ying-You Chen

Publikováno v: Theoretical Computer Science. (1-3):191-199

The (n,k)-star graph (S"n","k for short) is an attractive alternative to the hypercube and also a generalized version of the n-star. It is isomorphic to the n-star (n-complete) graph if k=n-1 (k=1). Jwo et al. have already demonstrated in 1991 that a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92fa4b25350e2babf45e22882f3c831f