CBCharles Burnette
Charles Burnette
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Charles Burnette has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Eric Schmutz
Drexel University
1 shared publication - Hüseyin Acan
Drexel University
1 shared publication - James Thomas
Drug Substance Development – Material Science, GlaxoSmithKline, Collegeville, United States of America
1 shared publication - Sean Eberhard
Mathematics Institute , 2707 University of Warwick , Zeeman Building , Coventry , CV4 7EZ , United Kingdom
1 shared publication
Latest Publications
- Open Access
- 27 January 2021
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 30 (5) , 800-810
Permutations with equal orders
Let ${\mathbb{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 ${\mathbb{P}}(ord\pi = ord\pi ') = {n^{ - 2 + o(1)}}$ and that ${\mathbb{P}}(ord\pi = ord\pi ') \ge {1 \over 2}{n^{ - 2}}lg*n$ for infinitely manyn. (Herelg*nis the height of the tallest tower of twos that is less than or equal ton.)- 27 January 2021
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 30 (5) , 800-810
Open AccessPermutations with equal orders
Let ${\mathbb{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 ${\mathbb{P}}(ord\pi = ord\pi ') = {n^{ - 2 + o(1)}}$ and that ${\mathbb{P}}(ord\pi = ord\pi ') \ge {1 \over 2}{n^{ - 2}}lg*n$ for infinitely manyn. (Herelg*nis the height of the tallest tower of twos that is less than or equal ton.)