text:
# Contents

## 1 Multiparametric quon algebras, Fock-like representations and determinants

### 1.1 $`q_{ij}`$-canonical commutation relations

Let $`𝐪=\{q_{ij}:i,jI,\overline{q}_{ij}=q_{ji}\}`$ be a hermitian family of complex numbers (parameters), where I is a finite (or infinite) set of indices.

By a multiparametric quon algebra $`𝒜=𝒜^{(𝐪)}`$ we shall mean an associative (complex) algebra generated by $`\{a_i,a_i^{},iI\}`$ subject to the following $`q_{ij}`$\- canonical commutation relations

$$a_ia_j^{}=q_{ij}a_j^{}a_i+\delta _{ij},\text{ for all }i,jI$$
(1)
Shortly, we shall give an explicit Fock-like representation of the algebra $`𝒜^{(𝐪)}`$ on the free associative algebra $`𝐟`$ (the algebra of noncommuting polynomials in the indeterminates $`\theta _i,iI`$) with $`a_i`$ acting as a generalized $`q_{ij}`$-deformed partial derivative $`{}_{i}{}^{}={}_{i}{}^{𝐪}`$ w.r.t. the variable $`\theta _i`$ (the i-th annihilation operator), and $`a_i^{}`$ as multiplication by $`\theta _i`$ (the i-th creation operator). Moreover $`a_i^{}`$ will be adjoint to $`a_i`$ w.r.t. a certain sesquilinear form $`(,)_𝐪`$ on $`𝐟`$ which will be better described via a certain canonical $`𝐪`$-deformed bialgebra structure on $`𝐟`$, generalizing the one used by Lusztig in his excellent treatment of quantum groups \[Lus\]. Then by explicit computation (which extends Zagier’s method) of the determinant of $`(,)_𝐪`$ we show that $`(,)_𝐪`$ is positive definite provided the following condition on the parameters $`q_{ij}`$ holds true :

$$|q_{ij}|<1,\text{ for all }i,jI$$
(2)
The condition (2) ensures that all the many-particle states $`a_{i_1}^{}\mathrm{}a_{i_r}^{}|0>=\theta _{i_1}\mathrm{}\theta _{i_r}`$$`i_jI,r0`$, are linearly independent, so we obtain a Hilbert space realization of the $`q_{ij}`$-canonical commutation relations (1).

We first need some notations:

$`\{0,1,2,\mathrm{}\}=`$ the set of nonnegative integers

the weight monoid i.e. the set of all finite formal linear combinations $`\nu =_{iI}\nu _ii`$, $`\nu _i𝐍,iI`$ with componentwise addition $`\nu +\nu ^{^{}}=_{iI}(\nu _i+\nu _i^{^{}})i`$

$`_{iI}\nu _i𝐍`$ for $`\nu =_{iI}\nu _ii𝐍[I]`$

Sometimes it is customary to view the elements $`\nu =\nu _ii`$ of $`𝐍[I]`$ as multisets M in which $`i`$ appears $`\nu _i`$ times (in case $`\nu _i1`$ we have sets contained in $`I`$) and then $`+`$ corresponds to the union of multisets and $`|\nu |`$ is just the cardinality of M.

$`(𝐍[I],+)\times (𝐍[I],+)(𝐂,)`$, the bilinear form on $`(𝐍[I],+)`$ with values in the multiplicative monoid of complex numbers given by $`i,jq_{ij}`$, i.e. for $`\nu =_{iI}\nu _ii`$, $`\nu ^{^{}}=_{jI}\nu _j^{^{}}j`$, $`\beta (\nu ,\nu ^{^{}})=_{ij}q_{ij}^{\nu _i\nu _j^{^{}}}`$.

### 1.2 The algebra $`𝐟`$

We denote by $`𝐟`$ the free associative $`𝐂`$-algebra with generators $`\theta _i(iI)`$. For any weight $`\nu =_{iI}\nu _ii𝐍[I]`$ we denote by $`𝐟_\nu `$ the corresponding weight space, i.e. the subspace of $`𝐟`$ spanned by monomials $`\theta _𝐢=\theta _{i_1}\mathrm{}\theta _{i_n}`$ indexed by sequences $`𝐢=i_1\mathrm{}i_n`$ of weight $`\nu `$,$`|𝐢|=\nu `$ (this means that the number of occurrences of $`i`$ in $`𝐢`$ is equal to $`\nu _i,\text{ for all }iI`$). Then each $`𝐟_\nu `$ is a finite dimensional complex vector space and we have a direct sum decomposition $`𝐟=_\nu 𝐟_\nu `$, where $`\nu `$ runs over $`𝐍[I]`$. We have $`𝐟_\nu 𝐟_\nu ^{^{}}𝐟_{\nu +\nu ^{^{}}}`$, $`1𝐟_0`$ and $`\theta _i𝐟_{(i)}`$. An element $`x`$ of $`𝐟`$ is said to be homogeneous if it belongs to $`𝐟_\nu `$ for some $`\nu `$. We than say that $`x`$ has weight $`\nu `$ and write $`|x|=\nu `$.
We shall consider the tensor product $`𝐟𝐟`$ with the following $`q_{ij}`$-deformed multiplication

$`(x_1x_2)(x_1^{^{}}x_2^{^{}})`$ $`=`$ $`\beta (|x_2|,|x_1^{^{}}|)x_1x_1^{^{}}x_2x_2^{^{}}`$
$`=`$ $`({\displaystyle \underset{i,j}{}}q_{ij}^{\nu _i\nu _j^{^{}}})x_1x_1^{^{}}x_2x_2^{^{}},\text{ if }x_2𝐟_\nu ,x_1^{^{}}𝐟_\nu ^{^{}}`$
where $`x_1,x_1^{^{}},x_2,x_2^{^{}}𝐟`$ are homogeneous; this algebra is associative since $`\beta (\nu ,\nu ^{^{}})`$ is bilinear.

The following statement is easily verified: if $`r=r_𝐪:𝐟𝐟𝐟`$ is the unique algebra homomorphism such that $`r(\theta _i)=\theta _i1+1\theta _i,\text{ for all }i`$, then $`(r1)r=(1r)r`$ takes the same value on any algebra generator $`\theta _i`$, namely $`\theta _i11+1\theta _i1+11\theta _i`$ yielding the coassociativity property. Thus the algebra $`𝐟`$ with the comultiplication $`r`$ is an example of a $`q_{ij}`$-deformed bialgebra.

Note that

$`r(\theta _i\theta _j)`$ $`=`$ $`r(\theta _i)r(\theta _j)=(\theta _i1+1\theta _i)(\theta _j1+1\theta _j)`$
$`=`$ $`\theta _i\theta _j1+q_{ij}\theta _j\theta _i+\theta _i\theta _j+1\theta _i\theta _j`$
More generally we have the following explicit formula for the value of $`r`$ on a monomial $`\theta _𝐢=\theta _{i_1}\theta _{i_2}\mathrm{}\theta _{i_n}`$:

$$r(\theta _𝐢)=\underset{k+l=n,g=(k,l)shuffle}{}q_{𝐢,g}\theta _{i_{g(1)}}\mathrm{}\theta _{i_{g(k)}}\theta _{i_{g(k+1)}}\mathrm{}\theta _{i_{g(k+l)}}$$

where a $`(k,l)shuffle`$ is a permutation $`gS_{k+l}`$ such that $`g(1)<g(2)<\mathrm{}<g(k)`$ and $`g(k+1)<g(k+2)<\mathrm{}<g(k+l)`$ and where for $`gS_n`$ we denote by $`q_{𝐢,g}`$the quantity

$$q_{𝐢,g}:=\underset{a<b,g(a)>g(b)}{}q_{i_ai_b}$$

### 1.3 The sesquilinear form $`(,)_𝐪`$ on $`𝐟`$

Note that $`r`$ maps $`𝐟_\nu `$ into $`_{(\nu ^{^{}}+\nu ^{^{\prime \prime }}=\nu )}𝐟_\nu ^{^{}}𝐟_{\nu ^{^{\prime \prime }}}`$. Then the linear maps $`𝐟_{\nu ^{^{}}+\nu ^{^{\prime \prime }}}𝐟_\nu ^{^{}}𝐟_{\nu ^{^{\prime \prime }}}`$ defined by $`r`$ give, by passage to dual spaces, linear maps $`𝐟_\nu ^{^{}}^{}𝐟_{\nu ^{^{\prime \prime }}}^{}𝐟_{\nu ^{^{}}+\nu ^{^{\prime \prime }}}^{}`$. These define the structure of an associative algebra with 1 on $`_\nu 𝐟_\nu ^{}`$. For any $`iI`$, let $`\theta _i^{}𝐟_i^{}`$ be the linear form given by $`\theta _i^{}(\theta _j)=\delta _{ij}`$. Let $`\mathrm{\Phi }:𝐟_\nu 𝐟_\nu ^{}`$ be the unique conjugate-linear algebra homomorphism preserving 1, such that $`\mathrm{\Phi }(\theta _i)=\theta _i^{},\text{ for all }i`$. For $`x,y𝐟`$, we set

$$(x,y)_𝐪=\mathrm{\Phi }(y)(x)$$

Then $`(,)=(,)_𝐪`$ is a unique sesquilinear form on $`𝐟`$ such that

a) $`(\theta _i,\theta _j)=\delta _{ij},\text{ for all }i,jI`$

b) $`(x,y^{^{}}y^{^{\prime \prime }})=(r(x),y^{^{}}y^{^{\prime \prime }}),\text{ for all }x,y^{^{}},y^{^{\prime \prime }}𝐟`$

c) $`(xx^{^{}},y^{^{\prime \prime }})=(xx^{^{}},r(y^{^{\prime \prime }})),\text{ for all }x,x^{^{}},y^{^{\prime \prime }}𝐟`$

(The sesquilinear form $`(𝐟𝐟)\times (𝐟𝐟)𝐂`$ given by $`x_1x_2,x_1^{^{}}x_2^{^{}}(x_1,x_1^{^{}})(x_2,x_2^{^{}})`$ is denoted again by $`(,)`$). Clearly,

d) $`(x,y)=0`$ if $`x`$ and $`y`$ are homogeneous with $`|x||y|`$. In particular, the subspaces $`𝐟_\nu ,𝐟_\nu ^{^{}}`$ are orthogonal w.r.t. $`(,)`$ for $`\nu \nu ^{^{}}`$.

e) Let $`\rho :𝐟𝐟`$ be the antiautomorphism of algebras with 1 which takes $`\theta _i`$ to $`\theta _i`$ (thus $`\rho (\theta _{i_1}\mathrm{}\theta _{i_n})=\theta _{i_n}\mathrm{}\theta _{i_1}`$). Then $`(\rho (x),\rho (x^{^{}}))=(x,x^{^{}}),\text{ for all }x,x^{^{}}𝐟`$.

### 1.4 The $`q_{ij}`$-deformed partial derivative maps $`{}_{i}{}^{𝐪}`$ and $`{}_{}{}^{𝐪}_{i}^{}`$

Let $`iI`$. Clearly there exists a unique $`𝐂`$-linear map $`{}_{i}{}^{}={}_{i}{}^{𝐪}:𝐟𝐟`$ such that $`{}_{i}{}^{}(1)=0`$, $`{}_{i}{}^{}(\theta _j)=\delta _{ij}`$, $`\text{ for all }j`$ and obeying the generalized Leibniz rule :

a) $`{}_{i}{}^{}(xy)={}_{i}{}^{}(x)y+\beta (i,|x|)x_i(y)`$ $`={}_{i}{}^{}(x)y+_jq_{ij}^{\nu _j}x_i(y)`$, if $`x𝐟_\nu `$
for all homogeneous $`x`$,$`y`$. If $`x𝐟_\nu `$ we have $`{}_{i}{}^{}(x)𝐟_{\nu i}`$ if $`\nu _i1`$ and $`{}_{i}{}^{}(x)=0`$ if $`\nu _i=0`$; moreover $`r(x)=\theta _i{}_{i}{}^{}(x)`$ $`+`$ terms of other bihomogeneities.

Similary, there is a unique $`𝐂`$-linear map $`_i={}_{}{}^{𝐪}_{i}^{}:𝐟𝐟`$ such that $`_i(1)=0`$$`_i(\theta _j)=\delta _{ij}`$ for all j and $`_i(xy)=\beta (|y|,i)_i(x)y+x_i(y)`$ $`(=(_jq_{ji}^{\nu _j})_i(x)y+x_i(y)`$, if $`y𝐟_\nu `$) for all homogeneous $`x`$,$`y`$. If $`xf_\nu `$ we have $`_i(x)f_{\nu i}`$ if $`\nu _i1`$ and $`_i(x)=0`$ if $`\nu _i=0`$; moreover, $`r(x)=_i(x)\theta _i+`$ terms of other bihomogeneities.

¿From the definition we see that

b) $`(\theta _iy,x)=(y,{}_{i}{}^{}(x)),(y\theta _i,x)=(y,_i(x))`$, for all $`x,y`$
i.e. the operator $`{}_{i}{}^{}`$ (resp. $`_i`$) is the adjoint of left (resp. right) multiplication by $`\theta _i`$.

c) $`\rho _i={}_{i}{}^{}\rho `$ ($`_i=\rho _i\rho ^1`$)
We shall need the following explicit formula for $`{}_{i}{}^{}={}_{i}{}^{𝐪}:𝐟𝐟`$

d) $`{}_{i}{}^{}(\theta _{j_1}\mathrm{}\theta _{j_n})=_{(p:j_p=i)}q_{ij_1}\mathrm{}q_{ij_{p1}}\theta _{j_1}\mathrm{}\widehat{\theta }_{j_p}\mathrm{}\theta _{j_n}`$
where $`\widehat{}`$ denotes omission of the factor $`\theta _{j_p}`$. This formula is obtained by iterating the recursive definition a) for $`{}_{i}{}^{}`$ or by using the general formula for $`r`$ in 1.2. A similar formula holds for $`_i`$.

e) Finally, we note that the form $`(,)=(,)_𝐪`$ will be nondegenerate if either of the following conditions holds: let $`x𝐟_\nu `$, where $`\nu 𝐍[I]`$ is different from 0
$`\alpha `$) If $`{}_{i}{}^{}(x)=0,\text{ for all }i`$, then $`x=0`$
$`\beta `$) If $`_i(x)=0,\text{ for all }i`$, then $`x=0`$.

### 1.5 Fock-like representations of the multiparametric quon algebra $`𝒜^{(𝐪)}`$

Here we give a representation of the multiparametric quon algebra $`𝒜=𝒜^{(𝐪)}`$ (defined in 1.1) on the underlying vector space of the free associative algebra $`𝐟`$. PROPOSITION 1.5.1.  For each $`iI`$ let $`a_i^{}`$ act on $`𝐟`$ as left multiplication by $`\theta _i`$ and let $`a_i`$ act as the linear map $`{}_{i}{}^{}`$ defined in 1.4. Then
a) $`a_i,a_i^{}`$ make $`𝐟`$ into a left $`𝒜`$ \- module
b) $`a_i^{}`$ is adjoint to $`a_i`$ w.r.t. the sesquilinear form $`(,)=(,)_𝐪`$ defined in 1.3.
c) $`a_i:𝐟𝐟`$ is locally nilpotent for every $`iI`$. Proof. a) The identity $`a_ia_j^{}=q_{ij}a_j^{}a_i+\delta _{ij}`$ (as maps $`𝐟𝐟`$) follows from the following computation:
$`{}_{i}{}^{}(\theta _jy)={}_{i}{}^{}(\theta _j)y+\beta (i,|\theta _j|)\theta _j{}_{i}{}^{}(y)`$
$`=\delta _{ij}y+q_{ij}\theta _j{}_{i}{}^{}(y)`$ (because $`|\theta _j|=j𝐍[I]`$)

For b) see 1.4 b).

c) If $`x𝐟_\nu `$, then $`a_i(x)𝐟_{\nu i}`$ if $`\nu _i1`$ and $`a_i(x)=0`$ if $`\nu _i=0`$. It follows that $`a_i:𝐟𝐟`$ is locally nilpotent. The proposition is proved.
(Observe that the property $`{}_{i}{}^{}(1)=0`$ is just the vacuum condition for $`a_i`$, with $`1𝐟`$ playing the role of the vacuum vector $`|0>`$. )

### 1.6 The matrix $`A(𝐪)`$ of the sesquilinear form $`(,)_𝐪`$ on $`𝐟`$

Here we study the sesquilinear form $`(,)_𝐪`$ on $`𝐟`$, defined in 1.2, via the associated matrix w.r.t. the basis $`B=\{\theta _𝐢=\theta _{i_1}\mathrm{}\theta _{i_n}|i_jI,n0\}`$ of the complex vector space $`𝐟=_\nu 𝐟_\nu `$. Let $`B^{^{}}=\{\theta _𝐢=\theta _{i_1}\mathrm{}\theta _{i_n}|i_1,\mathrm{},i_n`$ all distinct$`\}`$ and $`B^{^{\prime \prime }}=BB^{^{}}=\{\theta _{i_1}\mathrm{}\theta _{i_n}|`$ not all $`i_1,\mathrm{},i_n`$ distinct$`\}`$. Then we have the direct sum decomposition

$$𝐟=𝐟^{^{}}𝐟^{^{\prime \prime }},where𝐟^{^{}}=spanB^{^{}},𝐟^{^{\prime \prime }}=spanB^{^{\prime \prime }}$$
(3)
Note that for any weight $`\nu =\nu _ii𝐍[I]`$ we have $`𝐟_\nu 𝐟^{^{}}`$ (resp.$`𝐟_\nu 𝐟^{^{\prime \prime }}`$) if all $`\nu _i1`$ (resp. some $`\nu _i2`$). Then we call such weight $`\nu `$ generic (resp. degenerate ) and we have further direct sum decompositions

$$𝐟^{^{}}=\underset{\nu generic}{}𝐟_\nu ,𝐟^{^{\prime \prime }}=\underset{\nu degenerate}{}𝐟_\nu $$
(4)
PROPOSITION 1.6.1.  i) Let $`𝐀=𝐀(𝐪):𝐟𝐟`$ be the linear operator, associated to the sesquilinear form $`(,)=(,)_𝐪`$ on $`𝐟`$ defined by

$$𝐀(\theta _𝐣)=\underset{𝐢}{}(\theta _𝐣,\theta _𝐢)_𝐪\theta _𝐢$$

Then the $`𝐟^{^{}},𝐟^{^{\prime \prime }},𝐟_\nu (\nu 𝐍[I])`$ are all invariant subspaces of $`𝐀`$, yielding the following block decompositions for the corresponding matrices

$$A=A^{^{}}A^{^{\prime \prime }},A^{^{}}=\underset{\nu \mathrm{generic}}{}A^{(\nu )},A^{^{\prime \prime }}=\underset{\nu \mathrm{degenerate}}{}A^{(\nu )}$$

Moreover, for the matrix entries we have the following formulas:

ii) Let $`𝐢=i_1\mathrm{}i_n`$ and $`𝐣=j_1\mathrm{}j_n`$ be any two sequences with the same generic weight $`\nu `$ and let $`\sigma =\sigma (𝐢,𝐣)S_n`$ be the unique permutation such that $`\sigma 𝐢=𝐣`$ (i.e. $`i_{\sigma ^1(p)}=j_p`$, all $`p`$). Then

$$A_{𝐢,𝐣}^{^{}}=A_{𝐢,𝐣}^{(\nu )}=q_{𝐢,\sigma }(=\overline{q}_{𝐣,\sigma ^1})$$

where (c.f. 1.2)

$$q_{𝐢,\sigma }:=\underset{(a,b)I(\sigma )}{}q_{i_ai_b}$$

with $`I(\sigma )=\{(a,b)|a<b,\sigma (a)>\sigma (b)\}`$ denoting the set of inversions of $`\sigma `$.

iii) Let $`𝐢=i_1\mathrm{}i_n`$ and $`𝐣=j_1\mathrm{}j_n`$ be any two sequences of the same degenerate weight $`\nu `$ and let $`\sigma (𝐢,𝐣)=\{\sigma S_n|i_{\sigma ^1(p)}=j_p`$, all $`p\}`$. Then

$$A_{𝐢,𝐣}^{^{\prime \prime }}=A_{𝐢,𝐣}^{(\nu )}=\underset{\sigma \sigma (𝐢,𝐣)}{}q_{𝐢,\sigma ^1}(=\underset{\sigma \sigma (𝐢,𝐣)}{}\overline{q}_{𝐣,\sigma ^1}).$$

Proof. i) follows from 1.3d)

ii) We have, by 1.4b)

$$A_{𝐢,𝐣}^{^{}}=A_{𝐢,𝐣}=(\theta _𝐣,\theta _𝐢)_𝐪=({}_{i_1}{}^{}(\theta _𝐣),\theta _{i_2}\mathrm{}\theta _{i_n})_𝐪=\mathrm{}={}_{i_n}{}^{}\mathrm{}{}_{i_1}{}^{}(\theta _{j_1}\mathrm{}\theta _{j_n})$$

Now by applying the formula 1.4d) successively for $`i=i_1,i_2,\mathrm{}`$ and if $`j_{\sigma (1)}=i_1,j_{\sigma (2)}=i_2,\mathrm{}`$ we obtain

$$(\underset{1<b,\sigma (b)<\sigma (1)}{}q_{i_1i_b})(\underset{2<b,\sigma (b)<\sigma (2)}{}q_{i_2i_b})\mathrm{}=\underset{a<b,\sigma (b)<\sigma (a)}{}q_{i_ai_b}=q_{𝐢,\sigma },$$

so the claim follows.

The proof of iii) is similar as for ii) with only difference that $`\sigma `$ is not unique.

Remark 1.6.2 Note that for any weight $`\nu =\nu _ii`$ with $`|\nu |=\nu _i=n`$, the size of the matrix $`A^{(\nu )}`$ is equal to the multinomial coefficient $`\frac{n!}{_i\nu _i!}=dim𝐟_\nu `$, in particular for $`\nu `$ generic, $`A^{(\nu )}`$ is an $`n!\times n!`$ matrix.

Example 1.6.3 Let $`I=\{1,2,3\}`$ and $`\nu `$ generic with $`\nu _1=\nu _2=\nu _3=1`$. Then w.r.t. basis $`\{\theta _{123},\theta _{132},\theta _{312},\theta _{321},\theta _{231},\theta _{213}\}`$

$$A^{123}=\left(\begin{array}{cccccc}1& q_{23}& q_{23}q_{13}& q_{12}q_{13}q_{23}& q_{12}q_{13}& q_{12}\\ q_{32}& 1& q_{13}& q_{13}q_{12}& q_{12}q_{13}q_{32}& q_{12}q_{32}\\ q_{32}q_{31}& q_{31}& 1& q_{12}& q_{12}q_{32}& q_{12}q_{31}q_{32}\\ & & & 1& q_{32}& q_{31}q_{32}\\ & & & q_{23}& 1& q_{31}\\ & & & q_{13}q_{23}& q_{13}& 1\end{array}\right)=\left(\begin{array}{cc}X& Y\\ \overline{Y}& \overline{X}\end{array}\right)$$

where $`\overline{X}^T=X`$, $`Y^T=Y`$.

Example 1.6.4 Let $`I=\{1,2,3\}`$ and $`\nu `$ degenerate with $`\nu _1=2`$, $`\nu _2=0`$, $`\nu _3=1`$. Then w.r.t. the basis $`\{\theta _{113},\theta _{131},\theta _{311}\}`$

$$A^{113}=\left(\begin{array}{ccc}1+q_{11}& q_{13}+q_{11}q_{13}& q_{13}^2+q_{11}q_{13}^2\\ q_{31}+q_{31}q_{11}& 1+q_{11}q_{13}q_{31}& q_{13}+q_{11}q_{13}\\ q_{31}^2+q_{31}^2q_{11}& q_{31}+q_{31}q_{11}& 1+q_{11}\end{array}\right).$$

Now we state some properties of the matrices $`A^{(\nu )}`$, $`\nu `$ generic, which follow from the Proposition 1.6.1. For any sequences $`𝐢,𝐣`$ of weight $`\nu `$ we have :

a) $`A_{𝐢,𝐢}^{(\nu )}=1`$

b) $`A_{𝐢,𝐣}^{(\nu )}=\overline{A_{𝐣,𝐢}^{(\nu )}}`$ ($`A^{(\nu )}`$ is hermitian)

c) $`A_{\overline{𝐢},\overline{𝐣}}^{(\nu )}=\overline{A_{𝐢,𝐣}^{(\nu )}}`$, where $`\overline{𝐢}=i_n\mathrm{}i_1`$ denotes the reverse of $`𝐢=i_1\mathrm{}i_n`$

The property c) follows from the $`\rho `$-invariance 1.3.e) of $`(,)_𝐪`$. Equivalently, we can write this in the matrix form

$$P^{(\nu )}A^{(\nu )}P^{(\nu )}=\overline{A}^{(\nu )}(=(A^{(\nu )})^T)$$

where $`P^{(\nu )}(=(P^{(\nu )})^1)`$ is the permutation matrix defined by $`P_{𝐢,𝐣}^{(\nu )}=\delta _{\overline{𝐢},𝐣}`$. As in our example for $`n=3`$, one can also for general n write the matrix $`A^{(\nu )}`$, $`\nu `$ generic, in the form $`\left(\begin{array}{cc}X& Y\\ \overline{Y}& \overline{X}\end{array}\right),`$ with X hermitian and Y symmetric (e.g. if one uses the Johnson-Trotter ordering of permutations (see \[SWh\],p.2).

### 1.7 A reduction to generic case

Some questions about the matrices $`A^{(\nu )}`$ for general $`\nu `$ (e.g. invertibility, positive definiteness) can be reduced to the generic situation by using the following observation.

Let $`\nu =_i\nu _ii𝐍[I]`$ be a degenerate weight. We shall embed the matrix $`A^{(\nu )}`$ as a block in a block-diagonal matrix associated to some generic weight. To do this let $`\stackrel{~}{I}`$ be any set of size equal to $`n=|\nu |=_i\nu _i`$ and let $`\varphi :\stackrel{~}{I}I`$ be a function which maps exactly $`\nu _i`$ elements $`\stackrel{~}{i}`$ of $`\stackrel{~}{I}`$ to $`iI`$, and let $`\stackrel{~}{𝐪}`$ be the induced hermitian family of parameters $`\stackrel{~}{q}_{\stackrel{~}{i},\stackrel{~}{j}}:=q_{i,j}(\stackrel{~}{i},\stackrel{~}{j}\stackrel{~}{I})`$ where $`i=\varphi (\stackrel{~}{i}),j=\varphi (\stackrel{~}{j})`$.

Let $`\stackrel{~}{𝐟}`$ be the free associative algebra with generators $`\stackrel{~}{\theta }_1,\mathrm{},\stackrel{~}{\theta }_n`$ and let $`(,)_{\stackrel{~}{𝐪}}`$ be the sesquilinear form on $`\stackrel{~}{𝐟}`$ associated to $`\stackrel{~}{𝐪}`$ (as in 1.3). Let $`\stackrel{~}{𝐟}_{\stackrel{~}{\nu }}`$ be the generic weight space corresponding to $`\stackrel{~}{\nu }𝐍[\stackrel{~}{I}]`$ where $`\stackrel{~}{\nu }_{\stackrel{~}{i}}=1`$, for every $`\stackrel{~}{i}\stackrel{~}{I}`$. Let $`H=H_\nu `$ be the group of all bijections of $`\stackrel{~}{I}`$ which map $`\varphi ^1\{i\}`$ to itself for every $`i\varphi (\stackrel{~}{I})`$. This group is isomorphic to the Young subgroup $`_iS_{\nu _i}S_n`$. Let Y be the subspace of $`\stackrel{~}{𝐟}_{\stackrel{~}{\nu }}`$ spanned by $`H`$-invariant vectors $`\stackrel{~}{\theta }_{H\stackrel{~}{𝐢}}=_{hH}\stackrel{~}{\theta }_{h\stackrel{~}{𝐢}}`$ where $`\stackrel{~}{\theta }_{h\stackrel{~}{𝐢}}=\stackrel{~}{\theta }_{\stackrel{~}{i}_{h^1(1)}}\mathrm{}\stackrel{~}{\theta }_{\stackrel{~}{i}_{h^1(n)}}`$. Then for the operator $`\stackrel{~}{𝐀}`$ associated to the form $`(,)_{\stackrel{~}{𝐪}}`$ we have

$$\stackrel{~}{𝐀}(\stackrel{~}{\theta }_{H\stackrel{~}{𝐣}})=\underset{hH}{}\stackrel{~}{𝐀}(\stackrel{~}{\theta }_{h\stackrel{~}{𝐣}})=\underset{hH}{}\underset{\stackrel{~}{𝐢}}{}(\stackrel{~}{\theta }_{h\stackrel{~}{𝐣}},\stackrel{~}{\theta }_{\stackrel{~}{𝐢}})_{\stackrel{~}{𝐪}}\stackrel{~}{\theta }_{\stackrel{~}{𝐢}}.$$

Now for fixed $`\stackrel{~}{𝐢}`$ let $`\tau `$ be the unique permutation $`\tau S_n`$ such that $`\stackrel{~}{𝐣}=\tau \stackrel{~}{𝐢}`$. So

$`{\displaystyle \underset{hH}{}}(\stackrel{~}{\theta }_{h\stackrel{~}{𝐣}},\stackrel{~}{\theta }_{\stackrel{~}{𝐢}})_{\stackrel{~}{𝐪}}`$ $`=`$ $`{\displaystyle \underset{hH}{}}\stackrel{~}{q}_{\stackrel{~}{𝐢},h\tau }\text{(by Prop.1.6.1.ii))}`$
$`=`$ $`{\displaystyle \underset{hH}{}}q_{𝐢,h\tau }\text{ (by the definition of }\stackrel{~}{q}_{\stackrel{~}{𝐢},\stackrel{~}{𝐣}})=A^{(\nu )}_{𝐢,𝐣}\text{ (by Prop. 1.6.1.iii)},`$
where $`𝐢=i_1\mathrm{}i_n=\varphi (\stackrel{~}{i_1})\mathrm{}\varphi (\stackrel{~}{i_n})=:\varphi (\stackrel{~}{𝐢})`$ and $`𝐣=\varphi (\stackrel{~}{𝐣})`$. Note that $`𝐣=\varphi (h\stackrel{~}{𝐣})=\varphi (h\tau \stackrel{~}{𝐢})=(h\tau )𝐢`$, hence $`\sigma (𝐢,𝐣)=H\tau `$. So we can write

$$\stackrel{~}{𝐀}(\stackrel{~}{\theta }_{H\stackrel{~}{𝐣}})=\underset{\stackrel{~}{𝐢}}{}A_{𝐢,𝐣}^{(\nu )}\stackrel{~}{\theta }_{\stackrel{~}{𝐢}}=\underset{𝐢}{}A_{𝐢,𝐣}^{(\nu )}\stackrel{~}{\theta }_{H\stackrel{~}{𝐢}}$$

Thus we have proved that Y is an invariant subspace of the operator $`\stackrel{~}{𝐀}`$ associated to the form $`(,)_{\stackrel{~}{𝐪}}`$ and moreover that the matrix of $`\stackrel{~}{𝐀}|Y`$ w.r.t the basis of $`H`$-invariant vectors $`\stackrel{~}{\theta }_{H\stackrel{~}{𝐢}}`$ coincides with $`A^{(\nu )}`$. From this fact we conclude that

1. If $`\stackrel{~}{𝐀}|_{\stackrel{~}{𝐟}_{\stackrel{~}{\nu }}}`$ is invertible, then $`𝐀^{(\nu )}`$ is invertible too. In particular

$$[A^{(\nu )}]_{𝐢,𝐣}^1=\underset{hH}{}[\stackrel{~}{A}^{(\stackrel{~}{\nu })}]_{\stackrel{~}{𝐢},h\stackrel{~}{𝐣}}^1$$

where $`\stackrel{~}{𝐢},\stackrel{~}{𝐣}`$ are chosen so that $`\varphi (\stackrel{~}{𝐢})=𝐢,\varphi (\stackrel{~}{𝐣})=𝐣`$. This means that the entries of $`[A^{(\nu )}]^1`$, $`\nu `$ degenerate can be read off from the sums of H-equivalent columns of the matrix $`[\stackrel{~}{A}^{(\stackrel{~}{\nu })}]^1`$, corresponding to the generic weight $`\stackrel{~}{\nu }`$.
2. The determinant of $`A^{(\nu )}`$ divides the determinant of $`\stackrel{~}{A}^{(\stackrel{~}{\nu })}`$.
3. If $`\stackrel{~}{A}^{(\stackrel{~}{\nu })}`$ is positive definite, then $`A^{(\nu )}`$ is positive definite too.

### 1.8 Factorization of matrices $`A^{(\nu )}`$ for $`\nu `$ generic

First of all we point out that the rows of our multiparametric matrices $`A^{(\nu )}`$ are not equal up to reordering (what was true in \[Zag\], where all $`q_{ij}`$ are equal to q).

Therefore, the factorization of the matrices $`A^{(\nu )}`$ can not be reduced to the factorization of the corresponding group algebra elements as was treated by Zagier. Instead, by a somewhat tricky extension of the Zagier’s method we show how this can be done on the matrix level<sup>1</sup><sup>1</sup>1After completing this paper it becomes clear that the matrix level computations can be replaced by algebraic manipulations in a certain twisted group algebra and then quasimultiplicative representations can be considered as ordinary (multiplicative) representations of this twisted group algebra. This point of view will be elaborated elsewhere.. This is achieved by studying a $`q_{ij}`$-deformation of the regular representation of the symmetric group which is only quasimultiplicative, i.e., multiplicative only up to factors which are diagonal ($`q_{ij}`$-dependent) matrices (”projective representation”).

Let $`\nu =\nu _ii𝐍[I]`$ be a generic weight (i.e. $`\nu _i1,\text{ for all }iI`$) and let $`n=|\nu |=\nu _i`$. Let $`R_\nu `$ denote the action of the symmetric group $`S_n`$ on the (generic) weight space $`𝐟_\nu `$, given on the basis $`B_\nu =\{\theta _𝐢=\theta _{i_1}\mathrm{}\theta _{i_n},|𝐢|=\nu \}`$ of $`𝐟_\nu `$ by place permutation,

$$R_\nu (g):\theta _𝐣=\theta _{j_1}\mathrm{}\theta _{j_n}\theta _{g𝐣}=\theta _{j_{g^1(1)}}\theta _{j_{g^1(n)}}.$$

Note that $`g(k)`$ indicates the place where the factor $`\theta _{j_k}`$ goes under the action $`R_\nu (g)`$.

Then $`R_\nu `$ is equivalent to the right regular representation $`R_n`$ of $`S_n`$.

The corresponding matrix representation, also denoted by $`R_\nu (g)`$ is given by

$$R_\nu (g)_{𝐢,𝐣}:=\delta _{𝐢,g𝐣}.$$

Now, we need more notations. Let $`Q_{a,b}^\nu `$ for $`1a,bn`$ and $`Q^\nu (g)`$, for $`gS_n`$ be the diagonal matrices (multiplication operators on $`𝐟_\nu `$ ) defined by

$$(Q_{a,b}^\nu )_{𝐢,𝐢}:=q_{i_ai_b},$$

(e.g ($`Q_{2,4}^{1234})_{4123,4123}=q_{13}`$ if $`I=\{1,2,3,4\},\nu _1=\nu _2=\nu _3=\nu _4=1`$)

$$Q^\nu (g)_{𝐢,𝐢}:=q_{𝐢,g^1}=\underset{a<b,g^1(a)>g^1(b)}{}q_{i_ai_b}(Q^\nu (g)=\underset{(a,b)I(g^1)}{}Q_{a,b}^\nu ).$$

Note that $`\overline{q}_{ij}=q_{ji}`$ implies that $`Q_{b,a}^\nu =[Q_{a,b}^\nu ]^{}`$. We also denote by $`|Q_{a,b}^\nu |`$ the diagonal matrix defined by $`|Q_{a,b}^\nu |_{𝐢,𝐢}=|q_{i_ai_b}|`$. The quantity $`Q_{a,b}^\nu Q_{b,a}^\nu (=|Q_{a,b}^\nu |^2)`$ we abbreviate as $`Q_{\{a,b\}}^\nu .`$

More generally, for any subset $`T\{1,2,\mathrm{},n\}`$ we shall use the notations

$$Q_T^\nu :=\underset{a,bT,ab}{}Q_{a,b}^\nu ,\mathrm{}_T^\nu :=IQ_T^\nu $$

e.g. $`Q_{\{3,5,6\}}^\nu =Q_{\{3,5\}}^\nu Q_{\{3,6\}}^\nu Q_{\{5,6\}}^\nu =Q_{3,5}^\nu Q_{5,3}^\nu Q_{3,6}^\nu Q_{5,6}^\nu Q_{6,5}^\nu `$.

The following $`q_{ij}`$-deformation of the right regular representation $`R_\nu `$, defined by

$$\widehat{R}_\nu (g):=Q^\nu (g)R_\nu (g),gS_n$$

will be crucial in our method for factoring the matrices $`A^{(\nu )}`$ $`\nu `$-generic. PROPOSITION 1.8.1.  If $`\nu `$ is a generic weight with $`|\nu |=n`$, then for the matrix $`A^{(\nu )}`$ of $`(,)_𝐪`$ on $`𝐟_\nu `$ we have

$$A^{(\nu )}=\underset{gS_n}{}\widehat{R}_\nu (g)$$

Proof. The ($`𝐢,𝐣`$)-th entry of the r.h.s. is equal to
$`_{gS_n}\widehat{R}_\nu (g)_{𝐢,𝐣}=_{gS_n}Q(g)_{𝐢,𝐢}R_\nu (g)_{𝐢,𝐣}=_{gS_n}q_{𝐢,g^1}\delta _{𝐢,g𝐣}=q_{𝐢,\tau ^1}`$, if $`𝐢=\tau 𝐣`$ (such $`\tau `$ is unique, because $`|𝐢|=|𝐣|=\nu `$ is generic), what is just $`A_{𝐢,𝐣}^{(\nu )}`$, according to Prop.1.6.1 ii) and the proof follows.

Before we proceed with the factorization of matrices $`A^{(\nu )}`$ we need more detailed information concerning our ”projective” right regular representation $`\widehat{R}_\nu `$ which is only quasimultiplicative in the following sense:PROPERTY 0. (quasimultiplicativity)

$$\widehat{R}_\nu (g_1)\widehat{R}_\nu (g_2)=\widehat{R}_\nu (g_1g_2)\text{ if }l(g_1g_2)=l(g_1)+l(g_2)$$

where $`l(g):=CardI(g)`$ is the length of $`gS_n`$.

This property follows from the following general formula : PROPOSITION 1.8.2.  For any $`g_1,g_2S_n`$ we have

$$\widehat{R}_\nu (g_1)\widehat{R}_\nu (g_2)=M_\nu (g_1,g_2)\widehat{R}_\nu (g_1g_2)$$

where the multiplication factor is the diagonal matrix

$$M_\nu (g_1,g_2)=\underset{(a,b)I(g_1^1)I(g_2^1g_1^1)}{}Q_{\{a,b\}}^\nu (=\underset{(a,b)I(g_1)I(g_2^1)}{}Q_{\{g_1(a),g_1(b)\}}^\nu ).$$

Proof. First we observe that for any diagonal matrix D, its conjugate by the ”permutation” matrix $`R(g)`$, $`D^{(g)}=R(g)DR(g)^1`$ is a diagonal matrix such that $`D_{𝐢,𝐢}^{(g)}=D_{g^1𝐢,g^1𝐢}`$. Then by the definition of $`\widehat{R}_\nu `$ and writing $`Q`$ instead of $`Q^\nu `$ we obtain:

$`\widehat{R}_\nu (g_1)\widehat{R}_\nu (g_2)`$ $`=`$ $`Q(g_1)[R_\nu (g_1)Q(g_2)]R_\nu (g_2)=Q(g_1)Q(g_2)^{(g_1)}R_\nu (g_1)R_\nu (g_2)`$
$`=`$ $`Q(g_1)Q(g_2)^{(g_1)}R_\nu (g_1g_2)=Q(g_1)Q(g_2)^{(g_1)}Q(g_1g_2)^1\widehat{R}_\nu (g_1g_2)`$
i.e. $`M_\nu (g_1,g_2)=Q(g_1)Q(g_2)^{(g_1)}Q(g_1g_2)^1`$.

By using that $`[Q_{a,b}^{(g)}]_{𝐢,𝐢}=[Q_{a,b}]_{g^1𝐢,g^1𝐢}=q_{i_{g(a)}i_{g(b)}}(Q_{a,b}^{(g)}=Q_{g(a),g(b)})`$ we can rewrite and split $`Q(g_2)^{(g_1)}`$ and $`Q(g_1g_2)`$ as follows :

$`Q(g_2)^{(g_1)}`$ $`=`$ $`\left[{\displaystyle \underset{(a^{^{}},b^{^{}})I(g_2^1)}{}}Q_{a^{^{}},b^{^{}}}\right]^{(g_1)}={\displaystyle \underset{(a^{^{}},b^{^{}})I(g_2^1)}{}}Q_{a^{^{}},b^{^{}}}^{(g_1)}={\displaystyle \underset{(a^{^{}},b^{^{}})I(g_2^1)}{}}Q_{g_1(a^{^{}})g_1(b^{^{}})}`$
$`=`$ $`{\displaystyle \underset{(g_1^1(a),g_1^1(b))I(g_2^1)}{}}Q_{a,b}={\displaystyle \underset{(a,b)I(g_2^1g_1^1)I(g_1^1)}{}}Q_{a,b}{\displaystyle \underset{(b,a)I(g_1^1)I(g_2^1g_1^1)}{}}Q_{a,b}`$
$`Q(g_1g_2)`$ $`=`$ $`{\displaystyle \underset{(a,b)I(g_2^1g_1^1)}{}}Q_{a,b}`$
$`=`$ $`{\displaystyle \underset{(a,b)I(g_1^1)I(g_2^1g_1^1)}{}}Q_{a,b}{\displaystyle \underset{(a,b)I(g_2^1g_1^1)I(g_1^1)}{}}Q_{a,b}=Q^{^{}}Q^{^{\prime \prime }}`$
Finally, since diagonal matrices commute, after cancellation, we get

$`M_\nu (g_1,g_2)`$ $`=`$ $`[Q(g_1)Q^_{}^{1}{}_{}{}^{}][Q(g_2)^{(g_1)}Q^{_{}^{1}{}_{}{}^{\prime \prime }}]`$
$`=`$ $`{\displaystyle \underset{(a,b)I(g_1^1)I(g_2^1g_1^1)}{}}Q_{a,b}{\displaystyle \underset{(b,a)I(g_1^1)I(g_2^1g_1^1)}{}}Q_{a,b}`$
$`=`$ $`{\displaystyle \underset{(a,b)I(g_1^1)I(g_2^1g_1^1)}{}}Q_{\{a,b\}},`$
and the proof is finished.

For $`1abn`$ we denote by $`t_{a,b}`$ the following cyclic permutation in $`S_n`$

$$t_{a,b}:=\left(\begin{array}{cccc}a& a+1& \mathrm{}& b\\ b& a& \mathrm{}& b1\end{array}\right)$$

which maps $`b`$ to $`b1`$ to $`b2`$ $`\mathrm{}`$ to $`a`$ to $`b`$ and fixes all $`1k<a`$ and $`b<kn`$. Its inverse is then

$$t_{a,b}^1=\left(\begin{array}{cccc}a& a+1& \mathrm{}& b\\ a+1& a+2& \mathrm{}& a\end{array}\right).$$

Note that the corresponding sets of inversions are equal to $`I(t_{a,b})=\{(a,j)|a<jb\}`$ and $`I(t_{a,b}^1)=\{(i,b)|ai<b\}`$.

We also denote by

$$t_a:=t_{a,a+1}(1a<n)$$

the transposition of adjacent letters $`a`$ and $`a+1`$.

Then, from Proposition 1.8.2, one gets the following more specific properties of $`\widehat{R}_\nu `$ which we shall need later on:PROPERTY 1. (braid relations)

$`\widehat{R}_\nu (t_a)\widehat{R}_\nu (t_{a+1})\widehat{R}_\nu (t_a)=\widehat{R}_\nu (t_{a+1})\widehat{R}_\nu (t_a)\widehat{R}_\nu (t_{a+1}),\text{ for all }a=1,\mathrm{},n2`$
$`\widehat{R}_\nu (t_a)\widehat{R}_\nu (t_b)=\widehat{R}_\nu (t_b)\widehat{R}_\nu (t_a),\text{ for all }a,b=1,\mathrm{},n1\text{ with }|ab|2.`$
PROPERTY 2.

$$\widehat{R}_\nu (g)\widehat{R}_\nu (t_{a,b})=\underset{ai<b,g(i)>g(b)}{}Q_{\{g(b),g(i)\}}^\nu \widehat{R}_\nu (gt_{a,b}),$$

for $`gS_n,1a<bn.`$ In particular we havePROPERTY $`2^{^{}}`$.

$$\widehat{R}_\nu (g)\widehat{R}_\nu (t_{k,m})=\widehat{R}_\nu (gt_{k,m}),$$

for $`gS_{m1}\times S_{nm+1},1kmn`$.PROPERTY 3. (commutation rules) i) For $`1aa^{^{}}<mn`$

$$\widehat{R}_\nu (t_{a^{^{}},m})\widehat{R}_\nu (t_{a,m})=Q_{\{m1,m\}}^\nu \widehat{R}_\nu (t_{a,m1})\widehat{R}_\nu (t_{a^{^{}}+1,m}).$$

ii) Let $`w_n=nn1\mathrm{}\mathrm{2\hspace{0.25em}1}`$ be the longest permutation in $`S_n`$. Then for any $`gS_n`$

$`\widehat{R}_\nu (gw_n)\widehat{R}_\nu (w_n)`$ $`=`$ $`\widehat{R}_\nu (w_n)\widehat{R}_\nu (w_ng)`$
$`=`$ $`({\displaystyle \underset{a<b,g^1(a)<g^1(b)}{}}Q_{\{a,b\}}^\nu )\widehat{R}(g)(=|Q^\nu (gw_n)|^2\widehat{R}(g))`$
PROPERTY 4. For any $`1a_1<a_2<\mathrm{}<a_s<mn`$, we have

$$\widehat{R}_\nu (t_{a_1,m})\widehat{R}_\nu (t_{a_2,m})\mathrm{}\widehat{R}_\nu (t_{a_s,m})=\widehat{R}_\nu (t_{a_1,m}t_{a_2,m}\mathrm{}t_{a_s,m}).$$

Now we can state our first factorization of the matrices $`A^{(\nu )}`$, $`\nu `$ generic. PROPOSITION 1.8.3.  For $`1mn`$, we define

$$A^{(\nu ),m}:=\widehat{R}_\nu (t_{1,m})+\widehat{R}_\nu (t_{2,m})+\mathrm{}+\widehat{R}_\nu (t_{m,m})(A^{(\nu ),1}=I).$$

Then we have the following factorization

$$A^{(\nu )}=A^{(\nu ),1}A^{(\nu ),2}\mathrm{}A^{(\nu ),n}.$$

Proof. Since any element $`gS_n`$ can be represented uniquely as $`g_1t_{k,n}`$, with $`g_1S_{n1}\times S_1S_n`$ and $`1kn`$ (namely $`k=g^1(n),g_1=gt_{k,n}^1`$), we can write

$`A^{(\nu )}`$ $`=`$ $`{\displaystyle \underset{gS_n}{}}\widehat{R}_\nu (g)={\displaystyle \underset{g_1S_{n1}\times S_1,1kn}{}}\widehat{R}_\nu (g_1t_{k,n})`$
$`=`$ $`({\displaystyle \underset{g_1S_{n1}\times S_1}{}}\widehat{R}_\nu (g_1))({\displaystyle \underset{k=1}{\overset{n}{}}}\widehat{R}_\nu (t_{k,n}))`$
where the first equality is by Prop.1.8.1 and the third equality follows by Property $`2^{^{}}`$. Subsequently, we represent $`g_1S_{n1}\times S_1`$ uniquely as $`g_1=g_2t_{k_2,n1}`$ with $`g_2S_{n1}\times S_1^2`$ and $`1k_2n1`$ and so on. The claim follows.

We now make a second reduction by expressing the matrices $`A^{(\nu ),m}`$ in turn as products of yet simpler matrices. PROPOSITION 1.8.4.  Let $`C^{(\nu ),m}(mn)`$ and $`D^{(\nu ),m}(m<n)`$ be the following matrices
$`C^{(\nu ),m}:=[I\widehat{R}_\nu (t_{1,m})][I\widehat{R}_\nu (t_{2,m})]\mathrm{}[I\widehat{R}_\nu (t_{m1,m})]`$,
$`D^{(\nu ),m}=[IQ_{\{m,m+1\}}^\nu \widehat{R}_\nu (t_{1,m})][IQ_{\{m,m+1\}}^\nu \widehat{R}_\nu (t_{2,m})]\mathrm{}[IQ_{\{m,m+1\}}^\nu \widehat{R}_\nu (t_{m,m})]`$.
Then

$$A^{(\nu ),m}=D^{(\nu ),m1}[C^{(\nu ),m}]^1$$

Proof. Let $`A^{(\nu ),r,m}:=_{k=r}^m\widehat{R}(t_{k,m})`$, so that $`A^{(\nu ),1,m}=A^{(\nu ),m},A^{(\nu ),m,m}=I`$ (because $`t_{m,m}=1S_n`$). By using Property 3. (commutation rules) we find

$`A^{(\nu ),r,m}(I\widehat{R}_\nu (t_{r,m}))`$ $`=`$ $`\widehat{R}_\nu (t_{r,m})+{\displaystyle \underset{k=r+1}{\overset{m}{}}}\widehat{R}_\nu (t_{k,m}){\displaystyle \underset{k=r}{\overset{m1}{}}}\widehat{R}_\nu (t_{k,m})\widehat{R}_\nu (t_{r,m})\widehat{R}_\nu (t_{r,m})`$
$`=`$ $`{\displaystyle \underset{k=r+1}{\overset{m}{}}}\widehat{R}_\nu (t_{k,m}){\displaystyle \underset{k=r+1}{\overset{m}{}}}Q_{\{m1,m\}}^\nu \widehat{R}_\nu (t_{r,m1})\widehat{R}_\nu (t_{k,m})`$
$`=`$ $`(IQ_{\{m1,m\}}^\nu \widehat{R}(t_{r,m1}))A^{(\nu ),r+1,m}`$
and hence by induction on $`r`$ (starting with the trivial case $`r=0`$)

$`A^{(\nu ),1,m}[I\widehat{R}_\nu (t_{1,m})]\mathrm{}[I\widehat{R}_\nu (t_{r,m})]=`$
$`=[IQ_{\{m1,m\}}^\nu \widehat{R}_\nu (t_{1,m1})]\mathrm{}[IQ_{\{m1,m\}}^\nu \widehat{R}_\nu (t_{r,m1})A^{(\nu ),r+1,m}].`$
The case $`r=m1`$ of this identity is the desired identity.

### 1.9 Formula for the determinant of $`A^{(\nu )}`$, $`\nu `$ generic.

So far we have expressed the matrix $`A^{(\nu )}`$ as a product of matrices like $`IQ_{\{m,m+1\}}^\nu \widehat{R}_\nu (t_{k,m})`$ or $`[I\widehat{R}_\nu (t_{k,m})]^1`$. Thus, in order to evaluate $`detA^{(\nu )}`$, we first compute the determinant of such matrices. LEMMA 1.9.1.  For $`\nu `$ generic with $`|\nu |=n`$, we have
a) $`det(I\widehat{R}_\nu (t_{a,b}))={\displaystyle \underset{\mu \nu ,|\mu |=ba+1}{}}(\mathrm{}_\mu )^{(ba)!(n+ab1)!},(1a<bn)`$
b) $`det(IQ_{\{b,b+1\}}^\nu \widehat{R}_\nu (t_{a,b}))={\displaystyle \underset{\mu \nu ,|\mu |=ba+2}{}}(\mathrm{}_\mu )^{(ba)!(ba+2)!(n+ab2)!},(1ab<n)`$
where for any subset $`TI`$ we denote by $`\mathrm{}_T`$ the quantity

$$\mathrm{}_T:=1q_T;q_T=\underset{ijT}{}q_{ij}(=\underset{\{ij\}T}{}|q_{ij}|^2)$$

in which the last product is over all two-element subsets of $`T`$ (We view $`\nu `$ as a subset of $`I`$, hence $`\mu \nu `$ means that $`\mu `$ is a subset of $`\nu `$). Proof. a) Let $`H:=<t_{a,b}>S_n`$ be the cyclic subgroup of $`S_n`$ generated by the cycle $`t_{a,b}`$. Then, each $`H`$-orbit on $`𝐟_\nu `$, $`𝐟_\nu ^{[𝐢]_a^b}=span\{\theta _{t_{a,b}^k𝐢}|0kba\}`$, (which clearly corresponds to a cyclic $`t_{a,b}`$-equivalence class $`[𝐢]_a^b=i_1\mathrm{}(i_ai_{a+1}\mathrm{}i_b)\mathrm{}i_n`$ of the sequence $`𝐢=i_1\mathrm{}i_n`$ of weight $`\nu `$) is an invariant subspace of $`R_\nu (t_{a,b})`$ (and hence of $`\widehat{R}_\nu (t_{a,b})`$). Note that $`\widehat{R}_\nu (t_{a,b})(\theta _{t_{a,b}^k𝐢})=c_k\theta _{t_{a,b}^{k+1}𝐢}`$ where $`c_k=q_{t_{a,b}^k𝐢,t_{a,b}^1}(0kba)`$ i.e.

$`c_0`$ $`=`$ $`q_{i_ai_b}q_{i_{a+1}i_b}\mathrm{}q_{i_{b1}i_b},`$
$`c_1`$ $`=`$ $`q_{i_{a+1}i_a}q_{i_{a+2}i_a}\mathrm{}q_{i_bi_a},`$
$`\mathrm{}`$
$`c_{ba}`$ $`=`$ $`q_{i_bi_{b1}}q_{i_ai_{b1}}\mathrm{}q_{i_{b2}i_{b1}},`$
i.e. $`\widehat{R}_\nu (t_{a,b})|f_\nu ^{[𝐢]_a^b}`$ is a cyclic operator, hence

$`det(I\widehat{R}_\nu (t_{a,b})|f_\nu ^{[𝐢]_a^b})`$ $`=`$ $`1c_0c_1\mathrm{}c_{ba}=1{\displaystyle \underset{ij\{i_a,\mathrm{},i_b\}}{}}q_{ij}`$
$`=`$ $`1{\displaystyle \underset{\{i,j\}\{i_a,\mathrm{},i_b\}}{}}|q_{ij}|^2=\mathrm{}_{\{i_a,\mathrm{},i_b\}}.`$
Note that this determinant depends only on the set $`\{i_a,i_{a+1},\mathrm{},i_b\}`$ and that there are $`(ba)!(n(ba+1))!`$ cyclic $`t_{a,b}`$ -equivalence classes corresponding to any given $`(ba+1)`$-set $`\mu =\{i_a,\mathrm{},i_b\}\nu `$. (Here we identify a generic weight $`\nu =\nu _ii`$, $`\nu _i1`$ with the set $`\{iI|\nu _i=1\}`$).

b) Similary as in a) we have $`Q_{\{b,b+1\}}^\nu \widehat{R}_\nu (t_{a,b})(\theta _{t_{a,b}^k𝐢})=d_k\theta _{t_{a,b}^{k+1}𝐢}(0kba)`$ where $`d_0=c_0|q_{i_bi_{b+1}}|^2,d_1=c_1|q_{i_ai_{b+1}}|^2`$, $`\mathrm{}`$, $`d_{ba}=c_{ba}|q_{i_{b1}i_{b+1}}|^2`$ (with $`c_k`$ as above). Then
$`det(IQ_{\{b,b+1\}}^\nu \widehat{R}_\nu (t_{a,b})|f_\nu ^{[𝐢]_a^b})=1d_0d_1\mathrm{}d_{ba}=1_{\{i,j\}\{i_a,\mathrm{},i_{b+1}\}}|q_{ij}|^2=\mathrm{}_{\{i_a,\mathrm{},i_{b+1}\}}`$.

Now, for given $`(ba+2)`$-set $`\mu \nu `$, we shall count the number of $`H`$-orbits labeled by $`[𝐢]_a^b`$ on which the above determinant assumes the same value $`\mathrm{}_\mu `$. We can choose any element of $`\mu `$ to be $`i_{b+1}`$ (in $`ba+2`$ ways), then the remaining $`ba+1`$ elements in $`\mu `$ can be arranged in $`(ba+1)!/(ba+1)=(ba)!`$ cyclic arrangements $`(i_a\mathrm{}i_b)`$ and the remaining $`n(ba+2)`$ positions in $`[𝐢]_a^b=i_1\mathrm{}(i_a\mathrm{}i_b)i_{b+1}\mathrm{}i_n`$ can form any permutation of the set $`\nu \mu `$ (in $`(n+ab2)!`$ ways). THEOREM 1.9.2. \[THE DETERMINANTAL FORMULA\]  The determinant of the matrix $`A^{(\nu )}`$, $`\nu `$ generic, is given by

$$detA^{(\nu )}=\underset{\mu \nu ,|\mu |2}{}(\mathrm{}_\mu )^{(|\mu |2)!(|\nu ||\mu |+1)!}.$$

Proof. By Lemma 1.9.1 applied to matrices $`C^{(\nu ),m},D^{(\nu ),m1}`$ (defined in Prop.1.8.4), we have

$`detC^{(\nu ),m}`$ $`=`$ $`{\displaystyle \underset{\mu \nu ,2|\mu |m}{}}(\mathrm{}_\mu )^{(|\mu |1)!(n|\mu |)!}`$
$`detD^{(\nu ),m1}`$ $`=`$ $`{\displaystyle \underset{\mu \nu ,2|\mu |m}{}}(\mathrm{}_\mu )^{(|\mu |2)!|\mu |(n|\mu |)!}`$
Then, by Prop 1.8.4

$$detA^{(\nu ),m}=detD^{(\nu ),m1}/detC^{(\nu ),m}=\underset{\mu \nu ,2|\mu |m}{}(\mathrm{}_\mu )^{(|\mu |2)!(n|\mu |)!}$$

Finally, by Prop 1.8.3

$$detA^{(\nu )}=\underset{m=1}{\overset{n}{}}detA^{(\nu ),m}=\underset{\mu \nu ,|\mu |2}{}(\mathrm{}_\mu )^{(|\mu |2)!(n|\mu |+1)!}.$$

This completes the proof.

In particular, in Example 1.6.3 ($`I=\{1,2,3\},\nu _1=\nu _2=\nu _3=1`$) we have

$$detA^{123}=(1|q_{12}|^2)^2(1|q_{13}|^2)^2(1|q_{23}|^2)^2(1|q_{12}|^2|q_{13}|^2|q_{23}|^2)$$

Remark 1.9.3. Theorem 1.9.2 represents a multiparametric extension of the Theorem 2 in \[Zag\] which states that in one-parametric case $`(q_{ij}=q)`$:

$$detA_n(q)=\underset{k=2}{\overset{n}{}}(1q^{k(k1)})^{\frac{n!(nk+1)}{k(k1)}}$$

(e.g. $`detA_3(q)=(1q^2)^6(1q^6)`$). THEOREM 1.9.4.  The matrix $`A=A(𝐪)`$ associated to the sesquilinear form $`(,)=(,)_𝐪`$ on $`𝐟`$, (see 1.3 and 1.6) is positive definite if $`|q_{ij}|<1`$, for all $`i,jI`$, so that the $`q_{ij}`$-cannonical commutation relations 1.1(1) have a Hilbert space realization (cf. 1.5). Proof. From Prop.1.6.1 we know that $`A=A^{(\nu )}`$. For $`\nu `$ generic, we see directly from Theorem 1.9.2 that $`A^{(\nu )}`$ is nonsingular if $`|q_{ij}|<1`$ for all $`ijI`$. According to the reduction to the generic case (discussed in 1.7) we see that $`A^{(\nu )}`$, $`\nu `$ degenerate, is also nonsingular if $`|q_{ij}|<1`$, for all $`i,jI`$. Since $`A(\mathrm{𝟎})`$ (i.e. if all $`q_{ij}=0`$) is the identity matrix and the eigenvalues of $`A(𝐪)`$ vary continuously with $`q_{ij}`$ and are real (because $`A(𝐪)`$ is hermitian) we see that $`A(𝐪)`$ is positive definite if $`|q_{ij}|<1,i,jI`$.

## 2 Formulas for the inverse of $`A^{(\nu )}`$, $`\nu `$ generic.

The problem of computing the inverse of matrices $`A^{(\nu )}`$ appears in the expansions of the number operators and transition operators (c.f \[MSP\]). It is also related to a random walk problem on symmetric groups and in several other situations (hyperplane arrangements, contravariant forms on certain quantum groups). We shall give here two types of formulas for $`[A^{(\nu )}]^1`$: a Zagier type formula and Božejko-Speicher type formulas.

### 2.1 Zagier type formula

First we give a formula for the inverse of $`A^{(\nu )}`$, $`\nu `$ generic, which follows from Prop.1.8.3 and Prop.1.8.4 :

$`[A^{(\nu )}]^1`$ $`=`$ $`[A^{(\nu ),n}]^1\mathrm{}[A^{(\nu ),1}]^1`$
$`=`$ $`C^{(\nu ),n}[D^{(\nu ),n1}]^1C^{(\nu ),n1}[D^{(\nu ),n2}]^1\mathrm{}C^{(\nu ),2}[D^{(\nu ),1}]^1`$
To invert $`A^{(\nu )}`$, therefore, the first step is to invert $`D^{(\nu ),m}`$ for each $`m<n`$. First we recall the notation $`Q_T^\nu =_{a,bT,ab}Q_{a,b}^\nu `$, $`\mathrm{}_T^\nu =IQ_T^\nu `$ $`(T\{1,2,\mathrm{},n\})`$ from 1.8.

PROPOSITION 2.1.1.  For $`\pi S_n`$ let $`Des(\pi )`$ denote the descent set of $`\pi `$ (i.e. the set $`\{1in1|\pi (i)>\pi (i+1)\}`$) and let $`W_m^\nu (\pi )(m<n)`$ be the following diagonal matrix

$$W_m^\nu (\pi )=\underset{iDes(\pi ^1)}{}Q_{[i+1..m+1]}^\nu .$$

Then the inverse of the matrix $`D^{(\nu ),m}`$ is given explicitly by

$$[D^{(\nu ),m}]^1=[^{(\nu ),m}]^1E^{(\nu ),m}$$

where

$$E^{(\nu ),m}=\underset{\pi S_m\times S_1^{nm}}{}W_m^\nu (\pi )\widehat{R}_\nu (\pi )$$

and where $`^{(\nu ),m}`$ is the following diagonal matrix

$$^{(\nu ),m}:=\mathrm{}_{[1..m+1]}^\nu \mathrm{}_{[2..m+1]}^\nu \mathrm{}\mathrm{}_{[m..m+1]}^\nu $$

(Here $`[a..b]`$ denotes the set $`\{a,a+1,\mathrm{},b\}`$). Proof. Denote by $`\sigma \stackrel{~}{\sigma }`$ the obvious map $`S_m\times S_1^{nm}S_1\times S_m\times S_1^{nm1}`$ (i.e. $`\stackrel{~}{\sigma }(1)=1,\stackrel{~}{\sigma }(i)=\sigma (i1)+1`$ for $`i>1`$). This is a homomorphism since $`\stackrel{~}{\sigma }=t_{1,n}^1\sigma t_{1,n}`$ (because $`m<n`$). It is easy to check that then

$$\widehat{R}(\stackrel{~}{\sigma })=R(t_{1,n})^1\widehat{R}(\sigma )R(t_{1,n})$$

Also we note that $`\stackrel{~}{t_{a,b}}=t_{a+1,b+1}`$, for $`1a<bm`$. Thus we can rewrite the matrix $`D^{(\nu ),m}`$ as follows:

$$D^{(\nu ),m}=[IQ_{\{m,m+1\}}^\nu \widehat{R}_\nu (t_{1,m})]\stackrel{~}{D}^{(\nu ),m1}$$

where we set

$`\stackrel{~}{D}^{(\nu ),m1}`$ $`:=`$ $`[IQ_{\{m,m+1\}}^\nu \widehat{R}_\nu (t_{2,m})]\mathrm{}[IQ_{\{m,m+1\}}^\nu \widehat{R}_\nu (t_{m,m})]`$
$`=`$ $`[IQ_{\{m,m+1\}}^\nu \widehat{R}_\nu (\stackrel{~}{t}_{1,m1})]\mathrm{}[IQ_{\{m,m+1\}}^\nu \widehat{R}_\nu (\stackrel{~}{t}_{m1,m1})]`$
By noting that $`R_\nu (t_{1,n})Q_{\{m,m+1\}}^\nu =Q_{\{m1,m\}}^\nu R_\nu (t_{1,n})`$
($`Q_{\{m,m+1\}}^\nu =R_\nu (t_{1,n})^1Q_{\{m1,m\}}^\nu R_\nu (t_{1,n})`$) we have

$`\stackrel{~}{D}^{(\nu ),m1}`$ $`=`$ $`R_\nu (t_{1,n})^1[IQ_{\{m1,m\}}^\nu \widehat{R}_\nu (t_{1,m1})]\mathrm{}[IQ_{\{m1,m\}}^\nu \widehat{R}_\nu (t_{m1,m1})]R_\nu (t_{1,n})`$
$`=`$ $`R_\nu (t_{1,n})^1D^{(\nu ),m1}R_\nu (t_{1,n})`$
Therefore, to prove the formula $`[D^{(\nu ),m}]^1=[^{(\nu ),m}]^1E^{(\nu ),m}`$ by induction, it suffices to show that

$$E^{(\nu ),m}(IQ_{\{m,m+1\}}^\nu \widehat{R}_\nu (t_{1,m}))=[1Q_{[1..m+1]}^\nu ]\stackrel{~}{E}^{(\nu ),m1}$$
$`()`$
where we set

$$\stackrel{~}{E}^{(\nu ),m1}=R_\nu (t_{1,n})^1E^{(\nu ),m1}R_\nu (t_{1,n})$$

To show (\*), we first calculate

$`E^{(\nu ),m}Q_{\{m,m+1\}}^\nu \widehat{R}_\nu (t_{1,m})={\displaystyle \underset{\sigma S_m\times S_1^{nm}}{}}W_m^\nu (\sigma )\widehat{R}_\nu (\sigma )Q_{\{m,m+1\}}^\nu \widehat{R}_\nu (t_{1,m})`$
$`={\displaystyle \underset{\sigma S_m\times S_1^{nm}}{}}W_m^\nu (\sigma )Q_{\{\sigma (m),\sigma (m+1)\}}^\nu \widehat{R}_\nu (\sigma )\widehat{R}_\nu (t_{1,m})`$
By using that $`\sigma (m+1)=m+1`$, and by Property 2 (stated in 1.8)
$`={\displaystyle \underset{\sigma S_m\times S_1^{nm}}{}}W_m^\nu (\sigma )Q_{\{\sigma (m),m+1\}}^\nu {\displaystyle \underset{mj>\sigma (m)}{}}Q_{\{\sigma (m),j\}}^\nu \widehat{R}_\nu (\sigma t_{1,m})`$
$`={\displaystyle \underset{\pi S_m\times S_1^{nm}}{}}W_m^\nu (\pi t_{1,m}^1){\displaystyle \underset{\pi (1)<jm+1}{}}Q_{\{\pi (1),j\}}^\nu \widehat{R}_\nu (\pi )`$
By observing that the descent sets of $`\pi ^1`$ and $`(\pi t_{1,m}^1)^1=t_{1,m}\pi ^1`$ are related by

$$Des(t_{1,m}\pi ^1)=\{\begin{array}{cc}(Des(\pi ^1)\{\pi (1)1\})\{\pi (1)\},\hfill & \text{if }\pi (1)>1\hfill \\ Des(\pi ^1)\{\pi (1)\},\hfill & \text{if }\pi (1)=1\hfill \end{array}$$

we see immediately that

$$W_m^\nu (\pi t_{1,m}^1)\underset{\pi (1)<jm+1}{}Q_{\{\pi (1),j\}}^\nu =\{\begin{array}{cc}W_m^\nu (\pi ),\hfill & \text{if }\pi (1)>1\hfill \\ Q_{[1..m+1]}^\nu W_m^\nu (\pi ),\hfill & \text{if }\pi (1)=1\hfill \end{array}$$

By plugging this into the l.h.s. of (\*), after cancellation, we obtain the r.h.s. of (\*). This completes the proof of Prop.2.1.1.

We next give a formula expressing the matrices $`C^{(\nu ),m}(mn)`$ as a sum rather than a product (see Prop.1.8.4). PROPOSITION 2.1.2.  The matrices $`C^{(\nu ),m},(mn)`$ defined in Prop.1.8.4 are given by

$$C^{(\nu ),m}=\underset{k=1}{\overset{n}{}}C^{(\nu ),m;k},C^{(\nu ),m;k}=(1)^{mk}\underset{\pi S_m^{(k)}\times S_1^{nm}}{}\widehat{R}_\nu (\pi ^1)$$

where $`S_m^{(k)}`$ is the subset of $`S_m`$ of cardinality $`\left(\genfrac{}{}{0pt}{}{m1}{k1}\right)`$ consisting of those permutations $`\pi `$ for which $`\pi (1)<\mathrm{}<\pi (k)>\mathrm{}>\pi (m)`$. Proof. Multiplying out the terms in the product defining $`C^{(\nu ),m}`$, we find that

$`C^{(\nu ),m}`$ $`=`$ $`{\displaystyle \underset{s=0}{\overset{m1}{}}}(1)^s{\displaystyle \underset{1i_1<\mathrm{}<i_sm1}{}}\widehat{R}_\nu (t_{i_1,m})\mathrm{}\widehat{R}_\nu (t_{i_s,m})`$
what by Property 4 (in 1.8) $`=`$ $`{\displaystyle \underset{s=0}{\overset{m1}{}}}(1)^s{\displaystyle \underset{1i_1<\mathrm{}<i_sm1}{}}\widehat{R}_\nu (t_{i_1,m}\mathrm{}t_{i_s,m}).`$
The element $`\sigma =t_{i_1,m}t_{i_2,m}\mathrm{}t_{i_s,m}`$ of $`S_m\times S_1^{nm}`$ maps $`i_1`$ to $`m`$, $`i_2`$ to $`m1`$, …, and $`i_s`$ to $`ms+1`$ and maps the rest in $`\{1,2,\mathrm{},m\}`$ monotonically increasingly to $`\{1,2,\mathrm{},ms\}`$. Moreover it is clear that the number of inversions $`|I(\sigma )|=_{j=1}^s|I(t_{i_j,m})|`$ (c.f. Property 4 in 1.8).

The Proposition now follows by setting $`\pi =\sigma ^1`$ and $`k=ms`$. Remark 2.1.3. The Propositions 2.1.1 and 2.1.2 are multiparametric extensions of Propositions 3. and 4. of \[Zag\].

### 2.2 Božejko-Speicher type formulas

In addition to the, multiplicative in spirit, Zagier type formula for the inverse of $`A^{(\nu )}`$ ($`\nu `$ generic), given in 2.1., one also has another, additive in spirit, Božejko-Speicher type formula (c.f. \[BSp1\], Lemma 2.6.) which, in the case of symmetric group $`S_n`$, we shall present here, in slightly different notation, together with several improvements.

We point out that in Zagier type factorizations (see Prop.1.8.3) one of the key ingredients was the following coset decomposition of the symmetric group $`S_n`$ with respect to its Young subgroup $`S_{\{n1\}}:=S_{n1}\times S_1:`$

$$S_n=S_{\{n1\}}\beta _{\{n1\}},$$

with $`\beta _{\{n1\}}=\{t_{1,n},t_{2,n},\mathrm{},t_{n,n}\}`$ consisting of distinct coset representatives $`t_{k,n}`$ $`(=`$ the cyclic permutation $`\left(\begin{array}{cccc}k& k+1& \mathrm{}& n\\ n& k& \mathrm{}& n1\end{array}\right)`$). Note that $`\beta _{\{n1\}}=\{gS_n|g^1(1)<\mathrm{}<g^1(n1)\}`$, so each $`t_{k,n}`$ is of smallest length in the coset $`S_{\{n1\}}t_{k,n}`$, it generates, for each $`k`$, $`1kn`$.

Similary we have the left coset decomposition

$$S_n=\gamma _{\{1\}}S_{\{1\}},$$

where $`S_{\{1\}}:=S_1\times S_{n1}`$, $`\gamma _{\{1\}}=\{gS_n|g(2)<\mathrm{}<g(n)\}=\{t_{1,1},t_{1,2},\mathrm{},t_{1,n1}\}`$.

In general for $`J=\{j_1<j_2<\mathrm{}<j_{l1}\}\{1,2,\mathrm{},n1\}`$ let $`S_J`$ be the Young subgroup of $`S_n`$

$$S_J:=S_{j_1}\times S_{j_2j_1}\times \mathrm{}\times S_{nj_{l1}},S_\varphi =S_n.$$

Note that with such an indexing the Young subgroup $`S_J`$ is generated by all adjacent transpositions $`t_i=t_{i,i+1}`$, $`iJ^c`$, $`J^c=\{1,2,\mathrm{},n1\}J`$, (e.g. $`S_\varphi =S_n`$ is generated by $`t_1,\mathrm{},t_{n1}`$), and hence $`S_J`$ is the nontrivial product of the symmetric groups corresponding to the maximal components of consecutive elements in the complement $`J^c`$.

Then the following is the left coset decomposition :

$$S_n=\gamma _JS_J$$

where $`\gamma _J=\{gS_n|g(1)<g(2)<\mathrm{}<g(j_1),g(j_1+1)<\mathrm{}<g(j_2),\mathrm{},g(j_{l1}+1)<\mathrm{}<g(n)\}`$.

The definition of $`\gamma _J`$ can also be put in the following way FACT 2.2.1. $`g\gamma _Jg(1)g(2)\mathrm{}g(n)`$ is the shuffle of the sets
$`[1..j_1],[j_1+1..j_2],\mathrm{}[j_{l1}+1,n]`$ the descent set $`Des(g)=\{1in1|g(i)>g(i+1)\}`$ of $`g`$ is contained in the set $`J`$ (c.f. \[Sta, pp. 69-70\]). (Here $`[a..b]`$ denotes the set $`\{a,a+1,\mathrm{},b\}`$.)

Moreover, each $`gS_n`$ has the unique factorization $`g=a_Jg_J`$ with $`g_JS_J`$ and $`a_J\gamma _J`$ and with $`l(g)=l(a_J)+l(g_J)`$.

For arbitrary subset $`XS_n`$ we define the matrix $`\widehat{R}_\nu (X)`$ by

$$\widehat{R}_\nu (X):=\underset{gX}{}\widehat{R}_\nu (g)$$

PROPOSITION 2.2.2.  Let $`\nu `$ be a generic weight, $`|\nu |=n`$. For any subset $`J=\{j_1<j_2<\mathrm{}j_{l1}\}`$ of $`\{1,2,\mathrm{},n1\}`$ let $`A_J^{(\nu )},\mathrm{\Gamma }_J^{(\nu )}`$ be the following matrices

$$A_J^{(\nu )}=\widehat{R}_\nu (S_J),\mathrm{\Gamma }_J^{(\nu )}=\widehat{R}_\nu (\gamma _J).$$

Then the matrix $`A^{(\nu )}(=A_\varphi ^{(\nu )})`$ of the sesquilinear form $`(,)_𝐪`$ (see Prop.1.8.1) has the following factorizations

$$A^{(\nu )}=\mathrm{\Gamma }_J^{(\nu )}A_J^{(\nu )}$$

$$\mathrm{\Gamma }_J^{(\nu )}=A^{(\nu )}[A_J^{(\nu )}]^1$$

Proof. By quasimultiplicativity of $`\widehat{R}_\nu `$ and FACT 2.2.1 we have $`\widehat{R}_\nu (g)=\widehat{R}_\nu (a_J)\widehat{R}_\nu (g_J)`$. Hence $`A^{(\nu )}=\widehat{R}_\nu (S_n)=\widehat{R}_\nu (\gamma _J)\widehat{R}_\nu (S_J)=\mathrm{\Gamma }_J^{(\nu )}A_J^{(\nu )}`$.

The following formula is the Božejko-Speicher adaptation of an Euler-type character formula of Solomon. In the case $`W=S_n`$ it reads as follows : LEMMA 2.2.3.  (c.f.\[BSp2\] Lemma 2.6) Let $`w_n=n\mathrm{}\mathrm{2\hspace{0.25em}2\hspace{0.25em}1}`$ be the longest permutation in $`S_n`$. Then we have

$$\underset{J\{1,2,\mathrm{},n1\}}{}(1)^{n1|J|}\mathrm{\Gamma }_J^{(\nu )}=\widehat{R}_\nu (w_n)$$

For the reader’s convenience we include here a variant of the proof (our notation is slightly different). For any subset $`M\{1,2,\mathrm{},n1\}`$ we denote by $`\delta _M`$ the subset of $`S_n`$ consisting of all permutations $`gS_n`$ whose descent set $`Des(g)`$ is equal to M. Then by FACT 2.2.1 it is clear that $`\gamma _J=_{MJ}\delta _M`$ (disjoint union), implying that

$$\widehat{R}_\nu (\gamma _J)=\underset{MJ}{}\widehat{R}_\nu (\delta _M)$$

By the inclusion-exclusion principle we obtain

$$\widehat{R}_\nu (\delta _M)=\underset{JM}{}(1)^{|MJ|}\widehat{R}_\nu (\gamma _J)$$

By letting $`M=\{1,2,\mathrm{},n1\}(\delta _M=\{w_n\})`$ we obtain the desired identity.

By combining Prop.2.2.2. and Lemma 2.2.3 we obtain the following relation among the inverses of matrices $`A_J^{(\nu )}`$’s. PROPOSITION 2.2.4. (Long recursion for the inverse of $`A^{(\nu )}`$):  We have

$$[A^{(\nu )}]^1=(\underset{\varphi J\{1,2,\mathrm{},n1\}}{}(1)^{|J|+1}[A_J^{(\nu )}]^1)(I+(1)^n\widehat{R}_\nu (w_n))^1$$

Proof. By substituting $`\mathrm{\Gamma }_J^{(\nu )}=A^{(\nu )}[A_J^{(\nu )}]^1`$ (Prop.2.2.2) into Lemma 2.2.3 and by multiplying by $`[A^{(\nu )}]^1`$ we obtain

$`[A^{(\nu )}]^1\widehat{R}_\nu (w_n)`$ $`=`$ $`{\displaystyle \underset{J\{1,2,\mathrm{},n1\}}{}}(1)^{n1|J|}[A_J^{(\nu )}]^1`$
$`=`$ $`(1)^{n1}[A_\varphi ^{(\nu )}]^1+{\displaystyle \underset{\varphi J\{1,2,\mathrm{},n1\}}{}}(1)^{n1|J|}[A_J^{(\nu )}]^1`$
But $`A_\varphi ^{(\nu )}=A^{(\nu )}`$, so the proof follows. REMARK 2.2.5. Let us associate to each subset $`\varphi J=\{j_1<j_2<\mathrm{}<j_{l1}\}\{1,2,\mathrm{},n1\}`$ a subdivision $`\sigma (J)`$ of the set $`\{1,2,\mathrm{},n\}`$ into intervals by

$$\sigma (J)=J_1J_2\mathrm{}J_l,$$

where $`J_k=[j_{k1}+1..j_k](j_0=1,j_l=n)`$. (Here $`[a..b]`$ denotes the interval $`\{a,a+1,\mathrm{},b1,b\}`$ and abbreviate $`[a..a](=\{a\})`$ to $`[a]`$).

The Young subgroup $`S_J`$ can be written as direct product of commuting subgroups

$$S_J=S_{[1..j_1]}S_{[j_1+1..j_2]}\mathrm{}S_{[j_{l1}+1..n]}=S_{J_1}S_{J_2}\mathrm{}S_{J_l}$$

where for each interval $`I=[a..b]`$, $`1abn`$ we denote by $`S_I=S_{[a..b]}`$ the subgroup of $`S_n`$ consisting of permutations which are the identity on the complement of $`[a..b]`$ (i.e. $`S_{[a..b]}=S_1^{a1}\times S_{ba+1}\times S_1^{nb}`$). By denoting $`A_I^{(\nu )}=A_{[a..b]}^{(\nu )}:=\widehat{R}_\nu (S_{[a..b]})`$, we can rewrite the formula for $`[A^{(\nu )}]^1=[A_{[1..n]}^{(\nu )}]^1`$ in Prop.2.2.4. as follows:

$$[A_{[1..n]}^{(\nu )}]^1=(\underset{\sigma =J_1\mathrm{}J_l,l2}{}(1)^l[A_{J_1}^{(\nu )}]^1\mathrm{}[A_{J_l}^{(\nu )}]^1)(I+(1)^n\widehat{R}_\nu (w_n))^1$$
$`()`$
where the sum is over all subdivisions of the set $`\{1,2,\mathrm{},n\}`$. Similar formula we can write for $`[A_{[a..b]}^{(\nu )}]^1`$ for any nondegenerate interval $`[a..b]`$, $`1a<bn`$. Of course if $`a=b,[A_{[a..b]}^{(\nu )}]^1`$ is the identity matrix.

Now we shall use an ordering denoted by $`<`$ on the set $`\mathrm{\Sigma }_n`$ of all subdivisions of the set $`\{1,2,\mathrm{},n\}`$, called reverse refinement order, defined by $`\sigma <\sigma ^{^{}}`$ if $`\sigma ^{^{}}`$ is finer than $`\sigma `$ i.e. $`\sigma ^{^{}}`$ is obtained by subdividing each nontrivial interval in $`\sigma `$. The minimal and maximal elements in $`\mathrm{\Sigma }_n`$ are denoted by $`\widehat{0}_n(=[1..n])`$ and $`\widehat{1}_n=[1][2]\mathrm{}[n]`$. We shall call $`(\mathrm{\Sigma }_n,<)`$ the lattice of subdivisions of $`\{1,2,\mathrm{},n\}`$. For example we have
$`\mathrm{\Sigma }_1=\{[1]\},\mathrm{\Sigma }_2=\{[12],[1][2]\},\mathrm{\Sigma }_3=\{[123],[1][23],[12][3],[1][2][3]\},\mathrm{\Sigma }_4=\{[1234],[123][4],[12][34],[1][234],[12][3][4],[1][23][4],[1][2][34],[1][2][3][4]\}`$. (Here $`[1234]`$ denotes the interval $`[\mathrm{1..4}]=\{1,2,3,4\}`$ etc.)

Now for each interval $`I=[a..b],1a<bn`$ we denote by $`w_I=w_{[a..b]}:=\mathrm{1\; 2}\mathrm{}a1bb1\mathrm{}ab+1\mathrm{}n`$ the longest permutation in $`S_{[a..b]}(=S_1^{a1}\times S_{ba+1}\times S_1^{nb})`$ and by $`\mathrm{\Psi }_I^\nu =\mathrm{\Psi }_{[a..b]}^\nu ,a<b`$ the following matrix

$`\mathrm{\Psi }_I^\nu `$ $`=`$ $`\mathrm{\Psi }_{[a..b]}^\nu :=[I+(1)^{ba+1}\widehat{R}_\nu (w_{[a..b]})]^1={\displaystyle \frac{1}{\mathrm{}_{[a..b]}^\nu }}[I(1)^{ba+1}\widehat{R}_\nu (w_{[a..b]})]`$
$`=`$ $`{\displaystyle \frac{1}{\mathrm{}_I^\nu }}\mathrm{\Phi }_I^\nu ,\mathrm{\Phi }_I^\nu :=I(1)^{|I|}\widehat{R}_\nu (w_I)`$
where $`\mathrm{}_{[a..b]}^\nu `$ is the diagonal matrix (agreeing with the definition of $`\mathrm{}_T^\nu `$ given in 1.8):

$$\mathrm{}_{[a..b]}^\nu =\mathrm{}_{\{a,a+1,\mathrm{},b\}}^\nu =IQ_{\{a,a+1,\mathrm{},b\}}^\nu =I\underset{ak<lb}{}|Q_{k,l}^\nu |^2,[Q_{k,l}^\nu ]_{i_1\mathrm{}i_n,i_1\mathrm{}i_n}=q_{i_ki_l}$$

Accordingly, for each subdivision $`\sigma =I_1I_2\mathrm{}I_l\mathrm{\Sigma }_n`$ we define

$$\mathrm{\Psi }_\sigma ^\nu :=\underset{j:|I_j|2}{}\mathrm{\Psi }_{I_j}^\nu $$

and similary for any chain $`𝒞:\sigma ^{(1)}<\mathrm{}<\sigma ^{(m)}`$ in $`\mathrm{\Sigma }_n`$ we define

$$\mathrm{\Psi }_𝒞^\nu =\mathrm{\Psi }_{\sigma ^{(m)}}^\nu \mathrm{}\mathrm{\Psi }_{\sigma ^{(1)}}^\nu $$

In the same way we introduce notations $`\mathrm{}_𝒞^\nu `$ and $`\mathrm{\Phi }_𝒞^\nu `$ and observe that then

$$\mathrm{\Psi }_𝒞^\nu =\frac{1}{\mathrm{}_𝒞^\nu }\mathrm{\Phi }_𝒞^\nu $$

For example if $`𝒞:\widehat{0}_5=[12345]<[12][345]<[1][2][34][5]<\widehat{1}_5`$, then

$`\mathrm{\Psi }_𝒞^\nu `$ $`=`$ $`\mathrm{\Psi }_{\{3,4\}}^\nu (\mathrm{\Psi }_{\{1,2\}}^\nu \mathrm{\Psi }_{\{3,4,5\}}^\nu )\mathrm{\Psi }_{\{1,2,3,4,5\}}^\nu `$
$`=`$ $`{\displaystyle \frac{1}{\mathrm{}_{\{3,4\}}^\nu \mathrm{}_{\{1,2\}}^\nu \mathrm{}_{\{3,4,5\}}^\nu \mathrm{}_{\{1,2,3,4,5\}}^\nu }}\mathrm{\Phi }_{\{3,4\}}^\nu \mathrm{\Phi }_{\{1,2\}}^\nu \mathrm{\Phi }_{\{3,4,5\}}^\nu \mathrm{\Phi }_{\{1,2,3,4,5\}}^\nu ,`$
for any generic weight $`\nu ,|\nu |=5`$.

Now we can state our first explicit formula for the inverse of $`A^{(\nu )}`$ in terms of the involutions $`w_I=w_{[a..b]},1a<bn`$. THEOREM 2.2.6.  Let $`\nu `$ be a generic weight, $`|\nu |=n`$. Then

$$[A^{(\nu )}]^1=\underset{𝒞}{}(1)^{b_+(𝒞)+n1}\mathrm{\Psi }_𝒞^\nu =\underset{𝒞}{}\frac{(1)^{b_+(𝒞)+n1}}{\mathrm{}_𝒞^\nu }\mathrm{\Phi }_𝒞^\nu $$

where the summation is over all chains $`𝒞:\widehat{0}_n=\sigma ^{(0)}<\sigma ^{(1)}\mathrm{}<\sigma ^{(m)}<\widehat{1}_n`$ in the subdivision lattice $`\mathrm{\Sigma }_n`$ and where $`b_+(𝒞)`$ denotes the total number of nondegenerate intervals appearing in members of $`𝒞`$. Proof. The formula follows by iterating the formula (\*) in Remark 2.2.5. REMARK 2.2.7. If we represent chains $`𝒞:\widehat{0}_n=\sigma ^{(0)}<\sigma ^{(1)}<\mathrm{}<\sigma ^{(m1)}<\widehat{1}_n`$ of length $`m1`$ as generalized bracketing (of depth $`m`$) of the word $`12\mathrm{}n`$ with one pair of brackets for each nondegenerate interval appearing in the members of $`𝒞`$ (e.g. $`\widehat{0}_5=[12345]<[12][345]<[1][2][34][5]<\widehat{1}_5`$ is represented as $`[[12][[34]5]]`$), then we can write the formula in Thm.2.2.6 as

$$[A^{(\nu )}]^1=\underset{\beta }{}(1)^{b(\beta )+n1}\mathrm{\Psi }_\beta ^\nu =\underset{\beta }{}\frac{(1)^{b(\beta )+n1}}{\mathrm{}_\beta ^\nu }\mathrm{\Phi }_\beta ^\nu $$

where the sum is over all generalized bracketings of the word $`12\mathrm{}n`$ and where $`b(\beta )`$ denotes the number of pairs of brackets in $`\beta `$ and where $`\mathrm{\Psi }_\beta ^\nu :=\mathrm{\Psi }_𝒞^\nu `$, $`\mathrm{\Phi }_\beta ^\nu :=\mathrm{\Phi }_𝒞^\nu `$, $`\mathrm{}_\beta ^\nu :=\mathrm{}_𝒞^\nu `$ if $`\beta `$ is associated to the (unique!) chain $`𝒞`$ in $`\mathrm{\Sigma }_n`$ (e.g. $`\mathrm{\Psi }_{[[12][[34]5]]}^\nu =\mathrm{\Psi }_{[\mathrm{3..4}]}^\nu (\mathrm{\Psi }_{[\mathrm{1..2}]}^\nu \mathrm{\Psi }_{[\mathrm{3..5}]}^\nu )\mathrm{\Psi }_{[\mathrm{1..5}]}^\nu =\mathrm{\Psi }_{[\mathrm{1..2}]}^\nu \mathrm{\Psi }_{[\mathrm{3..4}]}^\nu \mathrm{\Psi }_{[\mathrm{3..5}]}^\nu \mathrm{\Psi }_{[\mathrm{1..5}]}^\nu `$
$`={\displaystyle \frac{1}{\mathrm{}_{\{1,2\}}^\nu \mathrm{}_{\{3,4\}}^\nu \mathrm{}_{\{3,4,5\}}^\nu \mathrm{}_{\{1,2,3,4,5\}}^\nu }}(I\widehat{R}_\nu (w_{[\mathrm{1..2}]}))(I\widehat{R}_\nu (w_{[\mathrm{3..4}]}))(I+\widehat{R}_\nu (w_{[\mathrm{3..5}]}))(I+\widehat{R}_\nu (w_{[\mathrm{1..5}]}))`$ .

In particular for Example 1.6.3 ($`I=\{1,2,3\},\nu _1=\nu _2=\nu _3=1`$) we have

$`[A^{123}]^1`$ $`=`$ $`\mathrm{\Psi }_{[123]}+\mathrm{\Psi }_{[[12]3]}+\mathrm{\Psi }_{[1[23]]}=`$
$`=`$ $`{\displaystyle \frac{1}{\mathrm{}_{\{1,2,3\}}}}(I\widehat{R}_{123}(321))+{\displaystyle \frac{1}{\mathrm{}_{\{1,2\}}\mathrm{}_{\{1,2,3\}}}}(I+\widehat{R}_{123}(213))(I\widehat{R}_{123}(321))+`$
$`+`$ $`{\displaystyle \frac{1}{\mathrm{}_{\{2,3\}}\mathrm{}_{\{1,2,3\}}}}(I+\widehat{R}_{123}(132))(I\widehat{R}_{123}(321)).`$
Similary for $`I=\{1,2,3,4\},\nu _1=\nu _2=\nu _3=\nu _4=1`$ we have

$`[A^{1234}]^1`$ $`=`$ $`\mathrm{\Psi }_{[1234]}\mathrm{\Psi }_{[1[234]]}\mathrm{\Psi }_{[12[34]]}\mathrm{\Psi }_{[1[23]4]}\mathrm{\Psi }_{[[12]34]}\mathrm{\Psi }_{[[123]4]}+`$
$`+`$ $`\mathrm{\Psi }_{[[12][34]]}+\mathrm{\Psi }_{[[[12]3]4]}+\mathrm{\Psi }_{[[1[23]]4]}+\mathrm{\Psi }_{[1[[23]4]]}+\mathrm{\Psi }_{[1[2[34]]]}`$
(Here we suppresed the upper indices in $`\mathrm{\Psi }_\beta ^{123}`$ and $`\mathrm{\Psi }_\beta ^{1234}`$). COROLLARY 2.2.8. (EXTENDED ZAGIER’S CONJECTURE):  For $`\nu `$ generic, $`|\nu |=n`$, for the inverse of the matrix $`A^{(\nu )}=A^{(\nu )}(𝐪)`$ we have

$$[A^{(\nu )}]^1\frac{1}{\mathrm{}^\nu }Mat_{n!}(Z[q_{ij}])$$
$`i)`$
where $`\mathrm{}^\nu `$ is the following diagonal matrix

$$\mathrm{}^\nu :=\underset{1a<bn}{}\mathrm{}_{[a..b]}^\nu =\underset{1a<bn}{}(IQ_{[a..b]}^\nu )=\underset{1a<bn}{}(I\underset{aklb}{}Q_{k,l}^\nu )$$

$$[A^{(\nu )}]^1\frac{1}{d_\nu }Mat_{n!}(Z[q_{ij}])$$
$`i^{})`$
where $`d_\nu `$ is the following quantity

$$d_\nu :=\underset{\mu \nu ,|\mu |2}{}\mathrm{}_\mu =\underset{\mu \nu ,|\mu |2}{}(1q_\mu )=\underset{\mu \nu ,|\mu |2}{}(1\underset{ij\mu }{}q_{ij})$$

($`\mathrm{}_\mu `$ and $`q_\mu `$ are the same as in Lemma 1.9.1).

In particular when all $`q_{ij}=q`$ (Zagier’s case) we have from i):

$$[A^\nu (q)]^1\frac{1}{\delta _n(q)}Mat_{n!}(Z[q])$$
$`ii)`$
where

$$\delta _n(q)=\underset{1a<bn}{}(1q^{(ba+1)(ba)})=\underset{k=2}{\overset{n}{}}(1q^{k(k1)})^{nk+1}$$

Proof. i) follows from Thm 2.2.6 by taking the common denominator which turns out to be $`\mathrm{}^\nu =_{1a<bn}\mathrm{}_{[a..b]}^\nu `$ because any $`\mathrm{}_{[a..b]}^\nu `$ appears at most once in each of the denominators $`\mathrm{}_𝒞^\nu `$ (and actually appears in at least one of them).
i’) The entries of $`\mathrm{}^\nu `$ are zero or $`\mathrm{}_{𝐢,𝐢}^\nu `$ where $`𝐢=i_1\mathrm{}i_n`$ is any permutation of $`\nu `$ $`(|𝐢|=\nu )`$ considered as a subset of $`I`$ (because $`\nu `$ is generic!). Since

$`\mathrm{}_{𝐢,𝐢}^\nu `$ $`=`$ $`{\displaystyle \underset{1a<bn}{}}(1{\displaystyle \underset{aklb}{}}q_{i_ki_l})`$
$`=`$ $`{\displaystyle \underset{1a<bn}{}}(1q_{\{i_a,i_{a+1},\mathrm{},i_b\}})={\displaystyle \underset{1a<bn}{}}\mathrm{}_{\{i_a,i_{a+1},\mathrm{},i_b\}}`$
we see that $`\mathrm{}_{𝐢,𝐢}^\nu `$ divides $`d_\nu `$.
ii) Note that in case all $`q_{ij}=q`$:

$`\mathrm{}_{𝐢,𝐢}^\nu `$ $`=`$ $`{\displaystyle \underset{1a<bn}{}}(1{\displaystyle \underset{aklb}{}}q)=`$
$`=`$ $`{\displaystyle \underset{1a<bn}{}}(1q^{(ba+1)(ba)})={\displaystyle \underset{k=2}{\overset{n}{}}}(1q^{k(k1)})^{nk+1}=\delta _n(q).`$
This completes the proof of the Extended Zagier’s conjecture. REMARK 2.2.9. In \[Zag\] p.201 Zagier conjectured that $`A_n(q)^1\frac{1}{\mathrm{}_n}Mat_{n!}(Z[q])`$, where $`\mathrm{}_n:=_{k=2}^n(1q^{k(k1)})`$ and checked this conjecture for $`n5`$. But we found that this conjecture failed for $`n=8`$ (see Examples to Prop.2.2.18). It seems that our statement in Corollary 2.2.8 ii) is the right form of a conjecture valid for all $`n`$ when all $`q_{ij}`$ are equal. PROPOSITION 2.2.10.  Let $`c_n`$ be the number $`\widehat{0}_n\widehat{1}_n`$ chains in the subdivision lattice $`\mathrm{\Sigma }_n`$ (i.e. the number of $`\mathrm{\Psi }`$-terms in the formula for $`[A^{(\nu )}]^1`$ $`\nu `$ generic, $`|\nu |=n`$ in Thm.2.2.6 ), $`c_0:=0,c_1:=1`$. Then

$$C(t)=\underset{n0}{}c_nt^n=\frac{1}{4}(1+t\sqrt{16t+t^2})=t+t^2+3t^3+11t^4+45t^5+197t^6+\mathrm{}$$

Proof. By Remark 2.2.7 this counting is equivalent to the Generalized bracketing problem of Schröder (1870) (see \[Com\], p.56).

By expanding the root $`(1+u)^{1/2},u=6t+t^2`$ we obtain

$$c_n=\underset{0\nu n/2}{}(1)^\nu \frac{(2n2\nu 3)!!}{\nu !(n2\nu )!}3^{n2\nu }2^{\nu 2}$$

Another formula follows by applying the Lagrange inversion to $`\stackrel{~}{C}=\frac{1+2t\stackrel{~}{C}^2}{1+t}`$, where $`C=t\stackrel{~}{C}`$ :

$$c_n=\underset{\nu =0}{\overset{n1}{}}(1)^{n1\nu }\frac{2^\nu }{2\nu +1}\left(\begin{array}{c}2\nu +1\\ \nu \end{array}\right)\left(\begin{array}{c}n+\nu 1\\ n\nu 1\end{array}\right)$$

In fact, the numbers $`c_n`$ can be computed faster via linear reccurence relation (following from the fact that $`C(t)`$ is algebraic ):

$$(n+1)c_{n+1}=3(2n1)c_n(n2)c_{n1},n2,c_1=c_2=1.$$

Finally, we note that the numbers $`q_n=2c_n`$, $`n2`$, $`q_1=1`$, $`q_2=2`$ have yet another interpretation as the numbers of underdiagonal (except at the ends) paths from $`(0,0)`$ to $`(n,n)`$ with step set $`\{(1,0),(0,1),(1,1)\}`$ (c.f. \[Com\], p.81).

¿From this interpretation we get

$$c_n=\underset{r=0}{\overset{n1}{}}\frac{1}{2n1r}\left(\begin{array}{c}2n1r\\ r,nr,nr1\end{array}\right)$$

(cf. \[Mo\], p.20).

Now we turn our attention to the computation of entries in the inverse of $`A^{(\nu )}`$, $`\nu `$ generic. First we note that any $`n!\times n!`$ matrix $`A`$ can be written as

$$A=\underset{gS_n}{}A(g)R_n(g)$$

where $`A(g)`$ are diagonal matrices defined by $`A(g)_{𝐢,𝐢}=A_{𝐢,g^1𝐢}`$ (all $`𝐢`$) ($`R_n(g)`$ is the right regular representation matrix $`R_n(g)_{𝐢,𝐣}=\delta _{𝐢,g𝐣}`$, c.f. 1.8).

We call $`A(g)`$ the g-th diagonal of $`A`$.

Hence, if we write

$`A^{(\nu )}`$ $`=`$ $`{\displaystyle \underset{gS_n}{}}A^{(\nu )}(g)R_\nu (g),`$
$`[A^{(\nu )}]^1`$ $`=`$ $`{\displaystyle \underset{gS_n}{}}[A^{(\nu )}]^1(g)R_\nu (g)`$
then by Prop.1.8.1 (in case $`\nu `$ generic ) we have

$$A^{(\nu )}(g)=Q^\nu (g)=\underset{(a,b)I(g^1)}{}Q_{a,b}^\nu ;(Q_{a,b}^\nu )_{𝐢,𝐢}=q_{i_ai_b}$$

In order to compute $`[A^{(\nu )}]^1(g)`$ we first write

$$[A^{(\nu )}]^1(g)=\mathrm{\Lambda }^\nu (g)A^{(\nu )}(g)$$

where $`\mathrm{\Lambda }^\nu (g)`$ are yet unknown diagonal matrices.

Similary, for each subset $`\mathrm{}J=\{j_1<j_2<\mathrm{}<j_{l1}\}\{1,2,\mathrm{},n1\}`$ we write

$$[A_J^{(\nu )}]^1(g)=\mathrm{\Lambda }_J^\nu (g)A_J^{(\nu )}(g)$$

and for any segment $`I=[a..b]\{1,2,\mathrm{},n\}`$

$$[A_I^{(\nu )}]^1(g)=\mathrm{\Lambda }_I^\nu (g)A_I^{(\nu )}(g)$$

where $`\mathrm{\Lambda }_J^\nu (g)`$ and $`\mathrm{\Lambda }_I^\nu (g)`$ are unknown diagonal matrices.

If $`\sigma (J)=J_1J_2\mathrm{}J_l`$ is the subdivision of $`\{1,2,\mathrm{},n\}`$ (cf. Remark 2.2.5) associated to $`J`$, and if $`g=g_1g_2\mathrm{}g_lS_J=S_{J_1}S_{J_2}\mathrm{}S_{J_l}`$, then $`\mathrm{\Lambda }_J^\nu (g)=\mathrm{\Lambda }_{J_1}^\nu (g_1)\mathrm{}\mathrm{\Lambda }_{J_l}^\nu (g_l)`$.

Let us denote by $`S_n^>`$ (resp. $`S_n^<`$) the subset of $`S_n`$ of all elements $`g`$ such that $`g(1)>g(n)`$ (resp. $`g(1)<g(n)`$). It is evident that $`S_n^<=S_n^>w_n`$, $`S_n^>=S_n^<w_n`$, where $`w_n=nn1\mathrm{}21`$. PROPOSITION 2.2.11.  The diagonal matrices $`\mathrm{\Lambda }^\nu (g)`$ are real and satisfy the following recurrences :
i) $`\mathrm{\Lambda }^\nu (g)=(1)^{n1}|Q^\nu (gw_n)|^2\mathrm{\Lambda }^\nu (gw_n)`$, if $`gS_n^>`$
ii) $`\mathrm{\Lambda }^\nu (g)=\mathrm{\Lambda }_{[1..n]}^\nu (g)={\displaystyle \frac{1}{\mathrm{}_{[1..n]}^\nu }}{\displaystyle \underset{\mathrm{}J\{1,2,\mathrm{},n1\},gS_J}{}}(1)^{|J|+1}\mathrm{\Lambda }_J^\nu (g)`$, if $`gS_n^<`$
ii’) $`\mathrm{\Lambda }^\nu (g)={\displaystyle \frac{1}{\mathrm{}_{[1..n]}^\nu }}{\displaystyle \underset{g=g^{^{}}g^{^{\prime \prime }}S_k\times S_{nk},1kn1}{}}(Q_{[1..k]}^\nu )^{[g(1)<g(k)]}\mathrm{\Lambda }_{[1..k]}^\nu (g^{^{}})\mathrm{\Lambda }_{[k+1..n]}^\nu (g^{^{\prime \prime }})`$,
if $`gS_n^<`$.

In particular, $`[A^{(\nu )}]^1(g)=[A^{(\nu )}]^1(gw_n)=0`$ if both $`g`$ and $`gw_n`$ are not splittable, i.e. if the minimal Young subgroup containing g (resp. $`gw_n`$) is equal to $`S_n`$. Proof. By substituting the formula $`(I+(1)^n\widehat{R}_\nu (w_n))^1=\frac{1}{\mathrm{}_{[1..n]}^\nu }(I(1)^n\widehat{R}_\nu (w_n))`$ into formula for $`[A^{(\nu )}]^1`$ in Prop.2.2.4 we see immediately that for $`gS_n^<`$

$$[A^{(\nu )}]^1(g)=\underset{\varphi J\{1,2,\mathrm{},n1\}}{}(1)^{|J|+1}[A_J^{(\nu )}]^1(g)\frac{1}{\mathrm{}_{[1..n]}^\nu }$$
$`()`$
(Here we use the fact that $`A_J^{(\nu )}=_{gS_J}\widehat{R}_\nu (g)`$ has the inverse of the form $`[A_J^{(\nu )}]^1=_{gS_J}\mathrm{\Lambda }_J^\nu (g)\widehat{R}_\nu (g)`$ and that $`gS_J,J\varphi g(1)<g(n)`$ and $`gw_n(1)>gw_n(n)`$.)

Then for $`gS_n^>`$, again by Prop.2.2.4, we have

$$[A^{(\nu )}]^1(g)\widehat{R}_\nu (g)=[A^{(\nu )}]^1(gw_n)\widehat{R}_\nu (gw_n)(1)^{n1}\widehat{R}_\nu (w_n)$$

implying that

$`\mathrm{\Lambda }^\nu (g)\widehat{R}_\nu (g)`$ $`=`$ $`(1)^{n1}\mathrm{\Lambda }^\nu (gw_n)\widehat{R}_\nu (gw_n)\widehat{R}_\nu (w_n)`$
$`=`$ $`(1)^{n1}\mathrm{\Lambda }^\nu (gw_n)|Q^\nu (gw_n)|^2\widehat{R}_\nu (g)`$
by Property 3.ii) from 1.8. Thus i) is proved.

The property ii) is immediate from (\*) because $`[A_J^\nu ]^1(g)0gS_J`$. To prove ii’) we shall use the following LEMMA 2.2.12. (Short recursion for the inverse of $`A^{(\nu )}`$):  We have

$$[A^{(\nu )}]^1=(\underset{k=1}{\overset{n1}{}}(1)^{k1}[A_{\{k\}}^{(\nu )}]^1\widehat{R}_\nu (w_{[1..k]})(I+(1)^n\widehat{R}_\nu (w_n))^1$$

where $`A_{\{k\}}^{(\nu )}=\widehat{R}_\nu (S_k\times S_{nk})`$ is just $`A_J^{(\nu )}`$ when $`J=\{k\}`$. Proof of Lemma 2.2.12. For fixed $`k`$, $`1kn1`$ we write every subset $`J=\{j_1<\mathrm{}<j_{l2}<j_{l1}=k\}`$ as $`J^{^{}}\{k\}`$ where $`J^{^{}}=\{j_1<\mathrm{}j_{l2}\}\{1,2,\mathrm{},k1\}`$. Then

$$A_J^{(\nu )}=\widehat{R}_\nu (S_J^{^{}}\times \mathrm{𝟏}_{nk})\widehat{R}_\nu (\mathrm{𝟏}_k\times S_{nk})$$

Now we compute
$`_{maxJ=k}(1)^{|J|+1}[A_J^{(\nu )}]^1=_{J^{^{}}\{1,2,\mathrm{},k1\}}(1)^{|J^{^{}}|}\widehat{R}_\nu (S_J^{^{}}\times \mathrm{𝟏}_{nk})^1\widehat{R}_\nu (\mathrm{𝟏}_k\times S_{nk})^1`$
$`=((1)^{k1}\widehat{R}_\nu (S_k\times \mathrm{𝟏}_{nk})^1\widehat{R}_\nu (w_{[1..k]}))\widehat{R}_\nu (\mathrm{𝟏}_k\times S_{nk})^1`$ (by the Proof of Prop.2.2.4)
$`=(1)^{k1}[\widehat{R}_\nu (S_k\times \mathrm{𝟏}_{nk})\widehat{R}_\nu (\mathrm{𝟏}_k\times S_{nk})]^1\widehat{R}_\nu (w_{[1..k]})`$
$`=(1)^{k1}[A_{\{k\}}^{(\nu )}]^1\widehat{R}_\nu (w_{[1..k]})`$
By summing over $`k`$, $`1kn1`$ and substituting into Prop.2.2.4 we are done.

Now we prove ii’). Let $`gS_n^<`$. Then by substituting the formula $`(I+(1)^n\widehat{R}_\nu (w_n))^1=\frac{1}{\mathrm{}_{[1..n]}^\nu }(I(1)^n\widehat{R}_\nu (w_n))`$ into Lemma 2.2.12 and comparing the terms involving $`\widehat{R}_\nu (g)`$ in both sides we get

$$\begin{array}{ccc}& & [A^{(\nu )}]^1(g)R_\nu (g)=\mathrm{\Lambda }^\nu (g)\widehat{R}_\nu (g)\hfill \\ & & =\underset{1kn1}{}(1)^{k1}[A_{\{k\}}^{(\nu )}]^1(gw_{[1..k]})R_\nu (gw_{[1..k]})\widehat{R}_\nu (w_{[1..k]})\hfill \\ & & =\underset{1kn1,g=g^{^{}}g^{^{\prime \prime }}S_k\times S_{nk}}{}(1)^{k1}\mathrm{\Lambda }_{\{k\}}^\nu (g^{^{}}w_{[1..k]}g^{^{\prime \prime }})\widehat{R}_\nu (g^{^{}}w_{[1..k]}g^{^{\prime \prime }})\widehat{R}_\nu (w_{[1..k]})\hfill \\ & & =\underset{1kn1,g=g^{^{}}g^{^{\prime \prime }}S_k\times S_{nk}}{}(1)^{k1}\mathrm{\Lambda }_{[1..k]}^\nu (g^{^{}}w_{[1..k]})\mathrm{\Lambda }_{[k+1..n]}^\nu (g^{^{\prime \prime }})|Q(g^{^{}}w_{[1..k]})|^2\widehat{R}_\nu (g^{^{}}g^{^{\prime \prime }})\hfill \end{array}$$
$`()`$
(by Prop.1.8.2).

Now, if $`g^{^{}}(1)<g^{^{}}(k)`$ then $`g^{^{}}w_{[1..k]}(1)>g^{^{}}w_{[1..k]}(k)`$ so by i) we have

$$\mathrm{\Lambda }_{[1..k]}^\nu (g^{^{}}w_{[1..k]})=(1)^{k1}|Q^\nu (g^{^{}})|^2\mathrm{\Lambda }_{[1..k]}^\nu (g^{^{}}).$$

Then $`(1)^{k1}\mathrm{\Lambda }_{[1..k]}^\nu (g^{^{}}w_{[1..k]})|Q^\nu (g^{^{}}w_{[1..k]})|^2=|Q^\nu (w_{[1..k]})|^2\mathrm{\Lambda }^\nu (g^{^{}})`$. Similary, if $`g^{^{}}(1)>g^{^{}}(k)`$ then $`g^{^{}}w_{[1..k]}(1)>g^{^{}}w_{[1..k]}(k)`$, so by i) we have $`(1)^{k1}\mathrm{\Lambda }_{[1..k]}^\nu (g^{^{}}w_{[1..k]})|Q^\nu (g^{^{}}w_{[1..k]})|^2=\mathrm{\Lambda }^\nu (g^{^{}})`$. By substituting these two formulas into $`()`$ we get

$$\mathrm{\Lambda }_{[1..n]}^\nu (g)=\frac{1}{\mathrm{}_{[1..n]}^\nu }\underset{1kn1,g=g^{^{}}g^{^{\prime \prime }}S_k\times S_{nk}}{}|Q^\nu (w_{[1..k]})|^{2[g^{^{}}(1)<g^{^{}}(k)]}\mathrm{\Lambda }_{[1..k]}^\nu (g^{^{}})\mathrm{\Lambda }_{[k+1..n]}^\nu (g^{^{\prime \prime }}).$$

Finally we use that $`|Q^\nu (w_{[1..k]})|^2=_{1a<bk}Q_{\{a,b\}}^\nu =Q_{\{1,2,\mathrm{},k\}}^\nu =Q_{[1..k]}^\nu `$. This completes the proof of Proposition 2.2.11. COROLLARY 2.2.13.  With notations of Remark 2.2.7 and Proposition 2.2.11 we have the following formulas for the diagonal entries of the inverse of $`A^\nu `$, $`\nu `$ generic, $`|\nu |=n`$.

$$[A^{(\nu )}]^1(id)=\underset{\beta }{}\frac{(1)^{b(\beta )+n1}}{\mathrm{}_\beta ^\nu }$$
$`i)`$
where the sum is over all generalized bracketings $`\beta `$ of the word $`12\mathrm{}n`$, which have outer brackets.

$$[A^{(\nu )}]^1(id)=\frac{1}{\mathrm{}_{[1..n]}^\nu }\underset{\beta }{}\frac{Q_\beta ^\nu }{\mathrm{}_\beta ^\nu }$$
$`i^{})`$
where the sum is over all generalized bracketings $`\beta `$ of the word $`12\mathrm{}n`$, which don’t have outer brackets and where $`Q_\beta ^\nu `$ is defined, analogously as $`\mathrm{}_\beta ^\nu `$, to be the product of $`Q_{[a..b]}^\nu `$ over all bracket pairs in $`\beta `$. Proof. i) follows from Remark 2.2.7 because $`\widehat{R}_\nu `$-terms contribute only to nondiagonal entries .
i’) follows by iterating Proposition 2.2.11 $`ii)^{^{}}`$ in the case $`g=id`$ and using that $`[A^{(\nu )}]^1(id)=\mathrm{\Lambda }^\nu (id)A^{(\nu )}(id)=\mathrm{\Lambda }^\nu (id)Q^\nu (id)=\mathrm{\Lambda }^\nu (id)`$.

In particular if $`I=\{1,2\},\nu _1=\nu _2=1`$, we have $`\mathrm{\Lambda }^{12}(id)=[A^{12}]^1(id)=\frac{1}{\mathrm{}_{\{1,2\}}}`$.

In Example 1.6.3 ($`I=\{1,2,3\},\nu _1=\nu _2=\nu _3=1`$) we have

$`\mathrm{\Lambda }^{123}(id)=[A^{123}]^1(id)`$ $`=`$ $`{\displaystyle \frac{1}{\mathrm{}_{\{1,2,3\}}}}+{\displaystyle \frac{1}{\mathrm{}_{\{1,2\}}\mathrm{}_{\{1,2,3\}}}}+{\displaystyle \frac{1}{\mathrm{}_{\{2,3\}}\mathrm{}_{\{1,2,3\}}}}`$
$`=`$ $`{\displaystyle \frac{1}{\mathrm{}_{\{1,2,3\}}}}(1+{\displaystyle \frac{Q_{\{1,2\}}}{\mathrm{}_{\{1,2\}}}}+{\displaystyle \frac{Q_{\{2,3\}}}{\mathrm{}_{\{2,3\}}}})`$
Similarly for $`I=\{1,2,3,4\},\nu _1=\nu _2=\nu _3=\nu _4=1`$ we have

$`\mathrm{\Lambda }^{1234}(id)`$ $`=`$ $`[A^{1234}]^1(id)=`$
$`=`$ $`{\displaystyle \frac{1}{\mathrm{}_{1234}}}\{1{\displaystyle \frac{1}{\mathrm{}_{12}}}{\displaystyle \frac{1}{\mathrm{}_{23}}}{\displaystyle \frac{1}{\mathrm{}_{34}}}+{\displaystyle \frac{1}{\mathrm{}_{12}\mathrm{}_{34}}}`$
$`+`$ $`(1+{\displaystyle \frac{1}{\mathrm{}_{12}}}+{\displaystyle \frac{1}{\mathrm{}_{23}}}){\displaystyle \frac{1}{\mathrm{}_{123}}}+(1+{\displaystyle \frac{1}{\mathrm{}_{23}}}+{\displaystyle \frac{1}{\mathrm{}_{34}}}){\displaystyle \frac{1}{\mathrm{}_{234}}}\}`$
$`=`$ $`{\displaystyle \frac{1}{\mathrm{}_{1234}}}\{1+{\displaystyle \frac{Q_{12}}{\mathrm{}_{12}}}+{\displaystyle \frac{Q_{23}}{\mathrm{}_{23}}}+{\displaystyle \frac{Q_{34}}{\mathrm{}_{34}}}+{\displaystyle \frac{Q_{12}Q_{34}}{\mathrm{}_{12}\mathrm{}_{34}}}`$
$`+`$ $`(1+{\displaystyle \frac{Q_{12}}{\mathrm{}_{12}}}+{\displaystyle \frac{Q_{23}}{\mathrm{}_{23}}}){\displaystyle \frac{Q_{123}}{\mathrm{}_{123}}}+(1+{\displaystyle \frac{Q_{23}}{\mathrm{}_{23}}}+{\displaystyle \frac{Q_{34}}{\mathrm{}_{34}}}){\displaystyle \frac{Q_{234}}{\mathrm{}_{234}}}\}`$
(Here we abbreviated $`Q_{\{1,2\}},Q_{\{2,3,4\}}`$ to $`Q_{12},Q_{234}`$ etc.).

If we take all $`q_{ij}=q`$ (Zagier’s case), then we obtain easily that

$$[A_3(q)]^1(id)=\frac{1+q^2}{(1q^2)(1q^6)}I$$

$$[A_4(q)]^1(id)=\frac{1+2q^2+q^4+2q^6+q^8}{(1q^2)(1q^6)(1q^{12})}I$$

which agree with Zagier’s computations. REMARK 2.2.14. The formula i’) in Corollary 2.2.13 can be interpreted also as a regular language expression for closed walks in the weighted digraph (a Markov chain) $`𝒟^\nu `$ on the symmetric group $`S_n`$ where the adjacency matrix $`A(𝒟^\nu )`$ is given by nondiagonal entries of $`A^{(\nu )}`$ multiplied by -1, i.e. $`A(𝒟^\nu )=(A^{(\nu )}I)`$. Then the walk generating matrix function of $`𝒟^\nu `$ is nothing but the inverse of $`A^{(\nu )}`$ because $`W(𝒟^\nu )=(IA(𝒟^\nu ))^1=[A^{(\nu )}]^1`$. For example, we have

$`W(𝒟^{123})_{closed}`$ $`=`$ $`[A^{123}]^1(id)=Q_{\{1,2,3\}}^{}(I+Q_{\{1,2\}}^++Q_{\{2,3\}}^+)`$
$`W(𝒟^{1234})_{closed}`$ $`=`$ $`[A^{1234}]^1(id)=Q_{[\mathrm{1..4}]}^{}\{1+Q_{[\mathrm{1..2}]}^++Q_{[\mathrm{2..3}]}^++Q_{[\mathrm{3..4}]}^++Q_{[\mathrm{1..2}]}^+Q_{[\mathrm{3..4}]}^+`$
$`+`$ $`(1+Q_{[\mathrm{1..2}]}^++Q_{[\mathrm{2..3}]}^+)Q_{[\mathrm{1..3}]}^++(1+Q_{[\mathrm{2..3}]}^++Q_{[\mathrm{3..4}]}^+)Q_{[\mathrm{2..4}]}^+\}`$
in the familiar formal language notation ($`x^{}=\frac{1}{1x},x^+=\frac{x}{1x}`$). REMARK 2.2.15. Besides the formulas for $`c_n=`$ total number of $`\mathrm{\Psi }_𝒞`$-terms in the formula for $`[A^{(\nu )}]^1`$ (Theorem 2.2.6)$`=`$ total number of $`\mathrm{}_\beta ^\nu `$-terms in the formula for $`[A^{(\nu )}]^1(id)`$ (Corollary 2.2.13 ) we can also give the formulas for the numbers $`c_{n,k}:=Card𝒞_{n,k}`$ ($`n2,1kn1`$ or $`n=1`$ and $`k=0`$) where $`𝒞_{n,k}:=`$all generalized bracketings of the word $`12\mathrm{}n`$ which have outer brackets (surrounding the entire word $`12\mathrm{}n`$), having all together k pairs of brackets, if $`n2`$.
(i.e. $`c_{n,k}=`$ number of terms in $`[A^{(\nu )}]^1(id)`$ having k $`\mathrm{}`$-factors).

For example $`c_{3,1}=1,c_{3,2}=2,c_{4,1}=1,c_{4,2}=5,c_{4,3}=5`$. LEMMA 2.2.16. We have
i)

$$C(t,z)=t+\underset{n2,1kn1}{}c_{n,k}t^nz^k=\frac{1+t\sqrt{(1t)^24tz}}{2(1+z)}$$

ii)

$$c_{n,k}=\frac{1}{n}\left(\begin{array}{c}n+k1\\ k\end{array}\right)\left(\begin{array}{c}n2\\ k1\end{array}\right),n2,1kn1,c_{1,0}=1.$$

Proof. We first observe that each bracketing $`\beta 𝒞_{n,k}`$ can be viewed as a word $`w=w(\beta )\{x,y,\overline{y}\}^{}`$ (by replacing each left bracket $`[`$ by y, each right bracket $`]`$ by $`\overline{y}`$ and each of the letters $`1,2,\mathrm{},n`$ by $`x`$) such that $`|w|_y=k,|w|_x=n`$. Then for the language $`𝒞=𝒞^{^{}}+𝒞^{^{\prime \prime }}`$ where $`𝒞^{^{}}:=𝒞_{1,0}=x,𝒞^{^{\prime \prime }}=_{n2,1kn1}𝒞_{n,k}`$ we obtain the following language equation

$$𝒞=x+y𝒞𝒞^+\overline{y}$$
$`()`$
where for any alphabet $`A`$ we denote by $`A^+`$ the set of all nonempty words over A, i.e. $`A^+=A+A^2+A^3+\mathrm{}=\frac{A}{1A}`$. By letting $`x=t,y=z,\overline{y}=1`$, where t and z commute we obtain from (\*) the following quadratic equation for the corresponding generating function $`C=C(t,z)=t+_{n2,kn1}c_{n,k}t^nz^k`$:

$$(1+z)C^2(1+t)C+t=0$$

from which i) follows immediately.

The formula ii) for the coefficients $`c_{n,k}`$ follows by Lagrange inversion applied to the following (equivalent) equation for $`C`$:

$$C=\frac{t}{1z\frac{C}{1C}}$$

(Note that Lagrange inversion applied to $`C=\frac{t+(1+z)C^2}{1+t}`$ would give a refinement of the second formula for $`c_n`$ (see Prop. 2.2.10) with $`2^\nu `$ replaced by $`\left(\genfrac{}{}{0pt}{}{\nu }{k+1}\right)`$, but our formula in ii) is shorter). This proves the Lemma.

Note that $`c_{n,n1}=\frac{1}{n}\left(\genfrac{}{}{0pt}{}{2n2}{n1}\right)`$ is just the n-th Catalan number (cf. \[Com\].p.53) COROLLARY 2.2.17.  The numbers $`c_{n,k}`$ of terms in $`[A^{(\nu )}]^1(id)`$ ($`\nu `$ generic, $`|\nu |=n`$) having k $`\mathrm{}`$-factors (in Corollary 2.2.13) or the numbers of regular expression monomials of degree k in $`W(𝒟^{(\nu )})_{closed}`$ (in Remark 2.2.14) are the coefficients of the following Catalan-Schröder polynomials :

$$P_n(z)=\underset{k=1}{\overset{n1}{}}\frac{1}{n}\left(\begin{array}{c}n+k1\\ k\end{array}\right)\left(\begin{array}{c}n2\\ k1\end{array}\right)z^k,n2,P_1(z)=1$$

i.e. $`c_{n,k}=[z^k]P_n(z)`$.

Note that $`c_n=P_n(1)=_{k=1}^{n1}\frac{1}{n}\left(\genfrac{}{}{0pt}{}{n+k1}{k}\right)\left(\genfrac{}{}{0pt}{}{n2}{k1}\right)`$ is yet another formula for number $`c_n`$ of $`\widehat{0}_n\widehat{1}_n`$ chains in the subdivision lattice $`\mathrm{\Sigma }_n`$.

Now we turn our attention to computing a general entry of the inverse of $`A^\nu `$, $`\nu `$ generic, $`|\nu |=n`$.

Let $`gS_n^<`$(i.e. $`g(1)<g(n)`$) be given. Let $`J(g)=\{j_1<j_2<\mathrm{}<j_{n(g)1}\}\{1,2,\mathrm{},n1\}`$ be such that $`S_{J(g)}`$ is the minimal Young subgroup of $`S_n`$ containing g. It is clear that $`J(g)`$ can be given explicitly as

$$J(g)=\{1jn1|g(1)+g(2)+\mathrm{}+g(j)=1+2+\mathrm{}+j\}$$

Then by $`\sigma (g)=J_1J_2\mathrm{}J_{n(g)}\mathrm{\Sigma }_n`$ we denote the subdivision associated to the set $`J(g)`$ i.e

$$J_1=J_1(g):=[1..j_1],J_2=J_2(g):=[j_1+1..j_2],\mathrm{},J_{n(g)}:=J_{n(g)}(g)=[j_{n(g)1}+1..n]$$

and by $`g=g_1g_2\mathrm{}g_{n(g)}`$ we denote the corresponding factorization of $`g`$ with $`g_kS_{J_k(g)},1kn(g)`$. By noting that $`gS_JJJ(g)`$, we can rewrite the formula Prop.2.2.11 ii) as follows

$`\mathrm{\Lambda }^\nu (g)`$ $`=`$ $`\mathrm{\Lambda }_{[1..n]}^\nu (g)={\displaystyle \frac{1}{\mathrm{}_{[1..n]}^\nu }}{\displaystyle \underset{\mathrm{}JJ(g)}{}}(1)^{|J|+1}\mathrm{\Lambda }_J^\nu (g)`$
$`=`$ $`{\displaystyle \frac{1}{\mathrm{}_{[1..n]}^\nu }}{\displaystyle \underset{\mathrm{}K\{1,2,\mathrm{},n(g)1\}}{}}(1)^{|K|+1}\mathrm{\Lambda }_{J(K)}^\nu (g)`$
where $`J(K):=\{j_k|kK\}\{1,2,\mathrm{},n1\}`$. (Note that if $`J(g)=\mathrm{}`$ ($`g`$ and $`gw_n`$ are not splittable), then $`\mathrm{\Lambda }^\nu (g)=0`$ by this formula too.)

In terms of subdivisions this can be viewed as a recursion formula:

$$\mathrm{\Lambda }_{[1..n]}^\nu (g)=\frac{1}{\mathrm{}_{[1..n]}^\nu }\underset{\tau =K_1K_2\mathrm{}K_l\mathrm{\Sigma }_{n(g)},l2}{}(1)^l\mathrm{\Lambda }_{I(K_1)}^\nu (g_{K_1})\mathrm{}\mathrm{\Lambda }_{I(K_l)}^\nu (g_{K_l})$$
$`()`$
where $`I(K_s):=_{kK_s}J_k(g)`$, $`g_{K_s}:=_{kK_s}g_k,s=1,\mathrm{},l`$.

By iterating this recursion formula (\*) (as in Theorem 2.2.6, Remark 2.2.7, Corollary 2.2.13) we obtain

$$\mathrm{\Lambda }_{[1..n]}^\nu (g)=(\underset{\beta }{}(1)^{b(\beta )+n(g)1}\stackrel{~}{\mathrm{\Psi }}_\beta )\mathrm{\Lambda }_{J_1(g)}^\nu (g_1)\mathrm{}\mathrm{\Lambda }_{J_{n(g)}(g)}^\nu (g_{n(g)})$$
$`()`$
where $`\beta `$ run over all generalized bracketings of the word $`12\mathrm{}n(g)`$ which have outer brackets and where each bracket pair $`[a..b]`$, $`1a<bn(g)`$, we set

$$\stackrel{~}{\mathrm{\Psi }}_{[a..b]}:=\frac{1}{\mathrm{}_{J_a{\scriptscriptstyle J_{a+1}\mathrm{}J_b}}}$$

($`b(\beta ):=`$number of bracket pairs in $`\beta `$). Thus the expression in the parentheses can be viewed as a ”thickened” identity coefficient

$$\mathrm{\Lambda }^{12\mathrm{}n(g)}(id)|_{1J_1,2J_2,\mathrm{},n(g)J_{n(g)}}^\nu $$

which we shall denote by

$$\mathrm{\Lambda }_{\sigma (g)}^\nu =\mathrm{\Lambda }_{J_1(g)J_2(g)\mathrm{}J_{n(g)}(g)}^\nu :=\mathrm{\Lambda }^{12\mathrm{}n(g)}(id)|_{1J_1,2J_2,\mathrm{},n(g)J_{n(g)}}.$$

(In particular we can now write $`\mathrm{\Lambda }_{[1..n]}^\nu (id)`$ also as $`\mathrm{\Lambda }_{[1][2]\mathrm{}[n]}^\nu `$).

As an example for this notation we take $`g=41325786`$. Then $`\sigma (g)=[\mathrm{1..4}][5][\mathrm{6..8}]`$ i.e $`J_1(g)=[\mathrm{1..4}],J_2(g)=[5],J_3(g)=[\mathrm{6..8}]`$. So

$$\mathrm{\Lambda }_{[\mathrm{1..4}][5][\mathrm{6..8}]}^\nu =\mathrm{\Lambda }^{123}(id)|_{1[\mathrm{1..4}],2[5],3[\mathrm{6..8}]}^\nu =\frac{1}{\mathrm{}_{[\mathrm{1..8}]}^\nu }(1+\frac{1}{\mathrm{}_{[\mathrm{1..5}]}^\nu }+\frac{1}{\mathrm{}_{[\mathrm{5..8}]}^\nu })$$

(c.f. Corollary 2.2.13).

Now we have one more observation concerning the formula ($``$). To each nonzero factor $`\mathrm{\Lambda }_{J_k(g)}^\nu (g_k),1kn(g)`$ in ($``$) we can apply Prop. 2.2.11 i) because $`g_k`$, being a minimal Young factor of $`g`$, is not splittable and hence
$`g_k(j_{k1}+1)>g_k(j_k)`$ (otherwise $`g_kw_{J_k}`$ would also be nonsplittable $`\mathrm{\Lambda }_{J_k(g)}^\nu (g_k)=0`$)

$$\mathrm{\Lambda }_{J_k(g)}^\nu (g_k)=(1)^{|J_k(g)|1}|Q^\nu (g_kw_{J_k(g)})|^2\mathrm{\Lambda }_{J_k(g)}^\nu (g_kw_{J_k(g)})$$

By substituting this into ($``$) we obtain the following algorithm for computing the diagonal matrices $`\mathrm{\Lambda }^\nu (g)`$ describing the inverse of $`A^{(\nu )}`$
(recall that $`[A^{(\nu )}]^1=_{gS_n}\mathrm{\Lambda }^\nu (g)\widehat{R}(g)`$). PROPOSITION 2.2.18. (An algorithm for $`\mathrm{\Lambda }^\nu (g)`$, $`\nu `$ generic, $`|\nu |=n`$).  For $`gS_n`$ we have

$$\mathrm{\Lambda }_{[1..n]}^\nu (g)=(1)^{nn(g)}\mathrm{\Lambda }_{\sigma (g)}^\nu |Q^\nu (g^{^{}})|^2\mathrm{\Lambda }_{J(g)}^\nu (g^{^{}})$$

where $`g^{^{}}:=gw_{J(g)}`$ ($`w_{J(g)}=`$ the maximal element in the minimal Young subgroup $`S_{J(g)}`$ containing $`g`$). A similar statement holds true if we replace $`[1..n]`$ by any interval $`[a..b],1abn`$. Proof. If $`g(1)<g(n)`$ this is what we get from ($``$).

If $`g(1)>g(n)`$, then $`J(g)=\mathrm{},S_{J(g)}=S_n,w_{J(g)}=nn1\mathrm{}21=w_n,n(g)=1,\sigma (g)=[1..n],\mathrm{\Lambda }_{\sigma (g)}^\nu =\mathrm{\Lambda }^1(id)|_{1[1..n]}=I,g^{^{}}=gw_{J(g)}=gw_n`$, so what we needed to prove is just the claim in Prop.2.2.11 i). The Prop.2.2.18 is proved.

To illustrate this algorithm we take $`g=41325786`$ ($`\nu `$ can be any generic weight, $`|\nu |=8`$) for which $`J(g)=\{4,5\},J_1(g)=[\mathrm{1..4}],J_2(g)=[5],J_3(g)=[\mathrm{6..8}],n(g)=3,n=8,w_{J(g)}=43215876,g^{^{}}=gw_{J(g)}=23145687,Q^\nu (g^{^{}})=Q_{1,2}^\nu Q_{1,3}^\nu Q_{7,8}^\nu ,`$
$`|Q^\nu (g^{^{}})|^2=Q^\nu (g^{^{}})Q^\nu (g^{^{}})^{}=Q_{\{1,2\}}^\nu Q_{\{1,3\}}^\nu Q_{\{7,8\}}^\nu `$. Then the first step of our algorithm gives

$`\mathrm{\Lambda }_{[\mathrm{1..8}]}^\nu (g)=\mathrm{\Lambda }_{[\mathrm{1..8}]}^\nu (41325786)=`$
$`=(1)^{83}\mathrm{\Lambda }_{[\mathrm{1..4}][5][\mathrm{6..8}]}^\nu Q_{\{1,2\}}^\nu Q_{\{1,3\}}^\nu Q_{\{7,8\}}^\nu \mathrm{\Lambda }_{[\mathrm{1..4}]}^\nu (2314)\mathrm{\Lambda }_{[5]}^\nu (5)\mathrm{\Lambda }_{[\mathrm{6..8}]}^\nu (687).`$
In the second step of our algorithm we compute
$`\mathrm{\Lambda }_{[\mathrm{1..4}]}^\nu (2314)=(1)^{42}\mathrm{\Lambda }_{[\mathrm{1..3}][4]}^\nu Q_{\{2,3\}}^\nu \mathrm{\Lambda }_{[\mathrm{1..3}]}^\nu (132)\mathrm{\Lambda }_{[4]}^\nu (4)`$
$`\mathrm{\Lambda }_{[\mathrm{6..8}]}^\nu (687)=(1)^{32}\mathrm{\Lambda }_{[6][\mathrm{7..8}]}^\nu \mathrm{\Lambda }_{[6]}^\nu (6)\mathrm{\Lambda }_{[\mathrm{7..8}]}^\nu (78)`$
In the third (and the final) step we need only to compute

$$\mathrm{\Lambda }_{[\mathrm{1..3}]}^\nu (132)=(1)^{32}\mathrm{\Lambda }_{[1][\mathrm{2..3}]}^\nu \mathrm{\Lambda }_{[1]}^\nu (1)\mathrm{\Lambda }_{[\mathrm{2..3}]}^\nu (23).$$

Since $`\mathrm{\Lambda }_{[\mathrm{7..8}]}^\nu (78)=\mathrm{\Lambda }_{[7][8]}^\nu ,\mathrm{\Lambda }_{[\mathrm{2..3}]}^\nu (23)=\mathrm{\Lambda }_{[2][3]}^\nu ,(Q_{\{1,2\}}^\nu Q_{\{1,3\}}^\nu )Q_{\{2,3\}}^\nu =Q_{[\mathrm{1..3}]}^\nu ,\mathrm{\Lambda }_{[1]}^\nu (1)=\mathrm{}=\mathrm{\Lambda }_{[8]}^\nu (8)=I`$, we finally obtain

$$\mathrm{\Lambda }_{[\mathrm{1..8}]}^\nu (41325786)=\mathrm{\Lambda }_{[\mathrm{1..4}][5][\mathrm{6..8}]}^\nu \mathrm{\Lambda }_{[\mathrm{1..3}][4]}^\nu \mathrm{\Lambda }_{[1][\mathrm{2..3}]}^\nu \mathrm{\Lambda }_{[2][3]}^\nu \mathrm{\Lambda }_{[6][\mathrm{7..8}]}^\nu \mathrm{\Lambda }_{[7][8]}^\nu Q_{[\mathrm{1..3}]}^\nu Q_{[\mathrm{7..8}]}^\nu .$$

As a general example we take $`g=w_J`$ where $`J=\{j_1<\mathrm{}<j_{l1}\}`$ is an arbitrary subset of $`\{1,2,\mathrm{},n1\}`$. Here $`n(g)=l`$ and $`g^{^{}}=id`$, so by one application of our algorithm we obtain

$$\mathrm{\Lambda }_{[1..n]}^\nu (w_J)=(1)^{nl}\mathrm{\Lambda }_{J_1J_2\mathrm{}J_l}^\nu \mathrm{\Lambda }_{J_1}^\nu (id)\mathrm{\Lambda }_{J_2}^\nu (id)\mathrm{}\mathrm{\Lambda }_{J_l}^\nu (id)$$

where $`J_1=[1..j_1],J_2=[j_1+1..j_2],\mathrm{},J_l=[j_{l1}+1..n]`$.

In particular for $`n=8`$, $`J=\{4\}`$ we obtain

$`\mathrm{\Lambda }_{[\mathrm{1..8}]}^\nu (43218765)`$ $`=`$ $`(1)^{82}\mathrm{\Lambda }_{[\mathrm{1..4}][\mathrm{5..8}]}^\nu \mathrm{\Lambda }_{[\mathrm{1..4}]}^\nu (1234)\mathrm{\Lambda }_{[\mathrm{5..8}]}^\nu (5678)`$
$`=`$ $`{\displaystyle \frac{1}{\mathrm{}_{[\mathrm{1..8}]}^\nu }}\mathrm{\Lambda }_{[1][2][3][4]}^\nu \mathrm{\Lambda }_{[5][6][7][8]}^\nu `$
In Zagier’s case, when all $`q_{ij}=q`$, we would then have (c.f. Examples to Cor. 2.2.13)

$$\mathrm{\Lambda }_{[\mathrm{1..8}]}^\nu (43218765)=\frac{1}{1q^{78}}\frac{(1+2q^2+q^4+2q^6+q^8)^2}{(1q^{12})^2(1q^{23})^2(1q^{34})^2}I$$

But the denominator $`D_8`$ of this expression does not divide Zagier’s $`\mathrm{}_8=(1q^{21})(1q^{32})(1q^{43})(1q^{54})(1q^{65})(1q^{76})(1q^{87})`$. Namely $`\mathrm{}_8/D_8=(1q^{45})(1q^{56})(1q^{67})/(1q^{12})(1q^{23})(1q^{34})`$ is not a polynomial due to the factor $`1q^2+q^4`$ in the denominator. This computation shows that the original Zagier’s conjecture (c.f. Remark 2.2.9) fails for $`n=8`$.

Now we return to our agorithm. We shall show now that it is somewhat better to combine two steps of our algorithm into one step. This can be observed already in our illustrative example ($`g=41325786`$) where after the second step the ”unrelated factors” $`Q_{\{1,2\}}^\nu `$ and $`Q_{\{1,3\}}^\nu `$ from the first step were completed, with the factor $`Q_{\{2,3\}}^\nu `$, into a ”nicer” term $`Q_{[\mathrm{1..3}]}^\nu `$ having a contiguous indexing set. Fortunately this holds in general, but first we need more notations to state the results.

To each permutation $`gS_n`$ we can associate a sequence of permutations $`g,g^{^{}},g^{^{\prime \prime }},\mathrm{}`$, where $`g^{(k+1)}`$ is obtained from $`g^{(k)}`$ by reversing all minimal Young factors in $`g^{(k)}`$ i.e $`g^{^{}}=gw_{J(g)},g^{^{\prime \prime }}=gw_{J(g^{^{}})},\mathrm{},g^{(k+1)}=(g^{(k)})^{^{}}=g^{(k)}w_{J(g^{(k)})},\mathrm{}`$.

We shall call this sequence a Young sequence of $`g`$.

We call $`g`$ tree-like if $`g^{(k)}=id`$ for some $`k`$, and by depth of $`g`$ we call the minimal such $`k`$.

Besides the notation $`\mathrm{\Lambda }_{\sigma (g)}^\nu =\mathrm{\Lambda }_{J_1(g)J_2(g)\mathrm{}J_{n(g)}(g)}^\nu `$, where $`\sigma (g)=J_1(g)\mathrm{}J_{n(g)}(g)`$ is the subdivision of $`\{1,2,\mathrm{},n\}`$ associated to the minimal Young subgroup $`S_{J(g)}`$ containing $`g`$ we need a relative version $`\mathrm{\Lambda }_{\sigma (g^{^{}}):\sigma (g)}^\nu `$ which we define by

$$\mathrm{\Lambda }_{\sigma (g^{^{}}):\sigma (g)}^\nu :=\mathrm{\Lambda }_{\sigma (g^{^{}}|J_1(g))}^\nu \mathrm{\Lambda }_{\sigma (g^{^{}}|J_2(g))}^\nu \mathrm{}\mathrm{\Lambda }_{\sigma (g^{^{}}|J_{n(g)}(g))}^\nu $$

For example when $`g=41325786(g^{^{}}=23145687)`$, $`J_1(g)=[\mathrm{1..4}],J_2(g)=[5],J_3(g)=[\mathrm{6..8}]`$, we have

$$\mathrm{\Lambda }_{\sigma (g^{^{}}):\sigma (g)}^\nu =\mathrm{\Lambda }_{[123][4]}^\nu \mathrm{\Lambda }_{[5]}^\nu \mathrm{\Lambda }_{[6][\mathrm{7..8}]}^\nu $$

Also, besides the notation, for $`T\{1,2,\mathrm{},n\},Q_T^\nu =_{a,bT,ab}Q_{a,b}^\nu `$ (introduced in 1.8), we define for any subdivision $`\sigma =J_1J_2\mathrm{}J_l`$ of $`\{1,2,\mathrm{},n\}`$:

$$Q_\sigma ^\nu :=Q_{J_1}^\nu Q_{J_2}^\nu \mathrm{}Q_{J_l}^\nu $$

For example:

$$Q_{[\mathrm{1..3}][4][5][6][\mathrm{7..8}]}^\nu =Q_{[\mathrm{1..3}]}^\nu Q_{[4]}^\nu Q_{[5]}^\nu Q_{[6]}^\nu Q_{[\mathrm{7..8}]}^\nu =Q_{[\mathrm{1..3}]}^\nu Q_{[\mathrm{7..8}]}^\nu .$$

PROPOSITION 2.2.19. (Fast algorithm for $`\mathrm{\Lambda }^\nu (g)`$, $`\nu `$ generic, $`|\nu |=n`$):  With the notations above we have

$$\mathrm{\Lambda }_{[1..n]}^\nu (g)=(1)^{n(g)+n(g^{^{}})}\mathrm{\Lambda }_{\sigma (g)}^\nu \mathrm{\Lambda }_{\sigma (g^{^{}}):\sigma (g)}^\nu Q_{\sigma (g^{^{}})}^\nu \mathrm{\Lambda }_{J(g^{^{}})}^\nu (g^{^{\prime \prime }})$$

($`n(g)=`$ the number of minimal Young factors of $`g`$) Proof. The proof consists in combining together the first two steps of the algorithm in Proposition 2.2.18.

First we note that in the unique factorization of $`g=g_1g_2\mathrm{}g_{n(g)}S_{J(g)}=S_{J_1(g)}S_{J_2(g)}\mathrm{}S_{J_{n(g)}(g)}`$ (here $`J_k(g)^{}s`$ denote intervals associated to the set $`J(g)[1\mathrm{}n1]`$(cf. Remark 2.2.5)) w.r.t. its minimal Young subgroup. This implies that

$$g^{^{}}=gw_{J(g)}=g_1w_{J_1(g)}g_2w_{J_2(g)}\mathrm{}g_{n(g)}w_{J_{n(g)}(g)}=(g_1)^{^{}}(g_2)^{^{}}\mathrm{}(g_{n(g)})^{^{}}$$

By using this formula we can write the first step of our algorithm (in Proposition 2.2.18) as follows:

$$\mathrm{\Lambda }_{[1..n]}^\nu (g)=(1)^{nn(g)}\mathrm{\Lambda }_{\sigma (g)}^\nu |Q^\nu (g^{^{}})|^2\mathrm{\Lambda }_{J_1(g)}^\nu ((g_1)^{^{}})\mathrm{\Lambda }_{J_2(g)}^\nu ((g_2)^{^{}})\mathrm{}\mathrm{\Lambda }_{J_{n(g)}(g)}^\nu ((g_{n(g)})^{^{}})$$
$`()`$
For $`g^{^{\prime \prime }}=g^{^{}}w_{J(g^{^{}})}`$ we also have the formula $`g^{^{\prime \prime }}=(g_1)^{^{\prime \prime }}(g_2)^{^{\prime \prime }}\mathrm{}(g_{n(g)})^{^{\prime \prime }}`$, so the second step of our algorithm gives

$`\mathrm{\Lambda }_{J_1(g)}^\nu ((g_1)^{^{}})\mathrm{\Lambda }_{J_2(g)}^\nu ((g_2)^{^{}})\mathrm{}\mathrm{\Lambda }_{J_{n(g)}(g)}^\nu ((g_{n(g)})^{^{}})=`$
$`=(1)^{nn(g^{^{}})}\mathrm{\Lambda }_{\sigma ((g_1)^{^{}}|J_1(g))}^\nu \mathrm{}\mathrm{\Lambda }_{\sigma ((g_{n(g)})^{^{}}|J_{n(g)}(g))}^\nu |Q^\nu (g^{^{\prime \prime }})|^2\mathrm{\Lambda }_{J(g^{^{}})}^\nu (g^{^{\prime \prime }})`$
$`=(1)^{nn(g^{^{}})}\mathrm{\Lambda }_{\sigma (g^{^{}}):\sigma (g)}^\nu |Q^\nu (g^{^{\prime \prime }})|^2\mathrm{\Lambda }_{J(g^{^{}})}^\nu (g^{^{\prime \prime }})`$
By substituting this into (\*) and using the following general fact (which is immediate from the definition of $`Q^\nu (g)=_{a<b,g^1(a)>g^1(b)}Q_{a,b}^\nu `$):

$$Q^\nu (g)Q^\nu (g^{^{}})=Q^\nu (g)Q^\nu (gw_{J(g)})=Q^\nu (w_{J(g)})=Q^\nu (w_{J_1(g)})\mathrm{}Q^\nu (w_{J_{n(g)}(g)})$$

($`|Q^\nu (g)Q^\nu (g^{^{}})|^2=Q_{J_1(g)}^\nu Q_{J_2(g)}^\nu \mathrm{}Q_{J_{n(g)}(g)}^\nu =Q_{\sigma (g)}^\nu `$) we finally obtain the desired formula.

Now we shall state our principal result concerning the inversion of matrices $`A^{(\nu )}`$ of the sesquilinear form $`(,)_𝐪`$, defined in 1.3, on the generic weight space $`𝐟_\nu ,|\nu |=n`$. THEOREM 2.2.20. \[INVERSE MATRIX COEFFICIENTS\]  Let $`\nu `$ be a generic weight, $`|\nu |=n`$. For the coeficients $`\mathrm{\Lambda }^\nu (g)`$ in the expansion

$$[A^{(\nu )}]^1=\underset{gS_n}{}\mathrm{\Lambda }^\nu (g)\widehat{R}_\nu (g)$$

we have, with the notations above, the following formulas:
i) If $`gS_n`$ is a tree-like permutation of depth $`d`$, then

$$\mathrm{\Lambda }^\nu (g)=(1)^{N(g)}\mathrm{\Lambda }_{\sigma (g)}^\nu \mathrm{\Lambda }_{\sigma (g^{^{}}):\sigma (g)}^\nu \mathrm{\Lambda }_{\sigma (g^{^{\prime \prime }}):\sigma (g^{^{}})}^\nu \mathrm{}\mathrm{\Lambda }_{\sigma (g^{(d)}):\sigma (g^{(d1)})}^\nu Q_{\sigma (g^{^{}})}^\nu Q_{\sigma (g^{^{\prime \prime \prime }})}^\nu \mathrm{}Q_{\sigma (g^{(d^{^{}})})}^\nu $$

where $`N(g):={\displaystyle \underset{k=0}{\overset{d}{}}}{\displaystyle \underset{I\sigma (g^{(k)})}{}}(CardI1),d^{^{}}=2{\displaystyle \frac{d1}{2}}+1`$
ii) If $`gS_n`$ is not tree-like, then $`\mathrm{\Lambda }^\nu (g)=0`$. Proof. i) follows by iterating our fast algorithm (of Prop.2.2.19).
ii) If $`g`$ is not tree-like then in the Young sequence of $`g`$ we encounter some Young factor which together with its reverse is not splittable, but then the corresponding $`\mathrm{\Lambda }_{[..]}^\nu (\text{the factor})=0`$ (c.f. Prop.2.2.11), hence $`\mathrm{\Lambda }^\nu (g)=0`$.

Now we give explicit formulas for the inverses of $`A^{123}`$ and $`A^{1234}`$:

$`[A^{123}]^1`$ $`=`$ $`{\displaystyle \frac{1}{\mathrm{}_{[\mathrm{1..3}]}}}\{{\displaystyle \frac{IQ_{[\mathrm{1..2}]}Q_{[\mathrm{2..3}]}}{\mathrm{}_{[\mathrm{1..2}]}\mathrm{}_{[\mathrm{2..3}]}}}(\widehat{R}(123)+\widehat{R}(321))`$
$``$ $`{\displaystyle \frac{1}{\mathrm{}_{[\mathrm{1..2}]}}}(\widehat{R}(213)+Q_{[\mathrm{1..2}]}\widehat{R}(312)){\displaystyle \frac{1}{\mathrm{}_{[\mathrm{2..3}]}}}(\widehat{R}(132)+Q_{[\mathrm{2..3}]}\widehat{R}(231))\}.`$
$`[A^{1234}]^1`$ $`=`$ $`\mathrm{\Lambda }^{1234}(id)\widehat{R}(1234)+{\displaystyle \frac{1}{\mathrm{}_{1234}}}\{{\displaystyle \frac{IQ_{123}Q_{34}}{\mathrm{}_{12}\mathrm{}_{123}\mathrm{}_{34}}}\widehat{R}(2134)`$
$``$ $`{\displaystyle \frac{IQ_{123}Q_{234}}{\mathrm{}_{23}\mathrm{}_{123}\mathrm{}_{234}}}\widehat{R}(1324){\displaystyle \frac{IQ_{12}Q_{234}}{\mathrm{}_{12}\mathrm{}_{34}\mathrm{}_{234}}}\widehat{R}(1243)+{\displaystyle \frac{1}{\mathrm{}_{12}\mathrm{}_{34}}}\widehat{R}(2143)+`$
$`+`$ $`{\displaystyle \frac{IQ_{12}Q_{23}}{\mathrm{}_{12}\mathrm{}_{23}\mathrm{}_{123}}}\widehat{R}(3214){\displaystyle \frac{Q_{12}}{\mathrm{}_{12}\mathrm{}_{123}}}\widehat{R}(3124){\displaystyle \frac{Q_{23}}{\mathrm{}_{23}\mathrm{}_{123}}}\widehat{R}(2314)`$
$`+`$ $`{\displaystyle \frac{IQ_{23}Q_{34}}{\mathrm{}_{23}\mathrm{}_{34}\mathrm{}_{234}}}\widehat{R}(1432){\displaystyle \frac{Q_{23}}{\mathrm{}_{23}\mathrm{}_{234}}}\widehat{R}(1423){\displaystyle \frac{Q_{34}}{\mathrm{}_{34}\mathrm{}_{234}}}\widehat{R}(1342)\}`$
$`+`$ $`\text{(eleven terms obtained by multiplying with }\widehat{R}(4321)\text{)}.`$
For $`\mathrm{\Lambda }^{123}(id)`$ and $`\mathrm{\Lambda }^{1234}(id)`$ see examples to Cor.2.2.13.
(Here we abbreviated $`Q_{[\mathrm{1..2}]},Q_{[\mathrm{2..4}]}`$ to $`Q_{12}`$ (don’t confuse with $`Q_{1,2}`$), $`Q_{234}`$ etc.).

Note that $`A^{1234}`$ is a $`24\times 24`$ symbolic matrix so the inversion of such a matrix by standard methods on a computer is almost impossible (the output may contain hundreds of pages of messy expressions!).

REMARK 2.2.21. By using our reduction to the generic case formula 1) $`[A^{(\nu )}]_{\mathrm{𝐢𝐣}}^1=_{hH}[\stackrel{~}{A}^{(\stackrel{~}{\nu })}]_{\stackrel{~}{𝐢},h\stackrel{~}{𝐣}}^1`$ in 1.7 we can write also formulas for the inverse matrix coefficients in the case of degenerate weights $`\nu `$. E.g. for the inverse of $`A^{113}`$ (see Example 1.6.4) one gets

$$[A^{113}]^1=\frac{1}{\mathrm{\Delta }}\left(\begin{array}{ccc}1& (1+q_{11})q_{13}& q_{11}q_{13}^2\\ q_{31}(1+q_{11})& (1+q_{11})(1+q_{13}q_{31})& (1+q_{11})q_{13}\\ q_{13}^2q_{11}& q_{31}(1+q_{11})& 1\end{array}\right)$$

where

$$\mathrm{\Delta }=(1+q_{11})(1q_{13}q_{31})(1q_{11}q_{13}q_{31}).$$

## 3 Applications

### 3.1 Quantum bilinear form of the discriminant arrangement of hyperplanes

Here we briefly recall the definition of the quantum bilinear form in case of the configuration $`𝒜_n`$ of diagonal hyperplanes $`H_{ij}=H_{ij}^n:x_i=x_j,1i<jn`$ in $`𝐑^n`$ (for general case see \[Var\]). This arrangement $`𝒜_n`$ is also called the discriminant arrangement of hyperplanes in $`𝐑^n`$. The domains of $`𝒜_n`$ (i.e connected components of the complement of the union of hyperplanes in $`𝒜_n`$) are clearly of the form

$$P_\pi =\{x𝐑^n|x_{\pi (1)}<x_{\pi (2)}<\mathrm{}<x_{\pi (n)}\},\pi S_n$$

Let $`a(H_{ij}^n)=q_{ij}`$ be the weight of the hyperplane $`H_{ij}𝒜_n`$, where $`q_{ij}`$ are given real numbers, $`1i<jn`$. Then the quantum bilinear form $`B_n`$ of $`𝒜_n`$ is defined on the free vector space $`M_n=M_{𝒜_n}`$ generated by the domains of $`𝒜_n`$ by

$$B_n(P_\pi ,P_\tau )=a(H)$$

where the product is taken over all the hyperplanes $`H𝒜_n`$ which separate $`P_\pi `$ and $`P_\tau `$. PROPOSITION 3.1.1.  We have

$$B_n(P_\pi ,P_\tau )=\underset{(a,b)I(\pi ^1)\mathrm{}I(\tau ^1)}{}q_{ab}$$

where $`I(\sigma )=\{(a,b)|a<b,\sigma (a)>\sigma (b)\}`$ denotes the set of inversions of $`\sigma S_n`$ and $`X\mathrm{}Y=(XY)(YX)`$ denotes the symmetric difference of sets $`X`$ and $`Y`$. Proof. For each hyperplane $`H_{ab}:x_a=x_b`$ we denote by $`H_{ab}^+:x_a<x_b`$ and $`H_{ab}^{}:x_a>x_b`$ the corresponding open half-spaces. Then $`H_{ab}`$ separates domains $`P_\pi `$ and $`P_\tau `$ if either
1) $`P_\pi H_{ab}^+`$ and $`P_\tau H_{ab}^{}`$ or
2) $`P_\pi H_{ab}^{}`$ and $`P_\tau H_{ab}^+`$.
In case 1) we have $`\pi ^1(a)<\pi ^1(b)`$ and $`\tau ^1(a)>\tau ^1(b)`$ i.e $`(a,b)I(\tau ^1)I(\pi ^1)`$. Similary in case 2) we have $`(a,b)I(\pi ^1)I(\tau ^1)`$. The proof is finished. COROLLARY 3.1.2.  The matrix of the quantum bilinear form $`B_n`$ of the discriminant arrangements $`𝒜_n=\{H_{ij}\}`$ of hyperplanes in $`𝐑^n`$ coincides with the matrix $`A^{12\mathrm{}n}=A^{12\mathrm{}n}(𝐪)`$ of the form $`(,)_𝐪`$ (defined in 1.3), restricted to the generic weight space $`𝐟_\nu `$, where $`I=\{1,2,\mathrm{},n\},\nu _1=\nu _2=\mathrm{}=\nu _n=1`$ and where $`𝐪=\{q_{ij}𝐑,1i,jn,q_{ij}=q_{ji}\},q_{ij}=`$ the weight of $`H_{ij}`$ for $`1i<jn`$.

This Corollary enables us to translate all our results concerning matrices $`A^\nu ,\nu =`$ generic, $`|\nu |=n`$ into results about the quantum bilinear form $`B_n`$. As an example we shall reinterpret our determinantal formula given in Theorem 1.9.2. First we recall some definitions and results from \[Var\] for the case of the configuration $`𝒞=𝒜_n`$. An edge of $`𝒜_n`$ is any nonempty intersection of some subset of hyperplanes of the configuration $`𝒜_n`$. The set of all edges of $`𝒜_n`$ we denote by $`(𝒜_n)`$. The weight of an edge is defined to be the product of the weights of all hyperplanes which contain the edge. Then the Varchenko’s formula (c.f. Theorem (1.1) in \[Var\]) reads as follows

$$detB_n=\underset{L(𝒜_n)}{}(1a(L)^2)^{l(L)}$$

where $`a(L)`$ is the weight of the edge $`L,l(L)`$ is the multiplicity of the edge, defined in Section 2 of \[Var\].

In order to state our formula we denote by $`^{^{}}(𝒜_n)(𝒜_n)`$ the set of those edges which belong to $`k`$-equal subspace arrangements $`𝒜_{n,k}=\{x_{i_1}=\mathrm{}=x_{i_k}:1i_1<i_2<\mathrm{}<i_kn\},k2`$, i.e

$$^{^{}}(𝒜_n)=𝒜_{n,n}𝒜_{n,n1}\mathrm{}𝒜_{n,2}$$

THEOREM 3.1.3.  The determinant of the quantum bilinear form $`B_n`$ of the discriminant arrangement $`𝒜_n`$ is given by the formula

$$detB_n=\underset{L^{^{}}(𝒜_n)}{}(1a(L)^2)^{l(L)}$$

where for $`L=\{x_{i_1}=x_{i_2}=\mathrm{}=x_{i_k}\}𝒜_{n,k}^{^{}}(𝒜_n)`$ we have

$$a(L)=\underset{1a<bk}{}q_{i_ai_b},l(L)=(k2)!(nk+1)!$$

Proof. In Theorem 1.9.2 we set $`I=\{1,2,\mathrm{},n\},\nu _1=\nu _2=\mathrm{}\nu _n=1`$ and for $`\mu \nu `$ interpreted as the set $`\{i_1,i_2,\mathrm{},i_k\}`$ we obtain $`\mathrm{}_\mu =1q_\mu =1_{ij\mu }q_{ij}=1(_{1a<bk}q_{i_ai_b})^2`$ (here $`q_{ij}`$ are real!). But $`a(L)=_{HL}a(H)=_{1a<bk}a(H_{i_ai_b})=_{1a<bk}q_{i_ai_b}`$, so $`\mathrm{}_\mu =1a(L)^2`$. Note that $`|\mu |=k,|\nu |=n`$. Now the proof follows by Corollary 3.1.2.

Note that our formula for $`detB_n`$ is more explicit then Varchenko’s formula, and in particular we conclude that the multiplicity $`l(L)=0`$ for all $`L(𝒜_n)^{^{}}(𝒜_n)`$.

### 3.2 Quantum groups

We shall adopt the notations used in \[SVa\]. Fix the following data:
a) a finite dimensional complex vector space h
b) a non-degenerate symmetric bilinear form $`(,)`$ on h
c) linearly independent covectors (”simple roots”) $`\alpha _1,\mathrm{},\alpha _n\text{h}^{}`$
d) a non-zero complex number $`\kappa `$.
Let $`b:\text{h}\text{h}^{}`$ be the isomorphism induced by $`(,)`$. We transfer the form $`(,)`$ to $`\text{h}^{}`$ using $`b`$. Put $`b_{ij}=(\alpha _i,\alpha _j)`$; $`B=(b_{ij})Mat_r(𝐂),h_i=b^1(\alpha _i)\text{h}`$.

Put $`q=\mathrm{exp}(2\pi i/\kappa )`$; for $`a𝐂`$ put $`q^a=\mathrm{exp}(2\pi ia/\kappa )`$.

Let $`U_q\text{g}=U_q\text{g}(B)`$ be the $`𝐂`$-algebra generated by elements $`e_i,f_i,i=1,\mathrm{},n`$ and the space h, subject to relations

$`[h,e_i]`$ $`=`$ $`\alpha _i(h)e_i;[h,f_i]=\alpha _i(h)f_i`$
$`[e_i,f_j]`$ $`=`$ $`(q^{h_i/2}q^{h_i/2})\delta _{ij}`$
$`[h,h^{^{}}]`$ $`=`$ $`0`$
for all $`i,j=1,\mathrm{},n;h,h^{^{}}\text{h}`$.

The comultiplication $`\mathrm{}:U_q\text{g}U_q\text{g}\widehat{}U_q\text{g}`$ is given by $`\mathrm{}(h)=h1+1h,\mathrm{}(f_i)=f_iq^{h_i/4}+q^{h_i/4}f_i,\mathrm{}(e_i)=e_iq^{h_i/4}+q^{h_i/4}e_i`$.

The counit $`ϵ:U_q𝐠𝐂`$ is defined by $`ϵ(f_i)=ϵ(e_i)=ϵ(h)=0`$ and the antipode $`A:U_q\text{g}U_q\text{g}`$ by $`A(h)=h,A(e_i)=q^{b_{ii}/4}e_i,A(f_i)=q^{b_{ii}/4}f_i`$. We denote by $`U_q\text{n}_{}`$ (resp. $`U_q\text{n}_+,U_q𝐡`$) subalgebras generated by $`f_i`$ (resp. $`e_i,h\text{h}`$), $`i=1,\mathrm{},n`$. $`U_q\text{n}_\pm `$ are free. We have $`U_q\text{g}=U_q\text{n}_{}U_q\text{h}U_q\text{n}_+`$.

For $`\lambda =(k_1,\mathrm{},k_n)𝐍^n`$ put

$$(U_q\text{n}_{})_\lambda =\{xU_q\text{n}_{}|[h,x]=k_i\alpha _i(h)x\text{ for all }h\text{h}\}$$

We have $`U_q\text{n}_{}=_\lambda (U_q\text{n}_{})_\lambda `$. Contravariant forms. There exist a unique symmetric bilinear form $`S`$ on $`U_q\text{n}_{}`$ satisfying

$$S(1,1)=1,S(f_ix,y)=S(x,g_iy)$$

where $`g_i:(U_q\text{n}_{})_\lambda (U_q\text{n}_{})_{\lambda _i^{^{}}},i=1,\mathrm{},n;\lambda _i^{^{}}=(k_1,\mathrm{},k_i1,\mathrm{},k_n)`$ are the operators acting on $`f_J=f_{j_1}\mathrm{}f_{j_n}(U_q\text{n}_{})_\lambda `$ as follows:

$$g_i(f_J):=\underset{p:j_p=i}{}q^{_{l<p}b_{ij_l}/4_{l>p}b_{ij_l}/4}f_{j_1}\mathrm{}\widehat{f}_{j_p}\mathrm{}f_{j_n}.$$

If the weight $`\lambda =(k_1,\mathrm{},k_n)=(1,1,\mathrm{},1)`$, then for $`f_I=f_{i_1}f_{i_2}\mathrm{}f_{i_n},f_J=f_{j_1}f_{j_2}\mathrm{}f_{j_n}(U_q\text{n}_{})_\lambda `$ is given explicitly by

$$S(f_I,f_J)=q^{(_{k<l}\pm b_{i_ki_l})/4}$$

where in the sum we take $`+b_{i_ki_l}`$ if $`\sigma (k)>\sigma (l)`$ and $`b_{i_ki_l}`$ otherwise.

Here $`\sigma =\sigma (I,J)S_n`$ is the unique permutation such that $`j_p=i_{\sigma (p)}`$ for all $`p`$. THEOREM 3.2.1.  The determinant of the contravariant form $`S`$ on the weight space $`(U_q\text{n}_{})_{(1,1,\mathrm{},1)}`$ is given by the following formula

$`detS|_{(U_q𝐧_{})_{(1,1\mathrm{},1)}}`$
$`=q^{\frac{n!}{4}_{1k<ln}b_{kl}}{\displaystyle \underset{m=2}{\overset{n}{}}}{\displaystyle \underset{1i_1<\mathrm{}<i_mn}{}}(1q^{_{1k<lm}b_{i_ki_l}})^{(m2)!(nm+1)!}`$
$`={\displaystyle \underset{m=2}{\overset{n}{}}}{\displaystyle \underset{1i_1<\mathrm{}<i_mn}{}}(q^{\frac{1}{2}_{1k<lm}b_{i_ki_l}}q^{\frac{1}{2}_{1k<lm}b_{i_ki_l}})^{(m2)!(nm+1)!}`$
Proof. By factoring out from the matrix $`S(f_I,f_J)`$ the factor $`q^{\frac{1}{4}_{1k<ln}b_{kl}}`$ we get a matrix which (up to permutation of rows and columns) coincides with the matrix $`A^{12\mathrm{}n}(𝐪)`$, where $`𝐪=\{q_{ij}\}`$, $`q_{ij}:=q^{\frac{1}{2}b_{ij}}`$. Then we apply Theorem 1.9.2 and the result follows.