Báo cáo toán học: "On the distribution of depths in increasing trees" ppsx

... 05C05 60C05 Abstract By a theorem of Dobrow and Smythe, the depth of the kth no de in very simple families of increasing trees (which includes, among others, binary increasing trees, recursive trees ... Dobrow/Smythe, Theorem 6) In a random increasing tree with n nodes from a simple family, the distribution of the distance between nodes i and k (i < k) is the...

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

... (3.9). If i is odd then p i q j ≺ p i−1 q j+1 . This shows the inequality between the last term of the first line and the first term in the second line of (3.10). ✷ For graphs consisting of more than ... ≥ 3. All matchings of P k , where the vertex k is not in the matching, generate the polynomial p k−1 (x). All matchings of P k , where the vertex k is in the...

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

... corresponds a filling L(G) of a Ferrers diagram F (G) whose shape is determined by the sequence of opening and closing vertices of G. The row sums of the filling L(G) give the left degrees of G and the column ... ∗, se = k), where the ∗ indicates that there is no the electronic journal of combinatorics 13 (2006), #N21 3 On the symmetry of the distribution of...

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

... on R d . In recent years, there has been an increasing interest in the study of the asymptotic behavior of the solutions of both convolution and non-convolution-type linear and nonlinear Volterra ... aim in this section is to obtain sufficient condition for the boundedness of the solution of (1.1) under the initial condition (1.2), but in the linear case of V...

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

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

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

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

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

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

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