3 citations · 4 across the 5 of their papers we have counts for
5 papers
Ordinal pattern probabilities for symmetric random walks
Hugh Denoncourt
An ordinal pattern for a finite sequence of real numbers is a permutation that records the relative positions in the sequence. For random walks with steps drawn uniformly from $[-1…
On the number of commutation classes of the longest element in the symmetric group
Hugh Denoncourt, Dana C. Ernst, Dustin Story
Using the standard Coxeter presentation for the symmetric group , two reduced expressions for the same group element are said to be commutation equivalent if we can obtain one…
Some combinatorial models for reduced expressions in Coxeter groups
Hugh Denoncourt
Stanley's formula for the number of reduced expressions of a permutation regarded as a Coxeter group element raises the question of how to enumerate the reduced expressions of an a…
A refinement of weak order intervals into distributive lattices
Hugh Denoncourt
In this paper we consider arbitrary intervals in the left weak order on the symmetric group . We show that the Lehmer codes of permutations in an interval form a distributive…
The enumeration of maximally clustered permutations
Hugh Denoncourt, Brant C. Jones
The maximally clustered permutations are characterized by avoiding the classical permutation patterns 3421, 4312, and 4321. This class contains the freely-braided permutations and…