We define a subclass of totally symmetric self-complementary plane partitions (TSSCPPs) which we show is in direct bijection with permutation matrices. This bijection maps the inversion number of the permutation, the position of the 1 in the last column, and the position of the 1 in the last row to natural statistics on these TSSCPPs. We also discuss the possible extension of this approach to f...

Permutation testing has been widely implemented in voxel-based morphometry (VBM) tools. However, this type of non-parametric inference has yet to be thoroughly compared with traditional parametric inference in VBM studies of brain structure. Here we compare both types of inference and investigate what influence the number of permutations in permutation testing has on results in an exemplar stud...

Circular permutation is a common molecular mechanism for evolution of proteins. However, such re-arrangement of secondary structure connectivity may interfere with the folding mechanism causing accumulation of folding intermediates, which in turn can lead to misfolding. We solved the crystal structure and investigated the folding pathway of a circularly permuted variant of a PDZ domain, SAP97 P...

Papai’s 2000 hierarchical exchange mechanisms for house allocation problems determine matchings as the outcome of multiple rounds of trading cycles. Any hierarchical exchange mechanism can be defined through a structure of ownership, which determines the ownership of houses after any round of trading cycles. Given a permutation of agents, a “permuted” hierarchical exchange mechanism can be cons...

Failure to account for family structure within populations or in complex mating designs via uninformed applications of permutation testing will lead to inflated type I error rates. Careful consideration of the design factors is essential since some situations allow several valid permutation strategies, and the choice that maximizes statistical power will not always be intuitive.

In this paper we address the issue of pruning (i.e., shortening) a given interleaver via truncation of the transposition vector of the mother permutation and study its impact on the structural properties of the permutation. This method of pruning allows for continuous uninterrupted data flow regardless of the permutation length since the permutation engine is a buffer whose leading element is s...

All known finite sharply 4-transitive permutation sets containing the identity are groups, namely S4, S5, A6 and the Mathieu group of degree 11. We prove that a sharply 4-transitive permutation set on 11 elements containing the identity must necessarily be the Mathieu group of degree 11. The proof uses direct counting arguments. It is based on a combinatorial property of the involutions in the ...

We study the permutations of the finite field Fqn given by x + γ f(x), where γ ∈ Fqn is a linear translator of f : Fqn → Fq. We determine the cycle structure and the inverse of such a permutation. We describe several families of permutation polynomials obtained using functions with linear translators.

2011 Using the reciprocal to calculate generating functions for permutations with no consecutive pattern matches Permutation Patterns 2011 San Luis Obispo, CA 2011 Reciprocal method to enumerate permutations with no consecutive pattern matches FPSAC 2011 Reykjavik, Iceland 2010 Pattern matching in the cycle structure of permutations Permutation Patterns 2010 Dartmouth, NH 2010 Advancement to ca...