Stable subsets of modules and the existence of a unit in associative rings

We obtain criteria for the existence of a (left) unit in rings (arbitrary, Artinian, Noetherian, prime, and so on) that are based on the systematic study of properties of stable subsets of modules and their stabilizers that generalize the technique of idempotents. We study a class of quasiunitary rings that is a natural extension of classes of rings with unit and of von Neumann (weakly) regular rings, which inherits may properties of these classes. Some quasiunitary radicals of arbitrary rings are constructed, and the size of these radicals “measures the probability” of the existence of a unit. Translated fromMatematicheskie Zametki, Vol. 61, No. 4, pp. 596–611, April, 1997. Translated by A. I. Shtern     

Stable Homotopy Monomorphisms

It is well known that the concept of monomorphism in a category can be defined using an appropriate pullback diagram. In the homotopy category of TOP pullbacks do not generally exist. This motivated Michael Mather to introduce another notion of homotopy pullback which does exist. The aim of this paper is to investigate the modified notion of homotopy monomorphism obtained by applying the pullback characterization using Mather's homotopy pullback. The main result of Section 1 shows that these modified homotopy monomorphisms are exactly those homotopy monomorphisms (in the usual sense) which are homotopy pullback stable, hence the terminology “stable” homotopy monomorphism. We also link these stable homotopy monomorphisms to monomorphisms and products in the track homotopy category over a fixed space. In Section 2 we answer the question: when is a (weak) fibration also a stable homotopy monomorphism? In the final section it is shown that the class of (weak) fibrations with this additional property coincides with the class of “double” (weak) fibrations. The double (weak) covering homotopy property being introduced here is a stronger version of the (W) CHP in which the final maps of the homotopies involved play the same role as the initial maps.     

On moduli spaces for stable bundles on quadrics

We investigate the relation between stable representations of quivers and stable sheaves. A construction of thin smooth compact moduli spaces for stable sheaves on quadrics based on this relation is presented. Translated fromMatematicheskie Zametki, Vol 62, No. 6, pp. 843–864, December, 1997 Translated by S. K. Lando     

Competitive exclusion and coexistence in a Leslie–Gower competition model with Allee effects

The classical competitive exclusion principle states that two populations competing for a limited resource cannot coexist, one of the populations will drive the other to extinction. We prove in this work that when one population is subject to Allee effects, then for certain parameter regimes both competing populations may either coexist or one population may drive the other to extinction depending on initial conditions.     

On dominance core and stable sets for cooperative ellipsoidal games

Abstract

The allocation problem of rewards or costs is a central question for individuals and organizations contemplating cooperation under uncertainty. The involvement of uncertainty in cooperative games is motivated by the real world where noise in observation and experimental design, incomplete information and further vagueness in preference structures and decision-making play an important role. The theory of cooperative ellipsoidal games provides a new game theoretical angle and suitable tools for answering this question. In this paper, some solution concepts using ellipsoids, namely the ellipsoidal imputation set, the ellipsoidal dominance core and the ellipsoidal stable sets for cooperative ellipsoidal games, are introduced and studied. The main results contained in the paper are the relations between the ellipsoidal core, the ellipsoidal dominance core and the ellipsoidal stable sets of such a game.     

Multiple attractors in a Leslie–Gower competition system with Allee effects

We investigate asymptotic dynamics of the classical Leslie–Gower competition model when both competing populations are subject to Allee effects. The system may possess four interior steady states. It is proved that for certain parameter regimes both competing populations may either go extinct, coexist or one population drives the other population to extinction depending on initial conditions.     

The guaranteed cost control for uncertain nonlinear large-scale stochastic systems via state and static output feedback

The guaranteed cost control (GCC) problem involved in decentralized robust control of a class of uncertain nonlinear large-scale stochastic systems with high-order interconnections is considered. After determining the appropriate conditions for the stochastic GCC controller, a class of decentralized local state feedback controllers is derived using the linear matrix inequality (LMI). The extension of the result of the study to the static output feedback control problem is discussed by considering the Karush-Kuhn-Tucker (KKT) conditions. The efficiency of the proposed design method is demonstrated on the basis of simulation results.     

On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function

We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality. This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA.     

Gaugeability for Feynman-Kac functionals with applications to symmetric -stable processes

For symmetric -stable processes, an analytic criterion for a measure being gaugeable was obtained by Z.-Q. Chen (2002), M. Takeda (2002) and M. Takeda and T. Uemura (2004). Applying it, we consider the ultracontractivity of Feynman-Kac semigroups and expectations of the number of branches hitting closed sets in branching symmetric -stable processes.