Second Best, Third Worst, Fourth in Line

02/15/2022
by   Steven Finch, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2021

Permute, Graph, Map, Derange

We study decomposable combinatorial labeled structures in the exp-log cl...
research
11/29/2021

Rounds, Color, Parity, Squares

This is a sequel to our paper "Permute, Graph, Map, Derange", involving ...
research
05/11/2022

Components and Cycles of Random Mappings

Each connected component of a mapping {1,2,...,n}→{1,2,...,n} contains a...
research
10/01/2020

Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs

Permutation σ appears in permutation π if there exists a subsequence of ...
research
03/16/2021

A Hamilton Cycle in the k-Sided Pancake Network

We present a Hamilton cycle in the k-sided pancake network and four comb...
research
11/25/2019

Combinatorial lower bounds for 3-query LDCs

A code is called a q-query locally decodable code (LDC) if there is a ra...
research
11/02/2017

On the complexity of optimal homotopies

In this article, we provide new structural results and algorithms for th...

Please sign up or login with your details

Forgot password? Click here to reset