The convergence of shooting methods
Shooting methods for nonlinear boundary value problems are examined. It is shown that the methods converge whenever the problem is well posed in the sense that the solution to be computed is isolated.

title: On the Approximation of Fixed Points of Nonlinear Compact Operators
abstract: Certain methods for the approximate solution of $x - Kx = 0$, where K is a compact operator, lead to a family of operator equations $x - K_n x = 0$, $n \geqq 1$, where $K_n $,$n \geqq 1$, are collectively compact and converge pointwise to K. In this paper a new and simplified proof of the existence and uniqueness of a solution of $x - K_n x = 0$ in a neighborhood of an isolated solution of $x - Kx = 0$ is given.

title: An analysis of the box and trapezoidal schemes for linear singularly perturbed boundary value problems
abstract: Stability and convergence results are derived for the box and trapezoidal schemes applied to boundary value problems for linear singularly perturbed first order systems of o.d.e.'s without turning points.

title: The application of implicit Runge-Kutta and collection methods to boundary-value problems
abstract: The solution of a nonlinear system of first order differential equations with nonlinear boundary conditions by implicit Runge-Kutta methods based on interpolatory quadrature formulae is examined. An equivalence between implicit Runge-Kutta and collocation schemes is established. It is shown that the difference equations obtained have a unique solution in a neighbourhood of an isolated solution of the continuous problem, that this solution can be computed by Newton iteration and that it converges to the isolated solution. The order of convergence is equal to the degree of precision of the related quadra- ture formula plus one. The efficient implementation of the methods is discussed and numerical examples are given. 1.  We investigate the application of certain implicit Runge- Kutta methods (cf. Butcher (2)) to the numerical solution of nonlinear boundary- value problems of the form

title: Algorithm 546: SOLVEBLOK [F4]
abstract: Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for dtrect commercial advantage, the ACM copymght notice and the title of the pubhcation and its date appear, and notme is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to repubhsh, requires a fee and/or specific permission.

title: Symmetric graphs with projective subconstituents
abstract: Let P be an undirected graph and G a subgroup of aut(r) acting transitively on the vertex set of P. Let x be an arbitrary vertex of P. We denote by P(x) the set of vertices adjacent to x and by G(x)F(x) the permutation group induced by the stabilizer G (x) of x in G on P(x); G (x)r(X) is called the subconstituent of the pair (P, G). For each i E N let Gi(x) = {a E G(x)Ia E G(y) if a (x, y) 1 then s 3. In , it was shown that s 3. We prove the following partial result:

title: 3-transpositions in infinite groups
abstract: Let G be a group. A subset D will be called a set of 3-transpositions if | x | = 2 for x e D and | xy | = 3 whenever x, yeD do not commute. We will call the set D closed if xDx −1 = D for each xeD . For each xeD , let For each subset X of D , we denote by [ X ] the graph with vertex set X where two elements x, yeX are joined by an edge whenever they commute. We denote by ( X ) the complement graph; thus two elements x, yeX are joined by an edge of ( X ) whenever they do not commute.

title: Distance-transitive graphs and generalized polygons
abstract: On etablit un theoreme sur un graphe Γ connexe, regulier de valence k≥3, circonference finie g, avec s≥4. Γ est (G,s)-transitif pour G≤aut(Γ) tel que G(x) est fini pour chaque sommet x

title: On finite Moufang polygons
abstract: We show that a finite generalized polygon Γ is Moufang with respect to a groupG if and only if for every flag {x, y} of Γ, the subgroupG1(x, y) ofG fixing every element incident with one ofx, y acts transitively on the set of apartments containing the elementsu, x, y, w, whereu≠y (resp.w≠x) is an arbitrary element incident withx (resp.y).

title: The nonexistence of 8-transitive graphs
abstract: We prove that the inequalitys≦7 holds for finites-transitive graphs assuming that the list of known 2-transitive permutation groups is complete.

title: Presentations for (G,s)-transitive graphs of small valency
abstract: Given a group G , a subgroup H and an element a ∈ G , we define Γ( G, H, a ) to be the graph on the set of left-cosets of H in G , where two left-cosets g 1 H and g 2 H are adjacent whenever . We will consider this construction only in the case that The first of these conditions assures that adjacency is a symmetric relation (i.e. that Γ( G, H, a ) is an undirected graph) and the second assures that Γ( G, H, a ) is connected.