Proof of a conjecture on irredundance perfect graphs

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002     

Extrusion of pastes with a piston extruder for the determination of the local solid and fluid concentration, the local porosity and saturation and displacement profiles by means of NMR imaging

 Nuclear Magnetic Resonance (NMR) was used to investigate the extrusion behaviour of PTFE pastes in a ram extruder. By means of ¹H-NMR imaging (MRI) it is possible to determine the local proton density and therefore, the local fluid concentration. The ¹⁹F-MRI provides the local solid concentration. Thus the local saturation and the local porosity can be calculated with the information of the local fluid and solid concentration. Furthermore displacement profiles can be derived from NMR images by means of correlation techniques without any preparation or marking of the pastes. Received: 8 May 2000   Accepted: 1 May 2001     

Unconditional Bases, the Matrix Muckenhoupt Condition, and Carleson Series in a Spectrum

Two families of functions constructed by a system of n scalar Muckenhoupt weights are studied. Criteria are given under which these families are unconditional bases. From the point of view of the spectral operator theory, the problem is reduced to the study of the structure of n-dimensional perturbations of the integration operator. Weighted estimates for the Hilbert transform in the spaces of vector-functions are applied to construct an operator mapping functions of the studied families to vector-valued rational functions. The concept of the Carleson series is used in the study of the following problem: when do vector-valued rational functions form an unconditional basis? Bibliography: 8 titles.     

Numerical solutions of the shallow water equations with discontinuous bed topography

A simple scheme is developed for treatment of vertical bed topography in shallow water flows. The effect of the vertical step on flows is modelled with the shallow water equations including local energy loss terms. The bed elevation is denoted with z_b^‐ for the left and z_b⁺ for the right values at each grid point, hence exactly representing a discontinuity in the bed topography. The surface gradient method (SGM) is generalized to reconstruct water depths at cell interfaces involving a vertical step so that the fluxes at the cell interfaces can accurately be calculated with a Riemann solver. The scheme is verified by predicting a surge crossing a step, a tidal flow over a step and dam‐break flows on wet/dry beds. The results have shown good agreements compared with analytical solutions and available experimental data. The scheme is efficient, robust, and may be used for practical flow calculations. Copyright © 2002 John Wiley & Sons, Ltd.     

An evolution operator in semiclassical electrodynamics

An evolution operatior is described, which acts on the operators of a problem to take it into the solutions of the corresponding problem of semiclassical electrodynamics.Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Fizika, No. 12, pp. 66–69, November, 1981.     

Numerical analysis of near electromagnetic fields of a parabolic cylinder and a paraboloid of revolution

Translated from Chislennye Metody Resheniya Obratnykh Zadach Matematicheskoi Fiziki, pp. 119–127.     

A transfer map for singular fibrations

Using a new group of singular chains on polyhedra, a transfer map is defined on the chain level for fibrations with singularities. These include usual transfer on homology as well as Oliver transfer and other cases.     

Positive definite functions on the Heisenberg group

Work supported in part by the NSF     

On the optimal allocation of two active redundancies in a two-component series system

Components C₁ and C₂ form a series system. Suppose we can allocate the spare R₁ in parallel with C₁ and the spare R₂ in parallel with C₂, or otherwise, allocate R₁ with C₂ and R₂ with C₁. In this paper, we compare these two options using hazard rate ordering.