The study of asymptotics of random permutations was initiated by Erdős and Turáan, in a series of papers from 1965 to 1968, and has been much studied since. Recent developments in permutation group theory make it reasonable to ask questions with a more group-theoretic flavour. Two examples considered here are membership in a proper transitive subgroup, and the intersection of a subgroup with a random conjugate. These both arise from other topics (quasigroups, bases for permutation groups, and design constructions).</p
AbstractA new random base change algorithm is presented for a permutation group G acting on n points...
AbstractA new random base change algorithm is presented for a permutation group G acting on n points...
The purpose of this thesis was to evaluate the proportion between a variance of some dependent varia...
The study of asymptotics of random permutations was initiated by Erdos and Turan, in a series of pap...
We present a "practical" algorithm to construct random elements of a finite group. We anal...
The second author had previously obtained explicit generating functions for moments of characteristi...
We prove a conjecture dating back to a 1978 paper of D.R. Musser [11], namely that four random permu...
We prove a conjecture dating back to a 1978 paper of D.R. Musser [11], namely that four random permu...
The topic of this thesis are random processes on finite and infinite groups. More specifically, we a...
The topic of this thesis are random processes on finite and infinite groups. More specifically, we a...
This is a survey of results on random group presentations, and on random subgroups of certain fixed ...
On présente dans cette thèse des techniques de preuve d'universalité pour les permutations aléatoire...
We describe some recent contributions on the probability of commuting pairs, introduced by P. Erdos,...
Given a transitive permutation group of degree n, we denote by e(T) (G) the expected number of eleme...
Models for random permutations with nonuniform probability distribution are ubiq-uitous in many bran...
AbstractA new random base change algorithm is presented for a permutation group G acting on n points...
AbstractA new random base change algorithm is presented for a permutation group G acting on n points...
The purpose of this thesis was to evaluate the proportion between a variance of some dependent varia...
The study of asymptotics of random permutations was initiated by Erdos and Turan, in a series of pap...
We present a "practical" algorithm to construct random elements of a finite group. We anal...
The second author had previously obtained explicit generating functions for moments of characteristi...
We prove a conjecture dating back to a 1978 paper of D.R. Musser [11], namely that four random permu...
We prove a conjecture dating back to a 1978 paper of D.R. Musser [11], namely that four random permu...
The topic of this thesis are random processes on finite and infinite groups. More specifically, we a...
The topic of this thesis are random processes on finite and infinite groups. More specifically, we a...
This is a survey of results on random group presentations, and on random subgroups of certain fixed ...
On présente dans cette thèse des techniques de preuve d'universalité pour les permutations aléatoire...
We describe some recent contributions on the probability of commuting pairs, introduced by P. Erdos,...
Given a transitive permutation group of degree n, we denote by e(T) (G) the expected number of eleme...
Models for random permutations with nonuniform probability distribution are ubiq-uitous in many bran...
AbstractA new random base change algorithm is presented for a permutation group G acting on n points...
AbstractA new random base change algorithm is presented for a permutation group G acting on n points...
The purpose of this thesis was to evaluate the proportion between a variance of some dependent varia...