Files and links (1)
SubmittedOpen Access (License Unspecified), Open
Journal article
Permutations with equal orders
Combinatorics, probability & computing, v 30(5), pp 800-810
01 Sep 2021
Featured in Collection : UN Sustainable Development Goals @ Drexel
Abstract
Let P(ord pi = ord pi') be the probability that two independent, uniformly random permutations of [n] have the same order. Answering a question of Thibault Godin, we prove that P(ord pi = ord pi')= n(-2+o(1)) and that P(ord pi = ord pi') >= 1/2 n(-2) lg* n for infinitely many n. (Here lg* n is the height of the tallest tower of twos that is less than or equal to n.)
Metrics
16 Record Views
1 citations in Scopus
Details
- Title
- Permutations with equal orders
- Creators
- Huseyin Acan - Drexel UniversityCharles Burnette - Xavier University of LouisianaSean Eberhard - University of CambridgeEric Schmutz - Drexel UniversityJames Thomas - Drexel University
- Publication Details
- Combinatorics, probability & computing, v 30(5), pp 800-810
- Publisher
- Cambridge Univ Press
- Number of pages
- 11
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Materials Science and Engineering; Mathematics
- Web of Science ID
- WOS:000753893300009
- Scopus ID
- 2-s2.0-85100098835
- Other Identifier
- 991019169898504721
UN Sustainable Development Goals (SDGs)
This publication has contributed to the advancement of the following goals:
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Collaboration types
- Domestic collaboration
- International collaboration
- Web of Science research areas
- Computer Science, Theory & Methods
- Mathematics
- Statistics & Probability