Hackenbush and the surreal numbers
|
|
- Ira Parks
- 6 years ago
- Views:
Transcription
1 Hackenbush and the surreal numbers James A. Swenson University of Wisconsin Platteville September 28, 2017 Bi-State Math Colloquium James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 1 / 37
2 Thanks for coming! I hope you ll enjoy the talk; please feel free to get involved! James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 2 / 37
3 Epigraph James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 3 / 37
4 Epigraph Propositiones aliquot, que in Scholis Societatis non sunt docendæ Continuum successiuum & intensio qualitatum solis indiuisibilibus constant Infinitum in multitudine, & magnitudine potest claudi inter duas unitates, vel duo puncta. Ordinatio pro studiis superioribus.... A[dmodum] R[everendus] P[ater] N[oster] Francisco Piccolomineo ad Prouincias Missa Anno James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 4 / 37
5 Epigraph Some propositions which must not be taught in the Society s schools The line of succession and of the intensity of qualities are made up of indivisible points Infinity in multitude and infinity in magnitude can be enclosed between two units or two points. Ordinance for higher study. Sent by Our Most Reverend Holy Father Francisco Piccolomineo [Superior General of the Jesuit Order], year James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 5 / 37
6 Outline 1 Heroes 2 Games 3 Ordering of games 4 Surreal numbers James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 6 / 37
7 John H. Conway (1937- ) Conway is a world-famous, award-winning mathematician, who has been a professor at Cambridge and (currently) Princeton. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 7 / 37
8 John H. Conway (1937 ) Conway is incredibly untidy. The tables in his room at the Department of Pure Mathematics and Mathematical Statistics in Cambridge are heaped high with papers, books, unanswered letters, notes, models, charts, tables, diagrams, dead cups of coffee and an amazing assortment of bric-à-brac, which has overflowed most of the floor and all of the chairs, so that it is hard to take more than a pace or two into the room and impossible to sit down. If you can reach the blackboard there is a wide range of coloured chalk, but no space to write. His room in College is in a similar state. In spite of his excellent memory he often fails to find the piece of paper with the important result that he discovered some days before, and which is recorded nowhere else. Richard Guy, quoted at history/biographies/conway.html James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 8 / 37
9 Donald K. Knuth (1938 ) James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 9 / 37
10 Outline 1 Heroes 2 Games 3 Ordering of games 4 Surreal numbers James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 10 / 37
11 The rules of Hackenbush Hackenbush is a game played by two players, Blue and Red, on a rooted graph with colored edges. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 11 / 37
12 The rules of Hackenbush Hackenbush is a game played by two players, Blue and Red, on a rooted graph with colored edges. To move, delete an edge of your color, plus any edges no longer connected to the ground. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 11 / 37
13 The rules of Hackenbush Hackenbush is a game played by two players, Blue and Red, on a rooted graph with colored edges. To move, delete an edge of your color, plus any edges no longer connected to the ground. Blue moves first. If it s your turn and you can t move, you lose. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 11 / 37
14 The rules of Hackenbush Hackenbush is a game played by two players, Blue and Red, on a rooted graph with colored edges. To move, delete an edge of your color, plus any edges no longer connected to the ground. Blue moves first. If it s your turn and you can t move, you lose. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 11 / 37
15 The rules of Hackenbush Hackenbush is a game played by two players, Blue and Red, on a rooted graph with colored edges. To move, delete an edge of your color, plus any edges no longer connected to the ground. Blue moves first. If it s your turn and you can t move, you lose. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 11 / 37
16 The rules of Hackenbush Hackenbush is a game played by two players, Blue and Red, on a rooted graph with colored edges. To move, delete an edge of your color, plus any edges no longer connected to the ground. Blue moves first. If it s your turn and you can t move, you lose. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 11 / 37
17 The rules of Hackenbush Hackenbush is a game played by two players, Blue and Red, on a rooted graph with colored edges. To move, delete an edge of your color, plus any edges no longer connected to the ground. Blue moves first. If it s your turn and you can t move, you lose. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 11 / 37
18 The rules of Hackenbush Hackenbush is a game played by two players, Blue and Red, on a rooted graph with colored edges. To move, delete an edge of your color, plus any edges no longer connected to the ground. Blue moves first. If it s your turn and you can t move, you lose. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 11 / 37
19 The rules of Hackenbush Hackenbush is a game played by two players, Blue and Red, on a rooted graph with colored edges. To move, delete an edge of your color, plus any edges no longer connected to the ground. Blue moves first. If it s your turn and you can t move, you lose. Red loses! James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 11 / 37
20 Game notation To play well, you need to know your options! =,, James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 12 / 37
21 The simplest game = James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 13 / 37
22 The simplest game = Let s improve our lives by giving this game a name: = { }. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 13 / 37
23 The next simplest games = James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 14 / 37
24 The next simplest games = In symbols, this game is { }. Let s name it: = { }. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 14 / 37
25 The next simplest games = In symbols, this game is { }. Let s name it: = { }. = In symbols, this game is { }. Let s name it: = { }. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 14 / 37
26 Games with up to two edges = { } = { } = { }! = {, } = { } = { } = { } = { } = {, } = { } James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 15 / 37
27 Outline 1 Heroes 2 Games 3 Ordering of games 4 Surreal numbers James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 16 / 37
28 Comparing games Idea If G and H are games, we want: G H when H is at least as good as G for Blue. ( ) James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 17 / 37
29 Order relation on games Definition Let G = {G L G R } and H = {H L H R } be games. This means that G L and G R are sets of games smaller than G, etc., so the following definition is recursive, not circular: We say G H provided that: 1 there is no X G L with H X ; and 2 there is no Y H R with Y G. ( Blue can t make G into something as good as H, and Red can t make H into something as bad as G. ) James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 18 / 37
30 Order relation on games Definition Let G = {G L G R } and H = {H L H R } be games. This means that G L and G R are sets of games smaller than G, etc., so the following definition is recursive, not circular: We say G H provided that: 1 there is no X G L with H X ; and 2 there is no Y H R with Y G. ( Blue can t make G into something as good as H, and Red can t make H into something as bad as G. ) Example Recall = { }. Since L = = R, it is vacuously true that. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 18 / 37
31 Comparison: adding a single edge Theorem Adding a blue edge makes a game better for Blue; adding a red edge makes it worse. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 19 / 37
32 Comparison: adding a single edge Theorem Adding a blue edge makes a game better for Blue; adding a red edge makes it worse. Corollary James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 19 / 37
33 Comparison: adding a single edge Theorem Adding a blue edge makes a game better for Blue; adding a red edge makes it worse. Corollary and and James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 19 / 37
34 Comparison: adding a single edge Theorem Adding a blue edge makes a game better for Blue; adding a red edge makes it worse. Proposition Corollary. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 19 / 37
35 Good news: is reflexive Theorem If G is a game, then G G. Proof (Induction on number of edges). We know. Now let G be a game with at least one edge. Suppose for (transfinite) induction that H H whenever H has fewer edges than G. Hence G G. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 20 / 37
36 Good news: is reflexive Theorem If G is a game, then G G. Proof (Induction on number of edges). We know. Now let G be a game with at least one edge. Suppose for (transfinite) induction that H H whenever H has fewer edges than G. Sftsoc: G G. we reach a contradiction. Hence G G. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 20 / 37
37 Good news: is reflexive Theorem If G is a game, then G G. Proof (Induction on number of edges). We know. Now let G be a game with at least one edge. Suppose for (transfinite) induction that H H whenever H has fewer edges than G. Sftsoc: G G. Then either there is some X G L with G X or there is some Y G R with Y G. In either case, we reach a contradiction. Hence G G. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 20 / 37
38 Good news: is reflexive Theorem If G is a game, then G G. Proof (Induction on number of edges). We know. Now let G be a game with at least one edge. Suppose for (transfinite) induction that H H whenever H has fewer edges than G. Sftsoc: G G. Then either there is some X G L with G X or there is some Y G R with Y G. In the first case, since G X, there is no Z G L with X Z... but X G L and X X (by induction). In either case, we reach a contradiction. Hence G G. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 20 / 37
39 Good news: is reflexive Theorem If G is a game, then G G. Proof (Induction on number of edges). We know. Now let G be a game with at least one edge. Suppose for (transfinite) induction that H H whenever H has fewer edges than G. Sftsoc: G G. Then either there is some X G L with G X or there is some Y G R with Y G. In the first case, since G X, there is no Z G L with X Z... but X G L and X X (by induction). In the second case, since Y G, there is no Z G R with Z Y... but Y G R and Y Y (by induction). In either case, we reach a contradiction. Hence G G. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 20 / 37
40 More good news: is transitive Fact If G H and H K, then G K. Proof (Induction on total number of edges in G H K). Base case: ( ) ( ). Let G H K. 1 Sftsoc: X G L and K X, so H K X. By induction, H X, so G H. 2 Sftsoc: Y K R and Y G, so Y G H. By induction, Y H, so H K. Hence G K. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 21 / 37
41 Bad news: is not antisymmetric Proposition = { } = { } James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 22 / 37
42 Bad news: is not antisymmetric Proposition = { } = { } Proof. 1 Let X L. Then X = = { }. Now X R and, so X. R =. So. 2 L =. Let Y R. Then Y = = { }. Now Y L and, so Y. So. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 22 / 37
43 Games with up to two edges (, ) (, ) (,! ) James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 23 / 37
44 Outline 1 Heroes 2 Games 3 Ordering of games 4 Surreal numbers James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 24 / 37
45 Forcing antisymmetry Definition Let G and H be games. We say G H provided that G H and H G. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 25 / 37
46 Forcing antisymmetry Definition Let G and H be games. We say G H provided that G H and H G. Definition is an equivalence relation; a -equivalence class is called a surreal number. We denote the equivalence class of a game G = {G L G R } by [G] = [G L G R ]. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 25 / 37
47 Forcing antisymmetry Definition Let G and H be games. We say G H provided that G H and H G. Definition is an equivalence relation; a -equivalence class is called a surreal number. We denote the equivalence class of a game G = {G L G R } by [G] = [G L G R ]. Definition [ ] The number zero is 0 = = [ ] = [ ]. [ ] The number one is 1 = = [ ] = [ ] = [0 ] = [[ ] ]. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 25 / 37
48 Ordering and strategy Fact [G] < 0 Red can always win the game G. [G] = 0 the second player can always win the game G. 0 < [G] Blue can always win the game G. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 26 / 37
49 Adding games Definition If G and H are games, G + H is the game you get by putting G and H next to each other. + = 1 + [ ] = [ ] = [ ] = 0 James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 27 / 37
50 Adding games Definition If G and H are games, G + H is the game you get by putting G and H next to each other. + = 1 + [ ] = [ ] = [ ] = 0 Definition [ ] The number negative one is 1 = = [ ] = [ ] = [ [ ]]. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 27 / 37
51 The opposite of a game Definition G is the game you get by flipping the color of each edge in G. G H is shorthand for G + ( H). = James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 28 / 37
52 The opposite of a game Definition G is the game you get by flipping the color of each edge in G. G H is shorthand for G + ( H). = Proposition ( G) = G. If G H, then H G. G + ( G) 0. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 28 / 37
53 Ordering and strategy Fact If G H, then G + K H + K. If G 1 G 2 and H 1 H 2, then G 1 H 1 G 2 H 2. Definition We say [G] [H] provided that G H. Corollary [G] < [H] Red can always win the game G H. [G] = [H] the second player can always win the game G H. [H] < [G] Blue can always win the game G H. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 29 / 37
54 G is between G L and G R Theorem Let G be a game. 1 If X G L, then X G. 2 If Y G R, then G Y. ( It would always be better to pass. ) Proof. 1 Suppose X G L is the result when Blue deletes the blue edge e from G. Now consider the game G X, and suppose it s Red s move. If Red deletes an edge from G that has a mirror image in X, or an edge from X that has a mirror image in G, then Blue responds by deleting that mirror image. Otherwise, Red deletes an edge from G with no mirror image in X, and Blue responds by deleting e. On Red s first turn after the deletion of e, the position has the form H H, so Blue can win (by mirroring Red). This shows that Blue can win G X, so [G X ] 0. Thus X G. 2 (Similar.) James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 30 / 37
55 All games are comparable Theorem If G H, then H G. Proof. Suppose G H. We consider two cases. 1 Suppose X G L and H X. We know X G. By transitivity, H G. 2 Suppose Y H R and Y G. We know H Y. By transitivity, H G. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 31 / 37
56 What is [ ]? Example The game shown below is + + : The second player can always win, so [ ] [ ] + + ( 1) = 0. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 32 / 37
57 What is [ ]? Example The game shown below is + + : The second player can always win, so [ ] [ ] + + ( 1) = 0. Definition The number one half is 1 2 = [ ]. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 32 / 37
58 Games with up to two edges James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 33 / 37
59 Games with more edges π ε ω ω ω + 1 2ω James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 34 / 37
60 More game arithmetic Definition Suppose G and H are games with X G G L, Y G G R, X H H L, Y H H R. Then: {X G H + GX H X G X H, Y G H + GY H Y G Y H } (GH) L. {X G H + GY H X G Y H, Y G H + GX H Y G X H } (GH) R. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 35 / 37
61 More game arithmetic Definition Suppose G and H are games with X G G L, Y G G R, X H H L, Y H H R. Then: {X G H + GX H X G X H, Y G H + GY H Y G Y H } (GH) L. {X G H + GY H X G Y H, Y G H + GX H Y G X H } (GH) R. Definition Let G and H be games with [G] > 0 and [H] > 0.1 If, for every X G G L, Y G G R, X H H L, and Y H H R, we have { } 1 1 Y G (1 + (Y G G)X H ), X G (1 + (X G G)Y H ) H L and { } 1 1 X G (1 + (X G G)X H ), Y G (1 + (Y G G)Y H ) H R, then [G][H] = 1. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 35 / 37
62 The surreal numbers are universal Theorem Every ordered field is isomorphic to a subfield of the surreal numbers. The proof requires the axiom of global choice and applies only to sets.... James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 36 / 37
63 References [1] Amir Alexander, Infinitesimal: How a dangerous mathematical theory shaped the modern world, Scientific American/Farrar, Strauss, and Giroux, New York, [2] John H. Conway, On numbers and games, 2nd ed., A K Peters, Ltd., Natick, MA, [3] John H. Conway and Richard K. Guy, The book of numbers, Copernicus, New York, [4] Tom Davis, Hackenbush (December 15, 2011), [5] Philip Ehrlich, All numbers great and small, Real numbers, generalizations of the reals, and theories of continua, Synthese Lib., vol. 242, Kluwer Acad. Publ., Dordrecht, 1994, pp [6] Gretchen Grimm, An introduction to surreal numbers (May 8, 2012), [7] D. E. Knuth, Surreal numbers: how two ex-students turned on to pure mathematics and found total happiness, Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, [8] Jonas Sjöstrand, Combinatorial game theory (March 2015), [9] Wikipedia contributors, Surreal number (July 6, 2017), Image sources Book cover: Conway photo: H Conway 2005.jpg Conway sketch: Fraser, Simon J. Knuth photo: Appelbaum, Jacob. Ordinatio: TikZ Diagrams in Math Mode. James A. Swenson (UWP) Hackenbush and the surreal numbers 9/14/17 37 / 37
COMBINATORIAL GAMES AND SURREAL NUMBERS
COMBINATORIAL GAMES AND SURREAL NUMBERS MICHAEL CRONIN Abstract. We begin by introducing the fundamental concepts behind combinatorial game theory, followed by developing operations and properties of games.
More informationAn very brief overview of Surreal Numbers
An very brief overview of Surreal Numbers for Gandalf MM 204 Steven Charlton History and Introduction Surreal numbers were created by John Horton Conway (of Game of Life fame), as a greatly simplified
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 informationRecursive definitions on surreal numbers
Recursive definitions on surreal numbers Antongiulio Fornasiero 19th July 2005 Abstract Let No be Conway s class of surreal numbers. I will make explicit the notion of a function f on No recursively defined
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 informationORDINAL OPERATIONS ON SURREAL NUMBERS
ORDINAL OPERATIONS ON SURREAL NUMBERS P. KEDDIE ABSTRACT An open problem posed by John H. Conway in [2] was whether one could, on his system of numbers and games,'... define operations of addition and
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 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 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 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 informationSurreal Numbers An Introduction
Surreal Numbers An Introduction Version 1.6 Claus Tøndering 18 September 2013 Copyright and disclaimer This document is Copyright c 2013 by Claus Tøndering. E-mail: claus@tondering.dk. (Please include
More informationDicots, and a taxonomic ranking for misère games
Dicots, and a taxonomic ranking for misère games Paul Dorbec 1,2, Gabriel Renault 1,2, Aaron N. Siegel 3, Éric Sopena 1,2, 1 Univ. Bordeaux, LaBRI, UMR5800, F-33400 Talence 2 CNRS, LaBRI, UMR5800, F-33400
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 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 informationCHAPTER 3: THE INTEGERS Z
CHAPTER 3: THE INTEGERS Z MATH 378, CSUSM. SPRING 2009. AITKEN 1. Introduction The natural numbers are designed for measuring the size of finite sets, but what if you want to compare the sizes of two sets?
More informationAN INTRODUCTION TO CONWAY S GAMES AND NUMBERS
AN INTRODUCTION TO CONWAY S GAMES AND NUMBERS DIERK SCHLEICHER AND MICHAEL STOLL 1. Combinatorial Game Theory Combinatorial Game Theory is a fascinating and rich theory, based on a simple and intuitive
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 informationPosets, homomorphisms and homogeneity
Posets, homomorphisms and homogeneity Peter J. Cameron and D. Lockett School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K. Abstract Jarik Nešetřil suggested
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 informationCMSC 27130: Honors Discrete Mathematics
CMSC 27130: Honors Discrete Mathematics Lectures by Alexander Razborov Notes by Geelon So, Isaac Friend, Warren Mo University of Chicago, Fall 2016 Lecture 1 (Monday, September 26) 1 Mathematical Induction.................................
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 informationRegular Languages and Finite Automata
Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University In 1943, McCulloch and Pitts [4] published a pioneering work on a model for studying
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 informationLecture 6: Finite Fields
CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going
More informationSF2972 Game Theory Exam with Solutions March 15, 2013
SF2972 Game Theory Exam with s March 5, 203 Part A Classical Game Theory Jörgen Weibull and Mark Voorneveld. (a) What are N, S and u in the definition of a finite normal-form (or, equivalently, strategic-form)
More informationMath576: Combinatorial Game Theory Lecture note IV
Math576: Combinatorial Game Theory Lecture note IV Linyuan Lu University of South Carolina Spring, 2017 Disclaimer The slides are solely for the convenience of the students who are taking this course.
More informationbesides your solutions of these problems. 1 1 We note, however, that there will be many factors in the admission decision
The PRIMES 2015 Math Problem Set Dear PRIMES applicant! This is the PRIMES 2015 Math Problem Set. Please send us your solutions as part of your PRIMES application by December 1, 2015. For complete rules,
More informationIn case (1) 1 = 0. Then using and from the previous lecture,
Math 316, Intro to Analysis The order of the real numbers. The field axioms are not enough to give R, as an extra credit problem will show. Definition 1. An ordered field F is a field together with a nonempty
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 informationA Brief Introduction to Proofs
A Brief Introduction to Proofs William J. Turner October, 010 1 Introduction Proofs are perhaps the very heart of mathematics. Unlike the other sciences, mathematics adds a final step to the familiar scientific
More informationSOME TRANSFINITE INDUCTION DEDUCTIONS
SOME TRANSFINITE INDUCTION DEDUCTIONS SYLVIA DURIAN Abstract. This paper develops the ordinal numbers and transfinite induction, then demonstrates some interesting applications of transfinite induction.
More informationON THE THREE-ROWED CHOMP. Andries E. Brouwer Department of Mathematics, Technical University Eindhoven, P.O. Box 513, 5600MB Eindhoven, Netherlands
ON THE THREE-ROWED CHOMP Andries E. Brouwer Department of Mathematics, Technical University Eindhoven, P.O. Box 513, 5600MB Eindhoven, Netherlands Andries.Brouwer@cwi.nl Gábor Horváth Department of Algebra
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 informationMath 225A Model Theory. Speirs, Martin
Math 5A Model Theory Speirs, Martin Autumn 013 General Information These notes are based on a course in Metamathematics taught by Professor Thomas Scanlon at UC Berkeley in the Autumn of 013. The course
More information33. SOLVING LINEAR INEQUALITIES IN ONE VARIABLE
get the complete book: http://wwwonemathematicalcatorg/getfulltextfullbookhtm 33 SOLVING LINEAR INEQUALITIES IN ONE VARIABLE linear inequalities in one variable DEFINITION linear inequality in one variable
More informationDO FIVE OUT OF SIX ON EACH SET PROBLEM SET
DO FIVE OUT OF SIX ON EACH SET PROBLEM SET 1. THE AXIOM OF FOUNDATION Early on in the book (page 6) it is indicated that throughout the formal development set is going to mean pure set, or set whose elements,
More informationMath 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011
Math 31 Lesson Plan Day 2: Sets; Binary Operations Elizabeth Gillaspy September 23, 2011 Supplies needed: 30 worksheets. Scratch paper? Sign in sheet Goals for myself: Tell them what you re going to tell
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 information15. NUMBERS HAVE LOTS OF DIFFERENT NAMES!
5 NUMBERS HAVE LOTS OF DIFFERENT NAMES! a fun type of game with numbers one such game playing the game: 3 pets There are lots of number games that can make you look clairvoyant One such game goes something
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationIn case (1) 1 = 0. Then using and from Friday,
Math 316, Intro to Analysis The order of the real numbers. The field axioms are not enough to give R, as an extra credit problem will show. Definition 1. An ordered field F is a field together with a nonempty
More information15. NUMBERS HAVE LOTS OF DIFFERENT NAMES!
get the complete book: http://wwwonemathematicalcatorg/getfulltetfullbookhtm 5 NUMBERS HAVE LOTS OF DIFFERENT NAMES! a fun type of game with numbers one such game playing the game: 3 pets There are lots
More informationAdvanced Combinatorial Optimization Updated February 18, Lecture 5. Lecturer: Michel X. Goemans Scribe: Yehua Wei (2009)
18.438 Advanced Combinatorial Optimization Updated February 18, 2012. Lecture 5 Lecturer: Michel X. Goemans Scribe: Yehua Wei (2009) In this lecture, we establish the connection between nowhere-zero k-flows
More informationOrdinals. Mustafa Elsheikh elsheimm at mcmaster dot ca. Wed 18 Nov 2008
CAS 701 Fall '08 Topic 09 Ordinals Ordinals Mustafa Elsheikh elsheimm at mcmaster dot ca Wed 18 Nov 2008 Copyright (c) 2008 Mustafa Elsheikh. Permission is granted to copy, distribute and/or modify this
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 informationKCP e-learning. test user - ability basic maths revision. During your training, we will need to cover some ground using statistics.
During your training, we will need to cover some ground using statistics. The very mention of this word can sometimes alarm delegates who may not have done any maths or statistics since leaving school.
More informationThe natural numbers. Definition. Let X be any inductive set. We define the set of natural numbers as N = C(X).
The natural numbers As mentioned earlier in the course, the natural numbers can be constructed using the axioms of set theory. In this note we want to discuss the necessary details of this construction.
More informationReduced Canonical Forms of Stoppers
Reduced Canonical Forms of Stoppers Aaron N. Siegel Mathematical Sciences Research Institute 17 Gauss Way, Berkeley, CA 94720 aaron.n.siegel@gmail.com Submitted: May 12, 2006; Accepted: Jun 26, 2006; Published:
More informationAxioms of separation
Axioms of separation These notes discuss the same topic as Sections 31, 32, 33, 34, 35, and also 7, 10 of Munkres book. Some notions (hereditarily normal, perfectly normal, collectionwise normal, monotonically
More informationFoundation Mathematics. Sample. Examination Paper. Time: 2 hours
Foundation Mathematics Sample Examination Paper Answer ALL questions. Clearly cross out surplus answers. Time: hours The maximum mark for this paper is 100. Any reference material brought into the examination
More informationMeasure and Category. Marianna Csörnyei. ucahmcs
Measure and Category Marianna Csörnyei mari@math.ucl.ac.uk http:/www.ucl.ac.uk/ ucahmcs 1 / 96 A (very short) Introduction to Cardinals The cardinality of a set A is equal to the cardinality of a set B,
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 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 informationCalculus of One Real Variable Prof. Joydeep Dutta Department of Economic Sciences Indian Institute of Technology, Kanpur
Calculus of One Real Variable Prof. Joydeep Dutta Department of Economic Sciences Indian Institute of Technology, Kanpur Lecture 08 Intermediate Value Theorem Welcome once again; as we continue moving
More informationDIMACS Technical Report March Game Seki 1
DIMACS Technical Report 2007-05 March 2007 Game Seki 1 by Diogo V. Andrade RUTCOR, Rutgers University 640 Bartholomew Road Piscataway, NJ 08854-8003 dandrade@rutcor.rutgers.edu Vladimir A. Gurvich RUTCOR,
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 information4.1 Real-valued functions of a real variable
Chapter 4 Functions When introducing relations from a set A to a set B we drew an analogy with co-ordinates in the x-y plane. Instead of coming from R, the first component of an ordered pair comes from
More informationSet Theory and the Foundation of Mathematics. June 19, 2018
1 Set Theory and the Foundation of Mathematics June 19, 2018 Basics Numbers 2 We have: Relations (subsets on their domain) Ordered pairs: The ordered pair x, y is the set {{x, y}, {x}}. Cartesian products
More informationKrivine s Intuitionistic Proof of Classical Completeness (for countable languages)
Krivine s Intuitionistic Proof of Classical Completeness (for countable languages) Berardi Stefano Valentini Silvio Dip. Informatica Dip. Mat. Pura ed Applicata Univ. Torino Univ. Padova c.so Svizzera
More informationProbing the Edge Template in Hex
H.J. van den Herik et al. (Eds.): CG 008, LNCS, pp. 9-0, 008. c IFIP International Federation for Information Processing 008 Probing the -- Edge Template in Hex Philip Henderson and Ryan B. Hayward University
More informationSurreal numbers, derivations and transseries
Vincenzo Mantova Joint work with A. Berarducci University of CamerinoScuola Normale Superiore, Pisa Paris 12 January 2014 Outline 1 Surreal numbers 2 Hardy fields and transseries 3 Surreal derivations
More informationCOM S 330 Lecture Notes Week of Feb 9 13
Monday, February 9. Rosen.4 Sequences Reading: Rosen.4. LLM 4.. Ducks 8., 8., Def: A sequence is a function from a (usually infinite) subset of the integers (usually N = {0,,, 3,... } or Z + = {,, 3, 4,...
More informationSUMS OF POWERS AND BERNOULLI NUMBERS
SUMS OF POWERS AND BERNOULLI NUMBERS TOM RIKE OAKLAND HIGH SCHOOL Fermat and Pascal On September 22, 636 Fermat claimed in a letter that he could find the area under any higher parabola and Roberval wrote
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 informationUniversal Totally Ordered Sets
Universal Totally Ordered Sets Luke Adams May 11, 2018 Abstract In 1874, Georg Cantor published an article in which he proved that the set of algebraic numbers are countable, and the set of real numbers
More informationDISJOINT-UNION PARTIAL ALGEBRAS
Logical Methods in Computer Science Vol. 13(2:10)2017, pp. 1 31 https://lmcs.episciences.org/ Submitted Dec. 07, 2016 Published Jun. 22, 2017 DISJOINT-UNION PARTIAL ALGEBRAS ROBIN HIRSCH AND BRETT MCLEAN
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 3
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 3 Induction Induction is an extremely powerful tool in mathematics. It is a way of proving propositions that hold for all
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: Rule of Inference Mathematical Induction: Conjecturing and Proving Mathematical Induction:
More informationVariants of the Game of Nim that have Inequalities as Conditions
Rose-Hulman Undergraduate Mathematics Journal Volume 10 Issue 2 Article 12 Variants of the Game of Nim that have Inequalities as Conditions Toshiyuki Yamauchi Kwansei Gakuin University, Japan Taishi Inoue
More informationFINITE CONNECTED H-SPACES ARE CONTRACTIBLE
FINITE CONNECTED H-SPACES ARE CONTRACTIBLE ISAAC FRIEND Abstract. The non-hausdorff suspension of the one-sphere S 1 of complex numbers fails to model the group s continuous multiplication. Moreover, finite
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 informationSF2972 Game Theory Written Exam with Solutions June 10, 2011
SF97 Game Theory Written Exam with Solutions June 10, 011 Part A Classical Game Theory Jörgen Weibull and Mark Voorneveld 1. Finite normal-form games. (a) What are N, S and u in the definition of a finite
More informationAdvanced Combinatorial Optimization September 24, Lecture 5
18.438 Advanced Combinatorial Optimization September 24, 2009 Lecturer: Michel X. Goemans Lecture 5 Scribe: Yehua Wei In this lecture, we establish the connection between nowhere-zero (nwz) k-flow and
More informationPrice: $25 (incl. T-Shirt, morning tea and lunch) Visit:
Three days of interesting talks & workshops from industry experts across Australia Explore new computing topics Network with students & employers in Brisbane Price: $25 (incl. T-Shirt, morning tea and
More informationOn the coinductive nature of centralizers
On the coinductive nature of centralizers Charles Grellois INRIA & University of Bologna Séminaire du LIFO Jan 16, 2017 Charles Grellois (INRIA & Bologna) On the coinductive nature of centralizers Jan
More informationMath 581 Problem Set 5 Solutions
Math 581 Problem Set 5 Solutions 1. Show that the set { 2, 2 + i, 3 i} is linearly independent over Q. Proof: Suppose there exists a 0, a 1, and a 2 in Q so that a 0 2 + a1 ( 2 + i) + a 2 ( 3 i) = 0. Then
More informationNotes on ordinals and cardinals
Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}
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 informationRamsey theory. Andrés Eduardo Caicedo. Undergraduate Math Seminar, March 22, Department of Mathematics Boise State University
Andrés Eduardo Department of Mathematics Boise State University Undergraduate Math Seminar, March 22, 2012 Thanks to the NSF for partial support through grant DMS-0801189. My work is mostly in set theory,
More informationSTRUCTURES WITH MINIMAL TURING DEGREES AND GAMES, A RESEARCH PROPOSAL
STRUCTURES WITH MINIMAL TURING DEGREES AND GAMES, A RESEARCH PROPOSAL ZHENHAO LI 1. Structures whose degree spectrum contain minimal elements/turing degrees 1.1. Background. Richter showed in [Ric81] that
More informationWhy write proofs? Why not just test and repeat enough examples to confirm a theory?
P R E F A C E T O T H E S T U D E N T Welcome to the study of mathematical reasoning. The authors know that many students approach this material with some apprehension and uncertainty. Some students feel
More informationWell Ordered Sets (continued)
Well Ordered Sets (continued) Theorem 8 Given any two well-ordered sets, either they are isomorphic, or one is isomorphic to an initial segment of the other. Proof Let a,< and b, be well-ordered sets.
More informationProofs of Claims Leading to the Intermediate Value Theorem Stephen M. Walk, St. Cloud State University, 2011
Proofs of Claims Leading to the Intermediate Value Theorem Stephen M. Walk, St. Cloud State University, 2011 This supplement contains proofs of theorems stated in the article The Intermediate Value Theorem
More informationMATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM
MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM (FP1) The exclusive or operation, denoted by and sometimes known as XOR, is defined so that P Q is true iff P is true or Q is true, but not both. Prove (through
More information30. TRANSFORMING TOOL #1 (the Addition Property of Equality)
30 TRANSFORMING TOOL #1 (the Addition Property of Equality) sentences that look different, but always have the same truth values What can you DO to a sentence that will make it LOOK different, but not
More informationWell-foundedness of Countable Ordinals and the Hydra Game
Well-foundedness of Countable Ordinals and the Hydra Game Noah Schoem September 11, 2014 1 Abstract An argument involving the Hydra game shows why ACA 0 is insufficient for a theory of ordinals in which
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 informationLogic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies
Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies Valentin Stockholm University September 2016 Propositions Proposition:
More informationSets, Models and Proofs. I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University
Sets, Models and Proofs I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University 2000; revised, 2006 Contents 1 Sets 1 1.1 Cardinal Numbers........................ 2 1.1.1 The Continuum
More informationUnderstanding Decimal Addition
2 Understanding Decimal Addition 2.1 Experience Versus Understanding This book is about understanding system architecture in a quick and clean way: no black art, nothing you can only get a feeling for
More informationNotes on induction proofs and recursive definitions
Notes on induction proofs and recursive definitions James Aspnes December 13, 2010 1 Simple induction Most of the proof techniques we ve talked about so far are only really useful for proving a property
More informationCardinality and ordinal numbers
Cardinality and ordinal numbers The cardinality A of a finite set A is simply the number of elements in it. When it comes to infinite sets, we no longer can speak of the number of elements in such a set.
More informationNUMERICAL COMPUTATIONS AND
NUMERICAL COMPUTATIONS AND MATHEMATICAL MODELLING WITH INFINITE AND INFINITESIMAL NUMBERS Yaroslav D. Sergeyev Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, 87030
More informationSundaram's Sieve. by Julian Havil. Sundaram's Sieve
1997 2009, Millennium Mathematics Project, University of Cambridge. Permission is granted to print and copy this page on paper for non commercial use. For other uses, including electronic redistribution,
More informationReductions of partizan games
Games of No Chance 3 MSRI Publications Volume 56, 2009 Reductions of partizan games J.P. GROSSMAN AND AARON N. SIEGEL ABSTRACT. The reduced canonical form of a game G, denoted by G, is the simplest game
More informationNONSTANDARD MODELS AND KRIPKE S PROOF OF THE GÖDEL THEOREM
Notre Dame Journal of Formal Logic Volume 41, Number 1, 2000 NONSTANDARD MODELS AND KRIPKE S PROOF OF THE GÖDEL THEOREM HILARY PUTNAM Abstract This lecture, given at Beijing University in 1984, presents
More informationCMPSCI 250: Introduction to Computation. Lecture 11: Proof Techniques David Mix Barrington 5 March 2013
CMPSCI 250: Introduction to Computation Lecture 11: Proof Techniques David Mix Barrington 5 March 2013 Proof Techniques Review: The General Setting for Proofs Types of Proof: Direct, Contraposition, Contradiction
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 information32. SOLVING LINEAR EQUATIONS IN ONE VARIABLE
get the complete book: /getfulltextfullbook.htm 32. SOLVING LINEAR EQUATIONS IN ONE VARIABLE classifying families of sentences In mathematics, it is common to group together sentences of the same type
More informationMath 230 Final Exam, Spring 2009
IIT Dept. Applied Mathematics, May 13, 2009 1 PRINT Last name: Signature: First name: Student ID: Math 230 Final Exam, Spring 2009 Conditions. 2 hours. No book, notes, calculator, cell phones, etc. Part
More information