|
|
- Byron Holmes
- 5 years ago
- Views:
Transcription
1
2
3
4
5
6
7
8
9
10
11
12
13 Ramsey Theory The Ramsey number R(r,s) is the smallest n for which any 2-coloring of K n contains a monochromatic red K r or a monochromatic blue K s where r,s 2.
14 Examples R(2,2) = 2 R(3,3) = 6 R(4,4) = 18 R(5,5) = 58 R(6,6) 102
15 Propositions of Ramsey Theory R(a,b) = R(b,a) R(2,m) = m R(3,m) = 3m!
16 Generalized Ramsey Theory Ramsey Theory can be generalized to have r colorings. Define for natural numbers I 1,...,I r the Ramsey number R(I 1, I 2,..., I r ) to be the least number n for which any r-coloring of K n contains a monochromatic r color K I r.
17 Chromatic number The chromatic number χ(h) is defined to be the least number of colors needed to color the vertices of H so that the endpoints of each edge are not all the same color. If χ(h) > 2 then every 2-coloring of K n contains a monochromatic K m
18 Overview Helpful to think about combinatorial problems in terms of games. 1. Achievement game 2. Avoidance game 3. Pekec s game (combination of Achievement game and Avoidance game) 1 / 9
19 Achievement Game 1. Start with K n and 2 players, each with a unique color. 2. Give each player a graph (P1 gets G, P2 gets H). 3. Players alternate turns, coloring an edge on K n each turn. 4. Aim: Each player aims to color a subgraph isomorphic to their graph in their color. 2 / 9
20 Achievement Game 1. Start with K n and 2 players, each with a unique color. 2. Give each player a graph (P1 gets G, P2 gets H). 3. Players alternate turns, coloring an edge on K n each turn. 4. Aim: Each player aims to color a subgraph isomorphic to their graph in their color. Imagine we are exploring the case of R(3, 3) = 6. We have two players trying to color monochromatic K 3 s. If n = 6, so the players are coloring K 6, then there will be a winner. Because we have shown R(3, 3) = 6. 3 / 9
21 Achievement Game 1. Start with K n and 2 players, each with a unique color. 2. Give each player a graph (P1 gets G, P2 gets H). 3. Players alternate turns, coloring an edge on K n each turn. 4. Aim: Each player aims to color a subgraph isomorphic to their graph in their color. Imagine we are exploring the case of R(3, 3) = 6. We have two players trying to color monochromatic K 3 s. If n = 6, so the players are coloring K 6, then there will be a winner. Because we have shown R(3, 3) = 6. If n = 5, so the players are coloring K 5, then there may be tie. If n = 3, then the players must tie (because neither can color a K 3 ). 4 / 9
22 Achievement Game Theorem Theorem In the achievement game, if all players are trying to achieve the same graph (i.e. G = H) and there is a winning strategy, then it belongs to the first player. Proof idea. The proof uses a strategy stealing argument. If the second player had a winning stategy, it would be a strategy on K n 1, then the first player could use that strategy on K n and win. Another way to think about it is that it s never bad for a player to color an edge, so the first person to go must have the winning strategy - just like tic-tac-toe. Corollary Suppose the players are trying to build the same graph. There exists some n such that for all m n, if the players are coloring K m, then the first player wins with best play. Proof: n = R(G, G). 5 / 9
23 Avoidance Game Same setup, except that the players want to avoid building a monochromatic subgraph isomorphic to their graph. If they do make one, then they lose. The theorem above does not hold for the avoidance game. Depending on the circumstance, coloring an edge could either help or hurt a player. Say the player can force the other player to build the graph by coloring an edge, then it s good to color an edge. Say if the player colors any edge, they build their monochromatic subgraph, then it s bad to color an edge. For two players playing on K 6, exhaustive computer search shows that player 2 wins with best play. The Ramsey number R(G, H) gives an upper bound on n for which if they play on K n, at least one player loses. 6 / 9
24 Pekec s Game Now we combine the Achievement and Avoidance game. One player (achiever) tries to create a monochromatic G in their color. Other player (avoider) tries to prevent the creation of a monochromatic G in the opponent s color. Lemma If Pekec s game is played on K m and the achiever is trying to create a monochromatic G where m 2R(G, G), then the achiever wins with best play. 7 / 9
25 Pekec s Game Lemma Lemma If Pekec s game is played on K m and the achiever is trying to create a monochromatic G where m 2R(G, G), then the achiever wins with best play. Proof. We prove by giving a strategy for the achiever. 1. Split edges into three sets, two of which form the complete subgraph on R(H, H) vertices, and the other has the remaining edges. 2. Achiever assigns an isomorphism between the two K R(H,H) subgraphs. 3. Whenever the opponent colors an edge in one subgraph, the achiever colors the corresponding edge in the other subgraph. 4. If the opponent colors an edge in the third set, so does the achiever until there are more edges. (technically determines are ordering, but not really important) 5. By definition of R(H, H), if the achiever s monochromatic H does not appear their color is the first set of edges, then it will appear in the second set of edges in the achiever s color. 6. So the acheiver wins. 8 / 9
26 Explanation of Proof of Lemma Say G = K 3. Say m = 15. Note that 15 =m 2R(G, G) = 2R(3, 3) = 12. Then set1 = K 6 K 1 5. Then set2 = K 6 K 1 5. Then set3 = remaining 3 edges. After coloring, set1 and set2 will look identical, except that colors will be flipped. i.e. e set1 has color c f (e) set2 has color c. So there will be a monochromatic K 3 in set1 and set2, each of a different color. Hence there is a monochromatic K 3 of the achiever s color, so they win! 9 / 9
27 Vertex Coloring A legal vertex coloring on a simple graph f : V (G) [r] is created by assigning one of r colors to each vertex in the graph G such that no adjacent vertices are the same color. The chromatic number χ(g) is the smallest number of colors, k, where a legal vertex coloring is possible.
28 Coloring the Plane The Hadwiger?Nelson Problem: What is the chromatic number of the plane, χ(r 2 )? Setup: Define the infinite unit distance graph of R 2 as R 2, the graph generated by taking each point in R 2 as a vertex and marking vertices as adjacent (i.e connecting them with an edge), iff they are unit distance apart. Theorem (Bruijn-Erdős Theorem) For every infinite graph G and every finite integer k, G can be colored with k colors iff all of its finite subgraphs can be colored with k colors.
29 Upper and Lower Bounds for χ(r 2 ) The best known bounds are 4 χ(r 2 ) 7. How do we find these bounds?
30 Upper and Lower Bounds for χ(r 2 ) The best known bounds are 4 χ(r 2 ) 7. How do we find these bounds? It s easy to show that if we try to color the plane with one or two colors, there will be always be a case where two points unit distance apart are assigned the same color.
31 Upper and Lower Bounds for χ(r 2 ) The best known bounds are 4 χ(r 2 ) 7. How do we find these bounds? It s easy to show that if we try to color the plane with one or two colors, there will be always be a case where two points unit distance apart are assigned the same color. The Moser Spindle shows that χ(r 2 ) 4
32 Upper and Lower Bounds for χ(r 2 ) The best known bounds are 4 χ(r 2 ) 7. How do we find these bounds? It s easy to show that if we try to color the plane with one or two colors, there will be always be a case where two points unit distance apart are assigned the same color. The Moser Spindle shows that χ(r 2 ) 4 If we tesselate the plane using regular hexagons (of diameter slightly less than unit distance) we can show that it is possible to color the plane with 7 colors, which yields the upper bound χ(r 2 ) 7
33 Homework Problems 1. Draw another unit distance graph, G with χ(g) = Show that R(2, m) = m. * Hint: One possible answer uses 10 vertices.
Tic-Tac-Toe on graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 72(1) (2018), Pages 106 112 Tic-Tac-Toe on graphs Robert A. Beeler Department of Mathematics and Statistics East Tennessee State University Johnson City, TN
More informationNuman Sheikh FC College Lahore
Numan Sheikh FC College Lahore 2 Five men crash-land their airplane on a deserted island in the South Pacific. On their first day they gather as many coconuts as they can find into one big pile. They decide
More informationPlan. Related courses. A Take-Away Game. Mathematical Games , (21-801) - Mathematical Games Look for it in Spring 11
V. Adamchik D. Sleator Great Theoretical Ideas In Computer Science Mathematical Games CS 5-25 Spring 2 Lecture Feb., 2 Carnegie Mellon University Plan Introduction to Impartial Combinatorial Games Related
More informationThe Hex game and its mathematical side
The Hex game and its mathematical side Antonín Procházka Laboratoire de Mathématiques de Besançon Université Franche-Comté Lycée Jules Haag, 19 mars 2013 Brief history : HEX was invented in 1942
More informationA Study of Combinatorial Games. David Howard Carnegie Mellon University Math Department
A Study of Combinatorial Games David Howard Carnegie Mellon University Math Department May 14, 2004 Contents 1 Positional Games 4 2 Quasiprobabilistic Method 9 3 Voronoi Game 13 4 Revolutionaries and Spies
More informationGame Theory and Algorithms Lecture 19: Nim & Impartial Combinatorial Games
Game Theory and Algorithms Lecture 19: Nim & Impartial Combinatorial Games May 17, 2011 Summary: We give a winning strategy for the counter-taking game called Nim; surprisingly, it involves computations
More informationThe Pigeonhole Principle
The Pigeonhole Principle Some Questions Does there have to be two trees on Earth with the same number of leaves? How large of a set of distinct integers between 1 and 200 is needed to assure that two numbers
More informationarxiv: v1 [cs.cc] 21 Jun 2017
Solving the Rubik s Cube Optimally is NP-complete Erik D. Demaine Sarah Eisenstat Mikhail Rudoy arxiv:1706.06708v1 [cs.cc] 21 Jun 2017 Abstract In this paper, we prove that optimally solving an n n n Rubik
More informationCommuting Graphs on Dihedral Group
Commuting Graphs on Dihedral Group T. Tamizh Chelvama, K. Selvakumar and S. Raja Department of Mathematics, Manonmanian Sundaranar, University Tirunelveli 67 01, Tamil Nadu, India Tamche_ 59@yahoo.co.in,
More informationRAINBOW COLORINGS OF SOME GEOMETRICALLY DEFINED UNIFORM HYPERGRAPHS IN THE PLANE
1 RAINBOW COLORINGS OF SOME GEOMETRICALLY DEFINED UNIFORM HYPERGRAPHS IN THE PLANE 1 Introduction Brent Holmes* Christian Brothers University Memphis, TN 38104, USA email: bholmes1@cbu.edu A hypergraph
More informationEXPLORING TIC-TAC-TOE VARIANTS
EXPLORING TIC-TAC-TOE VARIANTS By Alec Levine A SENIOR RESEARCH PAPER PRESENTED TO THE DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE OF STETSON UNIVERSITY IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR
More informationCombined Games. Block, Alexander Huang, Boao. icamp Summer Research Program University of California, Irvine Irvine, CA
Combined Games Block, Alexander Huang, Boao icamp Summer Research Program University of California, Irvine Irvine, CA 92697 August 17, 2013 Abstract What happens when you play Chess and Tic-Tac-Toe at
More informationDomination game and minimal edge cuts
Domination game and minimal edge cuts Sandi Klavžar a,b,c Douglas F. Rall d a Faculty of Mathematics and Physics, University of Ljubljana, Slovenia b Faculty of Natural Sciences and Mathematics, University
More informationOn the Periodicity of Graph Games
On the Periodicity of Graph Games Ian M. Wanless Department of Computer Science Australian National University Canberra ACT 0200, Australia imw@cs.anu.edu.au Abstract Starting with the empty graph on p
More informationContents. MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes. 1 Wednesday, August Friday, August Monday, August 28 6
MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes Contents 1 Wednesday, August 23 4 2 Friday, August 25 5 3 Monday, August 28 6 4 Wednesday, August 30 8 5 Friday, September 1 9 6 Wednesday, September
More informationObliged Sums of Games
Obliged Sums of Games Thomas S. Ferguson Mathematics Department, UCLA 1. Introduction. Let g be an impartial combinatorial game. In such a game, there are two players, I and II, there is an initial position,
More informationProblem Set 4 Due: Wednesday, November 12th, 2014
6.890: Algorithmic Lower Bounds Prof. Erik Demaine Fall 2014 Problem Set 4 Due: Wednesday, November 12th, 2014 Problem 1. Given a graph G = (V, E), a connected dominating set D V is a set of vertices such
More informationThe pairing strategies of the 9-in-a-row game
ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 16 (2019) 97 109 https://doi.org/10.26493/1855-3974.1350.990 (Also available at http://amc-journal.eu) The
More information12. 6 jokes are minimal.
Pigeonhole Principle Pigeonhole Principle: When you organize n things into k categories, one of the categories has at least n/k things in it. Proof: If each category had fewer than n/k things in it then
More informationAxiom A-1: To every angle there corresponds a unique, real number, 0 < < 180.
Axiom A-1: To every angle there corresponds a unique, real number, 0 < < 180. We denote the measure of ABC by m ABC. (Temporary Definition): A point D lies in the interior of ABC iff there exists a segment
More informationOn Drawn K-In-A-Row Games
On Drawn K-In-A-Row Games Sheng-Hao Chiang, I-Chen Wu 2 and Ping-Hung Lin 2 National Experimental High School at Hsinchu Science Park, Hsinchu, Taiwan jiang555@ms37.hinet.net 2 Department of Computer Science,
More informationDiscrete bidding games
Discrete bidding games Mike Develin merican Institute of Mathematics 360 Portage ve., Palo lto, C 94306 develin@post.harvard.edu Sam Payne Stanford University, Dept. of Mathematics 450 Serra Mall, Stanford,
More informationCrossing Game Strategies
Crossing Game Strategies Chloe Avery, Xiaoyu Qiao, Talon Stark, Jerry Luo March 5, 2015 1 Strategies for Specific Knots The following are a couple of crossing game boards for which we have found which
More informationTutorial 1. (ii) There are finite many possible positions. (iii) The players take turns to make moves.
1 Tutorial 1 1. Combinatorial games. Recall that a game is called a combinatorial game if it satisfies the following axioms. (i) There are 2 players. (ii) There are finite many possible positions. (iii)
More informationGames on graphs. Keywords: positional game, Maker-Breaker, Avoider-Enforcer, probabilistic
Games on graphs Miloš Stojaković Department of Mathematics and Informatics, University of Novi Sad, Serbia milos.stojakovic@dmi.uns.ac.rs http://www.inf.ethz.ch/personal/smilos/ Abstract. Positional Games
More informationA variation on the game SET
A variation on the game SET David Clark 1, George Fisk 2, and Nurullah Goren 3 1 Grand Valley State University 2 University of Minnesota 3 Pomona College June 25, 2015 Abstract Set is a very popular card
More informationAdvanced Automata Theory 4 Games
Advanced Automata Theory 4 Games Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Advanced Automata Theory 4 Games p. 1 Repetition
More informationThe tenure game. The tenure game. Winning strategies for the tenure game. Winning condition for the tenure game
The tenure game The tenure game is played by two players Alice and Bob. Initially, finitely many tokens are placed at positions that are nonzero natural numbers. Then Alice and Bob alternate in their moves
More informationOn the fairness and complexity of generalized k-in-a-row games
Theoretical Computer Science 385 (2007) 88 100 www.elsevier.com/locate/tcs On the fairness and complexity of generalized k-in-a-row games Ming Yu Hsieh, Shi-Chun Tsai 1001 University Road, Department of
More informationSOLITAIRE CLOBBER AS AN OPTIMIZATION PROBLEM ON WORDS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #G04 SOLITAIRE CLOBBER AS AN OPTIMIZATION PROBLEM ON WORDS Vincent D. Blondel Department of Mathematical Engineering, Université catholique
More informationCombinatorial Games. Jeffrey Kwan. October 2, 2017
Combinatorial Games Jeffrey Kwan October 2, 2017 Don t worry, it s just a game... 1 A Brief Introduction Almost all of the games that we will discuss will involve two players with a fixed set of rules
More informationTo be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we. The first (and most delicate) case concerns 2
Quadratic Reciprocity To be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we need to be able to evaluate q for any prime q. The first (and most delicate) case
More informationNotes for Recitation 3
6.042/18.062J Mathematics for Computer Science September 17, 2010 Tom Leighton, Marten van Dijk Notes for Recitation 3 1 State Machines Recall from Lecture 3 (9/16) that an invariant is a property of a
More information2 person perfect information
Why Study Games? Games offer: Intellectual Engagement Abstraction Representability Performance Measure Not all games are suitable for AI research. We will restrict ourselves to 2 person perfect information
More informationThe Mathematics of Playing Tic Tac Toe
The Mathematics of Playing Tic Tac Toe by David Pleacher Although it has been shown that no one can ever win at Tic Tac Toe unless a player commits an error, the game still seems to have a universal appeal.
More informationGraph Nim. PURE Insights. Breeann Flesch Western Oregon University,
PURE Insights Volume rticle 0 Graph Nim reeann Flesch Western Oregon University, fleschb@mail.wou.edu kaanchya Pradhan Western Oregon University, apradhan0@mail.wou.edu Follow this and additional works
More informationTOPOLOGY, LIMITS OF COMPLEX NUMBERS. Contents 1. Topology and limits of complex numbers 1
TOPOLOGY, LIMITS OF COMPLEX NUMBERS Contents 1. Topology and limits of complex numbers 1 1. Topology and limits of complex numbers Since we will be doing calculus on complex numbers, not only do we need
More informationStanford University CS261: Optimization Handout 9 Luca Trevisan February 1, 2011
Stanford University CS261: Optimization Handout 9 Luca Trevisan February 1, 2011 Lecture 9 In which we introduce the maximum flow problem. 1 Flows in Networks Today we start talking about the Maximum Flow
More informationFacilitator Guide. Unit 2
Facilitator Guide Unit 2 UNIT 02 Facilitator Guide ACTIVITIES NOTE: At many points in the activities for Mathematics Illuminated, workshop participants will be asked to explain, either verbally or in
More informationON SPLITTING UP PILES OF STONES
ON SPLITTING UP PILES OF STONES GREGORY IGUSA Abstract. In this paper, I describe the rules of a game, and give a complete description of when the game can be won, and when it cannot be won. The first
More informationTowards generalizing thrackles to arbitrary graphs
Towards generalizing thrackles to arbitrary graphs Jin-Woo Bryan Oh PRIMES-USA; Mentor: Rik Sengupta May 18, 2013 Thrackles and known results Thrackles and known results What is a thrackle? Thrackles and
More informationNontraditional Positional Games: New methods and boards for playing Tic-Tac-Toe
University of Montana ScholarWorks at University of Montana Graduate Student Theses, Dissertations, & Professional Papers Graduate School 2012 Nontraditional Positional Games: New methods and boards for
More informationGrade 7 & 8 Math Circles. Mathematical Games
Faculty of Mathematics Waterloo, Ontario N2L 3G1 The Loonie Game Grade 7 & 8 Math Circles November 19/20/21, 2013 Mathematical Games In the loonie game, two players, and, lay down 17 loonies on a table.
More informationPRIMES STEP Plays Games
PRIMES STEP Plays Games arxiv:1707.07201v1 [math.co] 22 Jul 2017 Pratik Alladi Neel Bhalla Tanya Khovanova Nathan Sheffield Eddie Song William Sun Andrew The Alan Wang Naor Wiesel Kevin Zhang Kevin Zhao
More informationa b c d e f g h 1 a b c d e f g h C A B B A C C X X C C X X C C A B B A C Diagram 1-2 Square names
Chapter Rules and notation Diagram - shows the standard notation for Othello. The columns are labeled a through h from left to right, and the rows are labeled through from top to bottom. In this book,
More informationOlympiad Combinatorics. Pranav A. Sriram
Olympiad Combinatorics Pranav A. Sriram August 2014 Chapter 2: Algorithms - Part II 1 Copyright notices All USAMO and USA Team Selection Test problems in this chapter are copyrighted by the Mathematical
More information1 Modified Othello. Assignment 2. Total marks: 100. Out: February 10 Due: March 5 at 14:30
CSE 3402 3.0 Intro. to Concepts of AI Winter 2012 Dept. of Computer Science & Engineering York University Assignment 2 Total marks: 100. Out: February 10 Due: March 5 at 14:30 Note 1: To hand in your report
More informationSOME MORE DECREASE AND CONQUER ALGORITHMS
What questions do you have? Decrease by a constant factor Decrease by a variable amount SOME MORE DECREASE AND CONQUER ALGORITHMS Insertion Sort on Steroids SHELL'S SORT A QUICK RECAP 1 Shell's Sort We
More informationCMPUT 396 Tic-Tac-Toe Game
CMPUT 396 Tic-Tac-Toe Game Recall minimax: - For a game tree, we find the root minimax from leaf values - With minimax we can always determine the score and can use a bottom-up approach Why use minimax?
More informationMath 152: Applicable Mathematics and Computing
Math 152: Applicable Mathematics and Computing April 16, 2017 April 16, 2017 1 / 17 Announcements Please bring a blue book for the midterm on Friday. Some students will be taking the exam in Center 201,
More informationGAMES AND STRATEGY BEGINNERS 12/03/2017
GAMES AND STRATEGY BEGINNERS 12/03/2017 1. TAKE AWAY GAMES Below you will find 5 different Take Away Games, each of which you may have played last year. Play each game with your partner. Find the winning
More informationarxiv: v2 [cs.cc] 18 Mar 2013
Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete Daniel Grier arxiv:1209.1750v2 [cs.cc] 18 Mar 2013 University of South Carolina grierd@email.sc.edu Abstract. A poset game is a
More informationGEOGRAPHY PLAYED ON AN N-CYCLE TIMES A 4-CYCLE
GEOGRAPHY PLAYED ON AN N-CYCLE TIMES A 4-CYCLE M. S. Hogan 1 Department of Mathematics and Computer Science, University of Prince Edward Island, Charlottetown, PE C1A 4P3, Canada D. G. Horrocks 2 Department
More informationARTIFICIAL INTELLIGENCE (CS 370D)
Princess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) (CHAPTER-5) ADVERSARIAL SEARCH ADVERSARIAL SEARCH Optimal decisions Min algorithm α-β pruning Imperfect,
More informationBackground. Game Theory and Nim. The Game of Nim. Game is Finite 1/27/2011
Background Game Theory and Nim Dr. Michael Canjar Department of Mathematics, Computer Science and Software Engineering University of Detroit Mercy 26 January 2010 Nimis a simple game, easy to play. It
More informationGame 0: One Pile, Last Chip Loses
Take Away Games II: Nim April 24, 2016 The Rules of Nim The game of Nim is a two player game. There are piles of chips which the players take turns taking chips from. During a single turn, a player can
More informationA tournament problem
Discrete Mathematics 263 (2003) 281 288 www.elsevier.com/locate/disc Note A tournament problem M.H. Eggar Department of Mathematics and Statistics, University of Edinburgh, JCMB, KB, Mayeld Road, Edinburgh
More informationThe Game of SET R, and its Mathematics.
The Game of SET R, and its Mathematics. Bobby Hanson April 2, 2008 But, as for everything else, so for a mathematical theory beauty can be perceived but not explained. A. Cayley Introduction The game of
More informationTHE PIGEONHOLE PRINCIPLE. MARK FLANAGAN School of Electrical and Electronic Engineering University College Dublin
THE PIGEONHOLE PRINCIPLE MARK FLANAGAN School of Electrical and Electronic Engineering University College Dublin The Pigeonhole Principle: If n + 1 objects are placed into n boxes, then some box contains
More informationAnalysis of Don't Break the Ice
Rose-Hulman Undergraduate Mathematics Journal Volume 18 Issue 1 Article 19 Analysis of Don't Break the Ice Amy Hung Doane University Austin Uden Doane University Follow this and additional works at: https://scholar.rose-hulman.edu/rhumj
More informationσ-coloring of the Monohedral Tiling
International J.Math. Combin. Vol.2 (2009), 46-52 σ-coloring of the Monohedral Tiling M. E. Basher (Department of Mathematics, Faculty of Science (Suez), Suez-Canal University, Egypt) E-mail: m e basher@@yahoo.com
More informationGenerating indecomposable permutations
Discrete Mathematics 306 (2006) 508 518 www.elsevier.com/locate/disc Generating indecomposable permutations Andrew King Department of Computer Science, McGill University, Montreal, Que., Canada Received
More informationSTAJSIC, DAVORIN, M.A. Combinatorial Game Theory (2010) Directed by Dr. Clifford Smyth. pp.40
STAJSIC, DAVORIN, M.A. Combinatorial Game Theory (2010) Directed by Dr. Clifford Smyth. pp.40 Given a combinatorial game, can we determine if there exists a strategy for a player to win the game, and can
More informationCutting a Pie Is Not a Piece of Cake
Cutting a Pie Is Not a Piece of Cake Julius B. Barbanel Department of Mathematics Union College Schenectady, NY 12308 barbanej@union.edu Steven J. Brams Department of Politics New York University New York,
More informationMath 152: Applicable Mathematics and Computing
Math 152: Applicable Mathematics and Computing May 8, 2017 May 8, 2017 1 / 15 Extensive Form: Overview We have been studying the strategic form of a game: we considered only a player s overall strategy,
More informationThe Apprentices Tower of Hanoi
Journal of Mathematical Sciences (2016) 1-6 ISSN 272-5214 Betty Jones & Sisters Publishing http://www.bettyjonespub.com Cory B. H. Ball 1, Robert A. Beeler 2 1. Department of Mathematics, Florida Atlantic
More informationTILING RECTANGLES AND HALF STRIPS WITH CONGRUENT POLYOMINOES. Michael Reid. Brown University. February 23, 1996
Published in Journal of Combinatorial Theory, Series 80 (1997), no. 1, pp. 106 123. TILING RECTNGLES ND HLF STRIPS WITH CONGRUENT POLYOMINOES Michael Reid Brown University February 23, 1996 1. Introduction
More informationMultiplayer Pushdown Games. Anil Seth IIT Kanpur
Multiplayer Pushdown Games Anil Seth IIT Kanpur Multiplayer Games we Consider These games are played on graphs (finite or infinite) Generalize two player infinite games. Any number of players are allowed.
More informationIntroduction To Game Theory: Two-Person Games of Perfect Information and Winning Strategies. Wes Weimer, University of Virginia
Introduction To Game Theory: Two-Person Games of Perfect Information and Winning Strategies Wes Weimer, University of Virginia #1 PL Fencing Day Fri Apr 27 (unless it rains) @ 3:30pm Darden Courtyard;
More informationSenior Math Circles February 10, 2010 Game Theory II
1 University of Waterloo Faculty of Mathematics Centre for Education in Mathematics and Computing Senior Math Circles February 10, 2010 Game Theory II Take-Away Games Last Wednesday, you looked at take-away
More informationSequential games. We may play the dating game as a sequential game. In this case, one player, say Connie, makes a choice before the other.
Sequential games Sequential games A sequential game is a game where one player chooses his action before the others choose their. We say that a game has perfect information if all players know all moves
More informationNANYANG TECHNOLOGICAL UNIVERSITY SEMESTER II EXAMINATION MH1301 DISCRETE MATHEMATICS. Time Allowed: 2 hours
NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER II EXAMINATION 206-207 DISCRETE MATHEMATICS May 207 Time Allowed: 2 hours INSTRUCTIONS TO CANDIDATES. This examination paper contains FOUR (4) questions and comprises
More informationGrade 7/8 Math Circles November 24/25, Review What have you learned in the past seven weeks?
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles November 24/25, 2015 Review What have you learned in the past seven weeks? First
More informationThe Galaxy. Christopher Gutierrez, Brenda Garcia, Katrina Nieh. August 18, 2012
The Galaxy Christopher Gutierrez, Brenda Garcia, Katrina Nieh August 18, 2012 1 Abstract The game Galaxy has yet to be solved and the optimal strategy is unknown. Solving the game boards would contribute
More informationMore Great Ideas in Theoretical Computer Science. Lecture 1: Sorting Pancakes
15-252 More Great Ideas in Theoretical Computer Science Lecture 1: Sorting Pancakes January 19th, 2018 Question If there are n pancakes in total (all in different sizes), what is the max number of flips
More informationCardinality and Bijections
Countable and Cardinality and Bijections Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 13, 2012 Countable and Countable and Countable and How to count elements in a set? How
More informationSection Summary. Permutations Combinations Combinatorial Proofs
Section 6.3 Section Summary Permutations Combinations Combinatorial Proofs Permutations Definition: A permutation of a set of distinct objects is an ordered arrangement of these objects. An ordered arrangement
More informationComputer Science and Software Engineering University of Wisconsin - Platteville. 4. Game Play. CS 3030 Lecture Notes Yan Shi UW-Platteville
Computer Science and Software Engineering University of Wisconsin - Platteville 4. Game Play CS 3030 Lecture Notes Yan Shi UW-Platteville Read: Textbook Chapter 6 What kind of games? 2-player games Zero-sum
More informationPROBLEMS & INVESTIGATIONS. Introducing Add to 15 & 15-Tac-Toe
Unit One Connecting Mathematical Topics Session 10 PROBLEMS & INVESTIGATIONS Introducing Add to 15 & 15-Tac-Toe Overview To begin, students find many different ways to add combinations of numbers from
More informationVARIATIONS ON NARROW DOTS-AND-BOXES AND DOTS-AND-TRIANGLES
#G2 INTEGERS 17 (2017) VARIATIONS ON NARROW DOTS-AND-BOXES AND DOTS-AND-TRIANGLES Adam Jobson Department of Mathematics, University of Louisville, Louisville, Kentucky asjobs01@louisville.edu Levi Sledd
More informationdepth parallel time width hardware number of gates computational work sequential time Theorem: For all, CRAM AC AC ThC NC L NL sac AC ThC NC sac
CMPSCI 601: Recall: Circuit Complexity Lecture 25 depth parallel time width hardware number of gates computational work sequential time Theorem: For all, CRAM AC AC ThC NC L NL sac AC ThC NC sac NC AC
More informationFormidable Fourteen Puzzle = 6. Boxing Match Example. Part II - Sums of Games. Sums of Games. Example Contd. Mathematical Games II Sums of Games
K. Sutner D. Sleator* Great Theoretical Ideas In Computer Science Mathematical Games II Sums of Games CS 5-25 Spring 24 Lecture February 6, 24 Carnegie Mellon University + 4 2 = 6 Formidable Fourteen Puzzle
More informationCircular Nim Games. S. Heubach 1 M. Dufour 2. May 7, 2010 Math Colloquium, Cal Poly San Luis Obispo
Circular Nim Games S. Heubach 1 M. Dufour 2 1 Dept. of Mathematics, California State University Los Angeles 2 Dept. of Mathematics, University of Quebeq, Montreal May 7, 2010 Math Colloquium, Cal Poly
More informationMathematics Alignment Lesson
Mathematics Alignment Lesson Materials Needed: Blackline Masters for each pair: o Product Game Rules o The Product Game board Blackline Masters for each student: o Product Game Recording Sheet o Playing
More informationLower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
ÂÓÙÖÒÐ Ó ÖÔ ÐÓÖØÑ Ò ÔÔÐØÓÒ ØØÔ»»ÛÛÛº ºÖÓÛÒºÙ»ÔÙÐØÓÒ»» vol.?, no.?, pp. 1 44 (????) Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings David R. Wood School of Computer Science
More informationA Winning Strategy for the Game of Antonim
A Winning Strategy for the Game of Antonim arxiv:1506.01042v1 [math.co] 1 Jun 2015 Zachary Silbernick Robert Campbell June 4, 2015 Abstract The game of Antonim is a variant of the game Nim, with the additional
More informationIMOK Maclaurin Paper 2014
IMOK Maclaurin Paper 2014 1. What is the largest three-digit prime number whose digits, and are different prime numbers? We know that, and must be three of,, and. Let denote the largest of the three digits,
More informationTwo-person symmetric whist
Two-person symmetric whist Johan Wästlund Linköping studies in Mathematics, No. 4, February 21, 2005 Series editor: Bengt Ove Turesson The publishers will keep this document on-line on the Internet (or
More information(b) In the position given in the figure below, find a winning move, if any. (b) In the position given in Figure 4.2, find a winning move, if any.
Math 5750-1: Game Theory Midterm Exam Mar. 6, 2015 You have a choice of any four of the five problems. (If you do all 5, each will count 1/5, meaning there is no advantage.) This is a closed-book exam,
More informationOn Variants of Nim and Chomp
The Minnesota Journal of Undergraduate Mathematics On Variants of Nim and Chomp June Ahn 1, Benjamin Chen 2, Richard Chen 3, Ezra Erives 4, Jeremy Fleming 3, Michael Gerovitch 5, Tejas Gopalakrishna 6,
More informationThe Game of SET R, and its Mathematics.
The Game of SET R, and its Mathematics. Bobby Hanson April 9, 2008 But, as for everything else, so for a mathematical theory beauty can be perceived but not explained. A. Cayley Introduction The game of
More informationRadio Coloring Phenomena and Its Applications
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 3, Issue 4, April 2015, PP 34-38 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Radio Coloring
More informationGrade 6 Math Circles Combinatorial Games - Solutions November 3/4, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles Combinatorial Games - Solutions November 3/4, 2015 Chomp Chomp is a simple 2-player
More informationNew Toads and Frogs Results
Games of No Chance MSRI Publications Volume 9, 1996 New Toads and Frogs Results JEFF ERICKSON Abstract. We present a number of new results for the combinatorial game Toads and Frogs. We begin by presenting
More information18.204: CHIP FIRING GAMES
18.204: CHIP FIRING GAMES ANNE KELLEY Abstract. Chip firing is a one-player game where piles start with an initial number of chips and any pile with at least two chips can send one chip to the piles on
More informationGrade 7/8 Math Circles November 24/25, Review What have you learned in the past seven weeks?
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles November 24/25, 2015 Review What have you learned in the past seven weeks? First
More informationThe first player to construct his or her obelisk is the winner, and if a player has no legal moves, he or she immediately loses the game.
Obelisk 1. Object Obelisk is a two-player strategy board game, and each player controls three stones. The largest base stone is the cornerstone. The smaller rectangular stone is the keystone. The pyramid-shaped
More informationTangent: Boromean Rings. The Beer Can Game. Plan. A Take-Away Game. Mathematical Games I. Introduction to Impartial Combinatorial Games
K. Sutner D. Sleator* Great Theoretical Ideas In Computer Science CS 15-251 Spring 2014 Lecture 110 Feb 4, 2014 Carnegie Mellon University Tangent: Boromean Rings Mathematical Games I Challenge for next
More informationKnots in a Cubic Lattice
Knots in a Cubic Lattice Marta Kobiela August 23, 2002 Abstract In this paper, we discuss the composition of knots on the cubic lattice. One main theorem deals with finding a better upper bound for the
More informationDiscrete Mathematics and Probability Theory Spring 2018 Ayazifar and Rao Midterm 2 Solutions
CS 70 Discrete Mathematics and Probability Theory Spring 2018 Ayazifar and Rao Midterm 2 Solutions PRINT Your Name: Oski Bear SIGN Your Name: OS K I PRINT Your Student ID: CIRCLE your exam room: Pimentel
More information