An Occurrence of the Ballot Numbers in Operator Theory (Q3983374)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 26699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Occurrence of the Ballot Numbers in Operator Theory |
scientific article; zbMATH DE number 26699 |
Statements
An Occurrence of the Ballot Numbers in Operator Theory (English)
0 references
27 June 1992
0 references
simple shift
0 references
adjoint
0 references
ballot numbers
0 references
0.7131990790367126
0 references
0.6965761780738831
0 references
0.6799361109733582
0 references
0.6759955883026123
0 references
Let \(S\), \(S^*\) be the simple shift and its adjoint on the Hilbert space \(\ell_ 2\). If \([P,Q]=QP-PQ\), define \(C_ 0=[S,S^*]\) and \(C_{n+1}\equiv[[C_ n,S],S^*]\). Let \(C_{ij}\) denote the \(j\)th diagonal element of \(C_ i\), and \([C_ i,S]_ j\), denote the \(j\)th off diagonal element of \([C_ i,S]\). The ballot numbers which play a role in a wide range of combinatorial arrangement problems are defined by \(B_ \infty=1\), \(B_{i,i+m}=0\), \(m\geq 1\), \(B_{i,j}=B_{i-1,j- 1}+B_{i,j+1}\), \(i>1\), where by convention \(B_{i,-1}=0\). Concerning the shift operator the author proves the following main result. Theorem: For all \(i,j\geq 0\), we have \[ C_{i,j}=(-1)^ j B_{i+j,2j} \qquad\text{and}\qquad [C_ i,S]_ j=(-1)^ j B_{i+j+1,2j+1}. \]
0 references