We show that on Hilbert scheme of n points on C, the hyperkähler metric construsted by H. Nakajima via hyperkähler reduction is the Quasi-Asymptotically Locally Euclidean (QALE in short) metric constructed by D. Joyce.

and Applied Analysis 3 It is well known that, in an infinite dimensional Hilbert space, the normal Mann iterative algorithm has only weak convergence, in general, even for nonexpansive mappings. Hybrid projection algorithms are popular tool to prove strong convergence of iterative sequences without compactness assumptions. Recently, hybrid projection algorithms have received rapid developments;...

In this paper, we consider an iteration process to approximate a common random fixed point of a finite family of asymptotically quasi-nonexpansive random mappings in convex metric spaces. Our results extend and improve several known results in recent literature.

This paper establishes explicit quantitative bounds on the computation of approximate fixed points of asymptotically (quasi-) nonexpansive mappings f by means of iterative processes. Here f : C → C is a selfmapping of a convex subset C ⊆ X of a uniformly convex normed space X . We consider general Krasnoselski-Mann iterations with and without error terms. As a consequence of our quantitative an...

As proved by Kahn, the chromatic number and fractional chromatic number of a line graph agree asymptotically. That is, for any line graph G we have χ(G) ≤ (1 + o(1))χf (G). We extend this result to quasi-line graphs, an important subclass of claw-free graphs. Furthermore we prove that we can construct a colouring that achieves this bound in polynomial time, giving us an asymptotic approximation...