Projective geometry and special relativity

Some concepts of real and complex projective geometry are applied to the fundamental physical notions that relate to Minkowski space and the Lorentz group. In particular, it is shown that the transition from an infinite speed of propagation for light waves to a finite one entails the replacement of a hyperplane at infinity with a light cone and the replacement of an affine hyperplane – or rest space – with a proper time hyperboloid. The transition from the metric theory of electromagnetism to the pre‐metric theory is discussed in the context of complex projective geometry, and ultimately, it is proposed that the geometrical issues are more general than electromagnetism, namely, they pertain to the transition from point mechanics to wave mechanics.     

Numerical solution of the three‐dimensional parabolic equation with an integral condition

Developement of numerical methods for obtaining approximate solutions to the three dimensional diffusion equation with an integral condition will be carried out. The numerical techniques discussed are based on the fully explicit (1,7) finite difference technique and the fully implicit (7,1) finite difference method and the (7,7) Crank‐Nicolson type finite difference formula. The new developed methods are tested on a problem. Truncation error analysis and numerical examples are used to illustrate the accuracy of the new algorithms. The results of numerical testing show that the numerical methods based on the finite difference techniques discussed in the present article produce good results. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 193–202, 2002; DOI 10.1002/num.1040     

弱(L_1,L_2)-BLD映射的正则性

本文首先将文［１］中的ＢＬＤ映射推广为弱（Ｌ１，Ｌ２）－ＢＬＤ映射，并证明了如下正则性结果：存在两个可积指数 Ｐ１＝Ｐ１（ｎ，Ｌ１，Ｌ２）＜ｎ＜ｑ１＝ｑ１（ｎ，Ｌ１，Ｌ２），使得对任意弱（Ｌ１，Ｌ２）－ＢＬＤ映射ｆ∈（Ω，Ｒｎ），都有ｆ∈（Ω，Ｒｎ），即ｆ为（Ｌ１，Ｌ２）－ＢＬＤ映射．     

A covering construction for packing disjoint copies of the Hoffman‐Singleton graph into K50

In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into K₅₀. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10049     

Biodegradable/biocompatible ABC triblock copolymer bearing hydroxyl groups in the middle block

New biodegradable/biocompatible ABC block copolymers, poly(ethylene oxide)‐b‐poly(glycidol)‐b‐poly(L ,L ‐lactide) (PEO‐PGly‐PLLA), were synthesized. First, PEO‐b‐poly(1‐ethoxyethylglycidol)‐b‐PLLA was synthesized by a successive anionic ring‐opening copolymerization of ethylene oxide, 1‐ethoxyethylglycidyl ether, and L ,L ‐lactide initiated with potassium 2‐methoxyethanolate. In the second step, the 1‐ethoxyethyl blocking groups of 1‐ethoxyethylglycidyl ether were removed at weakly acidic conditions leaving other blocks intact. The resulting copolymers were composed of hydrophilic and hydrophobic segments joined by short polyglycidol blocks with one hydroxyl group in each monomeric unit. These hydroxyl groups may be used for further copolymer transformations. The PEO‐PGly‐PLLA copolymers with a molecular weight of PLLA blocks below 5000 were water‐soluble. Above the critical micellar concentration (ranging from 0.05 to1.0 g/L, depending on the composition of copolymer), copolymers formed macromolecular micelles with a hydrophobic PLLA core and hydrophilic PEO shell. The diameters of the micelles were about 25 nm. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 3750–3760, 2003     

Extremes of deterministic sub‐sampled moving averages with heavy‐tailed innovations

Let {X_k}_k?1 be a strictly stationary time series. For a strictly increasing sampling function g:?→? define Y_k=X_g(k) as the deterministic sub‐sampled time series. In this paper, the extreme value theory of {Y_k} is studied when X_k has representation as a moving average driven by heavy‐tailed innovations. Under mild conditions, convergence results for a sequence of point processes based on {Y_k} are proved and extremal properties of the deterministic sub‐sampled time series are derived. In particular, we obtain the limiting distribution of the maximum and the corresponding extremal index. Copyright © 2003 John Wiley & Sons, Ltd.     

Interference of probabilities and number field structure of quantum models

We study the probabilistic consequences of the choice of the basic number field in the quantum formalism. We demonstrate that by choosing a number field for a linear space representation of quantum model it is possible to describe various interference phenomena. We analyse interference of probabilistic alternatives induced by real, complex, hyperbolic (Clifford) and p‐adic representations.     

Matrix perturbation theory for driven three‐level systems with damping

We investigate the dynamics of the Λ system driven by two resonant laser fields in presence of dissipation for coupling strengths where the rotating‐wave approximation starts to break down. This regime is characterised by Rabi frequencies being approximately equal or smaller than the field frequencies. A systematic procedure to obtain an expansion for the solution of the Bloch evolution equations of the system is presented. The lowest contribution results to be the well‐known rotating‐wave approximation. The method is based on a semi‐classical treatment of the problem, and its predictions are interpreted fully quantum mechanically. The theory is illustrated by a detailed study of the disappearance of coherent population trapping as the intensities of the fields increase.     

Some new results on superimposed codes

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.