Symmetry Breaking in Graphs
|
|
- Sherilyn Chandler
- 7 years ago
- Views:
Transcription
1 Symmetry Breaking in Graphs Motion Conjectures Wilfried Imrich Montanuniversität Leoben, Austria Joint Mathematics Meetings, Baltimore, Maryland My Favorite Graph Theory Conjectures, III January 17, 2014
2 ΠΑΝΤΑ ΡΕΙ Everything Flows Maybe the First Recorded Motion Conjecture Attributed to Heraklit 1
3 Conjectures about Motion and Symmetry Breaking The conjectures concern Symmetries of Countable or Uncountable Infinite Graphs and Groups and how automorphisms or endomorphisms are broken by deterministic or random colorings. 2
4 An Example for Symmetry Breaking in a Finite Graph Consider the given 3-coloring of the vertices of the 3-cube Q 3 : Only the identity automorphism of Q 3 preserves the colors. We say Q 3 is 3-distinguishable. 3
5 Definition Let A be a group acting on a set X. Then - a coloring C of the elements of X is distinguishing if A C = 1. - If C uses d colors, then C is d-distinguishing. - The smallest such d is the distinguishing number D(A, X) of (A, X). (Albertson and Collins, 1996) - The distinguishing number D(G) of a graph G is D(Aut(G), V (G)). D(K n ) = n. The distinguishing number of asymmetric graphs is 1. Conjecture Almost all graphs with non-trivial automorphism group are 2-distinguishable. 4
6 More Examples and Motion C 6 and P ℵ0 are 2-distinguishable, their motion is 4, resp. ℵ 0. 5
7 D(G) and the Motion of a Graph The motion m(α) of α A, where A acts on a set X, is the number of elements it moves. The motion of a graph G is m(g) = min α Aut(G)\{id} m(α). m(k n ) = 2, m(c 6 ) = 4, m(p ℵ0 ) = ℵ 0. Russell and Sundaram 1998: Lemma (Motion Lemma) If d m(g) 2 Aut(G), then the graph G is d-distinguishable. 6
8 1. The Infinite Motion Conjecture (Tucker 2011) Let G be an infinite, locally finite, connected graph with infinite motion. Then D(G) = 2. The conjecture holds, for example, for graphs with countable automorphism group and infinite homogeneous trees; the proofs are easy. The strongest result is: Theorem of growth (Lehner) The Infinite Motion Conjecture is true for graphs O ( 2 (1 ϵ) n 2 ) The proof extends methods of Cuno, Imrich and Lehner. It partitions automorphisms into classes with different motion. Johannes Cuno and Florian Lehner are PhD students at the Doctoral Program Discrete Mathematics at the TU & KFU Graz and MU Leoben. 7
9 2. The Probabilistic Infinite Motion Conjecture (Lehner) Let G be an infinite, locally finite, connected graph with infinite motion. Then a random coloring of G is almost surely distinguishing. It holds in all those cases, where the IMC has been shown to hold. Notice that random colorings of D(T ℵ0 ) are almost surely not distinguishing, but D(T ℵ0 ) = 2. Lehner and Moeller have examples of connected, infinite graphs of countable degree and infinite motion with infinite distinguishing number. 8
10 The Permutation Topology Every permutation group A acting on a countable set X carries a natural topology, the permutation topology. It is defined by choosing as open sets the cosets of the pointwise stabilizers of the finite subsets of X. Notice that Aut(G) is closed in Sym(V (G)) if G is a connected, locally finite infinite graph. Also, the orbits of every stabilizer Aut(G) v, where v V (G), are finite. Such groups are called subdegree finite. A permutation group A on a set is closed if and only if A is the full automorphism group of some structure on that set, say a graph. 9
11 3. The Infinite Motion Conjecture for Permutation Groups (Imrich, Smith, Tucker, Watkins) If A is a closed, subdegree-finite permutation group with infinite motion on a countably infinite set X, then D(A, X) = 2. For countable A one needs neither closure nor subdegree-finiteness. Notice that topological methods are essential for the proof that the Probabilistic IMC holds for graphs of intermediate growth. Lehner begins his proof by showing that every subdegree-finite, closed permutation group A on a set X is totally disconnected, locally compact, and Polish. homeomorphic to a complete metric space with a countable dense subset. 10
12 Theorem The distinguishing number of the homogeneous tree T d of degree d > 2 is 2. Proof for d = 4: The result D(T 3 ) = 2 is already due to Babai Essentially the same proof also holds for d = ℵ 0. 11
13 Recall, to prove the conjectures we have to show that D(A, X) = 2. This is equivalent to showing that a 2-coloring C with A c = id. Theorem (Tucker) Let A Sym(X), where X is countable. If m(a) = ℵ 0, then A has a dense 2-distinguishable subgroup B. Hence a 2-coloring C such that A C is completely disconnected. Theorem (Lehner) Let G be a locally finite infinite graph with infinite motion and let C be a random coloring of G. Then (Aut G) C is almost surely a nowhere dense, closed subgroup with Haar measure 0. Theorem (Lehner) Let G be a locally finite infinite graph with infinite motion. Then there exists a coloring C of G such that (Aut G) C has measure 0 in Aut G and is nowhere dense and compact. 12
14 4. The Motion Conjecture for Uncountable Graphs (Cuno, Imrich, Lehner) Let G be a connected graph of uncountable cardinality with infinite motion m(g) and suppose that 2 m(g) Aut(G). Then D(G) = 2. It is an immediate generalization of the Motion Lemma: 2 m(g)/2 Aut(G) implies D(G) = 2. Theorem Let G be a connected graph with uncountable motion. Then Aut(G) m(g) implies D(G) = 2. Corollary Let G be a connected graph with uncountable motion. If the general continuum hypothesis holds, and if Aut(G) < 2 m(g), then D(G) = 2. 13
15 The Motion Conjecture for Uncountable Graphs holds in the following cases D(Q n ) = 2, where Q n is the hypercube of dimension n. induction. Transfinite D(K n K n ) = 2. Transfinite induction. It does not hold for connected countable graphs that are not locally finite. For such graphs we have: D(R) = 2, where R is the countable random graph. Tricky proof. D(K ℵ0 K ℵ0 ) = 2, where denotes the Cartesian product. Easy. D(T ℵ0 ) = 2, we already discussed this case. 14
16 The following result are outside the scope of the Motion Conjecture for Uncountable Graphs D(K n K 2 n) = 2. Transfinite induction. This graph has motion n and Aut(K n K 2 n) = 2 2n > 2 n. This result is not implied by the Motion Conjecture for Uncountable Graphs. D(K n K m ) > n if m > 2 n. Here too m(k n K m ) = n, but Aut(K n K m ) = 2 m > 2 n. This result is in accordance with the Motion Conjecture for Uncountable Graphs. 15
17 Endomorphisms Definition Let G be a graph. A coloring C of V (G) with d colors is endomorphism d-distinguishing, if End(G) c = 1. D e (Q 3 ) = 3 Clearly D(G) D e (G). If End(G) = Aut(G), then D e (G) = D(G). Imrich, Kalinowski, Lehner and Pilsniak, Endomorphism Breaking in Graphs, E-JC, accepted for publication. 16
18 Notice that D e (G) can be equal to D(G) even when Aut(G) End(G). For example, D e (C 2k ) = 2 for k 3. v 5 v 2k 1 v 4 v 2k v 3 v 1 v 2 If Aut(G) is trivial, but 2 End(G), then D(G) < D e (G). Examples are asymmetric, nontrivial finite trees T. The endomorphism distinguishing number of finite paths is two. 17
19 The endomorphism motion of a graph G is m e (G) = min m(ϕ) ϕ End(G)\{id} For example, m e (C 4 ) = 1, m e (C 5 ) = 4, m e (C 100 ) = 49, m e (K 100 ) = 2. Lemma (Endomorphism Motion Lemma) If d m e(g) 2 End(G), then G is endomorphism d-distinguishable. 18
20 5. The Infinite Endomorphism Motion Conjecture Let G be a connected, locally finite infinite graph with infinite endomorphism motion. Then D e (G) = 2. A tree has infinite endomorphism motion if and only if it has no pendant vertices. Theorem The endomorphism distinguishing number of countable trees T without pendant vertices is 2. This includes rays (one-sided infinite paths) and two-sided infinite paths. Notice that these graphs have uncountable endomorphism monoids. 19
21 Theorem Let G be a graph with infinite m e (G) and countable End(G). Then D e (G) = 2. It is not hard to see that finitely generated groups have countable endomorphisms monoids and infinite endomorphism motion. Theorem If Γ is a finitely generated group. Then there is a twocoloring of Γ, such that the identity endomorphism of Γ is the only endomorphism that preserves this coloring. In other words, D e (Γ) = D e (End(Γ), Γ) = 2. This generalizes a result of Tucker for automorphisms of finitely generated groups. 20
22 6. The Endomorphism Motion Conjecture for Uncountable Graphs Let G be a connected, infinite graph with endomorphism motion m e (G). If 2 m e(g) End(G), then D e (G) = 2. Theorem Let G be a connected graph with uncountable endomorphism motion. Then Aut(G) m e (G) implies D e (G) = 2. Corollary Let G be a connected graph with uncountable endomorphism motion. If the general continuum hypothesis holds, and if End(G) < 2 me(g), then D e (G) = 2. 21
23 Thanks Special thanks to Sandi Klavžar, who introduced me to the subject, and to Thomas Tucker, who urged me to have a look at his Infinite Motion Conjecture. I am grateful to Johannes Cuno and Florian Lehner for their enthusiasm and mathematical contributions, to Simon Mark Smith, Tom Tucker and Mark Watkins for the interaction across the Atlantic, to Vladimir Trofimov for joint work on infinite graphs, and to Rafa l Kalinowski and Monika Pilsniak for cooperation on the endomorphim distinguishing number. 22
Logic, Combinatorics and Topological Dynamics, II
Logic, Combinatorics and Topological Dynamics, II Alexander S. Kechris January 9, 2009 Part II. Generic symmetries Generic properties Let X be a topological space and P X a subset of X viewed as a property
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationTuring Degrees and Definability of the Jump. Theodore A. Slaman. University of California, Berkeley. CJuly, 2005
Turing Degrees and Definability of the Jump Theodore A. Slaman University of California, Berkeley CJuly, 2005 Outline Lecture 1 Forcing in arithmetic Coding and decoding theorems Automorphisms of countable
More informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
More informationA REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries
Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationSET-THEORETIC CONSTRUCTIONS OF TWO-POINT SETS
SET-THEORETIC CONSTRUCTIONS OF TWO-POINT SETS BEN CHAD AND ROBIN KNIGHT AND ROLF SUABEDISSEN Abstract. A two-point set is a subset of the plane which meets every line in exactly two points. By working
More informationTree sums and maximal connected I-spaces
Tree sums and maximal connected I-spaces Adam Bartoš drekin@gmail.com Faculty of Mathematics and Physics Charles University in Prague Twelfth Symposium on General Topology Prague, July 2016 Maximal and
More informationCOMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationCOFINAL MAXIMAL CHAINS IN THE TURING DEGREES
COFINA MAXIMA CHAINS IN THE TURING DEGREES WEI WANG, IUZHEN WU, AND IANG YU Abstract. Assuming ZF C, we prove that CH holds if and only if there exists a cofinal maximal chain of order type ω 1 in the
More information6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
More informationSMALL SKEW FIELDS CÉDRIC MILLIET
SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite
More informationINTRODUCTION TO DESCRIPTIVE SET THEORY
INTRODUCTION TO DESCRIPTIVE SET THEORY ANUSH TSERUNYAN Mathematicians in the early 20 th century discovered that the Axiom of Choice implied the existence of pathological subsets of the real line lacking
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationF. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
More informationCHAPTER 1 BASIC TOPOLOGY
CHAPTER 1 BASIC TOPOLOGY Topology, sometimes referred to as the mathematics of continuity, or rubber sheet geometry, or the theory of abstract topological spaces, is all of these, but, above all, it is
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationGroup Theory. Contents
Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation
More informationThis chapter is all about cardinality of sets. At first this looks like a
CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },
More informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationThe Independence Number in Graphs of Maximum Degree Three
The Independence Number in Graphs of Maximum Degree Three Jochen Harant 1 Michael A. Henning 2 Dieter Rautenbach 1 and Ingo Schiermeyer 3 1 Institut für Mathematik, TU Ilmenau, Postfach 100565, D-98684
More informationKevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm
MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following
More informationOn Integer Additive Set-Indexers of Graphs
On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that
More informationTechniques algébriques en calcul quantique
Techniques algébriques en calcul quantique E. Jeandel Laboratoire de l Informatique du Parallélisme LIP, ENS Lyon, CNRS, INRIA, UCB Lyon 8 Avril 25 E. Jeandel, LIP, ENS Lyon Techniques algébriques en calcul
More information136 CHAPTER 4. INDUCTION, GRAPHS AND TREES
136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationConnectivity and cuts
Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every
More informationThe Markov-Zariski topology of an infinite group
Mimar Sinan Güzel Sanatlar Üniversitesi Istanbul January 23, 2014 joint work with Daniele Toller and Dmitri Shakhmatov 1. Markov s problem 1 and 2 2. The three topologies on an infinite group 3. Problem
More informationCS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010
CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected
More informationClassification of Cartan matrices
Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms
More informationCycles in a Graph Whose Lengths Differ by One or Two
Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS
More informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More informationHandout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs
MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set
More informationGENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
More informationGlobal Properties of the Turing Degrees and the Turing Jump
Global Properties of the Turing Degrees and the Turing Jump Theodore A. Slaman Department of Mathematics University of California, Berkeley Berkeley, CA 94720-3840, USA slaman@math.berkeley.edu Abstract
More informationA 2-factor in which each cycle has long length in claw-free graphs
A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science
More informationDetermination of the normalization level of database schemas through equivalence classes of attributes
Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,
More informationLecture 22: November 10
CS271 Randomness & Computation Fall 2011 Lecture 22: November 10 Lecturer: Alistair Sinclair Based on scribe notes by Rafael Frongillo Disclaimer: These notes have not been subjected to the usual scrutiny
More informations-convexity, model sets and their relation
s-convexity, model sets and their relation Zuzana Masáková Jiří Patera Edita Pelantová CRM-2639 November 1999 Department of Mathematics, Faculty of Nuclear Science and Physical Engineering, Czech Technical
More informationSCORE SETS IN ORIENTED GRAPHS
Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in
More informationMean Ramsey-Turán numbers
Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average
More informationON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
More informationTopological properties of Rauzy fractals
Topological properties of Rauzy fractals Anne Siegel (IRISA-CNRS, Rennes) Joerg Thuswaldner (Univ. Leoben, Autriche) Kanazawa April 2008 Many shapes for Rauzy fractals... Several properties on examples
More information1 Local Brouwer degree
1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.
More informationNIELSEN METHODS AND GROUPS ACTING ON HYPERBOLIC SPACES
NIELSEN METHODS AND GROUPS ACTING ON HYPERBOLIC SPACES ILYA KAPOVICH AND RICHARD WEIDMANN Abstract. We show that for any n N there eists a constant C(n) such that any n-generated group G which acts by
More informationInvariant random subgroups and applications
Department of Mathematics Ben-Gurion university of the Negev. Spa, April 2013. Plan 1 Plan 2 IRS Definitions, Examples, Theorems 3 Essential subgroups 4 Proof of the main theorem IRS Definition Γ a l.c
More informationIntroduction to Topology
Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................
More informationThe Banach-Tarski Paradox
University of Oslo MAT2 Project The Banach-Tarski Paradox Author: Fredrik Meyer Supervisor: Nadia S. Larsen Abstract In its weak form, the Banach-Tarski paradox states that for any ball in R, it is possible
More informationSOLUTIONS TO ASSIGNMENT 1 MATH 576
SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationPoint Set Topology. A. Topological Spaces and Continuous Maps
Point Set Topology A. Topological Spaces and Continuous Maps Definition 1.1 A topology on a set X is a collection T of subsets of X satisfying the following axioms: T 1.,X T. T2. {O α α I} T = α IO α T.
More informationDEFINABLE TYPES IN PRESBURGER ARITHMETIC
DEFINABLE TYPES IN PRESBURGER ARITHMETIC GABRIEL CONANT Abstract. We consider the first order theory of (Z, +,
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationMinimal R 1, minimal regular and minimal presober topologies
Revista Notas de Matemática Vol.5(1), No. 275, 2009, pp.73-84 http://www.saber.ula.ve/notasdematematica/ Comisión de Publicaciones Departamento de Matemáticas Facultad de Ciencias Universidad de Los Andes
More informationA Short Proof that Compact 2-Manifolds Can Be Triangulated
Inventiones math. 5, 160--162 (1968) A Short Proof that Compact 2-Manifolds Can Be Triangulated P. H. DOYLE and D. A. MORAN* (East Lansing, Michigan) The result mentioned in the title of this paper was
More information6 Commutators and the derived series. [x,y] = xyx 1 y 1.
6 Commutators and the derived series Definition. Let G be a group, and let x,y G. The commutator of x and y is [x,y] = xyx 1 y 1. Note that [x,y] = e if and only if xy = yx (since x 1 y 1 = (yx) 1 ). Proposition
More informationG = G 0 > G 1 > > G k = {e}
Proposition 49. 1. A group G is nilpotent if and only if G appears as an element of its upper central series. 2. If G is nilpotent, then the upper central series and the lower central series have the same
More informationFull and Complete Binary Trees
Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full
More informationSets of Fibre Homotopy Classes and Twisted Order Parameter Spaces
Communications in Mathematical Physics Manuscript-Nr. (will be inserted by hand later) Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces Stefan Bechtluft-Sachs, Marco Hien Naturwissenschaftliche
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More informationGroup Fundamentals. Chapter 1. 1.1 Groups and Subgroups. 1.1.1 Definition
Chapter 1 Group Fundamentals 1.1 Groups and Subgroups 1.1.1 Definition A group is a nonempty set G on which there is defined a binary operation (a, b) ab satisfying the following properties. Closure: If
More informationLecture 4 DISCRETE SUBGROUPS OF THE ISOMETRY GROUP OF THE PLANE AND TILINGS
1 Lecture 4 DISCRETE SUBGROUPS OF THE ISOMETRY GROUP OF THE PLANE AND TILINGS This lecture, just as the previous one, deals with a classification of objects, the original interest in which was perhaps
More informationFIXED POINT SETS OF FIBER-PRESERVING MAPS
FIXED POINT SETS OF FIBER-PRESERVING MAPS Robert F. Brown Department of Mathematics University of California Los Angeles, CA 90095 e-mail: rfb@math.ucla.edu Christina L. Soderlund Department of Mathematics
More informationIntroduction to Graph Theory
Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate
More informationA NOTE ON TRIVIAL FIBRATIONS
A NOTE ON TRIVIAL FIBRATIONS Petar Pavešić Fakulteta za Matematiko in Fiziko, Univerza v Ljubljani, Jadranska 19, 1111 Ljubljana, Slovenija petar.pavesic@fmf.uni-lj.si Abstract We study the conditions
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More informationFIBRATION SEQUENCES AND PULLBACK SQUARES. Contents. 2. Connectivity and fiber sequences. 3
FIRTION SEQUENES ND PULLK SQURES RY MLKIEWIH bstract. We lay out some foundational facts about fibration sequences and pullback squares of topological spaces. We pay careful attention to connectivity ranges
More informationTHE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
More informationEvery Positive Integer is the Sum of Four Squares! (and other exciting problems)
Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer
More informationTOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS
TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS VIPUL NAIK Abstract. In this journey, we are going to explore the so called separation axioms in greater detail. We shall try to understand how these axioms
More informationGod created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
More informationEvery tree contains a large induced subgraph with all degrees odd
Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
More informationOn end degrees and infinite cycles in locally finite graphs
On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel
More informationTenacity and rupture degree of permutation graphs of complete bipartite graphs
Tenacity and rupture degree of permutation graphs of complete bipartite graphs Fengwei Li, Qingfang Ye and Xueliang Li Department of mathematics, Shaoxing University, Shaoxing Zhejiang 312000, P.R. China
More informationToday s Topics. Primes & Greatest Common Divisors
Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime
More informationOn the k-path cover problem for cacti
On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we
More informationx < y iff x < y, or x and y are incomparable and x χ(x,y) < y χ(x,y).
12. Large cardinals The study, or use, of large cardinals is one of the most active areas of research in set theory currently. There are many provably different kinds of large cardinals whose descriptions
More informationCardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.
Section 2.5 Cardinality (another) 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 bijection from A to B. If there is an injection
More informationDiversity Coloring for Distributed Data Storage in Networks 1
Diversity Coloring for Distributed Data Storage in Networks 1 Anxiao (Andrew) Jiang and Jehoshua Bruck California Institute of Technology Pasadena, CA 9115, U.S.A. {jax, bruck}@paradise.caltech.edu Abstract
More informationHow To Understand The Theory Of Media Theory
Fundamentals of Media Theory ergei Ovchinnikov Mathematics Department an Francisco tate University an Francisco, CA 94132 sergei@sfsu.edu Abstract Media theory is a new branch of discrete applied mathematics
More informationThe degree, size and chromatic index of a uniform hypergraph
The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationThe positive minimum degree game on sparse graphs
The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University
More informationCommentationes Mathematicae Universitatis Carolinae
Commentationes Mathematicae Universitatis Carolinae Adam Emeryk; Władysław Kulpa The Sorgenfrey line has no connected compactification Commentationes Mathematicae Universitatis Carolinae, Vol. 18 (1977),
More informationThe chromatic spectrum of mixed hypergraphs
The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex
More informationDEGREES OF CATEGORICITY AND THE HYPERARITHMETIC HIERARCHY
DEGREES OF CATEGORICITY AND THE HYPERARITHMETIC HIERARCHY BARBARA F. CSIMA, JOHANNA N. Y. FRANKLIN, AND RICHARD A. SHORE Abstract. We study arithmetic and hyperarithmetic degrees of categoricity. We extend
More informationThe Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
More informationOn a conjecture by Palis
1179 2000 103-108 103 On a conjecture by Palis (Shuhei Hayashi) Introduction Let $M$ be a smooth compact manifold without boundary and let Diff1 $(M)$ be the set of $C^{1}$ diffeomorphisms with the $C^{1}$
More informationOffline sorting buffers on Line
Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationCMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma
CMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma Please Note: The references at the end are given for extra reading if you are interested in exploring these ideas further. You are
More informationAn inequality for the group chromatic number of a graph
An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics
More informationPSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2
PSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2 Abstract. We prove a Bruckner-Garg type theorem for the fiber structure of a generic map from a continuum X into the unit interval I. We
More informationAn algorithmic classification of open surfaces
An algorithmic classification of open surfaces Sylvain Maillot January 8, 2013 Abstract We propose a formulation for the homeomorphism problem for open n-dimensional manifolds and use the Kerekjarto classification
More information