Combinatorial methods are employed to study the double cosets of the symmetric group S n with respect to Young subgroups H and K . The current paper develops a correspondence between these double cosets and certain lists of integers . This approach leads naturally to an algorithm for computing the n
A combinatorial approach to transitive extensions of generously unitransitive permutation groups
β Scribed by M. H. Klin; D. M. Mesner; A. J. Woldar
- Publisher
- John Wiley and Sons
- Year
- 2010
- Tongue
- English
- Weight
- 230 KB
- Volume
- 18
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
Motivated by symmetric association schemes (which are known to approximate generously unitransitive group actions), we formulate combinatorial approximations to transitive extensions of generously unitransitive permutation groups. Specifically, the notions of compatible and coherent partitions are suggested and investigated in terms of the orbits of an ambient group (H, Ξ©) on the kβsubsets of Ξ©, k=2, 3, 4. We apply these ideas to investigate transitive extensions of the automorphism groups of the classical Johnson and Hamming schemes. In the latter case, we further provide algorithmic details and computerβgenerated data for the particular series of Hamming schemes H(m, 3), mβ©Ύ2. Finally, our approach is compared to the concept of a symmetric association scheme on triples in the sense of Mesner and Bhattacharya. Β© 2010 Wiley Periodicals, Inc. J Combin Designs 18:369β391, 2010
π SIMILAR VOLUMES
We calibrate and contrast the recent generalized multinomial logit model and the widely used latent class logit model approaches for studying heterogeneity in consumer purchases. We estimate the parameters of the models on panel data of household ketchup purchases, and find that the generalized mult