A Family of Nim-Like Arrays: The Locator Theorem
|
|
- Dominic Shawn Malone
- 6 years ago
- Views:
Transcription
1 locator theorem paper v 2.pdf A Family of Nim-Like Arrays: The Locator Theorem Lowell Abrams a,denas.cowen-morton b, a Department of Mathematics, The George Washington University, Washington, DC USA b Department of Mathematics, Xavier University, Cincinnati, OH USA Abstract We study a property shared by some members of a certain family of Nim-like arrays. The arrays are recursively generated in a manner related to the operation of Nim-addition. The property involves a kind of self-referential relationship between entries and their indices. Mathematics Subject Classification: 91A46, 68R05 Keywords: Nim, sequential compound 1. Introduction The game of Nim is a two person combinatorial game consisting of at least one pile of stones in which the players alternate turns removing any number of stones they wish from asinglepileofstones;thewinneristheplayertotakethelast stone. Given combinatorial games G 1 and G 2,wecanformanewgamebytakingtheirdirectsumG 1 G 2 ;thisis the game in which a player, on their turn, has the option of making a move in exactly one of the games G 1 or G 2 as long as that game is not yet exhausted (in Nim this simply means having several independent piles of stones). Again, the winner is the last player to make a move. We call two games G 1 and G 2 equivalent if for every game H the game G 1 H has the same winner as the game G 2 H. Nim s importance was established by the Sprague-Grundy Theorem [5, 6] (also developed in [4, chapter 11]), which essentially asserts that Nim is universal among finite impartial two player combinatorial games in which the winner is the player to move last. Briefly, that is to say that every such game G is, vis-á-vis direct summation, equivalent to a single-pile Nim game. We denote by Nim s the Nim game with one pile of s stones. Corresponding author (Phone: Fax: ) addresses: labrams@gwu.edu (Lowell Abrams), morton@xavier.edu (Dena S. Cowen-Morton) Preprint submitted to Elsevier January 20, 2013
2 In [7], Stromquist and Ullman define sequential compounding, an operation on combinatorial games. In essence, the sequential compound G H of games G and H is the game in which play proceeds in G until there are no moves left, at which point play switches to H. Thus,ifH =Nim 0,wehaveG H = G. IfH =Nim 1,thenG H is misère play on G (in which the last player to take a stone loses rather than wins). Stromquist and Ullman consider games of the form (G 1 G 2 ) H, whereg 1,G 2, and H are independent impartial combinatorial games, but before our previous papers [1, 2], little was understood about this type of sequential compounding for H equivalent to Nim s with s>1. Such games give rise to a family A = {A s } s N0 of recursively generated arrays, and this family is the object of our study. Our (previous) articles [1, 2] explore some of the algebraic, combinatorial, and graphical properties of this family. In particular, [1] discusses how each A s may be viewed as defining on N 0 the structure of a loop, i.e., aquasigroupwithatwo-sidedidentity,and [2] presents periodicity properties which hold in the rows and [super]-diagonals of each A s. The results here continue our exploration of the family A,concentratingonourLocator Theorem, which establishes a connection between the row and column indices and the value of an entry. Letting a i,j denote the entry in row i, columnj of the array A s,thelocator Property states that the entry j in row i can be found in column a i,j.forarraysa s where s {0, 1, 2, 3, 5, 7} this Locator Property holds for all but a few specific pairs (i, j), but this seems to not be the case for any other value of s. Toquantifythis,weconcludewitha computational result studying the failure of the Locator Property in A s for all remaining values of s between 0 and 200. In particular, for all s {4, 6, 8, 9, 10,...,200}, thelocator Property fails for at least 70% of all pairs, and frequently more often. 2. Background: The Arrays A s We begin by constructing a family of infinite arrays using the mex operation: Definition 2.1. For a set X N 0 = {0, 1, 2, 3,...} we define mex(x) to be the smallest non-negative integer not contained in X, i.e., mex(x) =min(n 0 \ X). Here, mex stands for minimal excluded value. Definition 2.2. For any 2-dimensional array A indexed by N 0 N 0,leta i,j denote the entry in row i, columnj, wherei, j 0. The principal (p, q) subarray A(p, q) is the subarray of A consisting of entries a i,j with indices (i, j) {0,...,p} {0,...,q}. For i, j 0defineLeft(i, j)= {a i,q : q<j} to be the set of all entries in row i to the left of the entry a i,j,anddefineup(i, j)= {a p,j : p<i} to be the set of entries in column j above a i,j. 2
3 Observe that Definition 2.2 gives Left(i, 0) = Up(0,j)=. Definition 2.3. The infinite array A s,fors N 0,isconstructedrecursively: Theseed a 0,0 is set to s and for (i, j) (0, 0), ( ) a i,j := mex Left(i, j) Up(i, j). See, for example, Figures 1 and 2, which show principal subarrays in seeds 0, 2, and 3. In all figures the index i =0, 1, 2,... increases down the page and j =0, 1, 2,... increases to the right. These arrays will be useful in the calculations to come Figure 1: A 0(7, 7) Figure 2: A 2(7, 7) and A 3(7, 7) Note that both the top row (row i =0)andtheleftcolumn(columnj =0)ofA s always have entries in the order s, 0, 1, 2,...,s 1,s+1,s+2,... (see Property 3.7 below). The array A 0 is well known as the Nim addition table, and has been extensively studied in the setting of combinatorial game theory. We denote by Nim s the s-stone, single-pile Nim game and we denote by H the Grundy value of a game H, thatis,theuniquenumberto which H is equivalent (see [3] for details). Let G 1,G 2 be games with G 1 = i and G 2 = j (so G 1,G 2 are equivalent to Nim i, Nim j respectively). Then the (i, j)-entry of A 0 is equal 3
4 to the Grundy value G 1 G 2.Considerationofwhatisknownas misèreplay resultsin the array A 1. Using the sequential compounding construction of Stromquist and Ullman gives rise to the full family of arrays A s.indeed,the(i, j)-entry of A s is (G 1 G 2 ) Nim s. The arrays A s can be used to guide the actual play of a game (G 1 G 2 ) Nim s ;wedirect the reader to [1, 2] for more information. An important property of A s follow as immediate consequence of the recursive construction (see [1] for details): Proposition 2.4 ([1, Proposition 2.4]). For each s, thearraya s is symmetric, and each nonnegative integer appears exactly once in each row (and, by symmetry, each column). We conclude this section by defining (as in [2]) two different recursive algorithms which may be used to compute A s : Definition 2.5. By algorithm 1, we mean the algorithm described above in Definition 2.3, using the mex operation to fill in increasingly large subarrays containing the seed. Definition 2.6. By algorithm 2, which is well-defined only for principal subarrays A s (p, q), we first fill in all the 0 s, then all the 1 s, then all the 2 s, etc. To do so, we begin with just the seed s placed in the upper left hand corner. We start with k =0andsupposethatallentrieslessthank have been placed (if k =0thennothing other than the seed has been placed). Starting with row i =0,letm =min{j : k Up(i, j) and(i, j) isnotyetassignedanentry}; ifm q then set the (i, m) entrytok. Now increment i and, if i p, repeatthecalculationofm. Carry out this process for all k, incrementingk each time, until all entries in A s (p, q) havebeenfilled. Algorithm 2 succeeds in correctly filling out a finite portion of A s because when computing mex(x) forasetx, only those entries less than mex(x) areactuallyrelevanttothe calculation. 3. The Locator Theorem In this section we highlight an interesting property of the arrays A s that only holds for a small selection of seeds. We first noted this property in Section 7 of our paper [1]. Definition 3.1. For a fixed seed s we say that the Locator Property holds at (i, j) if a i,ai,j = j. Inwords,entryj in row i appears in column a i,j. Proposition 3.2. For both seeds 0 and 1, the Locator Property holds for all (i, j). Proof. As seed 0 represents two piles of stones being played in usual Nim, a i,j is found by bit-wise XOR [3]. Specifically, we can compute a i,j = i j. Sincebit-wiseXORisassociative,we 4
5 have a i,ai,j = a i,i j = i (i j) =(i i) j =0 j = j for all i, j, sothelocatorproperty holds for seed 0. Note now that A 1 differs from A 0 only in A 1 (1, 1). Thus, in seed 1, as long as either i>1 or j>1thesamecalculationasforseed0givesa i,ai,j = j. It is simple to confirm that each of the remaining four entries in A 1 (1, 1) also satisfies the Locator Property. Definition 3.3. A set X of column-indices is i-left-complete if the entries in row i equal to the elements of X appear in the columns indexed by a i,x = {a i,j : j X}. Definition 3.4. A set Y of row-indices is j-up-complete if the entries equal to j in the rows indexed by Y appear in the columns indexed by a Y,j = {a i,j : i Y }. We note two important properties of Up-complete and Left-complete sets that readily follow from the definitions: Property 3.5. Aunionofi-Left-complete sets is i-left-complete and a union of j-upcomplete sets is j-up-complete. Property 3.6. If the Locator Property holds at (i, j), thenx = {j} is i-left-complete and Y = {i} is j-up-complete. Next, we will need the following Properties from [1]. Property 3.8 may be proved using algorithm 2. Property 3.7. For all seeds s and all k, s if k =0 a 0,k = a k,0 = k 1 if 0 <k s k if k>s. Property 3.8. For all seeds s 1 and all k, Lemma 3.9. For all seeds s 2, s if k =0 a k,k = 1 if k =1 0 otherwise. 1. The set {0, 1,...,s} is 0-Left-complete and 0-Up-complete, but {0, 1,...,k} for k<s is neither 0-Left-complete nor 0-Up-complete. 2. If {0, 1,...,j 1} is 0-Left-complete, then the Locator Property holds at (0,j). 3. If {0, 1,...,i 1} is 0-Up-complete, then the Locator Property holds at (i, 0). 5
6 Proof. To demonstrate the first assertion we use Properties 3.7 and 3.8 repeatedly. That {0, 1,...,k} for k<sis not 0-Left-complete when s 2followsbynotingthatifk<sthen in row 0, the entry k 1occursincolumnk a 0,X = {a 0,0,...,a 0,k } = {s, 0, 1,...,k 1}. However, if X = {0, 1,...,s} then a 0,X = X, sowedohave0-left-completeness. Let Y = {0, 1,...,k}. For k =0wehavea Y,0 = {s}, butsinces>1anda 0,1 =0,by Property 2.4, 0-Up-completeness fails. By Property 3.8, for k>0theentriesequalto0in rows indexed by Y occur in the columns indexed by Y.SincewehaveY a Y,0 for k<s and Y = a Y,0 for k = s, 0-Up-completenessholdsfork = s but not for k<s. By the hypotheses of the second and third assertions, the first assertion implies that i, j s. By Property 3.7 we have a 0,j = j and a i,0 = i, andthesecondandthirdassertionsreadily follow from Properties 3.7 and 3.8. Lemma For i, j 1, if{0, 1,...,(j 1)} is i-left-complete and {0, 1,...,(i 1)}) is j-up-complete, then the Locator Property holds at (i, j). Proof. Since {0, 1,...,(i 1)} is j-up-complete, the entries in Up(i, j) ={a 0,j,...,a (i 1),j } tell us the columns in which entry j appears for rows 0 through i 1. Since j is already in each of these columns, Proposition 2.4 tells us that in row i the entry j is not in any of the columns enumerated in {a 0,j,...,a (i 1),j }.Likewise,since{0, 1,...,(j 1)} is i-leftcomplete, looking at Left(i, j) ={a i,0,...,a i,(j 1) },wefindthecolumnnumbersinwhich j cannot appear in row i since there are already other entries in these columns, namely, the entries 0,...,(j 1). We now have a list of columns in which j does not appear in row i; thosearisingbecause j is already in that column (enumerated in Up(i, j) inarowofsmallerindex),andthose arising because an entry smaller than j is already in that column (enumerated in Left(i, j)) in row i. If we are using algorithm 2 for filling in the mex table, so that all values appear as early as they can, then the entry j appears in the first non-forbidden column in row i i.e., in the column with the smallest non-forbidden index. But this ispreciselythemexof the forbidden ( column numbers. ) Thus the entry j in row i goes into the row numbered m =mex Left(i, j) Up(i, j) = a i,j.inotherwords,entryj in row i appears in column a i,j,soa i,ai,j = j. Lemma For seed s =2,theset{0, 1, 2} is both i-left-complete for i =0, 1, 2 and j-up-complete for j =0, 1, 2. Lemma For seed s =3,thefollowinghold: 1. The set {0, 1, 2, 3} is i-left-complete for i =0, 1, 2 and 0-Up-complete. 2. The set {0, 1, 2, 3, 4} is 3-Up-complete and 3-Left-complete. 6
7 3. The set {1, 2, 3, 4, 5} is 4-Left-complete. 4. The sets {1, 2} and {i 1,i,i+1} are i-left-complete for all i The set {j 1,j,j +1} is j-up-complete for all j 4. These lemmas can readily be proven by induction using Figure 2; the details are left to the reader, but note that the patterns are established by considering even and odd cases and that [2] provides many useful lemmas. We do not include the necessary lemmas for seeds 5and7,butthereadercaneasilysurmisethem. Theorem 3.13 (The Locator Theorem). For seeds s =2, 3, 5, 7, thelocatorpropertyholdsforall(i, j) L s where L 2 = {(i, j) :i>sor j>s}, L 3 = {(i, j) :(i>sor j>s) and j 1, 2 and i j > 1}, L 5 = {(i, j) :(i>s+1 or j>s+1) and j 1, 2, 3, 4 and i j > 2}, L 7 = {(i, j) :(i>s+2 or j>s+2) and j 1, 2, 3, 4, 5 and i j > 3}. Proof. We use Lemmas 3.9, 3.11, and 3.12, as well as their analogues for seeds 5 and 7, as base cases. Suppose (i, j) L s for s {2, 3, 5, 7}, andmoreoverthatthelocator Property holds for all (i,j ) L s with i <ior j <j.bythebasecasesandproperty3.6 it follows that {0, 1,...,(j 1)} is a union of one or more sets which are i-left-complete and {0, 1,...,(i 1)} is a union of one or more sets which are j-up-complete. By Property 3.5, {0, 1,...,(j 1)} is i-left-complete and {0, 1,...,(i 1)} is j-up-complete. Lemma 3.10 therefore proves that the Locator Property holds at (i, j). 4. A Computational Result We conclude by computationally examining, for each seed from 0 to 200, the percentage of entries for which the Locator Property holds (this is expressed more precisely below). Our results suggest that the Locator Property does not hold for seeds other than s = 0, 1, 2, 3, 5, 7. Theorem 4.1. In A s,let P s = { (i, j) {0, 1, 2,...,2999} 2 : j>s and s<a i,j < 3000 }, and ρ s = Q s / P s.wehave Q s = {(i, j) P s : a i,ai,j = j}, if s {0, 1, 2, 3, 5, 7} then ρ s =1; if s {4, 6} {8, 9,...,200} then ρ s (0.155, 0.279). 7
8 ρ s seed Figure 3: The values ρ s for seeds s {4, 6, 8, 9, 10,...}. Thus ρ s gives a measure of the extent to which entries in A s satisfy the Locator Property. Figure 3 displays the values of ρ s for seeds other than {0, 1, 2, 3, 5, 7}. Note that in the definition of P s the conditions j>sand a i,j >sreflect the fact that for entries with small column indices and entries near the diagonal, respectively, we only have Left-completeness for non-singleton sets (see Lemmas 3.11 and 3.12). 5. Acknowledgements Thomas Zaslavsky offered helpful suggestions during the writing stage. 6. References [1] L. Abrams, D. Cowen-Morton, Algebraic Structure in a Family of Nim-like Arrays, J. Pure and Applied Algebra Vol. 214 (2010) [2] L. Abrams, D. Cowen-Morton, Periodicity and Other Structure in a Colorful Family of Nim-like Arrays, Electronic Journal of Combinatorics Vol. 17 (2010). [3] E. R. Berlekamp, H. H. Conway, R. K. Guy, Winning Ways For Your Mathematical Plays Vol. 1, secondedition,a.k.peters,wellesley,massachusetts,2001. [4] J. H. Conway, On Numbers and Games, secondedition,a.k.peters,wellesley,massachusetts, [5] P. M. Grundy, Mathematics and Games, Eureka, Vol. 2(1939)
9 [6] R. P. Sprague, Über mathematische Kampfspiele. Tôhoku Math. J. Vol. 41 (1935-6) [7] W. Stromquist, D. Ullman, Sequential compounds of combinatorial games, Theoret. Computer Science Vol. 119 (1993)
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationAlgebraic Structure in a Family of Nim-like Arrays
Algebraic Structure in a Family of Nim-like Arrays Lowell Abrams Department of Mathematics The George Washington University Washington, DC 20052 U.S.A. labrams@gwu.edu Dena S. Cowen-Morton Department of
More informationAlgebraic Structure in a Family of Nim-like Arrays
Algebraic Structure in a Family of Nim-like Arrays Lowell Abrams Department of Mathematics The George Washington University Washington, DC 20052 U.S.A. labrams@gwu.edu Dena S. Cowen-Morton Department of
More informationPeriodicity and Other Structure in a Colorful Family of Nim-like Arrays
Periodicity and Other Structure in a Colorful Family of Nim-like Arrays Lowell Abrams Department of Mathematics The George Washington University Washington, DC 20052 U.S.A. labrams@gwu.edu Dena S. Cowen-Morton
More informationarxiv: v2 [math.co] 9 Aug 2011
Winning strategies for aperiodic subtraction games arxiv:1108.1239v2 [math.co] 9 Aug 2011 Alan Guo MIT Computer Science and Artificial Intelligence Laboratory Cambridge, MA 02139, USA aguo@mit.edu Abstract
More informationMisère canonical forms of partizan games
Games of No Chance 4 MSRI Publications Volume 63, 2015 Misère canonical forms of partizan games AARON N. SIEGEL We show that partizan games admit canonical forms in misère play. The proof is a synthesis
More informationSlow k-nim. Vladimir Gurvich a
R u t c o r Research R e p o r t Slow k-nim Vladimir Gurvich a Nhan Bao Ho b RRR 3-2015, August 2015 RUTCOR Rutgers Center for Operations Research Rutgers University 640 Bartholomew Road Piscataway, New
More informationSingle Pile (Move Size) Dynamic Blocking Nim
Single Pile (Move Size) Dynamic Blocking Nim Abstract: Several authors have written papers dealing with a class of combinatorial games consisting of one-pile counter pickup games for which the maximum
More informationOne Pile Nim with Arbitrary Move Function
One Pile Nim with Arbitrary Move Function by Arthur Holshouser and Harold Reiter Arthur Holshouser 3600 Bullard St. Charlotte, NC, USA, 28208 Harold Reiter Department of Mathematics UNC Charlotte Charlotte,
More informationSprague-Grundy Values of the R-Wythoff Game
Sprague-Grundy Values of the R-Wythoff Game Albert Gu Department of Mathematics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A agu@andrew.cmu.edu Submitted: Aug 6, 2014; Accepted: Apr 10, 2015;
More informationGeometrical extensions of Wythoff s game
Discrete Mathematics 309 (2009) 3595 3608 www.elsevier.com/locate/disc Geometrical extensions of Wythoff s game Eric Duchêne, Sylvain Gravier Institut Fourier, ERTé Maths à modeler Grenoble, France Received
More informationA four parametric generalization of the Wythoff NIM and its recursive solution
R u t c o r Research R e p o r t A four parametric generalization of the Wythoff NIM and its recursive solution Vladimir Gurvich a RRR 8-00, November 00 RUTCOR Rutgers Center for Operations Research Rutgers
More informationAperiodic Subtraction Games
Aperiodic Subtraction Games Aviezri S. Fraenkel Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100, Israel Submitted: 2011; Accepted: 2011; Published: XX
More informationWen An Liu College of Mathematics and Information Science, Henan Normal University, Xinxiang, P.R. China
#G4 INTEGERS 1 (01) ON SUPPLEMENTS OF M BOARD IN TOPPLING TOWERS Wen An Liu College of Mathematics and Information Science, Henan Normal University, Xinxiang, P.R. China liuwenan@16.com Haifeng Li College
More information#G03 INTEGERS 10 (2010), MIN, A COMBINATORIAL GAME HAVING A CONNECTION WITH PRIME NUMBERS
#G03 INTEGERS 10 (2010), 765-770 MIN, A COMBINATORIAL GAME HAVING A CONNECTION WITH PRIME NUMBERS Grant Cairns Department of Mathematics, La Trobe University, Melbourne, Australia G.Cairns@latrobe.edu.au
More informationPoset-Game Periodicity
Poset-Game Periodicity Steven Byrnes Final Siemens-Westinghouse Version September 29, 2002 Abstract In this paper, we explore poset games, a large class of combinatorial games which includes Nim, Chomp,
More informationPLAYING END-NIM WITH A MULLER TWIST
#G5 INTEGERS 17 (2017) PLAYING END-NIM WITH A MULLER TWIST David G. C. Horrocks School of Mathematical and Computational Sciences, University of Prince Edward Island, Charlottetown, PE, Canada dhorrocks@upei.ca
More informationOPTION-CLOSED GAMES RICHARD J. NOWAKOWSKI AND PAUL OTTAWAY
Volume 6, Number 1, Pages 142 153 ISSN 1715-0868 OPTION-CLOSED GAMES RICHARD J. NOWAKOWSKI AND PAUL OTTAWAY Abstract. We consider the class of combinatorial games with the property that each player s move
More informationImpartial Games. Lemma: In any finite impartial game G, either Player 1 has a winning strategy, or Player 2 has.
1 Impartial Games An impartial game is a two-player game in which players take turns to make moves, and where the moves available from a given position don t depend on whose turn it is. A player loses
More informationSUMBERS SUMS OF UPS AND DOWNS. Kuo-Yuan Kao National Penghu Institute of Technology, Taiwan. Abstract
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5 (2005), #G01 SUMBERS SUMS OF UPS AND DOWNS Kuo-Yuan Kao National Penghu Institute of Technology, Taiwan stone@npit.edu.tw Received: 4/23/04,
More informationarxiv: v1 [math.co] 18 May 2018
P PLAY IN CANDY NIM NITYA MANI, RAJIV NELAKANTI, SIMON RUBINSTEIN-SALZEDO, AND ALEX THOLEN arxiv:1805.07019v1 [math.co] 18 May 018 Abstract. Candy Nim is a variant of Nim in which both players aim to take
More informationD. G. Horrocks 1 Department of Mathematics and Computer Science, University of Prince Edward Island, Charlottetown, PE C1A 4P3, Canada
REGULARITY IN THE G SEQUENCES OF OCTAL GAMES WITH A PASS D. G. Horrocks 1 Department of Mathematics and Computer Science, University of Prince Edward Island, Charlottetown, PE C1A 4P3, Canada dhorrocks@upei.ca
More informationarxiv: v2 [math.co] 23 Mar 2012
VARIANTS OF WYTHOFF S GAME TRANSLATING ITS P-POSITIONS arxiv:1203.2090v2 [math.co] 23 Mar 2012 NHAN BAO HO Abstract. We introduce a restriction of Wythoff s game, which we call F-Wythoff, in which the
More informationA misère-play -operator
A misère-play -operator Matthieu Dufour Silvia Heubach Urban Larsson arxiv:1608.06996v1 [math.co] 25 Aug 2016 July 31, 2018 Abstract We study the -operator (Larsson et al, 2011) of impartial vector subtraction
More informationPARTIAL NIM. Chu-Wee Lim Department of Mathematics, University of California Berkeley, Berkeley, CA , USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5 (005), #G0 PARTIAL NIM Chu-Wee Lim Department of Mathematics, University of California Berkeley, Berkeley, CA 9470-3840, USA limchuwe@math.berkeley.edu
More informationOne Pile Nim with Arbitrary Move Function
One Pile Nim with Arbitrary Move Function Arthur Holshouser 3600 Bullard St. Charlotte, NC, USA Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 28223, USA
More informationIntroduction to Combinatorial Game Theory
Introduction to Combinatorial Game Theory Tom Plick Drexel MCS Society April 10, 2008 1/40 A combinatorial game is a two-player game with the following properties: alternating play perfect information
More informationMATH4250 Game Theory 1. THE CHINESE UNIVERSITY OF HONG KONG Department of Mathematics MATH4250 Game Theory
MATH4250 Game Theory 1 THE CHINESE UNIVERSITY OF HONG KONG Department of Mathematics MATH4250 Game Theory Contents 1 Combinatorial games 2 1.1 Combinatorial games....................... 2 1.2 P-positions
More informationOn Aperiodic Subtraction Games with Bounded Nim Sequence
On Aperiodic Subtraction Games with Bounded Nim Sequence Nathan Fox arxiv:1407.2823v1 [math.co] 10 Jul 2014 Abstract Subtraction games are a class of impartial combinatorial games whose positions correspond
More informationChampion Spiders in the Game of Graph Nim
Champion Spiders in the Game of Graph Nim Neil J. Calkin, Janine E. Janoski, Allison Nelson, Sydney Ryan, Chao Xu Abstract In the game of Graph Nim, players take turns removing one or more edges incident
More informationCOFINITE INDUCED SUBGRAPHS OF IMPARTIAL COMBINATORIAL GAMES: AN ANALYSIS OF CIS-NIM
#G INTEGERS 13 (013) COFINITE INDUCED SUBGRAPHS OF IMPARTIAL COMBINATORIAL GAMES: AN ANALYSIS OF CIS-NIM Scott M. Garrabrant 1 Pitzer College, Claremont, California coscott@math.ucla.edu Eric J. Friedman
More informationAnalysis of odd/odd vertex removal games on special graphs
Analysis of odd/odd vertex removal games on special graphs Master Thesis, Royal Institute of Technology - KTH, 2012 Oliver Krüger okruger@kth.se May 21, 2012 Thesis advisor: Jonas Sjöstrand, KTH Abstract
More informationDYNAMIC ONE-PILE NIM Arthur Holshouser 3600 Bullard St., Charlotte, NC, USA, 28208
Arthur Holshouser 3600 Bullard St., Charlotte, NC, USA, 28208 Harold Reiter Department of Mathematics, UNC Charlotte, Charlotte, NC 28223 James Riidzinski Undergraduate, Dept. of Math., UNC Charlotte,
More informationProblem Set #1 solutions
Problem Set # solutions... This number trick involves your favorite three-digit number and your age. Multiply your age by 7. Subtract from the result. Multiply by. Add 8. Multiply by 3. Add your favorite
More informationDynamic Single-Pile Nim Using Multiple Bases
Dynamic Single-Pile Nim Using Multiple Bases Arthur Holshouser 3600 Bullard St, Charlotte, NC 28208, USA Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 28223,
More informationTheorem 1. Every P -position of the game can be written in the form (T n ; m 1 ; : : : ; m k?1 ), where the (k? 1)-tuples (m 1 ; : : : ; m k?1 ) range
A New Heap Game Aviezri S. Fraenkel and Dmitri Zusman Department of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot 76100, Israel fraenkel@wisdom.weizmann.ac.il http://www.wisdom.weizmann.ac.il/~fraenkel
More informationConsider an infinite row of dominoes, labeled by 1, 2, 3,, where each domino is standing up. What should one do to knock over all dominoes?
1 Section 4.1 Mathematical Induction Consider an infinite row of dominoes, labeled by 1,, 3,, where each domino is standing up. What should one do to knock over all dominoes? Principle of Mathematical
More informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
More informationGreedy Codes. Theodore Rice
Greedy Codes Theodore Rice 1 Key ideas These greedy codes come from certain positions of combinatorial games. These codes will be identical to other well known codes. Little sophisticated mathematics is
More informationA Generalized Algorithm for Computing Matching Polynomials using Determinants. Asa Scherer
A Generalized Algorithm for Computing Matching Polynomials using Determinants Asa Scherer April 17, 2007 Abstract We discuss the connection between determinants of modified matching matrices and the matching
More informationAnother bridge between Nim and Wythoff
Another bridge between Nim and Wythoff Eric Duchene, Aviezri Fraenkel, Sylvain Gravier, Richard J. Nowakowski To cite this version: Eric Duchene, Aviezri Fraenkel, Sylvain Gravier, Richard J. Nowakowski.
More informationarxiv: v1 [math.co] 21 Sep 2015
Chocolate Numbers arxiv:1509.06093v1 [math.co] 21 Sep 2015 Caleb Ji, Tanya Khovanova, Robin Park, Angela Song September 22, 2015 Abstract In this paper, we consider a game played on a rectangular m n gridded
More information#G4 INTEGERS 15 (2015) IMPARTIAL CHOCOLATE BAR GAMES
#G4 INTEGERS 15 (2015) IMPARTIAL CHOCOLATE BAR GAMES Shunsue Naamura Department of Information and Computer Sciences, School of Engineering Science, Osaa University, Osaa, Japan naashun1994@gmail.com Ryohei
More informationHeaps Induction. Heaps. Heaps. Tirgul 6
Tirgul 6 Induction A binary heap is a nearly complete binary tree stored in an array object In a max heap, the value of each node that of its children (In a min heap, the value of each node that of its
More informationIMPROVEMENTS ON CHOMP. Xinyu Sun Department of Mathematics, Temple University, Philadelphia, PA 19122, USA.
IMPROVEMENTS ON CHOMP Xinyu Sun Department of Mathematics, Temple University, Philadelphia, PA 191, USA xysun@math.temple.edu Received: 10/16/01, Revised: 4/9/0, Accepted: 5/17/0, Published: 5/0/0 Abstract
More informationarxiv: v2 [math.co] 15 Feb 2017
GENERALIZED ALGORITHM FOR WYTHOFF S GAME WITH BASIS VECTOR (2 b, 2 b ) SHUBHAM AGGARWAL, JARED GELLER, SHUVOM SADHUKA, MAX YU arxiv:1612.03068v2 [math.co] 15 Feb 2017 Abstract. Wythoff s Game is a variation
More informationMAHARAJA NIM: WYTHOFF S QUEEN MEETS THE KNIGHT
#G05 INTEGERS 14 (2014) MAHARAJA NIM: WYTHOFF S QUEEN MEETS THE KNIGHT Urban Larsson Mathematical Sciences, Chalmers University of Technology and University of Gothenburg, Göteborg, Sweden urban.larsson@yahoo.se
More informationLecture 7 Feb 4, 14. Sections 1.7 and 1.8 Some problems from Sec 1.8
Lecture 7 Feb 4, 14 Sections 1.7 and 1.8 Some problems from Sec 1.8 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness
More informationOn binary reflected Gray codes and functions
Discrete Mathematics 308 (008) 1690 1700 www.elsevier.com/locate/disc On binary reflected Gray codes and functions Martin W. Bunder, Keith P. Tognetti, Glen E. Wheeler School of Mathematics and Applied
More informationThe Free Central Limit Theorem: A Combinatorial Approach
The Free Central Limit Theorem: A Combinatorial Approach by Dennis Stauffer A project submitted to the Department of Mathematical Sciences in conformity with the requirements for Math 4301 (Honour s Seminar)
More informationAnnouncements. Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Existence Proofs. Non-constructive
Announcements Homework 2 Due Homework 3 Posted Due next Monday Quiz 2 on Wednesday Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Exam 1 in two weeks Monday, February 19
More informationTHE RALEIGH GAME. Received: 1/6/06, Accepted: 6/25/06. Abstract
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7(2) (2007), #A13 THE RALEIGH GAME Aviezri S. Fraenkel 1 Department of Computer Science and Applied Mathematics, Weizmann Institute of Science,
More informationOrdinal Partizan End Nim
Ordinal Partizan End Nim Adam Duffy, Garrett Kolpin, and David Wolfe October 24, 2003 Introduction Partizan End Nim is a game played by two players called Left and Right. Initially there are n stacks of
More informationOn tame, pet, domestic, and miserable impartial games
See discussions, stats, and author profiles for this publication at: http://www.researchgate.net/publication/281312777 On tame, pet, domestic, and miserable impartial games ARTICLE AUGUST 2015 Source:
More informationCombinatorial Games, Theory and Applications. Brit C. A. Milvang-Jensen
Combinatorial Games, Theory and Applications Brit C. A. Milvang-Jensen February 18, 2000 Abstract Combinatorial games are two-person perfect information zero-sum games, and can in theory be analyzed completely.
More informationResearch Statement. Janine E. Janoski
Research Statement Janine E. Janoski 1 Introduction My research is in discrete mathematics and combinatorics. I have worked on a wide variety of research topics including, enumeration problems, eigenvalue
More informationBinary dicots, a core of dicot games
Binary dicots, a core of dicot games Gabriel Renault Univ. Bordeaux, LaBRI, UMR5800, F-33400 Talence CNRS, LaBRI, UMR5800, F-33400 Talence Department of Mathematics, Beijing Jiaotong University, Beijing
More informationTheoretical Computer Science
Theoretical Computer Science 411 (2010) 3224 3234 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs N-player partizan games Alessandro
More informationINVARIANT AND DUAL SUBTRACTION GAMES RESOLVING THE DUCHÊNE-RIGO CONJECTURE.
INVARIANT AND DUAL SUBTRACTION GAMES RESOLVING THE DUCHÊNE-RIGO CONJECTURE. URBAN LARSSON, PETER HEGARTY, AVIEZRI S. FRAENKEL ABSTRACT. We prove a recent conjecture of Duchêne and Rigo, stating that every
More informationRandom Variable. Pr(X = a) = Pr(s)
Random Variable Definition A random variable X on a sample space Ω is a real-valued function on Ω; that is, X : Ω R. A discrete random variable is a random variable that takes on only a finite or countably
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More informationSection Summary. Proof by Cases Existence Proofs
Section 1.8 1 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Uniqueness Proofs Proving Universally Quantified Assertions Proof Strategies sum up
More information7.5 Taking-and-Breaking Games
Chapter 7. Impartial Games 7.5 Taking-and-Breaking Games There are many natural variations on nim obtained by modifying the legal moves. For example, sometimes a player, in addition to taking counters,
More informationarxiv: v1 [math.co] 27 Aug 2015
P-positions in Modular Extensions to Nim arxiv:1508.07054v1 [math.co] 7 Aug 015 Tanya Khovanova August 31, 015 Abstract Karan Sarkar In this paper, we consider a modular extension to the game of Nim, which
More informationThe Reduced Canonical Form of a Game
Games of No Chance MSRI Publications Volume 29, 1996 The Reduced Canonical Form of a Game DAN CALISTRATE Abstract. Cooling by, followed by the elimination of the stars, is used to define an operator G
More informationFinite Math - J-term Section Systems of Linear Equations in Two Variables Example 1. Solve the system
Finite Math - J-term 07 Lecture Notes - //07 Homework Section 4. - 9, 0, 5, 6, 9, 0,, 4, 6, 0, 50, 5, 54, 55, 56, 6, 65 Section 4. - Systems of Linear Equations in Two Variables Example. Solve the system
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationFibonacci Nim and a Full Characterization of Winning Moves
Fibonacci Nim and a Full Characterization of Winning Moves Cody Allen and Vadim Ponomarenko January 8, 2014 Abstract In this paper we will fully characterize all types of winning moves in the takeaway
More informationIdentifying Graph Automorphisms Using Determining Sets
Identifying Graph Automorphisms Using Determining Sets Debra L. Boutin Department of Mathematics Hamilton College, Clinton, NY 13323 dboutin@hamilton.edu Submitted: May 31, 2006; Accepted: Aug 22, 2006;
More informationSome Results on Combinatorial Game Theory. Saúl A. Blanco Rodríguez
CORNELL UNIVERSITY MATHEMATICS DEPARTMENT SENIOR THESIS Some Results on Combinatorial Game Theory A THESIS PRESENTED IN PARTIAL FULFILLMENT OF CRITERIA FOR HONORS IN MATHEMATICS Saúl A. Blanco Rodríguez
More informationThe doubly negative matrix completion problem
The doubly negative matrix completion problem C Mendes Araújo, Juan R Torregrosa and Ana M Urbano CMAT - Centro de Matemática / Dpto de Matemática Aplicada Universidade do Minho / Universidad Politécnica
More informationRendezvous On A Discrete Line
Rendezvous On A Discrete Line William H. Ruckle Abstract In a rendezvous problem on a discrete line two players are placed at points on the line. At each moment of time each player can move to an adjacent
More informationAbstract. We dene the family of locally path-bounded digraphs, which is a
Innite cyclic impartial games Aviezri S. Fraenkel and Ofer Rahat Department of Applied Mathematics and Computer Science Weizmann Institute of Science Rehovot 76, Israel Abstract. We dene the family of
More information22m:033 Notes: 3.1 Introduction to Determinants
22m:033 Notes: 3. Introduction to Determinants Dennis Roseman University of Iowa Iowa City, IA http://www.math.uiowa.edu/ roseman October 27, 2009 When does a 2 2 matrix have an inverse? ( ) a a If A =
More informationALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ.
ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ. ANDREW SALCH 1. Hilbert s Nullstellensatz. The last lecture left off with the claim that, if J k[x 1,..., x n ] is an ideal, then
More informationTEMPERATURE THEORY AND THE THERMOSTATIC STRATEGY
TEMPERATURE THEORY AND THE THERMOSTATIC STRATEGY KAREN YE Abstract. In this paper, we differentiate between cold games, which are easier to analyze and play, and hot games, much more difficult in terms
More informationDecomposing dense bipartite graphs into 4-cycles
Decomposing dense bipartite graphs into 4-cycles Nicholas J. Cavenagh Department of Mathematics The University of Waikato Private Bag 3105 Hamilton 3240, New Zealand nickc@waikato.ac.nz Submitted: Jun
More informationarxiv: v2 [math.co] 19 May 2017
IMPARTIAL ACHIEVEMENT GAMES FOR GENERATING GENERALIZED DIHEDRAL GROUPS BRET J. BENESH, DANA C. ERNST, AND NÁNDOR SIEBEN arxiv:68.59v [math.co] 9 May 7 Abstract. We study an impartial game introduced by
More informationCounting k-marked Durfee Symbols
Counting k-marked Durfee Symbols Kağan Kurşungöz Department of Mathematics The Pennsylvania State University University Park PA 602 kursun@math.psu.edu Submitted: May 7 200; Accepted: Feb 5 20; Published:
More informationInterlacing Inequalities for Totally Nonnegative Matrices
Interlacing Inequalities for Totally Nonnegative Matrices Chi-Kwong Li and Roy Mathias October 26, 2004 Dedicated to Professor T. Ando on the occasion of his 70th birthday. Abstract Suppose λ 1 λ n 0 are
More informationDiscrete Math in Computer Science Solutions to Practice Problems for Midterm 2
Discrete Math in Computer Science Solutions to Practice Problems for Midterm 2 CS 30, Fall 2018 by Professor Prasad Jayanti Problems 1. Let g(0) = 2, g(1) = 1, and g(n) = 2g(n 1) + g(n 2) whenever n 2.
More informationEdge colored complete bipartite graphs with trivial automorphism groups
Edge colored complete bipartite graphs with trivial automorphism groups Michael J. Fisher Garth Isaak Abstract We determine the values of s and t for which there is a coloring of the edges of the complete
More informationCounting Matrices Over a Finite Field With All Eigenvalues in the Field
Counting Matrices Over a Finite Field With All Eigenvalues in the Field Lisa Kaylor David Offner Department of Mathematics and Computer Science Westminster College, Pennsylvania, USA kaylorlm@wclive.westminster.edu
More informationOn a refinement of Wilf-equivalence for permutations
On a refinement of Wilf-equivalence for permutations Sherry H. F. Yan Department of Mathematics Zhejiang Normal University Jinhua 321004, P.R. China huifangyan@hotmail.com Yaqiu Zhang Department of Mathematics
More informationNumber Theory: Niven Numbers, Factorial Triangle, and Erdos' Conjecture
Sacred Heart University DigitalCommons@SHU Mathematics Undergraduate Publications Mathematics -2018 Number Theory: Niven Numbers, Factorial Triangle, and Erdos' Conjecture Sarah Riccio Sacred Heart University,
More informationAt the start of the term, we saw the following formula for computing the sum of the first n integers:
Chapter 11 Induction This chapter covers mathematical induction. 11.1 Introduction to induction At the start of the term, we saw the following formula for computing the sum of the first n integers: Claim
More informationExercises. Template for Proofs by Mathematical Induction
5. Mathematical Induction 329 Template for Proofs by Mathematical Induction. Express the statement that is to be proved in the form for all n b, P (n) forafixed integer b. 2. Write out the words Basis
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationMinimum number of non-zero-entries in a 7 7 stable matrix
Linear Algebra and its Applications 572 (2019) 135 152 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Minimum number of non-zero-entries in a
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 194 (015) 37 59 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: wwwelseviercom/locate/dam Loopy, Hankel, and combinatorially skew-hankel
More informationA Recursive Relation for Weighted Motzkin Sequences
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 8 (005), Article 05.1.6 A Recursive Relation for Weighted Motzkin Sequences Wen-jin Woan Department of Mathematics Howard University Washington, D.C. 0059
More informationToppling Conjectures
Games of No Chance 4 MSRI Publications Volume 63, 2015 Toppling Conjectures ALEX FINK, RICHARD NOWAKOWSKI, AARON SIEGEL AND DAVID WOLFE Positions of the game of TOPPLING DOMINOES exhibit many familiar
More informationBMT 2018 Team Test Solutions March 18, 2018
. A circle with radius is inscribed in a right triangle with hypotenuse 4 as shown below. What is the area of the triangle? Note that the diagram is not to scale. 4 Answer: 9 Solution : We wish to use
More informationHANDOUT I: CONSTRUCTION OF MAGIC SQUARES
HANDOUT I: CONSTRUCTION OF MAGIC SQUARES NOTES BY EMANUELE DELUCCHI 1 Magic squares Definition 1 A magic square M of order n is an m m-array filled with the numbers 1,,, n so that each number appears exactly
More informationRelations Graphical View
Introduction Relations Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Recall that a relation between elements of two sets is a subset of their Cartesian
More informationBoolean Inner-Product Spaces and Boolean Matrices
Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver
More information1 Proof by Contradiction
In these notes, which will serve as a record of what we covered in weeks 3-4, we discuss various indirect methods of proof. While direct proof is often preferred it is sometimes either not possible or
More informationDiscrete Mathematics and Probability Theory Fall 2013 Vazirani Note 1
CS 70 Discrete Mathematics and Probability Theory Fall 013 Vazirani Note 1 Induction Induction is a basic, powerful and widely used proof technique. It is one of the most common techniques for analyzing
More informationSubtraction games. Chapter The Bachet game
Chapter 7 Subtraction games 7.1 The Bachet game Beginning with a positive integer, two players alternately subtract a positive integer < d. The player who gets down to 0 is the winner. There is a set of
More information