Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-23T09:58:28.352Z Has data issue: false hasContentIssue false

COHOMOLOGY ACTIONS AND CENTRALISERS IN UNITARY REFLECTION GROUPS

Published online by Cambridge University Press:  22 October 2001

J. BLAIR
Affiliation:
School of Mathematics and Statistics, The University of Sydney, Sydney, NSW 2006, [email protected], [email protected]
G. I. LEHRER
Affiliation:
School of Mathematics and Statistics, The University of Sydney, Sydney, NSW 2006, [email protected], [email protected]
Get access

Abstract

In an earlier work, the second author proved a general formula for the equivariant Poincaré polynomial of a linear transformation g which normalises a unitary reflection group G, acting on the cohomology of the corresponding hyperplane complement. This formula involves a certain function (called a Z-function below) on the centraliser CG(g), which was proved to exist only in certain cases, for example, when g is a reflection, or is G-regular, or when the centraliser is cyclic. In this work we prove the existence of Z-functions in full generality. Applications include reduction and product formulae for the equivariant Poincaré polynomials. The method is to study the poset L(CG(g)) of subspaces which are fixed points of elements of CG(g). We show that this poset has Euler characteristic 1, which is the key property required for the definition of a Z-function. The fact about the Euler characteristic in turn follows from the ‘join-atom’ property of L(CG(g)), which asserts that if {X1,...,Xk} is any set of elements of L(CG(g)) which are maximal (set theoretically) then their setwise intersection $\bigcap_{i=1}^kX_i$ lies in L(CG(g)). 2000 Mathematical Subject Classification: primary 14R20, 55R80; secondary 20C33, 20G40.

Type
Research Article
Copyright
2001 London Mathematical Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)