Báo cáo toán học: "Blocking Wythoff Nim Urban Larsson" pdf

... 4. [LaW¨a] U. Larsson, J. W¨astlund, Maharajah Nim, Wythoff s Queen meets the Knight, preprint. [Lar2] Urban Larsson, A Generalized Diagonal Wythoff Nim, to appear in In tegers. [SmSt02] F. Smith ... in particular not on a variation of Wythoff Nim. (if we drop the ‘upper’ condition then one may obvi ously regard the P -positions of, for example, Wythoff Nim as a splitting sequence,...

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

... defined B f the way that we did. The mis`ere version : To win at the mis`ere version (N,x) of dynamic nim, simply use the theory to win the game (N − 1,x), so that your opponent is forced to take the last ... Fibonacci Quarterly, 18 (1980), 300–303. [2] A. Holshouser, J. Rudzinski and H. Reiter, Dynamic One-Pile Nim, The Fibonacci Quarterly,toappear. [3] A. J. Schwenk, Take-Away Games, The F...

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

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: 06/08/2014, 05:20

... 1000010010 0100000000 0000000001 1000100000 0010000000 0000000000 0000000001 0000000001 0101000000 1000001100 References [1] Golomb, S.W. and Taylor, M., Two-dimensional synchronization patterns for minimal ambiguity, IEEE Transactions Information Theory, It-28, pp. 600-604, 1982. [2] Robinson, J.P.,

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

... therewith determine the maximum t such that ε t and δ t are less than γ. This maximum value of t will then minimize |E(G t )|≈E t =H t  n 2  . Of course, we can adjust γ and η to suit our convenience. To ... outcomes, as long as their probability is not too great. Theorem 6 Let m and M be, respectively, the minimum and maximum values taken by Y over all possible outcomes. Let C be a set of...

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

... even. Since the rightmost vertices r i on level i and r i+1 on level i + 1 are respectively the minimum and maximum label on levels i and i +1, we have that f(r i+1 ) − f (r i ) ≥ g(u i u i+1 ), the ... modifications. Lastly, we check that the bound on the range holds. Let f MIN and f MAX be respec- tively the minimum and maximum vertex labels generated by the labelling f.Inthecase where l is...

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

... be found in Duke [12] and Fagin [18]. The girth of a hypergraph H, containing a cycle, is the minimum length of a cycle in H. On a connection between 3-graphs of girth at least five and Greechie

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

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