Algorithms and Complexity - Main page

Algorithms and Complexity

Research Focus: Combinatorics

Random preorders and alignments

By Peter Cameron, Mihyun Kang and Dudley Stark
Discrete Mathematics, accpeted for publication

Abstract

A preorder consists of linearly ordered equivalence classes called blocks, and an alignment is a sequence of cycles. We investigate the block structure of a random preorder chosen uniformly at random among all preorders on n elements, and also the distribution of cycles in a random alignment chosen uniformly at random among all alignments on n elements, as n goes to infinity.

Download


last modified: 08 October 2008