Domains for reflection-Catalan families and multiplicative convolution
Statement
Problem 1.2. What are the largest natural domains of definition for the families N C W,
N N W and ∆ W, and for their corresponding applications? In a sense, the broadest setting possible for the numerology is finite groups generated by pseudoreflections. (A pseudoreflec-tion is a unitary operator on an n-dimensional complex vector space whose eigenvalues are 0 with multiplicity n − 1, and −1 with multiplicity 1.) It is a classical result of Shephard and Todd that the ring of invariants of a group W is a polynomial ring precisely when the group is of this type. And in this case the sequence of degrees d1, d 2,..., d n of fundamental invariants is unique [43]. In the general (complex) case, David Bessis suggests that the Catalan number should be Cat( W ):=
n
∏
i=1
h + di
di,
where we set h equal to the highest degree dn. This agrees with our earlier definition in the real types. However, this may apply only when W is a duality group (or a well-generated group ), since otherwise Cat( W ) may fail to be an integer. See the paper [7] by David Bessis for more information.
• The noncrossing partitions are currently the most general of the Catalan families. The poset N C W is defined for all finite Coxeter groups, and the definition makes sense in principle for any finitely generated Coxeter group (although the definition may not be unique when W is infinite [11]). David Bessis and Ruth Corran gave a combinatorial realization of N C W for an infinite class of complex reflection groups in [8], and Bessis has suggested a uniform definition for N C W whenever W is a well-generated complex reflection group [7].
• Can one generalize free probability beyond types A and B? The combinatorics of free probability is naturally expressed in terms of the type A noncrossing partitions [47], and some work has been done on a type B free probability [10]. Does it make sense to generalize further? One would presumably need to express Roland Speicher's work on multiplicative functions [48] in the completely general case. See
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.