序列覆盖的闭映射保持可度量性

设f:X→Y是连续的满映射. f称为序列覆盖映射,若{y})是Y中的收敛序列,则存在X中的收敛序列{xn},使得每一xn∈f-1(yn);f称为1序列覆盖映射,若对于每-y∈Y,存在x∈f-1(y),使得如果{yn}是Y中收敛于点y的序列,则有X中收敛于点x的序列{xn},使得每一xn∈f-1(yn).本文研究度量空间序列覆盖的闭映射之构造,否定地回答了Topology and its Applications上提出的一个问题.     

Approximate fixed point sequences and convergence theorems for Lipschitz pseudocontractive maps

Let be a nonempty closed convex subset of a real Banach space and be a Lipschitz pseudocontractive self-map of with . An iterative sequence is constructed for which as . If, in addition, is assumed to be bounded, this conclusion still holds without the requirement that Moreover, if, in addition, has a uniformly Gâteaux differentiable norm and is such that every closed bounded convex subset of has the fixed point property for nonexpansive self-mappings, then the sequence converges strongly to a fixed point of . Our iteration method is of independent interest.

     

The loss of tightness of time distributions for homeomorphisms of the circle

For a minimal circle homeomorphism we study convergence in law of rescaled hitting time point process of an interval of length 0$">. Although the point process in the natural time scale never converges in law, we study all possible limits under a subsequence. The new feature is the fact that, for rotation numbers of unbounded type, there is a sequence going to zero exhibiting coexistence of two non-trivial asymptotic limit point processes depending on the choice of time scales used when rescaling the point process. The phenomenon of loss of tightness of the first hitting time distribution is an indication of this coexistence behaviour. Moreover, tightness occurs if and only if the rotation number is of bounded type. Therefore tightness of time distributions is an intrinsic property of badly approximable irrational rotation numbers.

     

Asymptotic properties of two interacting maps

In this paper we consider a system whose state x changes to (x) if a perturbation occurs at the time t, for . Moreover, the state x changes to the new state (x) at time t, for . It is assumed that the number of perturbations in an interval (0, t) is a Poisson process. Here and are measurable maps from a measure space into itself. We give conditions for the existence of a stationary distribution of the system when the maps and commute, and we prove that any stationary distribution is an invariant measure of these maps.     

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G is at most ^p+1, where is the number of pairs of vertices in G at distance 2, and p is the cardinality of a maximum induced matching in G. In this paper, we give an analogue of this result for hypergraphs and, more generally, for subsets of vectors in the product of n lattices =₁××_n, where the notion of an induced matching in G is replaced by a certain binary tree each internal node of which is mapped into . We show that our bounds may be nearly sharp for arbitrarily large hypergraphs and lattices. As an application, we prove that the number of maximal infeasible vectors x=₁××_n for a system of polymatroid inequalities does not exceed max{Q,^logt/c(2Q,)}, where is the number of minimal feasible vectors for the system, , , and c(,) is the unique positive root of the equation 2^c(^c/log–1)=1. This bound is nearly sharp for the Boolean case ={0,1}ⁿ, and it allows for the efficient generation of all minimal feasible sets to a given system of polymatroid inequalities with quasi-polynomially bounded right-hand sides . This research was supported by the National Science Foundation (Grant IIS-0118635), and by the Office of Naval Research (Grant N00014-92-J-1375). The second and third authors are also grateful for the partial support by DIMACS, the National Science Foundation's Center for Discrete Mathematics and Theoretical Computer Science.Mathematics Subject Classification (2000):20E28, 20G40, 20C20     

On a Theorem of Holický and Zelený Concerning Borel Maps Without σ-Compact Fibers

The paper is concerned with a recent very interesting theorem obtained by Holický and Zelený. We provide an alternative proof avoiding games used by Holický and Zelený and give some generalizations to the case of set-valued mappings.     

On Vector Quasi-Equilibrium Problems with Set-Valued Maps

In this paper, we introduce a new class of vector quasi-equilibrium problems with set-valued maps. Almost all the vector equilibrium models of the Blum-Oettli type in the literature are special cases of our new class of equilibrium problems under consideration. Moreover, a number of C-diagonal quasiconvexity properties are proposed for set-valued maps, which are natural generalizations of the -diagonal quasiconvexity for real functions. Together with an application of continuous selection and fixed-point theorems, these conditions enable us to prove unified existence results of solutions for such vector equilibrium problems.     

On bifurcation points of a complex polynomial

Let be a polynomial of degree . Assume that the set there is a sequence s.t. and is finite. We prove that the set of generalized critical values of (hence in particular the set of bifurcation points of ) has at most points. Moreover, We also compute the set effectively.

     

Proper actions on cohomology manifolds

Essential results about actions of compact Lie groups on connected manifolds are generalized to proper actions of arbitrary groups on connected cohomology manifolds. Slices are replaced by certain fiber bundle structures on orbit neighborhoods. The group dimension is shown to be effectively finite. The orbits of maximal dimension form a dense open connected subset. If some orbit has codimension at most , then the group is effectively a Lie group.

     

Sheaves on Involutive Quantaloids

We extend the well-known notions of a singleton, complete -set, presheaf and sheaf over a complete Heyting algebra or a right-sided idempotent quantale to arbitrary involutive quantaloids. We show that sheaves on and complete -sets come to the same thing. This paper can be considered as a symmetric version of an earlier work of the author.