In other words, when (u; u(0N); 11 1;u(01)) belongs to U , asymptotically periodic inputs produce asymptotically periodic outputs with the same period. The proof of this theorem makes use of a contraction-mapping fixed-point argument. The techniques used in our omitted proofs are also useful in connection with related problems that are " more nonlinear. " In particular, related results are give...

We give bounds for optimal coverings of finite sets by elements of regular families of subsets, and show that both upper and lower bounds are asymptotically sharp for some families of examples.

We study the phase space of the spherically symmetric solutions of Einstein-Gauss-Bonnet system nonmin-imally coupled to a scalar field and show that in four dimensions the only regular black hole solutions are asymptotically flat.

We study properties of eigenvalues a matrix associated with randomly chosen partial automorphism regular rooted tree. show that asymptotically, as the level number goes to infinity, fraction non-zero converges zero in probability.

and Applied Analysis 3 proving: 1 a fixed point theorem for an asymptotically pseudocontractive mapping that is also uniformly L-Lipschitzian and uniformly asymptotically regular, 2 that the set of fixed points of T is closed and convex, and 3 the strong convergence of a CQ-iterative method. The literature on asymptotical-type mappings is very wide see, 7–15 . In 1967, Browder 16 and Kato 17 , ...

In this paper we use the concept of a pair of asymptotically regular and compatible mappings to prove some common fixed point theorems in a complete fuzzy 2-metric space.

We study the connectivity of random d-regular graphs which are recursively generated by an algorithm motivated by a peer to peer network. We show that these graphs are asymptotically almost surely d-connected for any even constant d ≥ 4.

In this paper we asymptotically count d-regular k-uniform hypergraphs on n vertices, provided k is fixed and d = d(n) = o(n). In doing so, we extend to hypergraphs a switching technique of McKay and Wormald.