Robust Algorithms for the Stable Set Problem

The stable set problem is to find in a simple graph a maximum subset of pairwise non-adjacent vertices. The problem is known to be NP-hard in general and can be solved in polynomial time on some special classes, like cographs or claw-free graphs. Usually, efficient algorithms assume membership of a given graph in a special class. Robust algorithms apply to any graph G and either solve the problem for G or find in it special forbidden configurations. In the present paper we describe several efficient robust algorithms, extending some known results.     

THE SPACE—FRACTIONAL TELEGRAPH EQUATION AND THE RELATED FRACTIONAL TELEGRAPH PROCESS

The space-fractional telegraph equation is analyzed and the Fourier transform of its fundamental solution is obtained and discussed.A symmetric process with discontinuous trajectories, whose transition function satisfies the space-fractional telegraph equation, is presented. Its limiting behaviour and the connection with symmetric stable processes is also examined.     

Additive Jordan isomorphisms of nest algebras on normed spaces

Let X be a real or complex Banach space. Let and be two nest algebras on X. Suppose that φ is an additive bijective mapping from onto such that φ(A²)=φ(A)² for every . Then φ is either a ring isomorphism or a ring anti-isomorphism. Moreover, if X is a real space or an infinite dimensional complex space, then there exists a continuous (conjugate) linear bijective mapping T such that either φ(A)=TAT⁻¹ for every or φ(A)=TA∗T−1 for every .     

Food Web Implications of δ13C and δ15N Variability over 370 km of the Regulated Colorado River USA

Abstract

Dual stable isotope analysis in the regulated Colorado River through Grand Canyon National Park, USA, revealed a food web that varied spatially through this arid biome. Down-river enrichment of δ¹³C data was detected across three trophic levels resulting in shifted food webs. Humpack chub δ¹³C and δ¹⁵N values from muscle plugs and fin clips did not differ significantly. Humpback chub and rainbow trout trophic position is positively correlated with standard length indicating an increase in piscivory by larger fishes. Recovery of the aquatic community from impoundment by Glen Canyon Dam and collecting refinements for stable isotope analysis within large rivers are discussed.     

Removal of dust from flue gas in magnetically stabilized fluidized bed

A magnetically stabilized fluidized bed (MSFB, φ 500mm x 2100mm) was designed to study dust removal from flue gas. Based on the mechanism of dust removal in a fixed bed, the effects on collection efficiency of magnetic field intensity, ratio of flue gas velocity to minimum fluidization velocity, bed height, and particle average diameter, were investigated. Then feasible methods for MSFB to better remove dust were proposed. Over 95% of dust removal with MSFB can be achieved, when stable fluidization is maintained and when magnetic particles are frequently renewed.     

Stability of two player game structures

We have extended a two player game-theoretical model proposed by V. Gurvich [To theory of multi-step games, USSR Comput. Math and Math. Phys. 13 (1973)] and H. Moulin [The Strategy of Social Choice, North Holland, Amsterdam, 1983]: All the considered game situations are framed by the same game structure. The structure determines the families of potential decisions of the two players, as well as the subsets of possible outcomes allowed by pairs of such choices. To be a solution of a game, a pair of decisions has to determine a (pure) functional equilibrium of the situational pair of payoff mappings which transforms the realized outcome into real-valued rewards of the players. Accordingly we understand that a structure is stable, if it admits functional equilibria for all possible game situations; and that it is complete, if every situation that only partitions the potential outcomes, is dominated by one of the players. We have generalized and strengthened a theorem by V. Gurvich [Equilibrium in pure strategies, Soviet Math. Dokl. 38 (1989)], proving that a proper structure is stable iff it is complete. Additional results provide game-theoretical insight that focuses the inquiry on the complexity of the stability decision problem; in particular, for coherent structures.These results also have combinatorial importance because every structure is characterized by a pair of hypergraphs [C. Berge, Graphes et Hypergraphes, Dunod, 1970] over a common ground set. The structure is dual (complete/coherent) iff the clutter of one hypergraph equals (includes/is included in) the blocker of the other one. So, for non-void coherent structures, the stability decision problem is equivalent to the much studied subexponential [M.L. Fredman, L. Khachiyan, On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms 21 (1996)] hypergraph duality decision problem.     

Tautological rings of stable map spaces

We find a set of generators and relations for the system of extended tautological rings associated to the moduli spaces of stable maps in genus zero, admitting a simple geometrical interpretation. In particular, when the target is Pn, these give a complete presentation for the cohomology and Chow rings in the cases with/without marked points.     

Two-Sided Optimal Bounds for Green Functions of Half-Spaces for Relativistic <Emphasis Type="Italic">α</Emphasis>-Stable Process

The purpose of this paper is to find optimal estimates for the Green function of a half-space of the relativistic α -stable process with parameter m on ℝ ^d space. This process has an infinitesimal generator of the form mI–(m ^2/α I–Δ) ^α/2, where 0<α<2, m>0, and reduces to the isotropic α-stable process for m=0. Its potential theory for open bounded sets has been well developed throughout the recent years however almost nothing was known about the behaviour of the process on unbounded sets. The present paper is intended to fill this gap and we provide two-sided sharp estimates for the Green function for a half-space. As a byproduct we obtain some improvements of the estimates known for bounded sets. Our approach combines the recent results obtained in Byczkowski et al. (Bessel Potentials, Hitting Distributions and Green Functions (2006) (preprint). ), where an explicit integral formula for the m-resolvent of a half-space was found, with estimates of the transition densities for the killed process on exiting a half-space. The main result states that the Green function is comparable with the Green function for the Brownian motion if the points are away from the boundary of a half-space and their distance is greater than one. On the other hand for the remaining points the Green function is somehow related the Green function for the isotropic α-stable process. For example, for d≥3, it is comparable with the Green function for the isotropic α-stable process, provided that the points are close enough. Research supported by KBN Grants.     

Another complete invariant for Steiner triple systems of order 15

In this note, the 80 non‐isomorphic triple systems on 15 points are revisited from the viewpoint of the convex hull of the characteristic vectors of their blocks. The main observation is that the numbers, of facets of these 80 polyhedra are all different, thus producing a new proof of the non‐isomorphism of these triple systems. The space dimension of these polyhedra is also discussed. Finally, we observe the large number of facets of some of these polyhedra with few vertices, in relation with the upper bound problem for combinatorial polyhedra. © 2005 Wiley Periodicals, Inc. J Combin Designs.     

套代数模上的线性保秩映射

主要讨论作用在复Hilbert空间弱闭 AlgN-模上的线性保秩映射，并给出在各种情况下保秩一性线性映射的刻画．作为应用，最后讨论了弱闭 AlgN-模上的模同构，并得出这样的同构是平凡的．