Positive definite functions on Coxeter groups with applications to operator spaces and noncommutative probability
Marek Bo\.zejko, \'Swiatos{\l}aw R. Gal, and Wojciech M{\l}otkowski

TL;DR
This paper introduces a new class of positive definite functions on Coxeter groups, extending Riesz products, with applications to harmonic analysis, operator spaces, and noncommutative probability.
Contribution
It develops the Riesz-Coxeter product, extending positive definite functions from Abelian to arbitrary Coxeter groups, and characterizes radial functions on specific groups.
Findings
Defined the Riesz-Coxeter product for Coxeter groups.
Characterized radial functions on dihedral and permutation groups.
Applied the theory to harmonic analysis and noncommutative probability.
Abstract
A new class of positive definite functions related to colour-length function on arbitrary Coxeter group is introduced. Extensions of positive definite functions, called the Riesz-Coxeter product, from the Riesz product on the Rademacher (Abelian Coxeter) group to arbitrary Coxeter group is obtained. Applications to harmonic analysis, operator spaces and noncommutative probability is presented. Characterization of radial and colour-radial functions on dihedral groups and infinite permutation group are shown.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Positive definite functions on Coxeter groups
with applications to operator spaces and noncommutative probability
Marek Bożejko
M. Bożejko — Polska Akademia Nauk, ul. Kopernika 18, 50-001 Wrocław
,
Światosław R. Gal
Ś. R. Gal — Uniwersytet Wrocławski, pl. Grunwaldzki 2/4, 48-300 Wrocław
and
Wojciech Młotkowski
W. Młotkowski — Uniwersytet Wrocławski, pl. Grunwaldzki 2/4, 48-300 Wrocław
Abstract.
A new class of positive definite functions related to colour-length function on arbitrary Coxeter group is introduced. Extensions of positive definite functions, called the Riesz-Coxeter product, from the Riesz product on the Rademacher (Abelian Coxeter) group to arbitrary Coxeter group is obtained. Applications to harmonic analysis, operator spaces and noncommutative probability is presented. Characterization of radial and colour-radial functions on dihedral groups and infinite permutation group are shown.
Key words and phrases:
Coxeter group, positive definite functions, operator spaces, Sidon sets, Khinchine inequality, length function, de Finetti theorem
2010 Mathematics Subject Classification:
Primary 20f55, 43a35, 46l07, Secondary 05a15, 43a46
Introduction
In 1979 Uffe Haagerup in his seminal paper [haa79], essentially proved the positive definitness, for , of the function , where is the word lenght on a free Coxeter group . From this he deduced also Khinchine type inequalities. He has shown that the regular -algebra of has bounded approximation property and later [dch85] the completely bounded approximation property (cbap). These results of Uffe Haagerup have had significant impact on harmonic analysis on free groups and, more generally, on Coxeter groups; they also influenced free probability theory and other noncommutative probability theories.
In the paper [bjs88] it was shown that the function is positive definite for and all Coxeter groups, where the length is the natural word length function on a Coxeter group with repect to the set of its Coxeter generators. This fact implies that infinite Coxeter groups have the Haagerup property and do not have Kazhdan’s propery (T).
Later, Januszkiewicz [jan02] and Fendler [fen02b] showed, in the spirit of Haagerup proof, that is a coefficient of a uniformely bounded Hilbert representation of for all such that . As shown in a very short paper of Valette [val93], this implies cbap. See the book [bo08] for futher extension of Uffe Haagerup results for a big class of groups.
In the paper [bs96] Bożejko and Speicher considered the free product (convolution) of classic normal distribution and the new length function on the permutation group (i.e. the Coxeter group of type a) was introduced, which we shall call the colour-length function . It is defined as follows: for in the minimal (reduced) representations , where each belong to the set of transposions of the form , we put .
For our study one of the most important results of this paper is that the function called Riesz-Coxeter product defined on all Coxeter groups as
[TABLE]
is positive definite for .
This implies, in particular, that in an arbitrary Coxeter group the set of its Coxeter generators is a weak Sidon set and also it is completely bounded -set, see Theorems 8.1 and 8.2. Equivalently, the span of the linear operators in the noncommutative -space is completely boundedly isomorphic to row and column operator Hilbert space (see Theorem 8.2).
Another interesting connection between the two length functions and appeared in [bs96] in the formula for the moments of free additive convolution power of the Bernoulli law (cf. Corollary 6 in cited paper):
[TABLE]
for . (See also Section 9 of the present paper.)
Also, in [bbls11] the colour-length function on the permutation group was studied. Some of its extensions to pairpartitions appeared in the presentation of the proof that classical normal law is free infinitely divisible under free additive convolution .
Since we have recent extensions of the free probability (which is related to type a Coxeter groups) to the free probability of type b Coxeter groups (see [beh15]), it seems to be interesting to determine the role of the colour-length functions for the Coxeter groups of type b and d.
The plan of the paper is as follows.
In Section 1 we recall definitions of Coxeter groups and of the length and the colour-length functions.
In Section 2 we recall the definition of positive definite funcios and discuss various classes of those, namely radial, colour-radial, and colour-dependant.
In Section 3 we discuss Abelian Coxeter groups.
In Section 4 we show the following formula characterizing the radial normalised positive definite functions on these Coxeter groups which contain the infinite Rademacher group as a parabolic subgroup (these include the infinite permutation group ): every radial positive definite function is of the form
[TABLE]
for a probability measure .
That characterisation is a variation on the classical de Finetti theorem. A noncommutative version was shown by Köstler ans Speicher [ks09] (see also [leh04]).
We also show in Theorem 4.3, that the function is positive definite for all if and only if .
In Section 5 we give a short proof of the equivalence of the two known results concerning positive definite functions on finite Coxeter groups.
In Section 6 we present the main properties of the colour-dependent positive definite functions on Coxeter groups, in particular we show in Proposition 4.4. that on and some other Coxeter groups, the function is positive definite if and only if .
The Section 7 gives characterization of all colour-length functions on finite and infinite dihedral groups , for .
In Section 8 we prove that the set of Coxeter generators is a weak Sidon set in arbitrary Coxeter groups with constant 2 and that it is also a completely bounded set with contants as , for .
In Section 9 we prove for arbitrary finitely generated Coxeter group an identity involving both lengths and (see Proposition 9.1). We apply it to give a proof of Corollary 7 from [bs96], (see Equation (9.1)) where the proof, involving probabilistic considerations, was not presented in [bs96].
1. Coxeter groups
In this part we recall the basic facts regarding Coxeter groups and introduce notation which will be used throughout the rest of the paper. For more details we refer to [bou68, hum90].
A group is called a Coxeter group if it admits the following presentation:
[TABLE]
where is a set and is a function such that for all and if and only if . The pair is called a Coxeter system. In particular, every generator has order two and every element can be represented as
[TABLE]
for some . If the sequence is chosen in such a way that is minimal then we write and call it the length of . In such a case the right hand side of (1.1) is called a reduced representation or reduced word of . This is not unique in general, but the set of involved generators is unique [bou68, Ch. iv, §1, Prop. 7], i.e. if are two reduced representations of then . This set will be denoted and called the colour of .
Given a subset by we denote the subgroup generated by and call it the parabolic subgroup associated with . To see that is independent of the reduced representation of notice that
[TABLE]
We define the colour-length of putting (the cardinality of ). Both lengths satisfy the triangle inequality and we have .
In the case of the permutation group the colour-length has the following pictorial interpretation. If is a permutation in then equals minus the number of connected components of the diagram representing . Notice, that equals to the number of crossings in the diagram (the number of pairs of chords that cross).
\sigma$$e$$(12)$$(12)(23)$$(12)(23)(12)$$|\sigma|01230122
It would be convenient to define
[TABLE]
then, clearly, .
2. Positive defined functions
A complex function on a group is called positive definite if we have
[TABLE]
for every finitely supported function .
A positive definite function is Hermitian and satisfies for all . Usually it is assumed, that is normalised, i.e. that .
In this and the following sections we discuss the radial functions on Coxeter groups. These are functions which depend on rather then on .
We call a function on colour-dependent if depends only on . We call it colour-radial if it depends only on .
An Abelian Coxeter group generated by is isomorphic to the direct product . On these groups the lengths and coincide and all functions are colour dependent.
The main example of a positive definite function will be the Riesz–Coxeter function. Given a sequence we define . We will abuse notation and denote by also the associated operator . That is
[TABLE]
In the case all we get .
This generalises the classical case of Rademacher–Walsh functions in the Rademacher group . If we denote the generator of the -th factor of the latter by the symbol then, by definition, and and
[TABLE]
3. Rademacher groups
In this section we are going to study positive definite radial functions on the Abelian Coxeter groups, . Since positive definiteness is tested on functions with finite support, we can assume that is countable. If we will write instead of . Given , we denote by the class of all functions for finite and if such that is a normalised positive definite on .
The following observation is straightforward.
Proposition 3.1**.**
Assume that and . Then the restriction of to belongs to . A fuction belogs to if and only if all its restrictions to for any belong to .
Theorem 3.2**.**
Assume is finite. The set form a simplex whose vertices (extreme points) are , where . Equivalently, every normalised radial positive definite function on the group is of the form
[TABLE]
where the sequence of nonnegative numbers is unique and satisfies .
Proof.
We can indentify the dual group of with via the paring . By Bochner’s theorem every normalised positive definite function on is of the form
[TABLE]
for some probability measure . Clearly, such a function is radial if and only if is invariant under the action of .
Among such measures extreme ones are measures for , where is equally distributed among elements of length . Moreover,
[TABLE]
as claimed. ∎
The following theorem is a version of the classical de Finetti Theorem (see [fel71, p. 223]) for the infinite Rademacher group.
Theorem 3.3**.**
Assume that is a radial function on the Rademacher group . Then is a normalised positive definite if and only if there exists a probability measure on such that
[TABLE]
This measure is unique.
Proof.
Since the function is normalised positive definite for , the “if” implication is obvious.
Assume that is normlised positive definite. The group is discrete and Abelian and its dual is the compact group . By Bochner’s theorem, there exists a probability measure on \widehat{\mathop{\rm Rad}}\nolimits_{\infty} such that
[TABLE]
where for , y=(y_{1},y_{2},\ldots)\in\widehat{\mathop{\rm Rad}}\nolimits_{\infty} we put . The radiality of is equivalent to the fact that for every permutation we have , where . This, in turn, implies that is -invariant for every , i.e. we have for every Borel subset A\subset\widehat{\mathop{\rm Rad}}\nolimits_{\infty}.
For a sequence we define C_{n}(\mathbf{\epsilon})\subseteq\widehat{\mathop{\rm Rad}}\nolimits_{\infty} by
[TABLE]
in particular C_{0}(\varnothing)=\widehat{\mathop{\rm Rad}}\nolimits_{\infty}. Then we have if for some and every . For we put
[TABLE]
and . Moreover, for we define the difference operators by induction: and . We claim that
[TABLE]
Denoting the right hand side of (3.1) by we note that and
[TABLE]
is a disjoint union. This implies
[TABLE]
This formula, by induction on , leads to (3.1).
From (3.1) we see that the sequence is completely monotone, i.e. that for all . By the celebrated theorem of Hausdorff (see [hau21, Sätze ii und iii]), there exists a unique probability measure on such that
[TABLE]
(Note that Equation (3.2) for arbitrary follows from the case .)
For so that , we have
[TABLE]
where is defined by for a Borel set . ∎
4. Remarks on radial positive definite functions on some infinitely generated Coxeter groups
In this Section we extend the last theorem of the previous section to a certain class of Coxeter groups.
Theorem 4.1**.**
Assume that is a Coxeter system and that there is an infinite subset such that for . Assume that is a radial function on with . Then is positive definite if and only if there exists a probability measure on such that
[TABLE]
This measure is unique.
Proof.
It is sufficient to note that the group generated by is a parabolic subgroup isomorphic with . ∎
Example. For we have . Then we can take . Similar can be found in infinitely generated groups of type b and d.
Problem 4.2**.**
When , is the positive definite function on an extreme point in the set of normalised positive definite functions?
Theorem 4.3**.**
The function is positive definite on if and only if .
Proof.
A contrario. Assume that for some and the function is positive definite on .
For , choosing such that we have for some probability measure on . Since tends to while , we conclude that is the Dirac measure at [math], which is a contradiction.
The “if” part is standard. We need to show that is the Laplace transform of some probability measure supported on , so is a convex combination of functions of the form .
By characterisation of Laplace transforms (see [hau21, Satz iii]) this is equivalent to complete monotonicity, that is for all . And indeed, by induction, is a positive linear combination of positive functions of the form for . ∎
The measures with Laplace transforms for and are studied in detail in [yos80, Ch. ix.11] (see Propositions 1 and 2 there).
Let us note that for such groups like or with the Euclidean distance the functions are positive definite for all and (the case corresponds to the Gaußian Law).
5. The longest element
If a Coxeter group is finite, then it contains the unique element which has the maximal length with respect to .
From the definition it is clear, that a function on a group with values in the field of complex numbers is positive definite if and only is a nonnegative (bounded if the group is finite) operator on . (We will identify with , where is the left regular representation, for short.)
Let be a finite Coxeter group. The following two statements are well known.
- (a)
The function is positive definite for any . 2. (b)
The function is positive definite.
The first one was proven in [bjs88] (even for infinite Coxeter groups and also for ) while the second — in [bs03, Proposition 6]. Here we give a short direct prove of the following.
Proposition 5.1**.**
The above statements (a) and (b) are equivalent.
Proof.
Let (with , as we assume ). The case (a) is equivalent to being nonnegative.
Assume (a). Recall first, that . Therefore , ie. and similarly, .
The equality implies that (and thus ) commutes with (and thus ). Since is nonnegative we conclude that
[TABLE]
is nonnegative. Therefore, taking the limit as , we obtain that is nonnegative. Thus (b).
Assuming (b) and using the Schur lemma, which says that the (pointwise) product of positive definite functions is positive definite, we get that
[TABLE]
is nonnegative. Thus (a). ∎
6. Colour-dependent positive definite functions on Coxeter groups
The question which colour-dependant or colour-radial functions are positive functions on Coxeter groups is wide open. In this section we provide some sufficient conditions. In the next section we will examine the dihedral groups in full details.
Lemma 6.1**.**
Let be a subgroup of a group of index . Then the function defined by if and otherwise is positive definite on if and only if , with natural convention that if then .
Note, that if then .
Proof.
First assume that is finite and let us enumerate the left cosets:
[TABLE]
Note, that for we have if and only if . Therefore, for and for a finitely supported complex function on we have
[TABLE]
which proves that is positive definite. For the function is positive definite as a convex combination of and the constant function .
On the other hand, if we choose for each and define as the characteristic function of the set then
[TABLE]
which proves that is a necessary condition for positive definiteness of .
If then and the function is positive definite as the characteristic function of the subgroup . For “only if” part we chose an arbitrarily long sequence of elements from different left cosets and use (6.1) with instead of . ∎
Theorem 6.2**.**
Assume that for every we are given a number ,
[TABLE]
where denotes the index if the parabolic subgroup generated by in : . Then the Riesz–Coxeter is positive definite on .
Proof.
From Lemma 6.1 the function is positive definite for and . Since the pointwise product of positive definite functions is positive definite, the statement holds. ∎
Example. Take , the permutation group on the set . It is generated by the transpositions . For the parabolic subgroup generated by is isomorphic with , so its index is .
It would be interesting to determine for which the function is positive definite. By Proposition 6.2 this holds for , where is the maximal index of the parabolic subgroups of the form . We note a necessary condition.
Proposition 6.3**.**
Assume that we have distinct generators such that (i.e. ) for . If the function is positive definite on , then .
If there is an element for which there are infinitely many such that then is positive definite on if and only if .
Proof.
Consider elements . Note, that for we have . If is positive definite on then we have
[TABLE]
which implies . ∎
Corollary 6.4**.**
The function on is positive definite if and only if .
Problem 6.5**.**
Thus, it is valid to ask the following. Is it true that every normalised positive definite colour-lenght-radial function is of the form for some probability measure on ?
7. Dihedral groups
In this part we are going to examine the class of colour-dependent positive definite functions on the case the simplest nontrivial Coxeter groups. Assume that (i.e. the group of symmetries of a regular -gon), and define a colour-dependent function on :
[TABLE]
If then is colour radial. We are going to determine for which parameters the function is positive definite on . It is easy to observe necessary conditions: . Moreover, since is a cyclic subgroup of order , Lemma 6.1, implies a necessary condition: .
Finite dihedral groups
Assume that is a finite dihedral group, , so that . We will use the following version of Bochner’s theorem: A function on a compact group is positive definite if and only if its Fourier transform:
[TABLE]
is a positive operator for every , where denotes the dual object of , i.e. the family of all equivalency classes of unitary irreducible representations of , see [sim96]. Then we have
[TABLE]
Therefore, for every irreducible representation of we are going to find
[TABLE]
We will identify with and with . If is odd then possesses two characters: such that for every and such that . If is even then we have two additional characters and such that and . It is easy to check that
[TABLE]
[TABLE]
which gives
[TABLE]
and, for even,
[TABLE]
[TABLE]
which implies
[TABLE]
We have also the family of two dimensional representations :
[TABLE]
where . Then for the function given by (7.1) we have
[TABLE]
This matrix is positive definite if and only if and
[TABLE]
Therefore we have
Proposition 7.1**.**
The function given by (7.1) is positive definite on if and only if
[TABLE]
(plus
[TABLE]
whenever is even) and
[TABLE]
for .
Let us confine ourselves to colour-radial functions.
Corollary 7.2**.**
Assuming that , the function defined by (7.1) is positive definite on if and only if
[TABLE]
i.e. if and only if the point belongs to the triangle whose vertices are
[TABLE]
Proof.
For the conditions from Proposition 7.1 reduce to
[TABLE]
It is sufficient to note that implies for . ∎
Example. For we have the positive definiteness of is equivalent to
[TABLE]
which means that the set of all possible forms a tetrahedron with vertices , , , . For the condition reduces to .
In the case of Proposition 7.1 leads to the following conditions:
[TABLE]
[TABLE]
which can be expressed as
[TABLE]
The infinite dihedral group
Here we are going to study .
Proposition 7.3**.**
The function given by (7.1) is positive definite on if and only if and , i.e.
[TABLE]
Proof.
First we note that the set of satisfying (7.2) constitutes a pyramid which is the convex hull of the points , and (apex). For these particular parameters it is easy to see that is positive definite: corresponds to the constant function , to the characteristic function of the subgroup , and to the character times the characteristic function of . Similarly for . This, by convexity, proves that (7.2) is a sufficient condition.
On the other hand, we know already that is a necessary condition. Let us fix and define , and
[TABLE]
For we have in cases (namely, if ) in cases (namely if , or vice-versa, ) in cases (namely if , or vice-versa, ) and in all the other cases. Similarly, for we have in cases, in cases, in cases and in cases. If , or vice-versa then . Summing up, we get
[TABLE]
Therefore for every we have a necessary condition
[TABLE]
Letting we get .
Put , . Fix and define
[TABLE]
where, as before, is the character on for which , . Then
[TABLE]
Denote . Then we have , , if is even, if is odd, and for all . If and then , where is the total number of appearing in and . Now it is not difficult to check that
[TABLE]
which implies
[TABLE]
and leads to necessary condition . In a similar manner we get .
Finally, define a function similarly like , but now we use the character :
[TABLE]
Putting we have , if is even and if is odd. Moreover, if , then . Now one can check that
[TABLE]
which yields and completes the proof that the conditions (7.2) are necessary. ∎
8. Weak Sidon sets and operator Khinchin inequality
The aim of this section is to show that the set of Coxeter generators in an arbitrary Coxeter group is a weak Sidon set, ie. an interpolation set for the Fourier–Stieltjes algebra .
Given a group , the Fourier–Stieltjes algebra consists of linear combinations of positive definite functions on , ie. every element of is of the form for some positive definite functions () on . The norm on is defined as
[TABLE]
Theorem 8.1**.**
The set of Coxeter generators in an arbitrary Coxeter group is a weak Sidon set, ie. for every bounded function there exists positive definite functions , such that for any . One can take for a suitable choice of . Moreover
[TABLE]
Proof.
Put . Set
[TABLE]
Then as claimed. The rest of the statement hold as the Riesz-Coxeter function at the identity element equals to one. ∎
Given a matrix and the Schatten -class norm is defined as , where .
Let denote the left regular representation of a group . Given a finite sum we define noncommutative -norm
[TABLE]
where is the von Neumann trace and is a completion of with respect to the above norm.
We recall, that a scalar-valued map on a group is called a completely bounded Fourier multiplier on if the associated operator
[TABLE]
extends to a completely bounded operator on .
We let to be an algebra of completely bounded Fourier multipliers equipped with the norm
[TABLE]
Following Pisier [pis03], for , where , we define
[TABLE]
For a set we define the completely bounded constant as infimum of such that
[TABLE]
for all matrices and .
Theorem 8.2**.**
If , then for all and any Coxeter system we have
[TABLE]
Proof.
It was shown by Harcharras [lp86, Prop. 1.8] that if finite if and only if is an interpolation set for , i.e. every bounded function on can be extended to a multiplier, and
[TABLE]
where is the generating set in the Rademacher group and is the interpolation constant.
As shown by Buchholz [buc05, Thm. 5] for , and te standart generating set in , for some absolute . This was extended by Pisier [pis03, Thm. 9.8.2] for any , i.e
[TABLE]
for an absolute constant .
We have shown in Theorem 8.1 that in an arbitrary Coxeter group its Coxeter generating set is a weak Sidon set, i.e. it is interpolation set for the Fourier–Stieltjes algebra . Since for , is a subalgebra of and
[TABLE]
we see that . Thus . This finishes the proof of the right inequality.
The left inequality holds for any group and any (see [lp86]). ∎
Remark 8.3**.**
Fendler [fen02a] has shown that if for all , , we have , then
[TABLE]
See also [boż75] and [buc99] for related results in the case of free Coxeter groups. Also Haagerup and Pisier have shown that , where [hp93]. See the paper of Haagerup [haa81] where the best constant was calculated for the set of Coxeter generators of the Rademacher group in case when are scalars.
9. Chromatic length function for Coxeter groups and pairpartitions
Let . Let denote the set of subsets of . By a partition of we mean such that and if then or . We say, that partition is a coarsening of a partition if for any there exists such that .
A partition is called crossing if there exist and with ; otherwise it is called noncrossing. For any partition there exists th the smallest noncrossing coarsening of (ie. if is a noncrosing coarsening of then it is a coarsening of ). We define . The notion for the map was introduced in [by06].
We say that is a pairpartition if every member of has cardinality two. The set of pairpartitions of is denoted by . Given we write to denote the number of ordered quadruples such that both and belong to . Note, that precisely when is noncrossing. The set of noncrossing pairpartitions is denoted .
Given a noncrossing pairpartition we call an inner block if there exists with . The number of inner blocks of we denote as .
In [bs96, Cor. 7] Bożejko and Speicher observed the following identity.
[TABLE]
Let . It is elementary to derive
[TABLE]
where denote the -th Catalan number and is the classical hypergeometric funcion. If we write , then the triangle appears in [slo01] as “sequence” a062991). Since we are not going to use this formula, we leave it as an exercise to the reader. For the expansion of and the Delanoy triangle appearing there the reader may consult [bw01, Prop 6.1].
In what follows, we prove a result about an arbitrary finitely generated Coxeter group, which for permutation groups implies the above one. Given a permutation , we construct a pairpartition . Note, that is equal to the length of with respect to the Coxeter generators , …, of . Therefore, denoting by the Coxeter length of an element of some Coxeter group will not lead into any confusion.
It is also clear that, with respect to the identification of permutations with a subset of pairpartitions, the two definitions of agree (see Equations (1.3) and (1.2)).
By we denote a growth series of a finitely generated Coxeter group (length function). That is, a power series . (Note, that the coefficient at equals to . This explains why here and in the rest of this section we consider only finitely generated Coxeter groups. We will not repeat this assumption for short.) Moreover, for we write .
Let us define a multivariable formal power series (chromatic length function. For any define
[TABLE]
In particular , where .
Proposition 9.1**.**
The polynomial (or formal power series, if is infinite) satisfies
[TABLE]
Proof.
Let denote the set of all elements of not contained in any proper parabolic subgroup of , ie. . Then, by inclusion-exclusion principle, . Therefore,
[TABLE]
∎
Corollary 9.2**.**
If is a finite Coxeter group then
[TABLE]
Proof.
Choose and put . Clearly, therefore . Since is a finite group, is a polynomial. Thus if is nonempty (and ). ∎
In order to prove Equation (9.1) we define the Wick map (related to the normal order in quantum field theory). Given a pairpartition we define by repetitive resolving crossings. That is, we replace repetitively every crossing pair and with by and . In order to see that the result is independent of the order of resolution we describe in an equivalent way.
Let be the smallest noncrossing coarsening of . For each block of define and . Order in increasing way and in decreasing way. Then all pairs will be parts of .
Equation (9.1) will follow from a more refined statement.
Proposition 9.3**.**
For every
[TABLE]
Proof.
Let us first consider the case of . Clearly, . And Equation (9.3) is equivalent to Equation (9.2) (as all are set to ) for .
In a general case observe, that is a coarsening of . Yet, not every coarsening may appear. The obvious condition is that for each block of the pair belong to . For the purpose of this proof we will call such a coarsening admissible. Its clear, that abmissible coarsenings are in one to one correspondence with subsets of containing all outer (not inner) parts of of the form .
Let us refine Equation (9.3) further. For every and any admissible coarsening of we have
[TABLE]
Equation (9.3) follows from (9.4) by multiplying by and summing over all admissible coarsenings of .
Equation (9.4) is again equivalent to to Equation (9.2) (for all apermutation groups and all set to ) as both sides factor as a product over blocks of . ∎
Question 9.4**.**
We have proven Equation 9.1 with the help of an embedding (or several such embeddings, one for each outer block of ). Corollary 9.2 holds for any Coxeter group. Is there a corresponding formula concerning some generalization of pairpartitions?
In the proof of Proposition 9.1 we have not assumed that was finite. Let us finish this section with a discussion of infinite Coxeter groups. Recall, that does not lie in the radius of convergence on if is not finite. Nevertheless, represents a rational function as follows from the following result.
Proposition 9.5**.**
([ste68],[ser71, Prop. 26]) Let be an an infinite Coxeter system. Then
[TABLE]
Where denote the family of subsets , such that the group generated by is finite. In particular, is a series of a rational function (i.e. a quotient of polynomials).
One may ask a question what is the class of (infinite) Coxeter groups such that for any nonempty subset of generators. A naïve argument that
[TABLE]
shows, that the question if is equivalent to whether can have a pole at . On the other hand note, that if is of type ã, ie. is given by a presentation then, by Equation (9.5), and .
More generally, it is known ([bou68]) that in each coset of there exists the unique shortest element. Let denote the set of those shortest representatives. Moreover if with and then . Therefore In particular, represents a rational function, and it is legitimate to ask about the value of .
In the case of finite Coxeter group , Eng [eng01] observed that
[TABLE]
where is the longest element in . (Eng’s proof was case-by-case. Later, a general classification-free proof of Eng’s theorem was given in [rsw04]).
Subsequently, Reiner [rei02] has shown that if is crystallographic (ie. the Weyl group in a compact Lie group ), then both sides of the above equality compute the signature of the corresponding flag variety , where is a parabolic subgroup associated to .
What is the meaning of or for infinite ?
We do not know if it possible for to be negative. If one takes . Then, by Equation (9.5), and .
Acknowledgemens
Marek Bożejko was supported by ncn maestro grant dec-2011/02/a/st1/00119. Marek Bożejko and Wojciech Młotkowski were supported by ncn grant 2016/21/b/st1/00628.
The authors would like to thank Ryszard Szwarc and Janusz Wysoczański for many discussions and help with the preparation of this paper.
The first author would like to thank professor F. Götze for his kind invitation to sfb701 and his hospitality in Bielefeld in 2016.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[bbls 11] Serban T. Belinschi, Marek Bożejko, Franz Lehner, and Roland Speicher . The normal distribution is \boxplus \boxplus \boxplus -infinitely divisible. Adv. Math. , 226(4):3677–3698, 2011.
- 2[beh 15] Marek Bożejko, Wiktor Ejsmont, and Takahiro Hasebe . Fock space associated to Coxeter groups of type B. J. Funct. Anal. , 269(6):1769–1795, 2015.
- 3[bjs 88] M. Bożejko, T. Januszkiewicz, and R. J. Spatzier . Infinite Coxeter groups do not have Kazhdan’s property. J. Operator Theory , 19(1):63–67, 1988.
- 4[bo 08] Nathanial P. Brown and Narutaka Ozawa . C ∗ superscript 𝐶 C^{*} -algebras and finite-dimensional approximations , volume 88 of Graduate Studies in Mathematics . American Mathematical Society, Providence, RI, 2008.
- 5[bou 68] N. Bourbaki . Éléments de mathématique. Fasc. XXXIV. Groupes et algèbres de Lie. Chapitre IV: Groupes de Coxeter et systèmes de Tits. Chapitre V: Groupes engendrés par des réflexions. Chapitre VI: systèmes de racines . Actualités Scientifiques et Industrielles, No. 1337. Hermann, Paris, 1968.
- 6[boż75] Marek Bożejko . On Λ ( p ) Λ 𝑝 \Lambda(p) sets with minimal constant in discrete noncommutative groups. Proc. Amer. Math. Soc. , 51:407–412, 1975.
- 7[bs 96] Marek Bożejko and Roland Speicher . Interpolations between bosonic and fermionic relations given by generalized Brownian motions. Math. Z. , 222(1):135–159, 1996.
- 8[bs 03] Marek Bożejko and Ryszard Szwarc . Algebraic length and Poincaré series on reflection groups with applications to representations theory. In Asymptotic combinatorics with applications to mathematical physics (St. Petersburg, 2001) , volume 1815 of Lecture Notes in Math. , pages 201–221. Springer, Berlin, 2003.
