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 Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost

A firm's logistics cost, including shipping and inventory-carrying, is a substantial percentage of its sales. Nevertheless, typical inventory-control methods ignore or insufficiently represent the shipping cost. This paper describes a recursive algorithm that determines the reorder cycle-time that minimizes total logistics cost. It allows for a realistic accounting of shipping cost, which is modelled here as a function of shipping distance and weight. The algorithm uses a relaxation procedure to identify a suitable initial approximation to the optimal order cycle-time and then, through a series of recursive steps, moves to the optimal result. We demonstrate the algorithm with a single item, with a group of items that share a common order cycle, and with multi-items when item demands are random variables. Experience with this algorithm indicates that it converges to the optimal result in a very few steps.     

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.     

Scattering of solitons for the Schrödinger equation coupled to a particle

We establish soliton-like asymptotics for finite energy solutions to the Schrödinger equation coupled to a nonrelativistic classical particle. Any solution with initial state close to the solitary manifold converges to a sum of a travelling wave and an outgoing free wave. The convergence holds in global energy norm. The proof uses spectral theory and the symplectic projection onto the solitary manifold in the Hilbert phase space.