Papers
Topics
Authors
Recent
Search
2000 character limit reached

Steinberg's theorem for crystallographic complex reflection groups

Published 12 Feb 2018 in math.CO and math.RT | (1802.03854v2)

Abstract: Popov classified crystallographic complex reflection groups by determining lattices they stabilize. These analogs of affine Weyl groups have infinite order and are generated by reflections about affine hyperplanes; most arise as the semi-direct product of a finite complex reflection group and a full rank lattice. Steinberg's fixed point theorem asserts that the regular orbits under the action of a reflection group are exactly the orbits lying off of reflecting hyperplanes. This theorem holds for finite reflection groups (real or complex) and also affine Weyl groups but fails for some crystallographic complex reflection groups. We determine when Steinberg's theorem holds for the infinite family of crystallographic complex reflection groups. We include crystallographic groups built on finite Coxeter groups.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.