A Wolff-Denjoy theorem for infinitely connected Riemann surfaces

We generalize the classical Wolff-Denjoy theorem to certain infinitely connected Riemann surfaces. Let be a non-parabolic Riemann surface with Martin boundary . Suppose each Martin function , , extends continuously to and vanishes there. We show that if is an endomorphism of and the iterates of converge to the point at infinity, then the iterates converge locally uniformly to a point in . As an application, we extend the Wolff-Denjoy theorem to non-elementary Gromov hyperbolic covering spaces of compact Riemann surfaces. Such covering surfaces are of independent interest. Finally, we use the theory of non-tangential boundary limits to give a version of the Wolff-Denjoy theorem that imposes certain mild restrictions on but none on itself.

     

Real stable ranks

Several new notions of stable ranks for commutative Banach algebras are introduced. Due to the fact that they depend on certain orthogonal groups, they are called real stable ranks and are finer than their complex counterparts.     

The A-integral and restricted Ahlfors–Beurling transform

In this paper we prove that the restricted Ahlfors–Beurling transform of a Lebesgue integrable function is A-integrable and derive an analogue of Riesz's equality holds.     

On the construction of irredundant coverings of an integer matrix

New estimates are derived for the computational complexity of the problem of constructing irredundant coverings of an integer matrix (search for maximal conjunctions of a special logical function).     

Independent coverings and orthogonal colourings

In this paper, two open conjectures are disproved. One conjecture regards independent coverings of sparse partite graphs, whereas the other conjecture regards orthogonal colourings of tree graphs. A relation between independent coverings and orthogonal colourings is established. This relation is applied to find independent coverings of some sparse partite graphs. Additionally, a degree condition providing the existence of an independent covering in the case where the graph has a square number of vertices is found.     

Weighted covering numbers of convex sets

In this paper we define the notions of weighted covering number and weighted separation number for convex sets, and compare them to the classical covering and separation numbers. This sheds new light on the equivalence of classical covering and separation. We also provide a formula for computing these numbers via a limit of classical covering numbers in higher dimensions.     

Construction of covering maps between orientable surfaces

Consider the following problem. Can a set of numbers be realized as boundary covering indices of a covering map between surfaces? How to realize them? A set of equivalent criteria for this problem are found, which can be checked by a finite algorithm. Furthermore, the algorithm will also construct a solution if such one exists. As an application, a well_known group of necessary conditions are shown to be not sufficient in infinitely many cases, while in most cases, numbers satisfying them are realizable.     

On the solvability of implicit differential inclusions

In the paper, the set-valued covering mappings are studied. The statements on solvability, solution estimates, and well-posedness of inclusions with conditionally covering mappings are proved. The results obtained are applied to the investigation of differential inclusions unsolved for the unknown function. The statements on solvability, solution estimates, and well-posedness of these inclusions are derived.