Báo cáo toán học: "Tournaments as Feedback Arc Sets" docx

... class="bi x0 y1 w2 h 2" alt =""

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

...

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

... class="bi x0 y1 w1 h 4" alt =""

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

... alt =""

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

...

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

... direct consequence of Theorem 2.1 we obtain Consequence 2.1. Applying transformation L and R on minimal unavoidable sets leads to minimal unavoidable sets again. The proofs of the following lemmas ... a minimal unavoidable set. If Y can be obtained from X by applying first some transformation RC or LC, and then some transformation Generating of Minimal Unavoidable Sets...

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

... hard to show that if T has a feedback arc set whose arcs are the arcs of a (Hamiltonian) path then the minimum size of a feedback arc set in T equals the maximum number of arc disjoint cycles. Question: ... Introduction A feedback arc set in a digraph is a set of arcs whose removal makes the digraph acyclic. J.P. Barthelemy asked whether every acyclic digraph arises as the arc...

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

... 51–72. [6] P. Diaconis and L. Saloffe-Coste, Walks on generating sets of group, Stanford Technical Report No. 481, July 1995, 36 pages. [7] P. Diaconis and L. Saloffe-Coste, Walks on generating sets of abelian ... most c r n 2 log n where the constant c r depends only on the order r of G . 1. Introduction One method often used in computational group theory for generating...

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

... member of the second coordinate of the label of y, delete the edge x j y.If the digit of z is 3 and y is not a member of the second coordinate of the label of z, delete the electronic journal of ... Subclaims, the proof of our lemma is complete. 5 Proof of the Main Theorem In this section, we present the proof of the main theorem. Let C be a topologically closed class o...

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

... n.LetI B and I S be subsets of [k] and let B = {C i : i ∈ I B } and S = {C i : i ∈ I S }. We refer to the sets B and S as the bases and summits of G respectively. A set C i ∈BiscalledabaseofG and ... known techniques [10, 11, 12] for ranking and unranking function classes and hence the bijections provide ways to rank and unrank spanning trees of K n and K n 1 , ,n k ....

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

... +1| 2mt+1 = mt, the difference m-tuples obtained from a hooked Skolem-type m -cycle difference set of order t form a modulo v difference set that uses edges of lengths 1, 2, ,mt. Theorem 3.3 For all integers ... Skolem-type m -cycle difference set of size t. Hence it remains to construct a Skolem-type m -cycle difference set of size t whenever mt ≡ 0, 3(mod 4) and a hooked Skolem-ty...

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

... separates all the sets of at most  vertices of G.The dedicated terminology [12] for such codes is (1, ≤ ) -identifying codes. ThesetsI(X)are said to be the identifying sets of the corresponding ... sets of at most  vertices of G,andifalltheI(X, C)’s are nonempty then we say that C covers the sets of at most  vertices of G.WesaythatC is a code identifying set...

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

... the Frobenius number with fairly simple computations. 5. A Frobenius Growth Model Fast algorithms for f(A) can be used to generate data that can lead to estimates on the average size of the Frobenius ... once. The complete DQQD method is formally described as follows. A proof of correctness for DQQD is essentially identical to that for BFD. DQQD ALGORITHM FOR THE FROBENIUS N...

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

... follows from Theorem 2 and item 4 above. ✷ Corollary 1 There exists a partition of n with BG-rank = j if and only if j + n is even and j(2j − 1) ≤ n. 4 Congruences Berkovich and Garvan’s motivation ... 13 (2006), #N18 2 References [1] Alexander Berkovich and Frank Garvan, On the Andrews-Stanley refinement of Ra- manujan’s partition congruence modulo 5 and generalizations, Trans. A...

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

... Dordrecht, 1993. the electronic journal of combinatorics 13 (2006), #R28 17 Monochromatic and zero-sum sets of nondecreasing modified diameter David Grynkiewicz ∗ and Rasheed Sabar †‡ Submitted: Oct ... subset of [1, 3m− 3] of cardinality m + m a − 1 + 1 contains a zero-sum m-set, whence the proof is complete by the arguments at the end of the first paragraph of Case...

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