Mock tridiagonal systems

We introduce the notion of a mock tridiagonal system. This is a generalization of a tridiagonal system in which the irreducibility assumption is replaced by a certain nonvanishing condition. We show how mock tridiagonal systems can be used to construct tridiagonal systems that meet certain specifications. This paper is part of our ongoing project to classify the tridiagonal systems up to isomorphism.     

A characterization of Leonard pairs using the notion of a tail

Let V denote a vector space with finite positive dimension. We consider an ordered pair of linear transformations A:V→V and A^∗:V→V that satisfy (i) and (ii) below:

(i)

There exists a basis for V with respect to which the matrix representing A is irreducible tridiagonal and the matrix representing A^∗ is diagonal.

(ii)

There exists a basis for V with respect to which the matrix representing A^∗ is irreducible tridiagonal and the matrix representing A is diagonal.

We call such a pair a Leonard pair on V. In this paper, we characterize the Leonard pairs using the notion of a tail. This notion is borrowed from algebraic graph theory.     

On the Similarity of Analytic Matrix Functions

Consider a domain , and two analytic matrix-valued functions functions . Consider also points and positive integers n ₁, n ₂, . . . , n _N . We are interested in the existence of an analytic function such that X(ω) is invertible, and G(ω) coincides with X(ω)F(ω)X(ω)⁻¹ up to order n _j at the point ω _j . We will see that such a function exists provided that F(ω _j ),G(ω _j ) have cyclic vectors, and the characteristic polynomials of F,G coincide up to order n _j at ω _j . This allows one to give a short proof to a result of Huang, Marcantognini and Young concerning spectral interpolation in the unit disk. The author was partially supported by a grant from the National Science Foundation. Received: September 8, 2006. Accepted: January 11, 2007.     

Wilf classification of three and four letter signed patterns

We give some new Wilf equivalences for signed patterns which allow the complete classification of signed patterns of lengths three and four. The problem is considered for pattern avoidance by general as well as involutive signed permutations.     

An algebraic structure for Faber polynomials

Let Σ be the set of functions, convergent for all |z|>1, with a Laurent series of the form f(z)=z+∑_n?0a_nz^-n. In this paper, we prove that the set of Faber polynomial sequences over Σ and the set of their normalized kth derivative sequences form groups which are isomorphic to the hitting time subgroup and the Bell^(k) subgroup of the Riordan group, respectively. Further, a relationship between such Faber polynomial sequences and Lucas and Sheffer polynomial sequences is derived.     

Quivers of finite mutation type and skew-symmetric matrices

Quivers of finite mutation type are certain directed graphs that first arised in Fomin-Zelevinsky’s theory of cluster algebras. It has been observed that these quivers are also closely related with different areas of mathematics. In fact, main examples of finite mutation type quivers are the quivers associated with triangulations of surfaces. In this paper, we study structural properties of finite mutation type quivers in relation with the corresponding skew-symmetric matrices. We obtain a characterization of finite mutation type quivers that are associated with triangulations of surfaces and give a new numerical invariant for their mutation classes.     

The bias of three pseudo-random shuffles

Three schemes for shuffling a deck ofn cards are studied, each involving a random choice from [n] ⁿ . The shuffles favor some permutations over others sincen! does not dividen ⁿ . The probabilities that the shuffles lead to some simple permutations, for instance cycles left and right and the identity, are calculated. Some inequalities are obtained which lead to information about the least and most likely permutations. Numbers of combinatorial interest occur, notably the Catalan numbers and the Bell numbers.     

Riordan group involutions

We study involutions in the Riordan group, especially those with combinatorial meaning. We give a new determinantal criterion for a matrix to be a Riordan involution and examine several classes of examples. A complete characterization of involutions in the Appell subgroup is developed. In another direction we find several examples that generalize the RNA matrix but are of independent interest.     

Solution of a tridiagonal operator equation

Let H be a separable Hilbert space with an orthonormal basis {e_n/n∈N}, T be a bounded tridiagonal operator on H and T_n be its truncation on span ({e₁, e₂, … , e_n}). We study the operator equation Tx = y through its finite dimensional truncations T_nxⁿ = y_n. It is shown that if and are bounded, then T is invertible and the solution of Tx = y can be obtained as a limit in the norm topology of the solutions of its finite dimensional truncations. This leads to uniform boundedness of the sequence . We also give sufficient conditions for the boundedness of and in terms of the entries of the matrix of T.     

Schur indices of association schemes

In this paper we introduce and investigate the theory of Schur indices arising from simple components of the rational adjacency algebras of association schemes and investigate methods for computing these indices.     

Some examples of singular fluid flows

We show, by an explicit construction, the existence of solutions to the Stokes system in dimension three that are singular on a fractal set. The singular points are understood in the sense given by Caffarelli, Kohn and Nirenberg [2]. As an application, we show the existence of suitable weak solutions to the Navier-Stokes equations, driven by rough forces, that are singular on a fractal set.     

On the singular graph and the Weyr characteristic of anM-matrix

LetA be anM-matrix in standard lower block triangular form, with diagonal blocksA _ii irreducible. LetS be the set of indices such that the diagonal blockA is singular. We define the singular graph ofA to be the setS with partial order defined by > if there exists a chain of non-zero blocksA _i, A_ij, , A_l.Let ₁ be the set of maximal elements ofS, and define thep-th level _p ,p = 2, 3, , inductively as the set of maximal elements ofS \( _{1 p-1}). Denote by _p the number of elements in _p . The Weyr characteristic (associated with 0) ofA is defined to be (A) = ( ₁, ₂,, _h ), where ₁ + + _p = dim KerA ^p ,p = 1, 2, , and _h > 0, _h+1 = 0.Using a special type of basis, called anS-basis, for the generalized eigenspaceE(A) of 0 ofA, we associate a matrixD withA. We show that(A) = ( ₁, , _h) if and only if certain submatricesD _p,p+1 ,p = 1, , h – 1, ofD have full column rank. This condition is also necessary and sufficient forE(A) to have a basis consisting of non-negative vectors, which is a Jordan basis for –A. We also consider a given finite partially ordered setS, and we find a necessary and sufficient condition that allM-matricesA with singular graphS have(A) = ( ₁, , _h). This condition is satisfied ifS is a rooted forest.The work of the second-named author was partly supported by the National Science Foundation, under grant MPS-08618 A02.     

Unitary similarity of projectors

Summary We deal with linear operators acting in a finite dimensional complex Hilbert space. We show that there exists a simple canonical form for projectors (not necessarily orthogonal) under unitary similarity. As a consequence we obtain a simple test for unitary similarity of projectors. IfP is a projector we show thatP andP ^* are unitarily similar. We also determine the isomorphism type of the algebra generated by the projectorsP andP ^*.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth     

The Structure of the Closure of the Rational Functions in <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">q</Emphasis></Superscript>(μ)

Let K be a compact subset in the complex plane and let A(K) be the uniform closure of the functions continuous on K and analytic on K°. Let μ be a positive finite measure with its support contained in K. For 1 ≤ q < ∞, let A^q(K, μ) denote the closure of A(K) in L^q(μ). The aim of this work is to study the structure of the space A^q(K, μ). We seek a necessary and sufficient condition on K so that a Thomson-type structure theorem for A^q(K, μ) can be established. Our theorem deduces J. Thomson’s structure theorem for P^q(μ), the closure of polynomials in L^q(μ), as the special case when K is a closed disk containing the support of μ.     

Factorization of the Non-Stationary Schrödinger Operator

We consider a factorization of the non-stationary Schr?dinger operator based on the parabolic Dirac operator introduced by Cerejeiras, K?hler and Sommen. Based on the fundamental solution for the parabolic Dirac operators, we shall construct appropriated Teodurescu and Cauchy-Bitsadze operators. Afterwards we will describe how to solve the nonlinear Schr?dinger equation using Banach fixed point theorem.     

Semigroup of matrices acting on the max-plus projective space

We investigate the action of semigroups of d×d matrices with entries in the max-plus semifield on the max-plus projective space. Recall that semigroups generated by one element with projectively bounded image are projectively finite and thus contain idempotent elements.In terms of orbits, our main result states that the image of a minimal orbit by an idempotent element of the semigroup with minimal rank has at most d! elements. Moreover, each idempotent element with minimal rank maps at least one orbit onto a singleton.This allows us to deduce the central limit theorem for stochastic recurrent sequences driven by independent random matrices that take countably many values, as soon as the semigroup generated by the values contains an element with projectively bounded image.     

A note on Cartan matrices for symmetric groups

Using generating functions, a very simple explicit formula for the determinants of the p-Cartan matrices of symmetric groups is given. Our method works also when p is a composite number.Received: 5 September 2001