This paper is devoted to the proof of the following theorem.

THEOREM 1.1. Let H be a closed subgroup of a connected Lie group G, let N denote the largest (closed) subgroup of H which is normal in all of G, and suppose that π is a unitary representation of H whose restriction to N is a multiple of a character χ of N. Then every matrix coefficient of the induced representation Uπ vanishes at infinity modulo the kernel of Uπ providing that the following two conditions hold:

• i) N is almost-connected (finite modulo its connected component).

• ii) The subgroup Hk is “regularly related” to the diagonal subgroup D in Gk for at least one integer k ≧ k0 where k0 is determined by G and H.

A sequence of polynomials {Pn(x)} is orthogonal if Pn(x) is of precise degree n and there is a finite positive measure dμ such that

1.1

A necessary and sufficient condition for orthogonality [9] is that {Pn(x)} satisfies a three term recurrence

1.2

with

1.3

Given a sequence of orthogonal polynomials {Pn(x)} satisfying (1.2), the associated polynomials {Pn(γ)(x)}, γ > 0, are defined by

1.4

with P(γ)-1(x) = 0, P0(γ)(x) = 1, when An+γ and Bn+γ are well-defined.

For G a group, S a subset of G which generates G, the length problem in G with respect to S is to find, for g ∈ G, the least integer r such that g can be written as the product of r elements of S. For G an orthogonal group Of(F) (here F is a field, and the elements of Of(F) preserve the quadratic form f) and S the set of reflections in Of(F) the length problem has been studied by E. Cartan [2], J. Dieudonné [4, 5], E. Ellers [7], P. Scherk [8], and others. In all of these investigations, however, the problem posed by requiring that S be a single conjugacy class of reflections in Of(F) has been ignored. And it is generally the case that the reflections in Of(F) fall into several conjugacy classes.

This paper is a continuation of the Waterloo Research Report CORR 81-12, (see [1]) referred to in what follows as I. That Report is entitled “Chromatic Solutions”. It is largely concerned with a power series h in a variable z2, in which the coefficients are polynomials in a “colour number” λ. By definition the coefficient of z2r, where r > 0, is the sum of the chromatic polynomials of the rooted planar triangulations of 2r faces. (Multiple joins are allowed in these triangulations.) Thus for a positive integral λ the coefficient is the number of λ-coloured rooted planar triangulations of 2r faces. The use of the symbol z2 instead of a simple letter t is for the sake of continuity with earlier papers.

In I we consider the case

(1)

where n is an integer exceeding 4.

1. Introduction. The group of units, , of the integral group ring of a finite non-abelian group G is difficult to determine. For the symmetric group of order 6 and the dihedral group of order 8 this was done by Hughes-Pearson [3] and Polcino Milies [5] respectively. Allen and Hobby [1] have computed , where A4 is the alternating group on 4 letters. Recently, Passman-Smith [6] gave a nice characterization of where D2p is the dihedral group of order 2p and p is an odd prime. In an earlier paper [2] Galovich-Reiner-Ullom computed when G is a metacyclic group of order pq with p a prime and q a divisor of (p – 1). In this note, using the fibre product decomposition as in [2], we give a description of the units of the integral group rings of the two noncommutative groups of order p3, p an odd prime. In fact, for these groups we describe the components of ZG in the Wedderburn decomposition of QG.

If P(z) is a polynomial of degree n, then the inequality

1

is trivial. It was asked by Callahan [1], what improvement results from supposing that P(z) has a zero on |z| = 1 and he answered the question by showing that if P( l ) = 0, then

2

Donaldson and Rahman [3] have shown that if P(z) is a polynomial of degree n such that P(β) = 0 where β is an arbitrary non-negative number, then

3

whereas if the polynomial P(z) is such that P(l) = 0, then [4]

4

In this paper we will give brief proofs of two results on the undecidability of a first-order theory using a construction which we call a modified Boolean power. Modified Boolean powers were introduced by Burris in late 1978, and the first results were announced in [2]. Subsequently we succeeded in using this construction to prove the results in this paper, namely Ershov's theorem that every variety of groups containing a finite non-abelian group has an undecidable theory, and Zamjatin's theorem that a variety of rings with unity which is not generated by finitely many finite fields has an undecidable theory. Later McKenzie further modified the construction mentioned above, and combined it with a variant of one of Zamjatin's constructions to prove the sweeping main result of [3]. The proofs given here have the advantage (over the original proofs) that they use a single construction.

A well-known result of Chebyshev is that if pn ∊ Pn, (Pn is the set of polynomials of degree at most n) and

(1)

then an(pn), the leading coefficient of pn, satisfies

(2)

with equality holding only for pn = ±Tn, where Tn is the Chebyshev polynomial of degree n. (See [6, p. 57].) This is an example of an extremal problem in which the norm of a given linear operator on Pn is sought. Another example is A. A. Markov's result that (1) implies that

(3)

There are also results for the linear functionals pn(k)(x0), x0 real, k = 1, … n – 1 ([8]).

Suppose φ(x) ≧ 0 on [–1, 1] and (1) is generalized to

as suggested by Rahman [4] (polynomials with curved majorants), what can then be said about the analogue of (3) or similar extremal problems?

0. Notation. Throughout this paper p denotes a prime congruent to 1 modulo 4. It is well known that such primes are expressible in an essentially unique manner as the sum of the squares of two integers, that is,

(0.1)

with |a| and |b| uniquely determined by (0.1). Since a is odd, replacing a by –a if necessary, we can specify a uniquely by

(0.2)

Further, as {[(p – l)/2]!}2 = – 1 (mod p), we can specify b uniquely by

(0.3)

These choices are assumed throughout.

The following notation is also used throughout the paper: h(d) denotes the class number of the quadratic field of discriminant d, (d/n) is the Kronecker symbol of modulus |d|, [x] denotes the greatest integer less than or equal to the real number x, and {x} = x – [x].

Let G and B be abelian groups with G having exponent 2 and a distinguished element –1. In [7] we defined a linked quaternionic mapping to be a map q : G × G → B satisfying the following properties:

(A) q is symmetric and bilinear

(B) q(a, a) = q(a, – 1) for every a ∈ G, and

(L) q(a, b) = q(c, d) implies there exists x ∈ G such that q(a, b) = q(a, x) and q(c, d) = q(c, x).

A form (of dimension n over q) is a symbol φ = 〈a1, …, an〉 with a1, …, an ∈ G. The determinant and Hasse invariant of such a form φ are

The problem of additivity of the Pn-integral on abutting intervals was considered in [2] and in [5]. It was noted in [2] that the necessary and sufficient conditions for additivity for the P2-integral obtained by Skvorcov in [5] could be completely generalized to the Pn-integral, n > 2, if a key lemma (corresponding to Skvorcov's Lemma 3 [6]) could be proved. We provide a proof of that lemma in this paper and hence obtain the general additivity result.

The definitions and notation of [2] are used in the following, except that we shall take the following as the definition of Pn-major and minor functions:

Definition 1.1. Let f(x) be a function defined in [a, b] and let a1, i = 1, 2, …, n, be fixed points such that a = a1 < a2 < … < an = b.

Early in the Seventies I sought the number of rooted λ-coloured triangulations of the sphere with 2p faces. In these triangulations double joins, but not loops, were permitted. The investigation soon took the form of a discussion of a certain formal power series l(y, z, λ) in two independent variables y and z.

The basic theory of l is set out in [1]. There l is defined as the coefficient of x2 in a more complicated power series g(x, y, z, λ). But the definition is equivalent to the following formula.

1

Here T denotes a general rooted triangulation. n(T) is the valency of its root-vertex, and 2p(T) is the number of its faces. P(T, λ) is the chromatic polynomial of the graph of T.

Let ω0, ω1, … denote the Walsh-Paley functions and let G denote the dyadic group introduced by Fine [3]. Recall that a subset E of G is said to be a set of uniqueness if the zero series is the only Walsh series ∑ akωk which satisfies

A subset E of G which is not a set of uniqueness is called a set of multiplicity.

It is known that any subset of G of positive Haar measure is a set of multiplicity [5] and that any countable subset of G is a set of uniqueness [2]. As far as uncountable subsets of Haar measure zero are concerned, both possibilities present themselves. Indeed, among perfect subsets of G of Haar measure zero there are sets of multiplicity [1] and there are sets of uniqueness [5].

Soit T un endomorphisme continu de , nous montrons qu'il existe une fonction entière S sur Cn × Cn telle que ζ → S(x, ζ) soit de type exponential sur Cn avec croissance controlée uniformément lorsque x parcourt un compact de Cn, de telle sorte que pour on ait

( désigne la transformée de Fourier-Borel d'une fonctionnelle analytique). Une telle fonction S sera dite un symbole holomorphe sur Cn. Réciproquement nous montrons que si S est une fonctionnelle analytique, la formule précédente permet de définir un endomorphisme continu (encore noté S) de .

Let E be an m × (n + 1) regular interpolation matrix with elements ei, k = (E)i, k which are zero or one, with n + 1 ones. Then for each f ∈ Cn[a, b] and each set of knots X: a ≦ x1 < … < xm ≦ b, there is a unique interpolation polynomial P(f, E, X; t) of degree ≦ n which satisfies

1

A recent paper [1] discussed the continuity of P, as a function of x1, …,xm(with coalescences allowed). We would like to study in this note the analytic character of P as a function of real or complex knots X: x1, …, xm. This is easy for the Lagrange or the Hermite interpolation. In this case P is a polynomial in x1, …, xm if f is a polynomial, and an entire function in x1, …, xm if f is entire.

In a previous paper [13] one of us considered Brauer groups Br(C) and class groups Cl(C) attached to certain monoidal categories C of divisorial R-lattices. That paper showed that the groups arising for a suitable pair of categories C1 ⊆ C2 could be related by a tidy exact sequence

It was shown that this exact sequence specializes to a number of exact sequences which had formerly been handled separately. At the same time the conventional setting of noetherian normal domains was replaced by that of Krull domains, thus generalizing previous results while also simplifying the proofs. This work was carried out in an affine setting, and one aim of the present paper is to carry these results over to Krull schemes. This will enable us to recover the non-affine version of an exact sequence obtained by Auslander [1, p. 261], as well as to introduce a new, non-affine version of a different sequence derived by the same author [2, Theorem 1].

The constant term of certain rational functions has attracted much attention recently. For example the Dyson conjecture; that the constant term of

is the multinomial coefficient

has spawned many generalizations (see [2], [7]). In this paper we consider some other families of rational functions which have interesting constant terms. For example, Corollary 4 states that the constant term of

(1.1)

is . Here, and throughout this paper, A and B denote fixed positive integers.

In order to prove this result, we consider the rational function in two variables