Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups

We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each criterion is valid depend on the set of allowed gain groups. The binary cycle test is invalid, except for forests, if any possible gain group has an element of odd order. Assuming all groups are allowed, or all abelian groups, or merely the cyclic group of order 3, we characterize, both constructively and by forbidden minors, the graphs for which the circle test is valid. It turns out that these three classes of groups have the same set of forbidden minors. The exact reason for the importance of the ternary cyclic group is not clear. © 2005 Wiley Periodicals, Inc. J Graph Theory     

An Analogue of Distributivity for Ungraded Lattices

In this paper, we study lattices that posess both the properties of being extremal (in the sense of Markowsky) and of being left modular (in the sense of Blass and Sagan). We call such lattices trim and show that they posess some additional appealing properties, analogous to those of a distributive lattice. For example, trimness is preserved under taking intervals and suitable sublattices. Trim lattices satisfy a weakened form of modularity. The order complex of a trim lattice is contractible or homotopic to a sphere; the latter holds exactly if the maximum element of the lattice is a join of atoms. Any distributive lattice is trim, but trim lattices need not be graded. The main example of ungraded trim lattices are the Tamari lattices and generalizations of them. We show that the Cambrian lattices in types A and B defined by Reading are trim; we conjecture that all Cambrian lattices are trim.     

Stereocontrolled spirocyclic bislactams derived from pyroglutamic acid

The synthesis of rigid spirocyclic bislactams derived from pyroglutamic acid has been established.     

Zone specificity in low energy electron stimulated desorption of Cl from reconstructed Si(1 1 1)-7 × 7:Cl surfaces

Diffraction in electron stimulated desorption has revealed a propensity for Cl⁺ desorption from rest atom vs. adatom areas and unfaulted vs. faulted zones of Cl-terminated Si(1 1 1)-(7 × 7) surfaces. We associate the 15 eV ± 1 eV threshold with ionization of Si-Cl σ-bonding surface states and formation of screened two-hole states with Si 3s character. Similar specificity is observed from A and B reconstructions. This can be due to reduced screening in unfaulted regions and increased hole localization in Si back-bonds within faulted regions.     

Algebraic K-theory of non-linear projective spaces

In the spirit of “The Fundamental Theorem for the algebraic K-theory of spaces: I” (J. Pure Appl. Algebra 160 (2001) 21–52) we introduce a category of sheaves of topological spaces on n-dimensional projective space and present a calculation of its K-theory, a “non-linear” analogue of Quillen's isomorphism K_i(P_Rⁿ)₀ⁿK_i(R).     

Operations in A-theory

A construction for Segal operations for K-theory of categories with cofibrations, weak equivalences and a biexact pairing is given and coherence properties of the operations are studied. The model for K-theory, which is used, allows coherence to be studied by means of (symmetric) monoidal functors. In the case of Waldhausen A-theory it is shown how to recover the operations used in Waldhausen (Lecture Notes in Mathematics, Vol. 967, Springer, Berlin, 1982, pp. 390-409) for the A-theory Kahn-Priddy theorem. The total Segal operation for A-theory, which assembles exterior power operations, is shown to carry a natural infinite loop map structure. The basic input is the un-delooped model for K-theory, which has been developed from a construction by Grayson and Gillet for exact categories in Gunnarsson et al. (J. Pure Appl. Algebra 79 (1992) 255), and Grayson's setup for operations in Grayson (K-theory (1989) 247). The relevant material from these sources is recollected followed by observations on equivariant objects and pairings. Grayson's conditions are then translated to the context of categories with cofibrations and weak equivalences. The power operations are shown to be well behaved w.r.t. suspension and are extended to algebraic K-theory of spaces. Staying close with the philosophy of Waldhausen (1982) Waldhausen's maps are found. The Kahn-Priddy theorem follows from splitting the “free part” off the equivariant theory. The treatment of coherence of the total operation in A-theory involves results from Laplaza (Lecture Notes in Mathematics, Vol. 281, Springer, Berlin, 1972, pp. 29-65) and restriction to spherical objects in the source of the operation.     

The Third-Order Singular-Perturbation Expansion of the Planar Cold-Fluid Magnetron Equations

The singular-perturbation expansion of the plasma cold-fluid equations for crossed fields in a planar geometry is presented. The general expansion is carried out to third order. Various instabilities that occur in the first, second, and third orders are discussed.     

On the analysis of a dynamic evolutionary algorithm

Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability.