text:
# 1 Multiparametric quon algebras, Fock-like representation and determinants

## 1 Multiparametric quon algebras, Fock-like representation 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.Then 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.$$

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 derivatives $`{}_{i}{}^{}={}_{i}{}^{𝐪}`$ w.r.t. 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. certain sesquilinear form $`(,)_𝐪`$ on $`𝐟`$ which will be better described via 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`$ This condition 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. We first need some notations:

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

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]`$

$`(𝐍[I],+)\times (𝐍[I],+)(𝐂,)`$, the bilinear form on $`(𝐍[I],+)`$ 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 consider the tensor product $`𝐟𝐟`$ with the following $`q_{ij}`$-deformed multiplication

$$(x_1x_2)(x_1^{^{}}x_2^{^{}})=(\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

$`r(\theta _i\theta _j)`$ $`=`$ $`r(\theta _i)r(\theta _j)=\theta _i\theta _j1+q_{ij}\theta _j\theta _i+\theta _i\theta _j+1\theta _i\theta _j`$
More generally, the value of $`r`$ on any monomial $`\theta _𝐢=\theta _{i_1}\theta _{i_2}\mathrm{}\theta _{i_n}`$ is given by:

$$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 $`(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 }}𝐟`$.Clearly,d) $`(x,y)=0`$ if $`x`$ and $`y`$ are homogeneous with $`|x||y|`$.Thus the subspaces $`𝐟_\nu ,𝐟_\nu ^{^{}}`$ are orthogonal w.r.t. $`(,)`$ for $`\nu \nu ^{^{}}`$.

### 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. Similarly,we define 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`$. 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 the left (resp. right) multiplication by $`\theta _i`$.We shall need the following explicit formula for $`{}_{i}{}^{}={}_{i}{}^{𝐪}:𝐟𝐟`$
c) $`{}_{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. Similar formula holds for $`_i`$.

### 1.5 Fock representation of 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^{}`$ acts on $`𝐟`$ as left multiplication by $`\theta _i`$ and let $`a_i`$ acts as a 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. sesquilinear form $`(,)=(,)_𝐪`$ defined in 1.3.
c) $`a_i:𝐟𝐟`$ is locally nilpotent for every $`iI`$.

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

Here we study the sesquilinear form $`(,)_𝐪`$ on $`𝐟`$, defined in 1.2, via 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 }}`$. 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 $`𝐟^{^{}}=_{\nu generic}𝐟_\nu `$, $`𝐟^{^{\prime \prime }}=_{\nu degenerate}𝐟_\nu `$ .

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 )},$$

with entries given by 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 (cf. 1.2) $`q_{𝐢,\sigma }:=_{(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). For 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})$$

By applying 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 $`(_{1<b,\sigma (b)<\sigma (1)}q_{i_1i_b})(_{2<b,\sigma (b)<\sigma (2)}q_{i_2i_b})\mathrm{}=_{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) except that $`\sigma `$ is not unique. $`\mathrm{}`$

Remark 1.6.2. For any weight $`\nu =\nu _ii`$ with $`|\nu |=\nu _i=n`$, the size of the matrix $`A^{(\nu )}`$ is equal to $`n!/_i\nu _i!=dim𝐟_\nu `$. Hence 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. 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).$$

### 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.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{~}{𝐢}}.$$

By Prop.1.6.1. we can write $`\stackrel{~}{𝐀}(\stackrel{~}{\theta }_{H\stackrel{~}{𝐣}})=_{\stackrel{~}{𝐢}}A_{𝐢,𝐣}^{(\nu )}\stackrel{~}{\theta }_{\stackrel{~}{𝐢}}=_𝐢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 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=_{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`$($`\stackrel{~}{\nu }`$ generic).
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. 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”). For $`\nu =\nu _ii𝐍[I]`$ generic,$`n=|\nu |=\nu _i`$ let $`R_\nu `$ denotes 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 permutations:$`R_\nu (g):\theta _𝐣=\theta _{j_1}\mathrm{}\theta _{j_n}\theta _{g𝐣}=\theta _{j_{g^1(1)}}\mathrm{}\theta _{j_{g^1(n)}}.`$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 following diagonal matrices (multiplication operators on $`𝐟_\nu `$ ) defined by

$$(Q_{a,b}^\nu )_{𝐢,𝐢}:=q_{i_ai_b};\mathrm{e}.\mathrm{g}(Q_{2,4}^{1234})_{4123,4123}=q_{13}\mathrm{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}`$ imply 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 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)_{𝐢,𝐢}\widehat{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. $`\mathrm{}`$

Before we proceed with factorization of matrices $`A^{(\nu )}`$ we need more detailed informations concerning our ”projective” right regular representation $`\widehat{R}_\nu `$:

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 lenght of $`gS_n`$. This property follows from the following general formula :

PROPOSITION 1.8.2.  For $`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 ).$$

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`$.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}),\mathrm{for}a=1,\mathrm{},n2.$$

$$\widehat{R}_\nu (t_a)\widehat{R}_\nu (t_b)=\widehat{R}_\nu (t_b)\widehat{R}_\nu (t_a),\mathrm{for}a,b\{1,\mathrm{},n1\}\mathrm{with}|ab|2.$$

PROPERTY 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{}21`$ 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)=\left(\underset{a<b,g^1(a)<g^1(b)}{}Q_{\{a,b\}}^\nu \right)\widehat{R}(g)$$

PROPOSITION 1.8.3.  For $`mn`$, let $`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}.$$

We now make a second reduction by expressing the matrices $`A^{(\nu ),m}`$ in turn as a product 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$$

### 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 $`[I\widehat{R}_\nu (t_{k,m})]^1`$ or $`IQ_{\{m,m+1\}}^\nu \widehat{R}_\nu (t_{k,m})`$ . 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)!},(a<bn)`$
b) $`det(IQ_{\{b,b+1\}}^\nu \widehat{R}_\nu (t_{a,b}))={\displaystyle \underset{\mu \nu ,|\mu |=ba+2}{}}(\mathrm{}_\mu )^{(ba+2)(ba)!(n+ab2)!},(ab<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.

$$\{\begin{array}{ccc}c_0\hfill & =& q_{i_ai_b}q_{i_{a+1}i_b}\mathrm{}q_{i_{b1}i_b},\hfill \\ c_1\hfill & =& q_{i_{a+1}i_a}q_{i_{a+2}i_a}\mathrm{}q_{i_bi_a},\hfill \\ & \mathrm{}& \\ c_{ba}\hfill & =& q_{i_bi_{b1}}q_{i_ai_{b1}}\mathrm{}q_{i_{b2}i_{b1}}.\hfill \end{array}$$

Thus $`\widehat{R}_\nu (t_{a,b})|f_\nu ^{[𝐢]_a^b}`$ is a cyclic operator, and

$`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}=\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) Quite analogous as a). $`\mathrm{}`$

THEOREM 1.9.2.\[DETERMINANT FORMULA\] . For $`\nu `$ generic, we have

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

In particular, in Example 1.6.3 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 is a multiparametric extension of Theorem 2 in \[Zag\] which (case $`(q_{ij}=q)`$) reads as:$`detA_n(q)=_{k=2}^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).

## 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`$: 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`$. Then one can use multiparametric extensions of Propositions 3. and 4. of \[Zag\] which are to long to state them here.

### 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. For $`J=\{j_1<j_2<\mathrm{}<j_{l1}\}\{1,2,\mathrm{},n1\}`$ let $`S_J`$ be the following Young subgroup of $`S_n`$ defined by $`S_J:=S_{j_1}\times S_{j_2j_1}\times \mathrm{}\times S_{nj_{l1}},S_\varphi =S_n.`$ 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 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)(=\underset{gS_J}{}\widehat{R}_\nu (g)),\mathrm{\Gamma }_J^{(\nu )}=\widehat{R}_\nu (\gamma _J)(=\underset{g\gamma _J}{}\widehat{R}_\nu (g)).$$

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. $`\mathrm{}`$

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=nn1\mathrm{}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 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{\mathrm{}J\{1,2,\mathrm{},n1\}}{}(1)^{|J|+1}[A_J^{(\nu )}]^1)(I+(1)^n\widehat{R}_\nu (w_n))^1$$

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 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 accordingly $`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]\}`$ (see Figure 1).
(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

$`[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{where}\mathrm{\Phi }_I^\nu :=I(1)^{|I|}\widehat{R}_\nu (w_I)`$
and where $`\mathrm{}_{[a..b]}^\nu `$ is the diagonal matrix (cf. 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 any subdivision $`\sigma =I_1I_2\mathrm{}I_l\mathrm{\Sigma }_n`$ we define $`\mathrm{\Psi }_\sigma ^\nu :=_{j:|I_j|2}\mathrm{\Psi }_{I_j}^\nu `$ (factors commute here,because $`I_j^{}`$s are disjoint!), and similarly for any chain $`𝒞:\sigma ^{(1)}\mathrm{}\sigma ^{(m)}`$ in $`\mathrm{\Sigma }_n`$ we define

$$\mathrm{\Psi }_𝒞^\nu =\stackrel{}{}_{1jm}\mathrm{\Psi }_{\sigma ^{(j)}}^\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 for any generic weight $`\nu ,|\nu |=5`$ we have $`\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 =\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 ,`$.

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.(INVERSION FORMULA – CHAIN VERSION).  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. $`\mathrm{}`$

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 bracketing version of the Inversion formula of 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,\mathrm{},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

$$\begin{array}{c}[A^{123}]^1=\mathrm{\Psi }_{[123]}+\mathrm{\Psi }_{[[12]3]}+\mathrm{\Psi }_{[1[23]]}=\frac{1}{\mathrm{}_{\{1,2,3\}}}(I\widehat{R}_{123}(321))+\frac{1}{\mathrm{}_{\{1,2\}}\mathrm{}_{\{1,2,3\}}}\hfill \\ (I+\widehat{R}_{123}(213))(I\widehat{R}_{123}(321))+\frac{1}{\mathrm{}_{\{2,3\}}\mathrm{}_{\{1,2,3\}}}(I+\widehat{R}_{123}(132))(I\widehat{R}_{123}(321)).\hfill \end{array}$$

Similarly 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 }\mathrm{Mat}_{n!}(Z[q_{ij}])$$
$`i)`$
with $`\mathrm{}^\nu `$ denoting the diagonal matrix $`_{1a<bn}\mathrm{}_{[a..b]}^\nu =_{1a<bn}(I_{aklb}Q_{k,l}^\nu )`$

$$[A^{(\nu )}]^1\frac{1}{d_\nu }\mathrm{Mat}_{n!}(Z[q_{ij}])$$
$`i^{})`$
where $`d_\nu `$ is the following quantity $`_{\mu \nu ,|\mu |2}\mathrm{}_\mu =_{\mu \nu ,|\mu |2}(1_{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)}\mathrm{Mat}_{n!}(Z[q])$$
$`ii)`$
where $`\delta _n(q)=_{1a<bn}(1q^{(ba+1)(ba)})=_{k=2}^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}{}}\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{k=2}{\overset{n}{}}}(1q^{k(k1)})^{nk+1}=\delta _n(q).`$
This completes the proof of Extended Zagier’s conjecture. $`\mathrm{}`$

REMARK 2.2.9. In \[Zag\] p.201 Zagier conjectured that $`A_n(q)^1\frac{1}{\mathrm{}_n}\mathrm{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.15). 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). 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`$$`\mathrm{}`$

More generally,by a formal language method we found in \[MS\] that the number $`c_{n,k}`$ of chains,as above, having alltogether $`k`$ nondegenerate intervals is equal to $`c_{n,k}=\left(\genfrac{}{}{0pt}{}{n+k+1}{k}\right)\left(\genfrac{}{}{0pt}{}{n2}{k1}\right)/n`$ (e.g.$`c_{3,1}=1,c_{3,2}=2,c_{4,1}=1,c_{4,2}=5,c_{4,3}=5`$ ) yielding a simple formula for $`c_n=c_{n,1}+\mathrm{}+c_{n,n1}.`$(This formula is relevant to non-intersecting diagonals structures in one proof of Four Color Theorem and it is much simpler than the one given in \[CM1,CM2\]).
Now we turn our attention to 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=_{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 ($`\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}$$

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.

Similarly, for each $`\mathrm{}J\{1,2,\mathrm{},n1\}`$ we write $`[A_J^{(\nu )}]^1(g)=\mathrm{\Lambda }_J^\nu (g)A_J^{(\nu )}(g)`$ and for any $`I=[a..b]\{1,2,\mathrm{},n\}`$ we write $`[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.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{\mathrm{}J\{1,2,\mathrm{},n1\}}{}(1)^{|J|+1}[A_J^{(\nu )}]^1(g)\frac{1}{\mathrm{}_{[1..n]}^\nu }$$
$`()`$
Then for $`gS_n^>`$,we again use Prop.2.2.4 and Property 3.ii) in 1.8 The property ii) is immediate from (\*) because $`[A_J^\nu ]^1(g)0gS_J`$. To prove ii’) one can use the following lemma which we are going to state without proof. $`\mathrm{}`$

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})(=A_{[1..k]}^{(\nu )}A_{[k+1..n]}^{(\nu )})`$ is just $`A_J^{(\nu )}`$ when $`J=\{k\}`$.

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 `$, without outer brackets, of the word $`12\mathrm{}n`$, 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 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)`$$`\mathrm{}`$

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 Ex.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{}_{123}}}+{\displaystyle \frac{1}{\mathrm{}_{12}\mathrm{}_{123}}}+{\displaystyle \frac{1}{\mathrm{}_{23}\mathrm{}_{123}}}`$
$`=`$ $`{\displaystyle \frac{1}{\mathrm{}_{123}}}(1+{\displaystyle \frac{Q_{12}}{\mathrm{}_{12}}}+{\displaystyle \frac{Q_{23}}{\mathrm{}_{23}}})`$
Similarly for $`I=\{1,2,3,4\},\nu _1=\nu _2=\nu _3=\nu _4=1`$ we have

$$\begin{array}{ccc}\hfill \mathrm{\Lambda }^{1234}(id)=& \multicolumn{2}{c}{[A^{1234}]^1(id)}\\ \hfill =& \frac{1}{\mathrm{}_{1234}}\{1\hfill & +\frac{Q_{12}}{\mathrm{}_{12}}+\frac{Q_{23}}{\mathrm{}_{23}}+\frac{Q_{34}}{\mathrm{}_{34}}+\frac{Q_{12}Q_{34}}{\mathrm{}_{12}\mathrm{}_{34}}\hfill \\ & & +(1+\frac{Q_{12}}{\mathrm{}_{12}}+\frac{Q_{23}}{\mathrm{}_{23}})\frac{Q_{123}}{\mathrm{}_{123}}+(1+\frac{Q_{23}}{\mathrm{}_{23}}+\frac{Q_{34}}{\mathrm{}_{34}})\frac{Q_{234}}{\mathrm{}_{234}}\}\hfill \end{array}$$

(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$$

what agrees 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

$$\begin{array}{ccc}W(𝒟^{123})_{closed}\hfill & =\hfill & [A^{123}]^1(id)=Q_{\{1,2,3\}}^{}(I+Q_{\{1,2\}}^++Q_{\{2,3\}}^+)\hfill \\ W(𝒟^{1234})_{closed}\hfill & =\hfill & [A^{1234}]^1(id)=Q_{[\mathrm{1..4}]}^{}\{1+Q_{[\mathrm{1..2}]}^++Q_{[\mathrm{2..3}]}^++Q_{[\mathrm{3..4}]}^++\hfill \\ \multicolumn{3}{c}{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}]}^+\}}\end{array}$$

in the familiar formal language notation ($`x^{}=\frac{1}{1x},x^+=\frac{x}{1x}`$).

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 the label of 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 $`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)})$$

Substituting this into ($``$) we obtain the following algorithm for computing the diagonal matrices $`\mathrm{\Lambda }^\nu (g)`$ describing the inverse of $`A^{(\nu )}`$(recall $`[A^{(\nu )}]^1=_{gS_n}\mathrm{\Lambda }^\nu (g)\widehat{R}(g)`$). PROPOSITION 2.2.15.(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`$). 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). $`\mathrm{}`$

To ilustrate this algorithm we take (again!) $`g=41325786`$ ($`\nu `$ 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 (last) 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 divides 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 back to our algorithm. 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`$. Further 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.16.(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. By applying twice the algorithm in Proposition 2.2.15. $`\mathrm{}`$

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.17. \[INVERSE MATRIX ENTRIES\]  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\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=N(g):={\displaystyle \underset{k=0}{\overset{d}{}}}{\displaystyle \underset{I\sigma (g^{(k)})}{}}(CardI1),d^{^{}}=2(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.16).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`$$`\mathrm{}`$

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

$`[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{)}.`$
where $`\mathrm{\Lambda }^{123}(id)`$ and $`\mathrm{\Lambda }^{1234}(id)`$ are given as examples illustrating Corollary 2.2.13.(Here we abbreviated $`Q_{[\mathrm{1..2}]},Q_{[\mathrm{2..4}]}`$ to $`Q_{12}`$ (not to be confused 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 huge number of pages of messy expressions!). REMARK 2.2.18. By using our reduction to the generic case formula 1.7.1) $`[A^{(\nu )}]_{\mathrm{𝐢𝐣}}^1=_{hH}[\stackrel{~}{A}^{(\stackrel{~}{\nu })}]_{\stackrel{~}{𝐢},h\stackrel{~}{𝐣}}^1`$ we can write also formulas for the inverse matrix entries 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 hyperplanes $`H𝒜_n`$ which separate $`P_\pi `$ from $`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`$. 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. 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)!$$

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)`$. Note added in proof.After receiving a new book by Varchenko \[Multidimensional hypergeometric functions and representation theory of Lie algebras and quantum groups,World Scientific (1995)\] we found in it a result ( Theorem 3.11.2.-proved by different techniques) equivalent to our Theorem 3.1.3 ,but there seems to be no results equivalent to our inversion formulas applied to discriminant arrangements.

### 3.2 Quantum groups

We shall use the notations from \[SVa\]. Our Theorem 1.9.2 implies the following 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.