On Distance-Regular Graphs with Height Two

Let be a distance-regular graph with diameter at least three and height h = 2, where . Suppose that for every in and in _d(), the induced subgraph on _d() ₂() is a clique. Then is isomorphic to the Johnson graph J(8, 3).     

On Distance-Regular Graphs with Height Two, II

Let be a distance-regular graph with diameter and height , where . Suppose that for every in and every in , the induced subgraph on is isomorphic to a complete multipartite graph with . Then and is isomorphic to the Johnson graph .     

Theoretical Analysis of the Fluctuation Theorem Applied to Electric Circuits

We carry out a theoretical analysis of the fluctuations in the Johnson-Nyquist noise in an RC electric circuit being driven by a non-ideal constant current source. Using the appropriate Langevin equation, we derive the fluctuation theorem for the system. This analysis exhibits some interesting features. Firstly, the average of the dissipation function is not necessarily just an instantaneous entropy production, i.e. the work being done on the circuit by the external power source divided by the ambient temperature. Secondly, by appropriate selection of the values for the circuit components, the transient response of the system can be made identical to the nonequilibrium steady state response. In the limit of an ideal current source, the average of the dissipation function reduces to the entropy production. Our analysis accurately reproduces published experimental results.     

Algebraic K-theory of Normed Algebras

Quillen's algebraic K-theory of discrete rings is extended to the category of normed algebras over a commutative Banach ring k with unit and its relationship with topological K-theory is established. Sufficient conditions for the isomorphism of algebraic and topological K-groups on the category of real normed algebras are given. The isomorphism of algebraic and topological K-functors on the category of polynomial extensions of stable C-algebras is proved.     

Completely regular designs

We study a class of t-designs which enjoy a high degree of regularity. These are the subsets of vertices of the Johnson graph which are completely regular, in the sense of Delsarte [Philips Res. Reports Suppl. 10 (1973)]. After setting up the basic theory, we describe the known completely regular designs. We derive very strong restrictions which must hold in order for a design to be completely regular. As a result, we are able to determine which symmetric designs are completely regular and which Steiner systems with t = 2 are completely regular. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 261–273, 1998     

Fluoromethylene Transfer from Diarylfluoromethylsulfonium Salts: Synthesis of Fluorinated Epoxides

Diarylfluoromethyl sulfonium salts are efficient fluoromethylene transfer reagents equivalent to fluorocarbene, which is difficult to access. This was demonstrated by the development of a monofluorinated Johnson–Corey–Chaykovsky reaction with ketones and aldehydes, delivering uncommon 2-unsubstituted fluoroepoxides. This is the first evidence for the feasibility of sulfur fluoromethylylide and its action as a reaction intermediate.     

Mixed block designs

Let V_i (i = 1, 2) be a set of size v_i. Let D be a collection of ordered pairs (b₁, b₂) where b_i is a k_i-element subset of V_i. We say that D is a mixed t-design if there exist constants λ _(j,j2), (0 ≤ j_i ≤ k_i, j₁ + j₂ ≤ t) such that, for every choice of a j₁-element subset S₁ of V₁ and every choice of a j₂-element subset S₂ of V₂, there exist exactly λ_(j1,j2) ordered pairs (b₁, b₂) in D satisfying S₁ ⊆ b₁ and S₂ ⊆ b₂. In W. J. Martin [Designs in product association schemes, submitted for publication], Delsarte's theory of designs in association schemes is extended to products of Q-polynomial association schemes. Mixed t-designs arise as a particularly interesting case. These include symmetric designs with a distinguished block and α-resolvable balanced incomplete block designs as examples. The theory in the above-mentioned paper yields results on mixed t-designs analogous to those known for ordinary t-designs, such as the Ray-Chaudhuri/Wilson bound. For example, the analogue of Fisher's inequality gives |D| ≥ v₁ + v₂ − 1 for mixed 2-designs with Bose's condition on resolvable designs as a special case. Partial results are obtained toward a classification of those mixed 2-designs D with |D| = v₁ + v₂ − 1. The central result of this article is Theorem 3.1, an analogue of the Assmus–Mattson theorem which allows us to construct mixed (t + 1 − s)-designs from any t-design with s distinct block intersection numbers. © 1998 John Wiley & Sons, Inc. J Combin Designs 6:151–163, 1998