Báo cáo toán học: " Kannan-type contractions and fixed points in uniform spaces" pot

... as: Włodarczyk and Plebaniak: Kannan-type contractions and fixed points in uniform spaces. Fixed Point Theory and Applications 2011 2011:90. Submit your manuscript to a journal and benefi t from: 7 ... 2011:90 http://www.fixedpointtheoryandapplications.com/content/2011/1/90 Page 14 of 24 RESEARCH Open Access Kannan-type contractions and fixed points in unifo...

Ngày tải lên: 20/06/2014, 21:20

... Convergence of a sequence of fixed points in a uniform space. Mat Vesnik. 13(28), 131–141 (1976) 2. Angelov, VG: A continuous dependence of fixed points of -contractive mappings in uniform spaces. ... points, known as the stability (or continuity) of fixed points, has been widely studied in fixed point theory in various set- tings (cf. [1-18]). The orig...

Ngày tải lên: 21/06/2014, 01:20

... h 1" alt =""

Ngày tải lên: 05/08/2014, 15:21

... h 1" alt =""

Ngày tải lên: 05/08/2014, 15:21

... 2-matroids Let Q 1 and Q 2 be 2-matroids. When Q 1 and Q 2 have the same ground-set and skew classes we shall use Q 1 + Q 2 to denote the parity system which is the sum of Q 1 and Q 2 . When Q 1 and Q 2 have ... since r 1 (A) ≤ r t 1 (A) ≤ r 1 (A) + 1 and r 1 (A) ≤ r ˜ t 1 (A) ≤ r 1 (A) + 1. Parity Systems and the Delta-Matroid Intersection Problem Andr´e Bouch...

Ngày tải lên: 07/08/2014, 06:20

... hypotheses of the above claim are satisfied, and hence x(µ)  x(ν). On the other hand, bearing in mind that µ and ν are in the interior of the same Weyl chamber C,andwµ = µ + and wν = ν + are dominant, ... β ∨  ν (Lemma 4.5) and the induction continues.  For the numbering of the vertices of A 0 in what follows, refer to Figure 4. Corollary 5.6. The Bruhat orde...

Ngày tải lên: 07/08/2014, 08:22

... claw-free graphs with minimum degree at least three that have equal total domination and matching numbers. Keywords: claw-free, matching number, total domination number 1 Introduction Total domination ... graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G.AsetS of vertices...

Ngày tải lên: 07/08/2014, 13:21

... generalizing a result of Favaron and Kratsch [4] regarding k = 1. Keywords: domination, irredundance, distance domination number, total domi- nation number, connected domination number, distance irredundance ... − D and D is at most k (and D induces a connected graph in G). The minimum cardinality of a (connected) distance k-dominating set in G is the (connected) dista...

Ngày tải lên: 07/08/2014, 15:22

... ∞. References [1] Madras N and Slade G 1993 The Self-Avoiding Walk (Boston: Birkh¨auser) [2] Hughes B D 1995 Random Walks and Random Environments, Vol I Random Walks (Oxford: Clarendon) [3] Vanderzande C 1998 ... quite straight-forward to generalise the algorithm to count twice punctured staircase polygons and in this case we obtained the series to perimeter 502 for k = 0, perimeter...

Ngày tải lên: 07/08/2014, 15:23

... γ(G) and i(G) are respectively the minimum cardinality of a dominating set and of an independent dominating set and β(G) is the maximum cardinality of an independent set. Alliances are defined in ... corona of a graph is obtained by attaching a pendant edge at each vertex of G. the electronic journal of combinatorics 15 (2008), #R123 2 Global alliances and indepe...

Ngày tải lên: 07/08/2014, 21:20

... containing a finite odd cut of G extends to an element of C. 1 Introduction Erd˝os et al. [17] characterised the in nite graphs G containing an Euler tour, that is, a two-way in nite walk traversing ... ny arc in |G| with on e endpoint in X and one in Y contains an edge from F . 4 Euler tours In this section we prove Theorem 1.3, but before we do so let us consider an exa...

Ngày tải lên: 07/08/2014, 21:21

... of the embedding factor w ′ = 343 which has embedding index 5, and the two 2’s of u are in po sitions 6 and 7. Note that we obtain ordinary factor order by taking P to be an antichain. Also, we will ... explains all the Wilf equivalences in S 5 . In particular, the results of Section 4 and the last paragraph of Section 5 generat e all of the Wilf equivalences in Table 1...

Ngày tải lên: 08/08/2014, 01:20

... Diffusion of innovations on random networks: Understanding the chasm. In Proceedings of WINE 2 008, pages 178–185, 2008. [20] M. Molloy and B. Reed. A critical point for random graphs with a given ... the study of percolation in a random graph with given vertex degrees. We refer to Section 3 for more details. k-Core in Random Graphs with Given Degree Seque...

Ngày tải lên: 08/08/2014, 12:22

... production and survival in the field. High N concentrations in seedlings may lead to Original article Dry matter and nitrogen allocation in western redcedar, western hemlock, and ... balance and organic acids in western redcedar, western hemlock, and Douglas fir seedlings grown in low- and high-N soils, Can. J. For. Res. 29...

Ngày tải lên: 08/08/2014, 14:21

... Tevlin, L., Thibon, J Y., Thiem, N., Venkateswaran, V., Vinroot, C. R., Yan, N., and Mike, Z. Supercharacters, symmetric functions in no ncommut ing variables, and related Hopf algebras. Preprint ... Rosas, M., and Zabrocki, M. Invariants and coinvariants of t he symmetric groups in noncommuting variables. Canad. J. Math. 60, 2 (20 08), 266–296. [4] Chen, W. Y. C., Li, T....

Ngày tải lên: 08/08/2014, 14:23