Báo cáo toán học: "On the orbits of Singer groups and their subgroups" pot

Báo cáo toán học: "On the orbits of Singer groups and their subgroups" pot

Báo cáo toán học: "On the orbits of Singer groups and their subgroups" pot

... orbits of Singer groups or subgroups of Singer groups. It seems, however, that only point (and, in the case the electronic journal of combinatorics 9 (2002), #R15 8 orbits of any Singer cycle of Σ n−1 on ... ✷ In the statement of the following theorem, µ denotes the M¨obius function, the basic properties of which can be found in, for example, [1]. Theore...
Ngày tải lên : 07/08/2014, 06:23
  • 10
  • 271
  • 0
Báo cáo toán học: "On the Continuity of Julia Sets and Hausdorff Dimension of Polynomials" ppsx

Báo cáo toán học: "On the Continuity of Julia Sets and Hausdorff Dimension of Polynomials" ppsx

... that lim n→∞ lim s→∞ μ c s (Y c s n )=0, the proof of theorem 2 is complete.  Open Question. I do not know any example satisfying the hypothesis of Theorem 2. Acknowledgments. I am grateful to the referee and the editor ... study the continuity of Julia set of some rational maps and the stability of the Hausdorff dimension of the Julia set of polynomials z d...
Ngày tải lên : 06/08/2014, 05:20
  • 7
  • 357
  • 0
Báo cáo toán học: "On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs" ppsx

Báo cáo toán học: "On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs" ppsx

... +2) ν n! ν!2 ν completing the proof of part (a) of Theorem 1. the electronic journal of combinatorics 7 (2000), #R57 5 Part 2 of the lemma follows from the chain of inequalities 1 φ(k) ≤ 1 γ(k 0 ) ≤ (β ... (14) and (9) we see that A G ≤ n O(1) f 1 (15) and the lower bound in Theorem 1(b) follows from (7), modulo taking advantage of slack to absorb the n O(1) term....
Ngày tải lên : 07/08/2014, 06:22
  • 11
  • 336
  • 0
Báo cáo toán học: "On the number of possible row and column sums of 0,1-matrices" pps

Báo cáo toán học: "On the number of possible row and column sums of 0,1-matrices" pps

... (5) the electronic journal of combinatorics 13 (2006), #N8 5 3 Start of the proof Let N = {0, 1, }. Define the weight of a matrix N to be the sum of its entries, and write |N| for the weight of ... of total degree at most n. This is true for the first term N((λ 1 , ,λ n−1 )) by the inductive hypothesis. Each of the subsequent terms is itself a sum. By the induc...
Ngày tải lên : 07/08/2014, 13:21
  • 6
  • 241
  • 0
Báo cáo toán học: " On the boundedness of the solutions in nonlinear discrete Volterra difference equations" pot

Báo cáo toán học: " On the boundedness of the solutions in nonlinear discrete Volterra difference equations" pot

... R + , 0 ≤ j ≤ n and p ∈ (0, 1). The following result provides a necessary and sufficient condition for the boundedness of the solution of (4.4) and (4.5). The necessary part of the next theorem was ... 2.3). Thus, the conditions of Theorem 3.1 hold, and the initial vector x 0 belongs to S, and hence the solution x(n; x 0 ) of (1.1) and (1.2) is bounded. We...
Ngày tải lên : 20/06/2014, 20:20
  • 24
  • 371
  • 0

Xem thêm