Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

GAUSSIAN WHITE NOISE CALCULUS OF GENERALIZED EXPANSION

A new framework of Gaussian white noise calculus is established, in line with generalized expansion in [3, 4, 7]. A suitable frame of Fock expansion is presented on Gaussian generalized expansion functionals being introduced here, which provides the integral kernel operator decomposition of the second quantization of Koopman operators for chaotic dynamical systems, in terms of annihilation operators dt and its dual, creation operators t*.     

On one generalization of a DiPerna and Majda theorem

The weak limits of sequences {f(u^ν)}_ν∈? where u^ν's are vector‐valued µ‐measurable functions defined on a compact set Ω and f is (possibly) discontinuous are investigated. As shown by the author (J. Conv. Anal. (to appear)), they are described in terms of integral formulae involving parametrized measures independent of f, similarly as in the classical theorem by Young and its generalization due to DiPerna and Majda. In the present paper we describe the supports of the involved parametrized measures. Copyright © 2006 John Wiley & Sons, Ltd.     

A dynamical test of phase transition order: New things in old places or old wine in new bottles

We first discuss nonlinear aspects of phase transition theory applied to a particular liquid crystal phase transition. A simple derivation is given to show how two coupled Goldstone modes (one appearing as gauge fluctuations of the ordered phase) can force a phase transition, against all expectations, to take place discontinuously (theory of Halperin, Lubensky, and Ma)-but the discontinuity may be immeasurably small. Then, we describe a new dynamical test of phase transition order, developed by Cladiset al., that turns out to be more sensitive than x-ray diffraction and adiabatic calorimetry. Quantitative data found by this new method are in excellent agreement with the measurements of adiabatic calorimetry and x-ray diffraction as well as expectations implicit in the predictions of HLM.This is the text of an after-banquet talk given at the CNLS Workshop on the Dynamics of Concentrated Systems.     

Theory of interfacial phase transitions in surfactant systems

The spin-1 Ising model, which is equivalent to the three-component lattice gas model, is used to study wetting transitions in three-component surfactant systems consisting of an oil, water, and a nonionic surfactant. Phase equilibria, interfacial profiles, and interfacial tensions for three-phase equilibrium are determined in mean field approximation, for a wide range of temperature and interaction parameters. Surfactant interaction parameters are found to strongly influence interfacial tensions, reducing them in some cases to ultralow values. Interfacial tensions are used to determine whether the middle phase, rich in surfactant, wets or does not wet the interface between the oil-rich and water-rich phases. By varying temperature and interaction parameters, a wetting transition is located and found to be of the first order. Comparison is made with recent experimental results on wetting transitions in ternary surfactant systems.This paper is dedicated to J. K. Percus in honor of his 65th birthday.     

An applied cell mapping method for optimal control problems

From the application point of view, a series of modifications are proposed for the cell mapping method discussed in Ref. 1 for the optimal control analysis of dynamical systems. The cell order around the target set is rearranged. A set of common discriminate principles is used for the selection of the optimal one among competing control strategies of the same cost. Inequality constraints of the system are taken into account. The number of elements in the set of allowable time intervals is not prescribed, but left open. These modifications seem to make the cell mapping method more efficient for analyzing feedback systems and for obtaining their global optimal control information. The algorithms presented in this paper could broaden the application of the cell mapping approach of Ref. 1 to a wider class of engineering problems.     

A method for calculating invariant subspaces of symmetric hyperbolic equations

An algorithm is constructed for calculating invariant subspaces of symmetric hyperbolic systems arising in electromagnetic, acoustic, and elasticity problems. Discrete approximations are calculated for subspaces that correspond to minimal eigenvalues and smooth eigenfunctions. Difficulties related to the presence of an infinite-dimensional kernel in the differential operator are successfully handled. The efficiency of the algorithm is demonstrated using acoustics equations.     

Commuting and stable feedback design for switched linear systems

In the paper, commuting and stable feedback design for switched linear systems is investigated. This problem is formulated as to build up suitable state feedback controller for each subsystem such that the closed-loop systems are not only asymptotically stable but also commuting each other. A new concept, common admissible eigenvector set (CAES), is introduced to establish necessary/sufficient conditions for commuting and stable feedback controllers. For second-order systems, a necessary and sufficient condition is established. Moreover, a parametrization of the CAES is also obtained. The motivation comes from stabilization of switched linear systems which consist of a family of LTI systems and a switching law specifying the switching between them, where if all the subsystems are stable and commuting each other, then the total system is stable under arbitrary switching.     

On c‐Bhaskar Rao designs with block size 4

Several new families of c‐Bhaskar Rao designs with block size 4 are constructed. The necessary conditions for the existence of a c‐BRD (υ,4,λ) are that: (1)λ_min=?λ/3 ≤ c ≤ λ and (2a) c≡λ (mod 2), if υ > 4 or (2b) c≡ λ (mod 4), if υ = 4 or (2c) c≠ λ ? 2, if υ = 5. It is proved that these conditions are necessary, and are sufficient for most pairs of c and λ; in particular, they are sufficient whenever λ?c ≠ 2 for c > 0 and whenever c ? λ_min≠ 2 for c < 0. For c < 0, the necessary conditions are sufficient for υ> 101; for the classic Bhaskar Rao designs, i.e., c = 0, we show the necessary conditions are sufficient with the possible exception of 0‐BRD (υ,4,2)'s for υ≡ 4 (mod 6). © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 361–386, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10009