Commutativity of operators on the lattice of existence varieties

In a previous paper the authors introduced seven complete congruences on the lattice _ev(I of e-varieties of regular semigroups of the form _P :U _P VPU=PV, whereP is drawn from a small set of e-varieties: left zero, right zero, rectangular bands, groups, left groups, right groups and completely simple semigroups. Four new complete congruences are introduced here of the form _P :U _P VPU=PV, whereP is one of the following classes of regular semigroups: left monoids, right monoids, monoids, idempotent generated semigroups. For each complete congruence on _ev(I) and eachU_ev(I), the -class ofU is an interval [U ,U ] so that there is associated with each such congruence an idempotent operatorUU on _ev(I). This paper establishes numerous results concerning the commutativity of operators of this form.This work was supported in part by NSERC Grant 4044.     

A de bruijn-type formula for enumerating patterns of partitions

We develop a formula for enumerating the partitions of a set up to the action of a group. We give some special cases of this formula and illustrate its use with an example. Some comments are made relating the formula to an earlier formula.This work was supported in part by NSF Contract GP-43010.     

Characteristic functional equations of polynomials and the morera-carleman theorem

Several characteristic functional equations satisfied by classes of polynomials of bounded degree are examined in connection with certain generalizations of the Morera-Carleman Theorem. Certain functional equations which have nonanalytic polynomial solutions are also considered.     

The contraction number of a multigrid method for solving the Poisson equation

Summary The treatment of a multigrid method in the framework of numerical analysis elucidates that regularity of the solution is not necessary for the convergence of the multigrid algorithm but only for fast convergence. For the linear equations which arise from the discretization of the Poisson equation, a convergence factor 0,5 is established independent of the shape of the domain and of the regularity of the solution.Dedicated to Professor Dr.Dr.h.c. Lothar Collatz on the occasion of his 70 th birthday     

On a “lack of memory” property

For two independent nonnegative random variablesX andY we say thatX is ageless relative toY if the conditional probability P[X> Y+x|X>Y] is defined and is equal to P[X>x] for allx>0. Suppose thatX is ageless relative to a nonlatticeY with P[Y=0]<P [Y<X]. We show that the only suchX is the exponential variable. As a corollary it follows that exponential variable is the only one which possesses the ageless property relative to a continuous variable. Research partially supported by NRC of Canada grants #A8057 and #T0500. Work partially completed while on leave at Division of Math. Stat., C.S.I.R.O., Australia.     

A survey of pseudo (v,k, λ)-designs

This work is an attempt to give a complete survey of all known results about pseudo (v, k, )-designs. In doing this, the author hopes to bring more attention to his conjecture given in Section 6; an affirmative answer to this conjecture would settle completely the existence and construction problem for a pseudo (v, k, )-design in terms of the existence of an appropriate (v, k, )-design.     

Linear algorithms for testing the sign stability of a matrix and for findingZ-maximum matchings in acyclic graphs

Summary Ann×n real matrixA=(a _ij ) isstable if each eigenvalue has negative real part, andsign stable (orqualitatively stable) if each matrix B with the same sign-pattern asA is stable, regardless of the magnitudes ofB's entries. Sign stability is of special interest whenA is associated with certain models from ecology or economics in which the actual magnitudes of thea _ij may be very difficult to determine. Using a characterization due to Quirk and Ruppert, and to Jeffries, an efficient algorithm is developed for testing the sign stability ofA. Its time-and-space-complexity are both 0(n ²), and whenA is properly presented that is reduced to 0(max{n, number of nonzero entries ofA}). Part of the algorithm involves maximum matchings, and that subject is treated for its own sake in two final sections.     

On computing the number of subgroups of a finite Abelian group

We consider the numberN _A (r) of subgroups of orderp ^r ofA, whereA is a finite Abelianp-group of type =₁,₂,..., _l ()), i.e. the direct sum of cyclic groups of order ⁱⁱ. Formulas for computingN _A (r) are well known. Here we derive a recurrence relation forN _A (r), which enables us to prove a conjecture of P. E. Dyubyuk about congruences betweenN _A (r) and the Gaussian binomial coefficient .     

Harmonic maps with fixed singular sets

Suppose Ω is a smooth domain in R^m,N is a compact smooth Riemannian manifold, andZ is a fixed compact subset of Ω having finite (m − 3)-dimensional Minkowski content (e.g.,Z ism − 3 rectifiable). We consider various spaces of harmonic mapsu: Ω →N that have a singular setZ and controlled behavior nearZ. We study the structure of such spacesH and questions of existence, uniqueness, stability, and minimality under perturbation. In caseZ = 0,H is a Banach manifold locally diffeomorphic to a submanifold of the product of the boundary data space with a finite-dimensional space of Jacobi fields with controlled singular behavior. In this smooth case, the projection ofu εH tou |ϖΩ is Fredholm of index 0. R. H.’s research partially supported by the National Science Foundation.     

The Spearman footrule and a Markov chain property

An equivalent representation of the Spearman footrule is considered and a characterization in terms of a Markov chain is established. A martingale approach is thereby incorporated in the study of the asymptotic normality of the statistics.