2000 character limit reached
Second Best, Third Worst, Fourth in Line (2202.07621v2)
Published 15 Feb 2022 in math.CO, cs.DM, and math.NT
Abstract: We investigate decomposable combinatorial labeled structures more fully, focusing on the exp-log class of type a=1 or 1/2. For instance, the modal length of the second longest cycle in a random n-permutation is (0.2350...)n, whereas the modal length of the second smallest component in a random n-mapping is 2 (conjecturally, given n>=434). As in earlier work, our approach is to establish how well existing theory matches experimental data and to raise open questions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.