Toeplitz operators on connected domains"

The proof of the index formula of the Toeplitz operator with a continuous symbol on the Hardy space for the unit circle in the complex plane depends on the Hopf theorem. However, the analogue result of the Hopf theorem does not hold on a general connected domain. Hence, the extension of the index formula of the Toeplitz operator on a general domain needs a method which is different from that for the case of the unit circle. In the present paper, the index formula of the Toeplitz operator with a continuous symbol on the finite complex connected domain in the complex plane is obtained, and the cohomology groups of Toeplitz algebras on general domains are discussed. In addition, the Toeplitz operators with symbols in QC are also discussed.     

A note on the spectral distribution of toeplitz matrices

An elementary and direct proof of the Szegö formula is given, for both eigen and singular values. This proof, which is based on tools from linear algebra and does not rely on the theory of Fourier series, simultaneously embraces multilevel Toeplitz matrices, block Toeplitz matrices and combinations of them. The assumptions on the generating

function f are as weak as possible; indeedf is a matrix-valued function of p variables, and it is only supposed to be integrable. In the case of singular values f(x), and hence the block p-level Toeplitz matrices it generates, are not even supposed to be square matrices. Moreover, in the asymptotic formulas for eigen and singular values the test functions involved are not required to have compact support.     

A 1Ψ1 Summation Theorem for Macdonald Polynomials

In this note we extend the Ramanujan's 11 summation formula to the case of a Laurent series extension of multiple q-hypergeometric series of Macdonald polynomial argument [7]. The proof relies on the elegant argument of Ismail [5] and the q-binomial theorem for Macdonald polinomials. This result implies a q-integration formula of Selberg type [3, Conjecture 3] which was proved by Aomoto [2], see also [7, Appendix 2] for another proof. We also obtain, as a limiting case, the triple product identity for Macdonald polynomials [8].     

On a Szegö formula for a class of generalized Toeplitz kernels

In this paper a strong Szegö limit formula is established for a class of generalized Toeplitz kernels. The proof rests largely upon a factorization identity which serves to reduce the problem to a form which is amenable to the analysis developed earlier for pair operators.     

On a Toeplitz determinant identity of Borodin and Okounkov

In this note we give two other proofs of an identity of A. Borodin and A. Okounkov which expresses a Toeplitz determinant in terms of the Fredholm determinant of a product of two Hankel operators. The second of these proofs yields a generalization of the identity to the case of block Toeplitz determinants.Supported by National Science Foundation grant DMS-9970879.Supported by National Science Foundation grant DMS-9732687.     

On inversion of hermitian block toeplitz matrices

A formula for the inverse of a hermitian block Toeplitz matrix via solutions of two block equations(instead of four in the general case) is given.     

矩阵值Caratheodory函数广义块Pick矩阵的秩不变性

Lasarow^[1]推导出矩阵值Carath\'{e}odory函数的第一、第二型广义块Pick矩阵及其变型的秩不变性. 这些矩阵由同一个Carath\'{e}odory函数的值与它的直到某阶的导数值确定. 利用文献[2]中提出的块Toeplitz向量方法, 该文断言,这些块矩阵的秩分别相关并重合于具有秩不变性的块Toeplitz矩阵的秩, 从而改进了这两类广义块Pick矩阵的秩不变性结论的证明.     

A Fredholm determinant formula for Toeplitz determinants

We prove a formula expressing a generaln byn Toeplitz determinant as a Fredholm determinant of an operator 1 –K acting onl ₂ (n,n+1,...), where the kernelK admits an integral representation in terms of the symbol of the original Toeplitz matrix. The proof is based on the results of one of the authors, see [14], and a formula due to Gessel which expands any Toeplitz determinant into a series of Schur functions. We also consider 3 examples where the kernel involves the Gauss hypergeometric function and its degenerations.     

A direct method to solve block banded block Toeplitz systems with non-banded Toeplitz blocks

A fast solution algorithm is proposed for solving block banded block Toeplitz systems with non-banded Toeplitz blocks. The algorithm constructs the circulant transformation of a given Toeplitz system and then by means of the Sherman-Morrison-Woodbury formula transforms its inverse to an inverse of the original matrix. The block circulant matrix with Toeplitz blocks is converted to a block diagonal matrix with Toeplitz blocks, and the resulting Toeplitz systems are solved by means of a fast Toeplitz solver.The computational complexity in the case one uses fast Toeplitz solvers is equal to ξ(m,n,k)=O(mn³)+O(k³n³) flops, there are m block rows and m block columns in the matrix, n is the order of blocks, 2k+1 is the bandwidth. The validity of the approach is illustrated by numerical experiments.     

Block toeplitz products of block toeplitz matrices

Necessary and sufficient conditions for the product of two block Toeplitz matrices to be block Toeplitz are obtained. In the special case of two Toeplitz matrices, the conditions simplify considerably and, when combined with known necessary and sufficient conditions for a nonsingular Toeplitz matrix to have a Toeplitz inverse, provide a simple characterization of the additional matrix structure required by a subclass of Toeplitz matrices in order for it to be closed with respect to both inversion and multiplication.     

A note on the solution of not balanced banded Toeplitz systems

A direct algorithm is presented for the solution of linear systems having banded Toeplitz coefficient matrix with unbalanced bandwidths. It is derived from the cyclic reduction algorithm, it makes use of techniques based on the displacement rank and it relies on the Morrison–Sherman–Woodbury formula. The algorithm always equals and sometimes outperforms the already known direct ones in terms of asymptotic computational cost. The case where the coefficient matrix is a block banded block Toeplitz matrix in block Hessenberg form is analyzed as well. The algorithm is numerically stable if applied to M‐matrices that are point diagonally dominant by columns. Copyright © 2007 John Wiley & Sons, Ltd.     

Applications of minor summation formula III, Plücker relations, lattice paths and Pfaffian identities

The initial purpose of the present paper is to provide a combinatorial proof of the minor summation formula of Pfaffians in [Ishikawa, Wakayama, Minor summation formula of Pfaffians, Linear and Multilinear Algebra 39 (1995) 285-305] based on the lattice path method. The second aim is to study applications of the minor summation formula for obtaining several identities. Especially, a simple proof of Kawanaka's formula concerning a q-series identity involving the Schur functions [Kawanaka, A q-series identity involving Schur functions and related topics, Osaka J. Math. 36 (1999) 157-176] and of the identity in [Kawanaka, A q-Cauchy identity involving Schur functions and imprimitive complex reflection groups, Osaka J. Math. 38 (2001) 775-810] which is regarded as a determinant version of the previous one are given.     

Using the Sherman-Morrison-Woodbury inversion formula for a fast solution of tridiagonal block Toeplitz systems

A fast numerical algorithm for solving systems of linear equations with tridiagonal block Toeplitz matrices is presented. The algorithm is based on a preliminary factorization of the generating quadratic matrix polynomial associated with the Toeplitz matrix, followed by the Sherman-Morrison-Woodbury inversion formula and solution of two bidiagonal and one diagonal block Toeplitz systems. Tight estimates of the condition numbers are provided for the matrix system and the main matrix systems generated during the preliminary factorization. The emphasis is put on rigorous stability analysis to rounding errors of the Sherman-Morrison-Woodbury inversion. Numerical experiments are provided to illustrate the theory.     

Arithmetic-Geometric Mean determinantal identity

In this paper, we give a generalization of a determinantal identity posed by Charles R. Johnson about minors of a Toeplitz matrix satisfying a specific matrix identity. These minors are those appear in the Dodgson’s condensation formula.     

Matrices with block Toeplitz inverses

Conditions for a nonsingular matrix to have a block Toeplitz inverse are obtained. A simpler criterion for a block Toeplitz matrix to have a block Toeplitz inverse is also given. The results generalize those of Huang and Cline for Toeplitz matrices with scalar entries, for which alternative statements and proofs are also indicated.     

A gap between hyponormality and subnormality for block Toeplitz operators

This paper concerns a gap between hyponormality and subnormality for block Toeplitz operators. We show that there is no gap between 2-hyponormality and subnormality for a certain class of trigonometric block Toeplitz operators (e.g., its co-analytic outer coefficient is invertible). In addition we consider the extremal cases for the hyponormality of trigonometric block Toeplitz operators: in this case, hyponormality and normality coincide.     

Multiple Meixner–Pollaczek polynomials and the six-vertex model

We study multiple orthogonal polynomials of Meixner–Pollaczek type with respect to a symmetric system of two orthogonality measures. Our main result is that the limiting distribution of the zeros of these polynomials is one component of the solution to a constrained vector equilibrium problem. We also provide a Rodrigues formula and closed expressions for the recurrence coefficients. The proof of the main result follows from a connection with the eigenvalues of (locally) block Toeplitz matrices, for which we provide some general results of independent interest.The motivation for this paper is the study of a model in statistical mechanics, the so-called six-vertex model with domain wall boundary conditions, in a particular regime known as the free fermion line. We show how the multiple Meixner–Pollaczek polynomials arise in an inhomogeneous version of this model.     

Conservative solution of the Fokker–Planck equation for stochastic chemical reactions

In this paper we discuss multigrid methods for ill-conditioned symmetric positive definite block Toeplitz matrices. Our block Toeplitz systems are general in the sense that the individual blocks are not necessarily Toeplitz, but we restrict our attention to blocks of small size. We investigate how transfer operators for prolongation and restriction have to be chosen such that our multigrid algorithms converge quickly. We point out why these transfer operators can be understood as block matrices as well and how they relate to the zeroes of the generating matrix function. We explain how our new algorithms can also be combined efficiently with the use of a natural coarse grid operator. We clearly identify a class of ill-conditioned block Toeplitz matrices for which our algorithmic ideas are suitable. In the final section we present an outlook to well-conditioned block Toeplitz systems and to problems of vector Laplace type. In the latter case the small size blocks can be interpreted as degrees of freedom associated with a node. A large number of numerical experiments throughout the article confirms convincingly that our multigrid solvers lead to optimal order convergence. AMS subject classification (2000) 65N55, 65F10     

Touchard–Riordan formulas, T-fractions, and Jacobi’s triple product identity

Touchard–Riordan-like formulas are certain expressions appearing in enumeration problems and as moments of orthogonal polynomials. We begin this article with a new combinatorial approach to prove such formulas, related to integer partitions. This gives a new perspective on the original result of Touchard and Riordan. But the main goal is to give a combinatorial proof of a Touchard–Riordan-like formula for q-secant numbers discovered by the first author. An interesting limit case of these objects can be directly interpreted in terms of partitions, so that we obtain a connection between the formula for q-secant numbers, and a particular case of Jacobi’s triple product identity. Building on this particular case, we obtain a “finite version” of the triple product identity. It is in the form of a finite sum which is given a combinatorial meaning, so that the triple product identity can be obtained by taking the limit. Here the proof is non-combinatorial and relies on a functional equation satisfied by a T-fraction. Then from this result on the triple product identity, we derive a whole new family of Touchard–Riordan-like formulas whose combinatorics is not yet understood. Eventually, we prove a Touchard–Riordan-like formula for a q-analog of Genocchi numbers, which is related with Jacobi’s identity for (q;q)³ rather than the triple product identity.     

Block companion Singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields

We discuss a conjecture concerning the enumeration of nonsingular matrices over a finite field that are block companion and whose order is the maximum possible in the corresponding general linear group. A special case is proved using some recent results on the probability that a pair of polynomials with coefficients in a finite field is coprime. Connection with an older problem of Niederreiter about the number of splitting subspaces of a given dimension are outlined and an asymptotic version of the conjectural formula is established. Some applications to the enumeration of nonsingular Toeplitz matrices of a given size over a finite field are also discussed.