Chain sequences and compact perturbations of orthogonal polynomials.
Harper’s operator is defined on by where . We show that the norm of is less than or equal to for . This solves a conjecture stated in [1]. A general formula for estimating the norm of self-adjoint tridiagonal infinite matrices is also derived.
Let G be a group generated by r elements . Among the reduced words in of length n some, say , represent the identity element of the group G. It has been shown in a combinatorial way that the 2nth root of has a limit, called the cogrowth exponent with respect to the generators . We show by analytic methods that the numbers vary regularly, i.e. the ratio is also convergent. Moreover, we derive new precise information on the domain of holomorphy of γ(z), the generating function associated...
Let (W,S) be a Coxeter system such that no two generators in S commute. Assume that the Cayley graph of (W,S) does not contain adjacent hexagons. Then for any two vertices x and y in the Cayley graph of W and any number k ≤ d = dist(x,y) there are at most two vertices z such that dist(x,z) = k and dist(z,y) = d - k. Allowing adjacent hexagons, but assuming that no three hexagons can be adjacent to each other, we show that the number of such intermediate vertices at a given distance from x and y...
Let be a free group on generators. We construct the series of uniformly bounded representations of acting on the common Hilbert space, depending analytically on the complex parameter z, , such that each representation is irreducible. If is real or then is unitary; in other cases cannot be made unitary. For representations and are congruent modulo compact operators.
The aim of the Kaczmarz algorithm is to reconstruct an element in a Hilbert space from data given by inner products of this element with a given sequence of vectors. The main result characterizes sequences of vectors leading to reconstruction of any element in the space. This generalizes some results of Kwapień and Mycielski.
Radial convolution operators on free groups with nonnegative kernel of weak type (2,2) and of restricted weak type (2,2) are characterized. Estimates of weak type (p,p) are obtained as well for 1 < p < 2.
We study the relaxed Kaczmarz algorithm in Hilbert space. The connection with the non-relaxed algorithm is examined. In particular we give sufficient conditions when relaxation leads to the convergence of the algorithm independently of the relaxation coefficients.
Symmetric Jacobi matrices on one sided homogeneous trees are studied. Essential selfadjointness of these matrices turns out to depend on the structure of the tree. If a tree has one end and infinitely many origin points the matrix is always essentially selfadjoint independently of the growth of its coefficients. In case a tree has one origin and infinitely many ends, the essential selfadjointness is equivalent to that of an ordinary Jacobi matrix obtained by restriction to the so called radial functions....
Page 1