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     

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.     

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     

A Language for Teaching Discrete-event Simulation

Courses which teach discrete-event simulation are based on many different simulation languages. The requirements for a language to support teaching simulation are discussed. In particular, it is recommended that such languages separate into distinct modules those aspects of simulation which are taught as separate topics. Implementation of the separation is discussed. The SEESIM language, developed as a teaching aid, is described, and examples of its use are given. Straightforward use of SEESIM can be learned quickly, yet the language provides facilities for a staged introduction to advanced concepts of simulation.     

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.