Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-28T02:16:31.807Z Has data issue: false hasContentIssue false
  • English
  • Français

Intersecting families in classical Coxeter groups

Part of: Representation theory of groups Algebraic combinatorics

Published online by Cambridge University Press:  28 June 2013

Li Wang
Li Wang*
Affiliation:
Department of Mathematics, Shanghai Normal University, Guilin Road 100, Shanghai 200234, People's Republic of China ([email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let Ω be a finite set and let G be a permutation group acting on it. A subset H of G is called t-intersecting if any two elements in H agree on at least t points. Let SDn and SBn be the classical Coxeter group of type Dn and type Bn, respectively. We show that the maximum-sized (2t)-intersecting families in SDn and SBn are precisely cosets of stabilizers of t points in [n] ≔ {1, 2, …, n}, provided n is sufficiently large depending on t.

Keywords

intersecting families of permutations: Erdős–Ko–Rado theoremrepresentation theoryclassical coxeter groups

MSC classification

Secondary: 05E10: Combinatorial aspects of representation theory 20C15: Ordinary representations and characters
Type
Research Article
Information
Proceedings of the Edinburgh Mathematical Society , Volume 56 , Issue 3 , October 2013 , pp. 887 - 908
Copyright
Copyright © Edinburgh Mathematical Society 2013 

References

1.Cameron, P. J. and Ku, C. Y., Intersecting families of permutations, Eur. J. Combin. 24 (2003), 881–890.CrossRefGoogle Scholar
2.Chu, W. C. and Wang, X. Y., Eigenvectors of tridiagonal matrices of Sylvester type, Calcolo 45 (2008), 217–233.CrossRefGoogle Scholar
3.Deza, M. and Frankl, P., On the maximum number of permutations with given maximal or minimal distance, J. Combin. Theory A 22 (1977), 352–360.Google Scholar
4.Ellis, D., Setwise intersecting families of permutations, J. Combin. Theory A 119 (2012), 825–849.CrossRefGoogle Scholar
5.Ellis, D., Friedgut, E. and Pilpel, H., Intersecting families of permutations, J. Am. Math. Soc. 24 (2011), 649–682.CrossRefGoogle Scholar
6.Erőds, P., Co, C. and Rado, R., Intersecting theorems for systems of finite sets, Q. J. Math. 12 (1961), 313–320.CrossRefGoogle Scholar
7.Godsil, C. and Meagher, K., A new proof of the Erdős–Ko–Rado theorem for intersecting families of permutations, Eur. J. Combin. 29 (2009), 404–414.CrossRefGoogle Scholar
8.Larose, B. and Malvenuto, C., Stable sets of maximal size in Kneser-type graphs, Eur. J. Combin. 25 (2004), 657–673.CrossRefGoogle Scholar
9.Mathas, A., Iwahori–Hecke algebras and Schur algebras of the symmetric group, University Lecture Series, Volume 15 (American Mathematical Society, Providence, RI, 1999).Google Scholar
10.Ram, A., Seminormal representations of Weyl groups and the Iwahori–Hecke algebras, Proc. Lond. Math. Soc. 75 (1997), 99–133.CrossRefGoogle Scholar
11.Read, E. W., On the finite imprimitive unitary reflection groups, J. Alg. 45 (1977), 439–452.CrossRefGoogle Scholar
12.Shephard, G. C. and Todd, J. A., Finite unitary reflection groups, Can. J. Math. 6 (1954), 274–304.CrossRefGoogle Scholar
13.Wang, L., Erdős–Ko–Rado theorem for irreducible imprimitive reflection groups, Front. Math. China 7 (2012), 125–144.CrossRefGoogle Scholar
14.Wang, J. and Zhang, S. J., An Erdős–Ko–Rado-type theorem in Coxeter groups, Eur. J. Combin. 29 (2008), 1112–1115.CrossRefGoogle Scholar