Báo cáo toán học: "A converse to Ocneanu''''''''s theorem " potx

...

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

... class="bi x1 y0 w3 h 1" alt =""

Ngày tải lên: 05/08/2014, 09:46

... class="bi x0 y0 w2 h 1" alt =""

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

... [P k,1 ···P k,l ] k p,q forms the bibasic factorial factor of P of maximal length k. Iterating this procedure one gets a factorization of P in terms of “greatest” factorial factors. Definition 3. We s ay that ... falling bibasic factorial [P k,1 ] k p,q of maximal length k. For the remaining irreducible factors of P this procedure is applied again in order to find all k-th falling factorial d...

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

... write down the letters in the leftmost column from bottom to top, then write down the letters in the next -to- leftmost column from bottom to top, etc. Let w(T ) denote this word. (Although this ... ribbon tableaux. We define an operator R neg similar to the neg operator on colored tableaux. Working from the smallest ribbon to largest, and within a ribbon from left to right, convert...

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

... 1/30, then this sum can be decomposed into n parts so that all partial sums are ≤ 1. In this note we propose a counterexample which gives a negative answer to this conjecture. Keywords: Erd˝os-Graham-Spencer ... simple construction to show that the answer is negative: let {a i } = { divisors of 120 with the exception of 1 and 120 }. Furthermore, S´andor[3] proved the following results: T...

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

...

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

... h 5" alt =""

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

... easier to avoid than finite antichains! That is, to avoid a finite antichain over S it may be necessary to move to a larger alphabet, whereas this is not the case with infinite antichains. To give ... is too ambitious. An affirmative solution would imply that for any avoidable word w, it takes no more letters to avoid w and w R simultaneously than it does to avoid w alone. Strong evi...

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

... ‘∝’ to represents asymptotic proportionality, that is, asymptotic equivalence up to an un- specified multiplicative constant. the electronic journal of combinatorics 13 (2006), #R103 31 4.3 Factorizations ... accessible to the saddle point method. Finally, Gourdon has developed in [18] methods leading to asymptotic expansions of a shape similar to the ones of the present paper in rel...

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