Báo cáo toán học: "A note on naturally embedded ternary trees" ppsx

Báo cáo toán học: "A note on naturally embedded ternary trees" ppsx

Báo cáo toán học: "A note on naturally embedded ternary trees" ppsx

... additional condition s − 2m 3 − m 2 ≡ 0 mod 2. The formal description of ternary trees translates into the following functional equation for F (z, u, v), where T (z) denotes the generating function ... discuss generalizations of the considered enumeration problems to embedded d-ary trees. Keywords: Ternary trees, Embedded trees, Labeled trees 1 Introduction The study of tree families...
Ngày tải lên : 08/08/2014, 14:23
  • 20
  • 159
  • 0
Báo cáo toán học: " A note on the almost sure limit theorem for self-normalized partial sums of random variables in the domain of attraction of the normal law" pptx

Báo cáo toán học: " A note on the almost sure limit theorem for self-normalized partial sums of random variables in the domain of attraction of the normal law" pptx

... PDF corresponds to the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. A note on the almost sure limit theorem for self-normalized ... below). For information about publishing your research in Journal of Inequalities and Applications go to http://www.journalofinequalitiesandapplications.com/authors/instructions/ For in...
Ngày tải lên : 20/06/2014, 21:20
  • 13
  • 480
  • 0
Báo cáo toán học: "A Note on Maximal Nonhamiltonian Burkard–Hammer Graphs" pptx

Báo cáo toán học: "A Note on Maximal Nonhamiltonian Burkard–Hammer Graphs" pptx

... question for all k ≥ 4 and to the second question for all k ≥ 5. We would like to note that there is an interesting discussion about the Burkard–Hammer condition in [9]. Concerning the hamiltonian ... Hamilton cycle if and only if G satisfies the Burkard– Hammer condition; (ii) If |I| =5and G satisfies the Burkard–Hammer condition, then G has no Hamilton cycles i f and only if G is isomorphic...
Ngày tải lên : 06/08/2014, 05:20
  • 13
  • 331
  • 0
Báo cáo toán học: "A note on antichains of words" potx

Báo cáo toán học: "A note on antichains of words" potx

... denoted by |w|. Thus |banana| = 6, for example. The language consisting of all words over Σ is denoted by Σ ∗ . If x, y ∈ Σ ∗ , the concatenation of x and y, written xy, is simply the string consisting ... m j , and hence that l is a subword of h ω (a). This contradicts Lemma 2.6. The supposition that m j encounters m i leads to a contradiction. We conclude that m i and m j are incomparable,...
Ngày tải lên : 07/08/2014, 06:20
  • 7
  • 393
  • 0
Báo cáo toán học: "A Note on the Symmetric Powers of the Standard Representation of Sn" ppt

Báo cáo toán học: "A Note on the Symmetric Powers of the Standard Representation of Sn" ppt

... representation of S n consists of the direct sum of the reflection representation and the trivial representa- tion. This trivial summand has no significant effect on the theory.) In this context it ... of nonnegative integer solutions to the equation λ 1 x 1 + ···+ λ k x k = N.Consequently, one easily verifies that f λ (q) is the generating function for the entries of the column corresponding ....
Ngày tải lên : 07/08/2014, 06:20
  • 8
  • 409
  • 0
Báo cáo toán học: "A Note on Sparse Random Graphs and Cover Graphs" docx

Báo cáo toán học: "A Note on Sparse Random Graphs and Cover Graphs" docx

... for a constant κ<2/3, then it outputs a cover graph whp. Note that the output graph will have whp girth equal to 4. On a related note we point to [8] which surveys constructions of non cover ... electronic journal of combinatorics 7 (2000), #R19 9 [8] O. Pretzel, Orientations and Edge Functions on Graphs, in: A.D.Keedwell (ed.), Surveys in Combinatorics, London Math. Soc. Lecture N...
Ngày tải lên : 07/08/2014, 06:20
  • 9
  • 380
  • 0
Báo cáo toán học: "A note on the non-colorability threshold of a random graph" pot

Báo cáo toán học: "A note on the non-colorability threshold of a random graph" pot

... information on Maple) implementation of the downhill simplex function optimization method (see [13] for a good description of the method and a C implementation) to the maximize the expression. This ... (3) When conditioning on the event C P 0 , the random graphs of the resulting probability space may contain edges only from within the edges that connect vertices of different partitions of...
Ngày tải lên : 07/08/2014, 06:20
  • 12
  • 424
  • 0