A Course in Model Theory I:

Size: px
Start display at page:

Download "A Course in Model Theory I:"

Transcription

1 A Course in Model Theory I: Introduction 1 Rami Grossberg DEPARTMENT OFMATHEMATICAL SCIENCES, CARNEGIE MELLON UNI- VERSITY, PITTSBURGH, PA This preliminary draft is dated from August 15, The book will be published by Cambridge University Press. The book is approximately 96.75% complete, I expect that the final version will have about 800 pages, many sections of the current version will be revised and few will be added. I hope to have a stable version of this volume soon. This version is made only for students studying model theory with me and not for distribution outside CMU. If you have a copy not received directly from me, it is an illegal copy and I request that you will not share with others. Exercise #=749 rami c Rami Grossberg

2

3 Contents Preface 7 1. About this book 7 2. A mathematical introduction to the book 15 Course outlines 22 Part 1. Definability 25 Chapter 1. Fundamentals 27 Introduction Structures and languages The basic concepts On existence of models and elementary submodels The Erdős-Rado Theorem Applications of the compactness theorem Joint embedding and the Amalgamation properties in first-order logic Types and the diagram of T Some extensions of first-order logic Countable models and Henkin s omitting types theorem Models of weak set theory Absoluteness Two cardinal theorems, by Vaught, Chang, Keisler and Morley Model complete-theories Skolemization 219 Chapter 2. Abstract Elementary Classes 225 Introduction Abstract Classes Abstract Elementary Classes The major open questions concerning AEC Shelah s presentation Theorem and 2-categories Basic Examples PC-classes and omitting types I(@ 0, K) =I(@ 1, K) =1 =) 6= ; Categoricity 1 for AECs is not absolute Random power set in higher order Ext 1 Z(G, Z) Weak amalgamation Few models imply the amalgamation property 323 Chapter 3. More Fundamentals 329 Introduction The filter of closed unbounded sets Ultraproducts 342 3

4 4 CONTENTS 3. Ehrenfeucht-Fraissé games Two applications to algebra Non-standard analysis* When does a class have a structure theory? Shelah s thesis 365 Part 2. Galois Theory 367 Chapter 4. Complete types and indiscernibles 369 Introduction Saturated models The monster model, homogenous and special models Indiscernibles and Ehrenfeucht-Mostowski models Galois types and monster models in Abstract Elementary Classes 426 Chapter 5. More on Types 443 Introduction Definability and the Lascar group Using models of set theory to establish consistency of a first-order theory Game theoretic characterization of elementary embedding and isomorphism Saturation of ultraproducts Keisler-Shelah s theorem* More on model complete theories* Shelah s Generalization of Eherenfeucht-Mostowski models D(T ) as a topological space* The topology of Lascar s groups More on existence, omitting types, and the completeness theorem The Paris Harrington s theorem* More on two cardinal theorems* Chang s conjecture and Jónsson algebras* 486 Chapter 6. Morley s Theorem 493 Introduction Dimension in model theory A rank function stability Existence of indiscernibles, non-splitting and cohiers Prime, primary and atomic models Every model is saturated Chang s Conjecture is true 0-stable theories Quasi-minimal formulas and an omitting types Theorem Strongly minimal sets and the Baldwin-Lachlan proof Some properties of T + -categorical theories The Baldwin Lachlan proof Keisler s rank-free proof of Morley s theorem Morely s rank and the local rank Some properties 0-stable theories 581 Chapter 7. Basics of Stability 583 Introduction Local Types Infinitely many Rank Functions Characterizations of stability by rank and '-types Definability of types is equivalent to stablity The order dichotomy 613

5 CONTENTS 5 6. Sequences and sets of indiscernibles Towards Los conjecture for uncountable first-order theories The independence and strict-order properties Superstable theories Simple Theories Noetherian topological spaces 649 Chapter 8. Forking calculus 653 Introduction Basics of Forking Stability spectrum theorem Forking in Simple theories is symmetric and transitive Applications of forking Forking is canonical 688 Chapter 9. Applications 689 Introduction Harnik s theorem Uniqueness and characterization of prime models Uniqueness of prime models Stability spectrum 691 Chapter 10. Survey 693 Introduction The main gap (Shelah s great theorem) Classification theory for non-elementary classes Geometric stability (or the fine structure theory) Lang-Mordell Ax and Kochen o-minimal theories Abstract model theory Finite model theory Non standard analysis 697 Chapter 11. A miniguide to the literature 699 Chapter 12. Open Problems 701 Introduction Classification theory for non-elementary classes Shelah s categoricity conjecture Main Gap for uncountable theories Other problems 702 Chapter 13. Historical comments 705 APPENDIX 715 Chapter 14. Some set theory 717 Introduction Sets, functions and relations Cardinal numbers Ordinals Martin s Axiom On weak diamonds The small subsets of + is a normal ideal 737

6 6 CONTENTS 7. Kuratowski s and Hajnal s free subset theorems The building-stones of many models 744 Chapter 15. Combinatorial geometry 747 Introduction Pregeometries (or Matroids) Abstract dependence Projective geometries 756 Chapter 16. Plato: The Allegory of the Cave, from book VII The Republic 757 Bibliography 761 Index 773

A Course in Model Theory

A Course in Model Theory A Course in Model Theory Author address: Rami Grossberg 1 DEPARTMENT OF MATHEMATICAL SCIENCES, CARNEGIE MELLON UNI- VERSITY, PITTSBURGH, PA 15213 E-mail address: rami@cmu.edu 1 This preliminary draft is

More information

A Course in Model Theory

A Course in Model Theory A Course in Model Theory Author address: Rami Grossberg 1 DEPARTMENT OF MATHEMATICAL SCIENCES, CARNEGIE MELLON UNI- VERSITY, PITTSBURGH, PA 15213 E-mail address: rami@cmu.edu 1 This preliminary draft is

More information

Finite homomorphism-homogeneous permutations via edge colourings of chains

Finite homomorphism-homogeneous permutations via edge colourings of chains Finite homomorphism-homogeneous permutations via edge colourings of chains Igor Dolinka dockie@dmi.uns.ac.rs Department of Mathematics and Informatics, University of Novi Sad First of all there is Blue.

More information

Publications of T. Jech

Publications of T. Jech Publications of T. Jech 1. (with B. Balcar), Modeli teorii mnoжestv obrazovannye soverxennym otnoxeniem, (Models of set theory given by perfect relations), Časopis pro pěstování matematiky 90 (1965), 413

More information

Graduate Texts in Mathematics. Editorial Board. F. W. Gehring P. R. Halmos Managing Editor. c. C. Moore

Graduate Texts in Mathematics. Editorial Board. F. W. Gehring P. R. Halmos Managing Editor. c. C. Moore Graduate Texts in Mathematics 49 Editorial Board F. W. Gehring P. R. Halmos Managing Editor c. C. Moore K. W. Gruenberg A.J. Weir Linear Geometry 2nd Edition Springer Science+Business Media, LLC K. W.

More information

Primitive permutation groups with finite stabilizers

Primitive permutation groups with finite stabilizers Primitive permutation groups with finite stabilizers Simon M. Smith City Tech, CUNY and The University of Western Australia Groups St Andrews 2013, St Andrews Primitive permutation groups A transitive

More information

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Fall CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Define and compute the cardinality of a set. Use functions to compare the sizes of sets. Classify sets

More information

Cardinality of Accumulation Points of Infinite Sets

Cardinality of Accumulation Points of Infinite Sets International Mathematical Forum, Vol. 11, 2016, no. 11, 539-546 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2016.6224 Cardinality of Accumulation Points of Infinite Sets A. Kalapodi CTI

More information

Bibliography. S. Gill Williamson

Bibliography. S. Gill Williamson Bibliography S. Gill Williamson 1. S. G. Williamson, A Combinatorial Property of Finite Sequences with Applications to Tensor Algebra, J. Combinatorial Theory, 1 (1966), pp. 401-410. 2. S. G. Williamson,

More information

On the isomorphism problem of Coxeter groups and related topics

On the isomorphism problem of Coxeter groups and related topics On the isomorphism problem of Coxeter groups and related topics Koji Nuida 1 Graduate School of Mathematical Sciences, University of Tokyo E-mail: nuida@ms.u-tokyo.ac.jp At the conference the author gives

More information

THE GAME CREATION OPERATOR

THE GAME CREATION OPERATOR 2/6/17 THE GAME CREATION OPERATOR Joint work with Urban Larsson and Matthieu Dufour Silvia Heubach California State University Los Angeles SoCal-Nevada Fall 2016 Section Meeting October 22, 2016 Much of

More information

LATIN SQUARES. New Developments in the Theory and Applications

LATIN SQUARES. New Developments in the Theory and Applications LATIN SQUARES New Developments in the Theory and Applications J. DENES Industrial and Scientific Consultant Formerly Head of Mathematics Institute for Research and Co-ordination of Computing Techniques

More information

November 20, 2005 PERFECT COMPACTA AND BASIS PROBLEMS IN TOPOLOGY

November 20, 2005 PERFECT COMPACTA AND BASIS PROBLEMS IN TOPOLOGY November 20, 2005 PERFECT COMPACTA AND BASIS PROBLEMS IN TOPOLOGY GARY GRUENHAGE AND JUSTIN TATCH MOORE An interesting example of a compact Hausdorff space that is often presented in beginning courses

More information

TOPOLOGY, 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 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 information

Finite and Infinite Sets

Finite and Infinite Sets Finite and Infinite Sets MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Basic Definitions Definition The empty set has 0 elements. If n N, a set S is said to have

More information

Homogeneous permutations

Homogeneous permutations Homogeneous permutations Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road, London E1 4NS, U.K. p.j.cameron@qmul.ac.uk Submitted: May 10, 2002; Accepted: 18

More information

18 Completeness and Compactness of First-Order Tableaux

18 Completeness and Compactness of First-Order Tableaux CS 486: Applied Logic Lecture 18, March 27, 2003 18 Completeness and Compactness of First-Order Tableaux 18.1 Completeness Proving the completeness of a first-order calculus gives us Gödel s famous completeness

More information

Teacher s Notes. Problem of the Month: Courtney s Collection

Teacher s Notes. Problem of the Month: Courtney s Collection Teacher s Notes Problem of the Month: Courtney s Collection Overview: In the Problem of the Month, Courtney s Collection, students use number theory, number operations, organized lists and counting methods

More information

On the isomorphism problem for Coxeter groups and related topics

On the isomorphism problem for Coxeter groups and related topics On the isomorphism problem for Coxeter groups and related topics Koji Nuida (AIST, Japan) Groups and Geometries @Bangalore, Dec. 18 & 20, 2012 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter

More information

Principle of Inclusion-Exclusion Notes

Principle of Inclusion-Exclusion Notes Principle of Inclusion-Exclusion Notes The Principle of Inclusion-Exclusion (often abbreviated PIE is the following general formula used for finding the cardinality of a union of finite sets. Theorem 0.1.

More information

MATHEMATICS 152, FALL 2004 METHODS OF DISCRETE MATHEMATICS Outline #10 (Sets and Probability)

MATHEMATICS 152, FALL 2004 METHODS OF DISCRETE MATHEMATICS Outline #10 (Sets and Probability) MATHEMATICS 152, FALL 2004 METHODS OF DISCRETE MATHEMATICS Outline #10 (Sets and Probability) Last modified: November 10, 2004 This follows very closely Apostol, Chapter 13, the course pack. Attachments

More information

On uniquely k-determined permutations

On uniquely k-determined permutations On uniquely k-determined permutations Sergey Avgustinovich and Sergey Kitaev 16th March 2007 Abstract Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce

More information

UNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES. with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun

UNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES. with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun UNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES ADELINE PIERROT with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun The aim of this work is to study the asymptotic

More information

Topology and its Applications

Topology and its Applications Topology and its Applications 157 (2010) 1541 1547 Contents lists available at ScienceDirect Topology and its Applications www.elsevier.com/locate/topol On a core concept of Arhangel skiĭ Franklin D. Tall

More information

Goldbach Conjecture (7 th june 1742)

Goldbach Conjecture (7 th june 1742) Goldbach Conjecture (7 th june 1742) We note P the odd prime numbers set. P = {p 1 = 3, p 2 = 5, p 3 = 7, p 4 = 11,...} n 2N\{0, 2, 4}, p P, p n/2, q P, q n/2, n = p + q We call n s Goldbach decomposition

More information

Enumeration of Two Particular Sets of Minimal Permutations

Enumeration of Two Particular Sets of Minimal Permutations 3 47 6 3 Journal of Integer Sequences, Vol. 8 (05), Article 5.0. Enumeration of Two Particular Sets of Minimal Permutations Stefano Bilotta, Elisabetta Grazzini, and Elisa Pergola Dipartimento di Matematica

More information

Analysis on the Properties of a Permutation Group

Analysis on the Properties of a Permutation Group International Journal of Theoretical and Applied Mathematics 2017; 3(1): 19-24 http://www.sciencepublishinggroup.com/j/ijtam doi: 10.11648/j.ijtam.20170301.13 Analysis on the Properties of a Permutation

More information

THREE LECTURES ON SQUARE-TILED SURFACES (PRELIMINARY VERSION) Contents

THREE LECTURES ON SQUARE-TILED SURFACES (PRELIMINARY VERSION) Contents THREE LECTURES ON SQUARE-TILED SURFACES (PRELIMINARY VERSION) CARLOS MATHEUS Abstract. This text corresponds to a minicourse delivered on June 11, 12 & 13, 2018 during the summer school Teichmüller dynamics,

More information

Göttlers Proof of the Collatz Conjecture

Göttlers Proof of the Collatz Conjecture Göttlers Proof of the Collatz Conjecture Henry Göttler, Chantal Göttler, Heinrich Göttler, Thorsten Göttler, Pei-jung Wu goettlercollatzproof@gmail.com March 8, 2018 Abstract Over 80 years ago, the German

More information

Online Computation and Competitive Analysis

Online Computation and Competitive Analysis Online Computation and Competitive Analysis Allan Borodin University of Toronto Ran El-Yaniv Technion - Israel Institute of Technology I CAMBRIDGE UNIVERSITY PRESS Contents Preface page xiii 1 Introduction

More information

1 Algebraic substructures

1 Algebraic substructures Permutation codes Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS UK p.j.cameron@qmul.ac.uk Abstract There are many analogies between subsets

More information

Class 8 - Sets (Lecture Notes)

Class 8 - Sets (Lecture Notes) Class 8 - Sets (Lecture Notes) What is a Set? A set is a well-defined collection of distinct objects. Example: A = {1, 2, 3, 4, 5} What is an element of a Set? The objects in a set are called its elements.

More information

Permutations and codes:

Permutations and codes: Hamming distance Permutations and codes: Polynomials, bases, and covering radius Peter J. Cameron Queen Mary, University of London p.j.cameron@qmw.ac.uk International Conference on Graph Theory Bled, 22

More information

Preface for Instructors and Other Teachers 1 About This Book... xvii

Preface for Instructors and Other Teachers 1 About This Book... xvii Preface for Instructors and Other Teachers xvii 1 About This Book.... xvii 2 How tousethis Book...................... xx 2.1 A Start on Discovery-Based Learning..... xxi 2.2 Details of Conducting Group

More information

Classes of permutations avoiding 231 or 321

Classes of permutations avoiding 231 or 321 Classes of permutations avoiding 231 or 321 Nik Ruškuc nik.ruskuc@st-andrews.ac.uk School of Mathematics and Statistics, University of St Andrews Dresden, 25 November 2015 Aim Introduce the area of pattern

More information

arxiv: v1 [math.co] 16 Aug 2018

arxiv: v1 [math.co] 16 Aug 2018 Two first-order logics of permutations arxiv:1808.05459v1 [math.co] 16 Aug 2018 Michael Albert, Mathilde Bouvel, Valentin Féray August 17, 2018 Abstract We consider two orthogonal points of view on finite

More information

Cardinality. Hebrew alphabet). We write S = ℵ 0 and say that S has cardinality aleph null.

Cardinality. Hebrew alphabet). We write S = ℵ 0 and say that S has cardinality aleph null. Section 2.5 1 Cardinality Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a one-to-one correspondence (i.e., a bijection) from A to

More information

The Strong Finiteness of Double Mersenne Primes and the Infinity of Root Mersenne Primes and Near-square Primes of Mersenne Primes

The Strong Finiteness of Double Mersenne Primes and the Infinity of Root Mersenne Primes and Near-square Primes of Mersenne Primes The Strong Finiteness of Double Mersenne Primes and the Infinity of Root Mersenne Primes and Near-square Primes of Mersenne Primes Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract In this paper

More information

Cardinality and Bijections

Cardinality 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 information

How to Gamble Against All Odds

How to Gamble Against All Odds How to Gamble Against All Odds Gilad Bavly 1 Ron Peretz 2 1 Bar-Ilan University 2 London School of Economics Heidelberg, June 2015 How to Gamble Against All Odds 1 Preface starting with an algorithmic

More information

@CRC Press. Discrete Mathematics. with Ducks. sarah-marie belcastro. let this be your watchword. serious mathematics treated with levity

@CRC Press. Discrete Mathematics. with Ducks. sarah-marie belcastro. let this be your watchword. serious mathematics treated with levity Discrete Mathematics with Ducks sarah-marie belcastro serious mathematics treated with levity let this be your watchword @CRC Press Taylor & Francis Croup Boca Raton London New York CRC Press is an imprint

More information

A CONJECTURE ON UNIT FRACTIONS INVOLVING PRIMES

A CONJECTURE ON UNIT FRACTIONS INVOLVING PRIMES Last update: Nov. 6, 2015. A CONJECTURE ON UNIT FRACTIONS INVOLVING PRIMES Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing 210093, People s Republic of China zwsun@nju.edu.cn http://math.nju.edu.cn/

More information

NON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday

NON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday NON-OVERLAPPING PERMUTATION PATTERNS MIKLÓS BÓNA Abstract. We show a way to compute, to a high level of precision, the probability that a randomly selected permutation of length n is nonoverlapping. As

More information

The Relationship between Permutation Groups and Permutation Polytopes

The Relationship between Permutation Groups and Permutation Polytopes The Relationship between Permutation Groups and Permutation Polytopes Shatha A. Salman University of Technology Applied Sciences department Baghdad-Iraq Batool A. Hameed University of Technology Applied

More information

FUNDAMENTALS OF SIGNALS AND SYSTEMS

FUNDAMENTALS OF SIGNALS AND SYSTEMS FUNDAMENTALS OF SIGNALS AND SYSTEMS LIMITED WARRANTY AND DISCLAIMER OF LIABILITY THE CD-ROM THAT ACCOMPANIES THE BOOK MAY BE USED ON A SINGLE PC ONLY. THE LICENSE DOES NOT PERMIT THE USE ON A NETWORK (OF

More information

1. The empty set is a proper subset of every set. Not true because the empty set is not a proper subset of itself! is the power set of A.

1. The empty set is a proper subset of every set. Not true because the empty set is not a proper subset of itself! is the power set of A. MAT 101 Solutions to Sample Questions for Exam 1 True or False Questions Answers: 1F, 2F, 3F, 4T, 5T, 6T, 7T 1. The empty set is a proper subset of every set. Not true because the empty set is not a proper

More information

Food for Thought. Robert Won

Food for Thought. Robert Won SET R and AG(4, 3) Food for Thought Robert Won (Lafayette REU 2010 - Joint with M. Follett, K. Kalail, E. McMahon, C. Pelland) Partitions of AG(4, 3) into maximal caps, Discrete Mathematics (2014) February

More information

Say My Name. An Objection to Ante Rem Structuralism. Tim Räz. July 29, 2014

Say My Name. An Objection to Ante Rem Structuralism. Tim Räz. July 29, 2014 Say My Name. An Objection to Ante Rem Structuralism Tim Räz July 29, 2014 Abstract In this paper I raise an objection to ante rem structuralism, proposed by Stewart Shapiro: I show that it is in conflict

More information

Non-overlapping permutation patterns

Non-overlapping permutation patterns PU. M. A. Vol. 22 (2011), No.2, pp. 99 105 Non-overlapping permutation patterns Miklós Bóna Department of Mathematics University of Florida 358 Little Hall, PO Box 118105 Gainesville, FL 326118105 (USA)

More information

Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility

Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility theorem (consistent decisions under uncertainty should

More information

1. Functions and set sizes 2. Infinite set sizes. ! Let X,Y be finite sets, f:x!y a function. ! Theorem: If f is injective then X Y.

1. Functions and set sizes 2. Infinite set sizes. ! Let X,Y be finite sets, f:x!y a function. ! Theorem: If f is injective then X Y. 2 Today s Topics: CSE 20: Discrete Mathematics for Computer Science Prof. Miles Jones 1. Functions and set sizes 2. 3 4 1. Functions and set sizes! Theorem: If f is injective then Y.! Try and prove yourself

More information

Peter J. Cameron, London, 1991

Peter J. Cameron, London, 1991 Preface It is common now in academic circles to lament the decline in the teaching of geometry in our schools and universities, and the resulting loss of geometric intuition among our students. On the

More information

Geometry Unit 2 Review Day 1 What to expect on the test:

Geometry Unit 2 Review Day 1 What to expect on the test: Geometry Unit 2 Review Day 1 What to expect on the test: Conditional s Converse Inverse Contrapositive Bi-conditional statements Today we are going to do more work with Algebraic Proofs Counterexamples/Instances

More information

An improvement to the Gilbert-Varshamov bound for permutation codes

An improvement to the Gilbert-Varshamov bound for permutation codes An improvement to the Gilbert-Varshamov bound for permutation codes Yiting Yang Department of Mathematics Tongji University Joint work with Fei Gao and Gennian Ge May 11, 2013 Outline Outline 1 Introduction

More information

Final exam. Question Points Score. Total: 150

Final exam. Question Points Score. Total: 150 MATH 11200/20 Final exam DECEMBER 9, 2016 ALAN CHANG Please present your solutions clearly and in an organized way Answer the questions in the space provided on the question sheets If you run out of room

More information

5 Symmetric and alternating groups

5 Symmetric and alternating groups MTHM024/MTH714U Group Theory Notes 5 Autumn 2011 5 Symmetric and alternating groups In this section we examine the alternating groups A n (which are simple for n 5), prove that A 5 is the unique simple

More information

Section II.9. Orbits, Cycles, and the Alternating Groups

Section II.9. Orbits, Cycles, and the Alternating Groups II.9 Orbits, Cycles, Alternating Groups 1 Section II.9. Orbits, Cycles, and the Alternating Groups Note. In this section, we explore permutations more deeply and introduce an important subgroup of S n.

More information

Tutorial 1. (ii) There are finite many possible positions. (iii) The players take turns to make moves.

Tutorial 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 information

THE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS

THE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS THE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS A Thesis Submitted to the Faculty of Graduate Studies and Research In Partial Fulfillment of the Requirements for the Degree of Master

More information

Examples of highly transitive permutation groups

Examples of highly transitive permutation groups Sonderdrucke aus der Albert-Ludwigs-Universität Freiburg OTTO H. KEGEL Examples of highly transitive permutation groups Originalbeitrag erschienen in: Rendiconti del Seminario Matematico della Università

More information

Finite and Infinite Combinatorics in Sets and Logic

Finite and Infinite Combinatorics in Sets and Logic Finite and Infinite Combinatorics in Sets and Logic NATO ASI Series Advanced Science Institutes Series A Series presenting the results of activities sponsored by the NATO Science Committee, which aims

More information

A Complete Approximation Theory for Weighted Transition Systems

A Complete Approximation Theory for Weighted Transition Systems A Complete Approximation Theory for Weighted Transition Systems December 1, 2015 Peter Christoffersen Mikkel Hansen Mathias R. Pedersen Radu Mardare Kim G. Larsen Department of Computer Science Aalborg

More information

Formal Verification. Lecture 5: Computation Tree Logic (CTL)

Formal Verification. Lecture 5: Computation Tree Logic (CTL) Formal Verification Lecture 5: Computation Tree Logic (CTL) Jacques Fleuriot 1 jdf@inf.ac.uk 1 With thanks to Bob Atkey for some of the diagrams. Recap Previously: Linear-time Temporal Logic This time:

More information

Countability. Jason Filippou UMCP. Jason Filippou UMCP) Countability / 12

Countability. Jason Filippou UMCP. Jason Filippou UMCP) Countability / 12 Countability Jason Filippou CMSC250 @ UMCP 06-23-2016 Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 1 / 12 Outline 1 Infinity 2 Countability of integers and rationals 3 Uncountability of R Jason

More information

DVA325 Formal Languages, Automata and Models of Computation (FABER)

DVA325 Formal Languages, Automata and Models of Computation (FABER) DVA325 Formal Languages, Automata and Models of Computation (FABER) Lecture 1 - Introduction School of Innovation, Design and Engineering Mälardalen University 11 November 2014 Abu Naser Masud FABER November

More information

The Hex game and its mathematical side

The 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 information

Lecture 20 November 13, 2014

Lecture 20 November 13, 2014 6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Prof. Erik Demaine Lecture 20 November 13, 2014 Scribes: Chennah Heroor 1 Overview This lecture completes our lectures on game characterization.

More information

Perfect Difference Families and Related Variable-Weight Optical Orthogonal Codess

Perfect Difference Families and Related Variable-Weight Optical Orthogonal Codess Perfect Difference Families and Related Variable-Weight Optical Orthogonal Codess D. Wu, M. Cheng, Z. Chen Department of Mathematics Guangxi Normal University Guilin 541004, China Abstract Perfect (v,

More information

Objectives: - You are given a circuit with 2-4 resistors and a battery. The circuits are either series or parallel.

Objectives: - You are given a circuit with 2-4 resistors and a battery. The circuits are either series or parallel. I: Solve Simple Circuits with Nontraditional Information Level 5 Prerequisite: Solve Complete Circuits Points To: Solve Circuits with Symbolic Algebra; Solve Combined Circuits One-Step Objectives: - You

More information

1.6 Congruence Modulo m

1.6 Congruence Modulo m 1.6 Congruence Modulo m 47 5. Let a, b 2 N and p be a prime. Prove for all natural numbers n 1, if p n (ab) and p - a, then p n b. 6. In the proof of Theorem 1.5.6 it was stated that if n is a prime number

More information

SYMMETRIES OF FIBONACCI POINTS, MOD m

SYMMETRIES OF FIBONACCI POINTS, MOD m PATRICK FLANAGAN, MARC S. RENAULT, AND JOSH UPDIKE Abstract. Given a modulus m, we examine the set of all points (F i,f i+) Z m where F is the usual Fibonacci sequence. We graph the set in the fundamental

More information

29. Army Housing (a) (b) (c) (d) (e) (f ) Totals Totals (a) (b) (c) (d) (e) (f) Basketball Positions 32. Guard Forward Center

29. Army Housing (a) (b) (c) (d) (e) (f ) Totals Totals (a) (b) (c) (d) (e) (f) Basketball Positions 32. Guard Forward Center Infinite Sets and Their Cardinalities As mentioned at the beginning of this chapter, most of the early work in set theory was done by Georg Cantor He devoted much of his life to a study of the cardinal

More information

On uniquely k-determined permutations

On uniquely k-determined permutations Discrete Mathematics 308 (2008) 1500 1507 www.elsevier.com/locate/disc On uniquely k-determined permutations Sergey Avgustinovich a, Sergey Kitaev b a Sobolev Institute of Mathematics, Acad. Koptyug prospect

More information

On first and second countable spaces and the axiom of choice

On first and second countable spaces and the axiom of choice Topology and its Applications 143 (2004) 93 103 www.elsevier.com/locate/topol On first and second countable spaces and the axiom of choice Gonçalo Gutierres 1 Departamento de Matemática da Universidade

More information

Sets. Definition A set is an unordered collection of objects called elements or members of the set.

Sets. Definition A set is an unordered collection of objects called elements or members of the set. Sets Definition A set is an unordered collection of objects called elements or members of the set. Sets Definition A set is an unordered collection of objects called elements or members of the set. Examples:

More information

Some Fine Combinatorics

Some Fine Combinatorics Some Fine Combinatorics David P. Little Department of Mathematics Penn State University University Park, PA 16802 Email: dlittle@math.psu.edu August 3, 2009 Dedicated to George Andrews on the occasion

More information

Analytic Geometry/ Trigonometry

Analytic Geometry/ Trigonometry Analytic Geometry/ Trigonometry Course Numbers 1206330, 1211300 Lake County School Curriculum Map Released 2010-2011 Page 1 of 33 PREFACE Teams of Lake County teachers created the curriculum maps in order

More information

PRIMES 2017 final paper. NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma

PRIMES 2017 final paper. NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma PRIMES 2017 final paper NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma ABSTRACT. In this paper we study pattern-replacement

More information

Some t-homogeneous sets of permutations

Some t-homogeneous sets of permutations Some t-homogeneous sets of permutations Jürgen Bierbrauer Department of Mathematical Sciences Michigan Technological University Houghton, MI 49931 (USA) Stephen Black IBM Heidelberg (Germany) Yves Edel

More information

Modal logic. Benzmüller/Rojas, 2014 Artificial Intelligence 2

Modal logic. Benzmüller/Rojas, 2014 Artificial Intelligence 2 Modal logic Benzmüller/Rojas, 2014 Artificial Intelligence 2 What is Modal Logic? Narrowly, traditionally: modal logic studies reasoning that involves the use of the expressions necessarily and possibly.

More information

ECS 20 (Spring 2013) Phillip Rogaway Lecture 1

ECS 20 (Spring 2013) Phillip Rogaway Lecture 1 ECS 20 (Spring 2013) Phillip Rogaway Lecture 1 Today: Introductory comments Some example problems Announcements course information sheet online (from my personal homepage: Rogaway ) first HW due Wednesday

More information

PD-SETS FOR CODES RELATED TO FLAG-TRANSITIVE SYMMETRIC DESIGNS. Communicated by Behruz Tayfeh Rezaie. 1. Introduction

PD-SETS FOR CODES RELATED TO FLAG-TRANSITIVE SYMMETRIC DESIGNS. Communicated by Behruz Tayfeh Rezaie. 1. Introduction Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 7 No. 1 (2018), pp. 37-50. c 2018 University of Isfahan www.combinatorics.ir www.ui.ac.ir PD-SETS FOR CODES RELATED

More information

Equivalence classes of length-changing replacements of size-3 patterns

Equivalence classes of length-changing replacements of size-3 patterns Equivalence classes of length-changing replacements of size-3 patterns Vahid Fazel-Rezai Mentor: Tanya Khovanova 2013 MIT-PRIMES Conference May 18, 2013 Vahid Fazel-Rezai Length-Changing Pattern Replacements

More information

The tenure game. The tenure game. Winning strategies for the tenure game. Winning condition for the tenure game

The 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 information

CONTENTS PREFACE. Part One THE DESIGN PROCESS: PROPERTIES, PARADIGMS AND THE EVOLUTIONARY STRUCTURE

CONTENTS PREFACE. Part One THE DESIGN PROCESS: PROPERTIES, PARADIGMS AND THE EVOLUTIONARY STRUCTURE Copyrighted Material Dan Braha and Oded Maimon, A Mathematical Theory of Design: Foundations, Algorithms, and Applications, Springer, 1998, 708 p., Hardcover, ISBN: 0-7923-5079-0. PREFACE Part One THE

More information

Chapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations

Chapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations Chapter 1 The alternating groups 1.1 Introduction The most familiar of the finite (non-abelian) simple groups are the alternating groups A n, which are subgroups of index 2 in the symmetric groups S n.

More information

Research Article The Structure of Reduced Sudoku Grids and the Sudoku Symmetry Group

Research Article The Structure of Reduced Sudoku Grids and the Sudoku Symmetry Group International Combinatorics Volume 2012, Article ID 760310, 6 pages doi:10.1155/2012/760310 Research Article The Structure of Reduced Sudoku Grids and the Sudoku Symmetry Group Siân K. Jones, Stephanie

More information

by Michael Filaseta University of South Carolina

by Michael Filaseta University of South Carolina by Michael Filaseta University of South Carolina Background: A covering of the integers is a system of congruences x a j (mod m j, j =, 2,..., r, with a j and m j integral and with m j, such that every

More information

Tangent: Boromean Rings. The Beer Can Game. Plan. A Take-Away Game. Mathematical Games I. Introduction to Impartial Combinatorial Games

Tangent: 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 information

Peeking at partizan misère quotients

Peeking at partizan misère quotients Games of No Chance 4 MSRI Publications Volume 63, 2015 Peeking at partizan misère quotients MEGHAN R. ALLEN 1. Introduction In two-player combinatorial games, the last player to move either wins (normal

More information

PROTECTION of electricity distribution networks

PROTECTION of electricity distribution networks PROTECTION of electricity distribution networks Juan M. Gers and Edward J. Holmes The Institution of Electrical Engineers Contents Preface and acknowledgments x 1 Introduction 1 1.1 Basic principles of

More information

ALGEBRA: Chapter I: QUESTION BANK

ALGEBRA: Chapter I: QUESTION BANK 1 ALGEBRA: Chapter I: QUESTION BANK Elements of Number Theory Congruence One mark questions: 1 Define divisibility 2 If a b then prove that a kb k Z 3 If a b b c then PT a/c 4 If a b are two non zero integers

More information

QUOTIENT AND PSEUDO-OPEN IMAGES OF SEPARABLE METRIC SPACES

QUOTIENT AND PSEUDO-OPEN IMAGES OF SEPARABLE METRIC SPACES proceedings of the american mathematical society Volume 33, Number 2, June 1972 QUOTIENT AND PSEUDO-OPEN IMAGES OF SEPARABLE METRIC SPACES PAUL L. STRONG Abstract. Ernest A. Michael has given a characterization

More information

In this paper, we discuss strings of 3 s and 7 s, hereby dubbed dreibens. As a first step

In this paper, we discuss strings of 3 s and 7 s, hereby dubbed dreibens. As a first step Dreibens modulo A New Formula for Primality Testing Arthur Diep-Nguyen In this paper, we discuss strings of s and s, hereby dubbed dreibens. As a first step towards determining whether the set of prime

More information

Topological Symmetries: Quasiperiodicity and its Application to Filtering and Classification Problems. Michael Robinson

Topological Symmetries: Quasiperiodicity and its Application to Filtering and Classification Problems. Michael Robinson Topological Symmetries: Quasiperiodicity and its Application to Filtering and Classification Problems Acknowledgements Collaborators: Jason Summers, Charlie Gaumond (ARiA, LLC) Students: Brian DiZio Jen

More information

An elementary study of Goldbach Conjecture

An elementary study of Goldbach Conjecture An elementary study of Goldbach Conjecture Denise Chemla 26/5/2012 Goldbach Conjecture (7 th, june 1742) states that every even natural integer greater than 4 is the sum of two odd prime numbers. If we

More information

A Group-theoretic Approach to Human Solving Strategies in Sudoku

A Group-theoretic Approach to Human Solving Strategies in Sudoku Colonial Academic Alliance Undergraduate Research Journal Volume 3 Article 3 11-5-2012 A Group-theoretic Approach to Human Solving Strategies in Sudoku Harrison Chapman University of Georgia, hchaps@gmail.com

More information

Continuity of the Norm of a Composition Operator

Continuity of the Norm of a Composition Operator Integr. equ. oper. theory 45 (003) 35 358 0378-60X/03035-8 $.50+0.0/0 c 003 Birkhäuser Verlag Basel/Switzerl Integral Equations Operator Theory Continuity of the Norm of a Composition Operator David B.

More information

MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES

MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES Thursday, 4/17/14 The Addition Principle The Inclusion-Exclusion Principle The Pigeonhole Principle Reading: [J] 6.1, 6.8 [H] 3.5, 12.3 Exercises:

More information

ON SPLITTING UP PILES OF STONES

ON 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 information