Erdős-Ko-Rado theorem for irreducible imprimitive reflection groups
From MaRDI portal
Publication:1758575
DOI10.1007/s11464-011-0167-0zbMath1250.05118OpenAlexW2159033144MaRDI QIDQ1758575
Publication date: 15 November 2012
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-011-0167-0
Erdős-Ko-Rado theoremrepresentation theorystabilizercosetirreducible imprimitive reflection groupsmaximal intersectin subset
Combinatorial aspects of representation theory (05E10) Ordinary representations and characters (20C15) Extremal set theory (05D05)
Related Items (4)
The Erdős-Ko-Rado property for some 2-transitive groups ⋮ A numerical model for railroad freight car-to-car end impact ⋮ Setwise intersecting families in classical Coxeter groups ⋮ Intersecting families in classical Coxeter groups
Cites Work
- Unnamed Item
- Unnamed Item
- Erdős-Ko-Rado-type theorems for colored sets
- An Erdős-Ko-Rado-type theorem in Coxeter groups.
- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- On the finite imprimitive unitary reflection groups
- On the maximum number of permutations with given maximal or minimal distance
- A Hecke algebra of \((\mathbb{Z}/r\mathbb{Z})\wr{\mathfrak S}_ n\) and construction of its irreducible representations
- Stable sets of maximal size in Kneser-type graphs
- Representation theory of a Hecke algebra of \(G(r,p,n)\)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Murnaghan-Nakayama Rules for Characters of Iwahori-Hecke Algebras of the Complex Reflection Groups G(r, p, n)
- Generating a random permutation with random transpositions
- Finite Unitary Reflection Groups
- Intersecting families of permutations
- Intersecting families of permutations
This page was built for publication: Erdős-Ko-Rado theorem for irreducible imprimitive reflection groups
