New techniques, both theoretical and practical, are presented for constructing permutation representations for computing with matrix groups defined over finite fields. The permutation representation is constructed on a conjugacy class of subgroups of prime order. We construct a base for the permutation representation, which in turn simplifies the computation of a strong generating set. In addit...

We prove that the multiparameter (product) space BMO of functions of bounded mean oscillation can be written as the intersection of finitely many dyadic product BMO spaces, with equivalent norms, generalizing the one-parameter result of T. Mei. We establish the analogous dyadic structure theorems for the space VMO of functions of vanishing mean oscillation, for Ap weights, for reverse-Hölder we...

For a graph G, let 9(G) be the family of strong orientations of G, d(G) = min{d(D) / D t 9’ (G)} and p(G) = d(G) -d(G), where d(G) and d(D) are the diameters of G and D respectively. In this paper we show that p(G) = 0 if G is a Cartesian product of (I ) paths, and (2) paths and cycles, which satisfy some mild conditions.

We discuss two methods for generating cryptographically strong elliptic curves deened over nite prime elds. The advantages and disadvantages of these algorithms are discussed and a practical comparison of the algorithms is given.

In finite mixtures of location-scale distributions, if there is no constraint or penalty on the parameters, then the maximum likelihood estimator does not exist because the likelihood is unbounded. To avoid this problem, we consider a penalized likelihood, where the penalty is a function of the minimum of the ratios of the scale parameters and the sample size. It is shown that the penalized max...

In this paper we study the local behavior of a solution to the Lamé system with Lipschitz coefficients in dimension n ≥ 2. Our main result is the bound on the vanishing order of a nontrivial solution, which immediately implies the strong unique continuation property. This paper solves the open problem of the strong uniqueness continuation property for the Lamé system with Lipschitz coefficients...

V. Chv atal proved that no minimal imperfect graph has a small transversal, that is, a set of vertices of cardinality at most + ! 1 which meets every !-clique and every -stable set. In this paper we prove that a slight generalization of this notion of small transversal leads to a conjecture which is as strong as Berge's Strong Perfect Graph Conjecture for a very large class of graphs, although ...

In order to prove the Strong Perfect Graph Conjecture, the existence of a ”simple” property P holding for any minimal non-quasi-parity Berge graph G would really reduce the difficulty of the problem. We prove here that this property cannot be of type ”G is F-free”, where F is any fixed family of Berge graphs.

Our proof (with Robertson and Thomas) of the strong perfect graph conjecture ran to 179 pages of dense matter; and the most impenetrable part was the final 55 pages, on what we called “wheel systems”. In this paper we give a replacement for those 55 pages, much easier and shorter, using “even pairs”. This is based on an approach of Maffray and Trotignon.