John R. Britnell

activity

20052026

most citedThe probability that a pair of elements of a finite group are conjugate

18 citations · 44 across the 15 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2015★ 1 cited

Computing derangement probabilities of the symmetric group acting on k-sets

John R. Britnell, Mark Wildon

Let $i (\infty, k)$ be the limiting proportion, as $n \to \infty$ , of permutations in the symmetric group of degree $n$ that fix a $k$ -set. We give an algorithm for computing…

math.CO2015

Bell numbers, partition moves and the eigenvalues of the random-to-top shuffle in Dynkin Types A, B and D

John R. Britnell, Mark Wildon

Let $B_{t} (n)$ be the number of set partitions of a set of size~ $t$ into at most $n$ parts and let $B_{t}^{'} (n)$ be the number of set partitions of ${1, \dots, t}$ into at most $n$ par…

math.CO2014★ 1 cited

The majority game with an arbitrary majority

John R. Britnell, Mark Wildon

The $k$ -majority game is played with $n$ numbered balls, each coloured with one of two colours. It is given that there are at least $k$ balls of the majority colour, where $k$ is a…

math.CO2012

Finding a princess in a palace: A pursuit-evasion problem

John R. Britnell, Mark Wildon

This paper solves a pursuit-evasion problem in which a prince must find a princess who is constrained to move on each day from one vertex of a finite graph to another. Unlike the r…

math.CO2012

A formal identity involving commuting triples of permutations

John R. Britnell

We prove a formal power series identity, relating the arithmetic sum-of-divisors function to commuting triples of permutations. This establishes a conjecture of Franklin T. Adams-W…