D. A. Holton
Research Subjects
D. A. Holton has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- C. C. Handley
Department of Computer Science Department of Mathematics Department of Computer Science Department of Computer Science Department of Mathematics Department of Mathematics Department of Computer Science University of Otago Statistics University of Otago University of Otago University of Otago Statistics University of Otago Statistics University of Otago University of Otago
2 shared publications - M. D. Atkinson
Department of Computer Science, University of Otago, Dunedin, New Zealand
2 shared publications - Michael Henry Albert
Department of Computer Science University of Otago Dunedin New Zealand
2 shared publications - D. J. McCaughan
Department of Computer Science Department of Mathematics Department of Computer Science Department of Computer Science Department of Mathematics Department of Mathematics Department of Computer Science University of Otago Statistics University of Otago University of Otago University of Otago Statistics University of Otago Statistics University of Otago University of Otago
1 shared publication - R. E. L. Aldred1 shared publication
- Walter Stromquist
Department of Mathematics and Statistics Swarthmore College 19081 Swarthmore PA
1 shared publication
Latest Publications
- Open Access
- 7 January 2005
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 12 (1) , R31
Sorting Classes
Weak and strong sorting classes are pattern-closed classes that are also closed downwards under the weak and strong orders on permutations. They are studied using partial orders that capture both the subpermutation order and the weak or strong order. In both cases they can be characterised by forbidden permutations in the appropriate order. The connection with the corresponding forbidden permutations in pattern-closed classes is explored. Enumerative results are found in both cases.
- 7 January 2005
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 12 (1) , R31
Open AccessSorting Classes
Weak and strong sorting classes are pattern-closed classes that are also closed downwards under the weak and strong orders on permutations. They are studied using partial orders that capture both the subpermutation order and the weak or strong order. In both cases they can be characterised by forbidden permutations in the appropriate order. The connection with the corresponding forbidden permutations in pattern-closed classes is explored. Enumerative results are found in both cases.
- Open Access
- 1 January 2002
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 9 (1) , R5
On Packing Densities of Permutations
The density of a permutation pattern $\pi$ in a permutation $\sigma$ is the proportion of subsequences of $\sigma$ of length $|\pi|$ that are isomorphic to $\pi$. The maximal value of the density is found for several patterns $\pi$, and asymptotic upper and lower bounds for the maximal density are found in several other cases. The results are generalised to sets of patterns and the maximum density is found for all sets of length $3$ patterns.- 1 January 2002
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 9 (1) , R5
Open AccessOn Packing Densities of Permutations
The density of a permutation pattern $\pi$ in a permutation $\sigma$ is the proportion of subsequences of $\sigma$ of length $|\pi|$ that are isomorphic to $\pi$. The maximal value of the density is found for several patterns $\pi$, and asymptotic upper and lower bounds for the maximal density are found in several other cases. The results are generalised to sets of patterns and the maximum density is found for all sets of length $3$ patterns.