Extremal length and Dirichlet problem on Klein surfaces

The object of this paper is to extend the method of extremal length to Klein surfaces by solving conformally invariant extremal problems on the complex double. Within this method we define the extremal length, the extremal distance, the conjugate extremal distance, the modulus, the reduced extremal distance on a Klein surface and we study their dependences on arcs.

Classification of Solutions to the Plane Extremal Distance Problem for Bodies With Smooth Boundaries

The determination of the contact points between two bodies with analytically described boundaries can be viewed as the limiting case of the extremal point problem, where the distance between the bodies is vanishing. The advantage of this approach is that the solutions can be computed efficiently along with the generalized state during time integration of a multibody system by augmenting the equations of motion with the corresponding extremal point conditions. Unfortunately, these solutions can degenerate when one boundary is concave or both boundaries are nonconvex. We present a novel method to derive degeneracy and nondegeneracy conditions that enable the determination of the type and codimension of all the degenerate solutions that can occur in plane contact problems involving two bodies with smooth boundaries. It is shown that only divergence bifurcations are relevant, and thus, we can simplify the analysis of the degeneracy by restricting the system to its one-dimensional center manifold. The resulting expressions are then decomposed by applying the multinomial theorem resulting in a computationally efficient method to compute explicit expressions for the Lyapunov coefficients and transversality conditions. Furthermore, a procedure to analyze the bifurcation behavior qualitatively at such solution points based on the Tschirnhaus transformation is given and demonstrated by examples. The application of these results enables in principle the continuation of all the solutions simultaneously beyond the degeneracy as long as their number is finite.

The Spectral Excess Theorem for Distance-Regular Graphs: A Global (Over)view

Distance-regularity of a graph is in general not determined by the spectrum of the graph. The spectral excess theorem states that a connected regular graph is distance-regular if for every vertex, the number of vertices at extremal distance (the excess) equals some given expression in terms of the spectrum of the graph. This result was proved by Fiol and Garriga [From local adjacency polynomials to locally pseudo-distance-regular graphs, J. Combinatorial Th. B 71 (1997), 162-183] using a local approach. This approach has the advantage that more general results can be proven, but the disadvantage that it is quite technical. The aim of the current paper is to give a less technical proof by taking a global approach.