Switch-Setting Games Torsten Muetze. Content Introduction General theory Case study.

Slides:



Advertisements
Similar presentations
Applied Informatics Štefan BEREŽNÝ
Advertisements

Introduction to Graph “theory”
13 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
1D MODELS Logan; chapter 2.
Linear Equations in Linear Algebra
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
4.I. Definition 4.II. Geometry of Determinants 4.III. Other Formulas Topics: Cramer’s Rule Speed of Calculating Determinants Projective Geometry Chapter.
Matrices and Systems of Equations
Lights-Out on Graphs Nadav Azaria. What is “ Lights-Out ” ? “ Lights-Out ” is a hand- held electronic game by Tiger electronics. It is played on a 5 ‰
Linear Equations in Linear Algebra
10.1 Gaussian Elimination Method
Mathematics1 Mathematics 1 Applied Informatics Štefan BEREŽNÝ.
資訊科學數學11 : Linear Equation and Matrices
Graphs, relations and matrices
Applied Discrete Mathematics Week 10: Equivalence Relations
Thinking Mathematically Algebra: Graphs, Functions and Linear Systems 7.3 Systems of Linear Equations In Two Variables.
C&O 355 Mathematical Programming Fall 2010 Lecture 17 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A.
BMI II SS06 – Class 3 “Linear Algebra” Slide 1 Biomedical Imaging II Class 3 – Mathematical Preliminaries: Elementary Linear Algebra 2/13/06.
Gaussian Elimination, Rank and Cramer
Dr. Mubashir Alam King Saud University. Outline Systems of Linear Equations (6.1) Matrix Arithmetic (6.2) Arithmetic Operations (6.2.1) Elementary Row.
Combinatorial Algorithms Unate Covering Binate Covering Graph Coloring Maximum Clique.
1 1.4 Linear Equations in Linear Algebra THE MATRIX EQUATION © 2016 Pearson Education, Inc.
Radu Grosu SUNY at Stony Brook Finite Automata as Linear Systems Observability, Reachability and More.
A matrix equation has the same solution set as the vector equation which has the same solution set as the linear system whose augmented matrix is Therefore:
Chapter 9. Chapter Summary Relations and Their Properties Representing Relations Equivalence Relations Partial Orderings.
Chapter 3 Vector Spaces. The operations of addition and scalar multiplication are used in many contexts in mathematics. Regardless of the context, however,
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Matrices CHAPTER 8.1 ~ 8.8. Ch _2 Contents  8.1 Matrix Algebra 8.1 Matrix Algebra  8.2 Systems of Linear Algebra Equations 8.2 Systems of Linear.
Week 14 - Wednesday.  What did we talk about last time?  Regular expressions  Introduction to finite state automata.
TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A A A A A A A Image:
1 Closures of Relations: Transitive Closure and Partitions Sections 8.4 and 8.5.
4.6: Rank. Definition: Let A be an mxn matrix. Then each row of A has n entries and can therefore be associated with a vector in The set of all linear.
1/24 Introduction to Graphs. 2/24 Graph Definition Graph : consists of vertices and edges. Each edge must start and end at a vertex. Graph G = (V, E)
CSCI 171 Presentation 9 Matrix Theory. Matrix – Rectangular array –i th row, j th column, i,j element –Square matrix, diagonal –Diagonal matrix –Equality.
CSP: Algorithms and Dichotomy Conjecture Andrei A. Bulatov Simon Fraser University.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
1 Beginning & Intermediate Algebra – Math 103 Math, Statistics & Physics.
Lesson Menu Five-Minute Check (over Lesson 3–6) CCSS Then/Now New Vocabulary Key Concept: Second-Order Determinant Example 1: Second-Order Determinant.
Arab Open University Faculty of Computer Studies M132: Linear Algebra
CHARACTERIZATIONS OF INVERTIBLE MATRICES
C&O 355 Lecture 19 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A A A.
Introduction to NP Instructor: Neelima Gupta 1.
Section 2.4. Section Summary  Sequences. o Examples: Geometric Progression, Arithmetic Progression  Recurrence Relations o Example: Fibonacci Sequence.
1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.
A very brief introduction to Matrix (Section 2.7) Definitions Some properties Basic matrix operations Zero-One (Boolean) matrices.
MATRICES A rectangular arrangement of elements is called matrix. Types of matrices: Null matrix: A matrix whose all elements are zero is called a null.
2.1 Matrix Operations 2. Matrix Algebra. j -th column i -th row Diagonal entries Diagonal matrix : a square matrix whose nondiagonal entries are zero.
CHAPTER 7 Determinant s. Outline - Permutation - Definition of the Determinant - Properties of Determinants - Evaluation of Determinants by Elementary.
An Introduction to Matrix Algebra Math 2240 Appalachian State University Dr. Ginn.
REVIEW Linear Combinations Given vectors and given scalars
1.4 The Matrix Equation Ax = b
Mathematics-I J.Baskar Babujee Department of Mathematics
Linear Equations in Linear Algebra
Relations Chapter 9.
Combinatorial Spectral Theory of Nonnegative Matrices
Linear Algebra Lecture 17.
Splash Screen.
MLR5 MLR3* MLR4’ MLR3 + Q is finite MLR5 MLR{2 4’} MLR2 MLR3 MLR4 MLR6
Linear Equations in Linear Algebra
Linear Equations in Linear Algebra
Relations (sections 7.1 – 7.5)
Objective: Today we will investigate the ‘magic’ in magic squares.
4.6: Rank.
Closures of Relations: Transitive Closure and Partitions
Spin Models and Distance-Regular Graphs
Linear Algebra Lecture 6.
3.IV. Change of Basis 3.IV.1. Changing Representations of Vectors
Linear Algebra Lecture 28.
Inverse Matrices From: D.A. Harville, Matrix Algebra from a Statistician’s Perspective, Springer. Chapter 8.
Presentation transcript:

Switch-Setting Games Torsten Muetze

Content Introduction General theory Case study

Switch-Setting Games Is an initial light pattern solvable? Is there more than one solution? Which solution needs a minimal number of switching operations? Introduction

Mathematical Model D: The 4-tuple (G,S,L,z 0 ) is a switch-setting problem if G is a symmetric, bipartite graph with an induced partition of its vertices into the sets S and L and z 0 : L  {0,1}. S L G z0z0 General theory

Solution Behavior s1s1 s2s2 s3s3 A L,S s1s1 s2s2 s3s3 l1l1 111 l2l2 110 l3l3 101 l4l4 011 A = A S,L A L,S 0 0 z0z z 0 + A L,S  s 2 z0z l3l3 110l4l4 011l2l2 111l1l1 s3s3 s2s2 s1s1 A L,S A L,S T = A S,L sequence of switches s‘ 0,s‘ 1,...,s‘ k  S z 0 + A L,S  s‘ 0 + A L,S  s‘ A L,S  s‘ k = 0 (mod 2) z 0 + A L,S (  s‘ 0 +  s‘  s‘ k ) = 0 (mod 2) =: x  {0,1} S A L,S x = z 0 (mod 2) 5 5 l1l1 l2l2 l3l3 l4l4 solvability: ker(A L,S T ) (A L,S T = A S,L ) all solutions: ker(A L,S ) General theory

Parity Domination T: X4S is an even L-dominating set 5 x  ker(A L,S ). A S,L z = 0 (mod 2) Z4L is an even S-dominating set 5 z  ker(A S,L ). D: Even L-dominating set X4S : 5 X  N(l) has even cardinality for all l  L. X S L A L,S x = 0 (mod 2) Even S-dominating set Z 4 L : 5 Z  N(s) has even cardinality for all s  S. Z S L General theory

Z1Z1 S L Z2Z2 S LL Z1+Z2Z1+Z2 S Main Theorem T: Let P=(G,S,L,z 0 ) be a switch-setting problem and A the adjacency matrix of G. The following statements are equivalent: (i) P has a solution. (ii) A L,S x = z 0 (mod 2) has a solution. (iii) For all z  ker(A S,L ) the relation z T z 0 = 0 (mod 2) holds. (iv) For all z from a basis of ker(A S,L ) the relation z T z 0 = 0 (mod 2) holds. (v) The number of lit lamps on every even S-dominating set is even. (vi) The number of lit lamps on every even S-dominating set from a basis of the set of all even S-dominating sets is even. General theory

Rules Case study Switching operation: toggle all lamps on either a row, a column a diagonal or an antidiagonal m n Formal definition of the underlying graph G m,n = (V,E) |S| = 3(m+n)-2 |L| = mn G 2,2 X={s *2, s *1, s *1 } 4 S Z={l 1,1, l 2,1 } 4 L

Even S-dominating sets of G m,n Case study D: A circle C i,j is a subset of L, defined for all i  {1,2,...,m-3} and j  {1,2,...,n-3} by C i,j := {l i,j+1, l i,j+2, l i+1,j, l i+1,j+3, l i+2,j, l i+2,j+3, l i+3,j+1,l i+3,j+2 }. C 3,2 C 1,3 T: The set of circles is a basis for the set of even S-dominating sets. C 2,2 + C 3,3 C 2,2 + C 2,3 + C 2,4 + C 4,1 + C 4,2 + C 4,4 Conclusion: a light pattern is solvable, iff the number of lit lamps on every circle is even. not solvable solvable

Case study A basis for the even L-dominating sets of G 4,4 A basis for the even L-dominating sets of G m,n (min(m,n)  4) Problem X X1‘X1‘X2‘X2‘ Possible Solutions 14 X + X1‘X + X1‘X + X2‘X + X2‘ 11 Minimal solution? For min(m,n)R4 there are always 2 7 =128 even L-dominating sets Even L-dominating sets of G m,n

Summary General theory for the mathematical treatment of switch-setting games Interesting and fruitful relations between concepts from graph theory and linear algebra Graphically aesthetic interpretations

References [1] K. Sutner. Linear cellular automata and the garden-of-eden. Math. Intelligencer, 11:49-53, [2] J. Goldwasser, W. Klostermeyer, and H. Ware. Fibonacci polynomials and parity domination in grid graphs. Graphs Combin., 18: , [3] D. Pelletier. Merlin‘s Magic Square. Amer. Math. Monthly, 94: , [4] M. Anderson and T. Feil. Turning lights out with linear algebra. Math. Magazine, 71: , [5] T. Muetze. Generalized switch-setting problems. Preprint.