Quandles and the Towers of Hanoi
|
|
- Terence Mason
- 5 years ago
- Views:
Transcription
1 The the Bob Laboratory for Algebraic and Symbolic Computation Reem-Kayden Center for Science and Computation Bard College Annandale-on-Hudson, NY August 8, 2011
2 The The
3 The Figure Eight (4 1 ) Knot The
4 Knot A knot quandle is a system of equations relating the arcs of a knot, one for each crossing. a b c The a a b = c b a/b = c c
5 Figure Eight 4 1 The Q(4 1 ) = 0, 1, 2, 3 0/2 = 1, 1 3 = 2, 2/0 = 3, 3 1 = 0
6 Type I Reidemeister Move The x y x x = y = x x
7 Type II Reidemeister Move The y x y z w (x y)/y = z/y = w = x x
8 Type III Reidemeister Move x y w z s v x y t z r u The (x z) (y z) = w s = v = u = t z = (x y) z
9 The Definition A quandle (Q,, /) is a set Q along with a binary operations and / on Q satisfying: I x(x x = x); IIa xy((x/y) y = x); IIb xy((x y)/y = x); and III xyz((x y) z = (x z) (y z)). Since uniquely determines /, we can limit our mention of /. [Note: Axioms I, IIa, and IIb constitute the theory of idempotent, right quasigroups.]
10 Unary Quandle The Table: Unary Quandle U 3
11 Latin Quandle The Table: Latin (Quasigroup) Quandle
12 Basic Elements of a CSP The A, a finite domain; V = {v 1, v 2,..., v n,...},a countable collection of variables; and Γ, which is a collection of relations R A n for various positive integers n.
13 Example: Sat The Question Does there exists a truth assignment for the proposition below? α = ( v 1 v 2 ) (v 3 v 2 ) The domain is easy: A = {0, 1}
14 Constraints The Definition (Constraint) A constraint over Γ is a pair (v i1, v i2,..., v im ), R, where R is a relation in Γ of arity m. α = ( v 1 v 2 ) (v 3 v 2 ) translates to the following constraints: and C 1 = (v 1, v 2 ), {(0, 0), (0, 1), (1, 1)} C 2 = (v 3, v 2 ), {(0, 0), (1, 0), (1, 1)}.
15 CSP(Γ) The Definition (CSP(Γ)) CSP(Γ) is the combinatorial decision problem with the following components. Instance: A triple I = (V, A, C) where C is a finite set of constraints over Γ and V is a finite subset of V. Solution: A function θ : V A such that for every constraint (v 1, v 2,..., v m ), R C, (θ(v 1 ), θ(v 2 ),..., θ(v m )) R.
16 Tractable and NP-Complete CSP The Definition Let Γ be a collection of relations over a finite domain A. CSP(Γ) is tractable if CSP(Γ ) is in P for all finite Γ Γ. CSP(Γ) is NP-complete if CSP(Γ ) is NP-complete for some finite Γ Γ.
17 Complexity of CSP s The Tractable: 2-Color 2-Sat NP-Complete: k-color for k > 2 k-sat for k > 2 Schedule n-queens
18 CSP(Q) The Definition (Subpower) Recall that a subpower of a quandle Q is a subquandle of Q n. Let Sub(Q) stand for the class of subpowers of Q. Definition (CSP(Q)) CSP(Q) = CSP(Γ) where Γ = Sub(Q). Definition Q is NP-complete if CSP(Q) is NP-complete and is tractable if CSP(Q) is tractable.
19 U 2 The Theorem U 2 is NP-complete. Proof Table: U 2 Sub(U 2 ) includes all relations over {0, 1}. So 3-Sat is a finite, NP-complete subproblem of CSP(Q) where Q = U 2.
20 Connectedness The Definition (Connected) A quandle Q is connected if its right Cayley graph for is connected. Proposition A quandle Q is disconnected iff there exists a surjective homomorphism h : Q U 2. Definition (Totally Connected) A quandle Q is totally connected if every element of Sub(Q) is connected.
21 Homomorphic Images The Theorem Suppose h : Q Q is a surjective quandle homomorphism. If Q is tractable, so is Q. If Q is NP-complete, so is Q. Corollary Disconnected quandles are NP-complete.
22 Subpowers The Theorem Suppose Q Sub(Q). If Q is tractable, so is Q. If Q is NP-complete, so is Q. Corollary If Q is not totally connected, then it is NP-complete. If Q is not totally connected, then U 2 appears in its variety.
23 Merling Terms The Definition A Merling term t(x, y) for a quandle Q satisfies the following 1 t(x, y) = y in Q; and 2 t(x, y) = x in U 2. Note: If such a term exists for Q, then Q and U 2 have independent varieties. Proposition Every totally connected quandle has a Merling term. Why? F (2, Q) is a subpower of Q, so it is connected. t(x, y) is the path from x to y in F (2, Q).
24 From Merling to Malcev The Lemma If a quandle Q has a Merling term, then it also has a Mal cev term. This follows from a two-stage transformation of t(x, y): 1 Construct term s(x, y, z) via selective substitution. 2 Use right cancellation to form m(x, y, z). This transformation is demonstrated on the term t(x, y) = ((x (y x)) (x y)) (y x).
25 s(x, y, z) The To construct s(x, y, z) from t(x, y): Replace all instances of y with z, and Replace every instance of x except the first with y. For example, t(x, y) = ((x (y x)) (x y)) (y x) yields s(x, y, z) = ((x (z y)) (y z)) (z y).
26 Properties of s(x, y, z) The Hence, if t(x, y) = y, then s(x, x, y) = t(x, y) = y, s(x, y, y) = ((x (y y)) (y y)) (y y) = ((x y) y) y.
27 m(x, y, z) The To determine m(x, y, z) from s(x, y, z), use right cancellation to unravel s(x, y, y). For example, for let s(x, y, y) = ((x y) y) y, m(x, y, z) = ((s(x, y, z)/z)/z)/z.
28 m(x, y, z) is Mal cev The If t(x, y) = y, then m(x, x, y) = ((s(x, x, y)/y)/y)/y = ((y/y)/y)/y = y, m(x, y, y) = ((s(x, y, y)/y)/y)/y = (((((x y) y) y)/y)/y)/y = x.
29 Malv cev Terms and Tractability The Theorem (Bulatov,Dalmau) If an algebra has a Mal cev term, then it is tractable. Corollary If a quandle Q is totally connected, then it is tractable.
30 The Theorem Every quandle that is not NP-complete is tractable. In fact, since right self distributivity is never employed, this result extends as follows. Theorem Every idempotent, right quasigroup that is not NP-complete is tractable.
31 Types 4 and 5 Omitted The Theorem (Hobby) The pseudo variety of a finite quandle omits types 4 and 5. The proof does use right, self distributivity and so does not apply to idempotent, right quasigroups.
32 The Specific: Let Q = A R be a finitely presented quandle. Does there exist an algorithm that decides whether two expressions q 1 and q 2 over the generators A represent the same element of Q? General: Does there exist a general algorithm over all quandles that takes A R as input and then proceeds with a correct decision method? In groups the specific version depends on the group, so the general algorithm does not exist.
33 Conjugation The Given a group G, define a quandle structure Conj(G) via and g h = h 1 gh g/h = hgh 1. A conjugation quandle is a quandle Q that embeds into Conj(G) for some G.
34 Conj(G) Naively The Given a finitely presented group G = A W with undecidable word problem, is Conj(G) a finitely presented quandle with undecidable work problem? Conj(G) is not necessarily finitely presented. Conj(G) does not faithfully reflect G (Groups omit type 1!). Conj(G) is not sufficiently general among quandles.
35 Lopsided Quandle The The following quandle cannot arise through conjugation Table: Lopsided Quandle
36 Inner Automorphisms The Let Q be a quandle. For q Q define r q, R q : Q Q by right translation as follows r q (p) = p q and R q (p) = p/q.
37 Inner Automorphisms The r q is always a permutation: R q = r 1 q. r q is a quandle homomorphism: r q (a b) = (a b) q = (a q) (b q) = r q (a) r q (b). Let Inn(Q) be the group generated by the permutations {r q q Q}. We will show that Inn(Q) is general among groups.
38 The Quandle The Given a finitely presented group G = A W, we wish to construct a finitely presented quandle = A R W.
39 Example: G = C 2 The Consider the following group presentation: C 2 = a aa. Let x be a fresh generator and Q C2 be the following quandle presentation: Q C2 = a, x (x a) a = x, (a a) a = a, or, rather, Q C2 = a, x x aa = x, a aa = a.
40 The Quandle The Given G = A W, let x be a new generator not in A and let = A x R W where A x = A {x} and R W = {a w = a a A x, w W }.
41 The Formal Expression q g The Given a quandle expression q over A x and a group expression g over A, define the quandle expression q g over A x by structural induction: q e = q, q e 1 = q, q a = q a = r a (q), for a A, q a 1 = q/a = R a (q) for a A, q g 1g 2 = (q g 1 ) g 2, q (g 1g 2 ) 1 = (q g 1 2 ) g 1 1.
42 Main Result The Theorem Given a finitely presented group G, Corollary G g = e iff x g = x. The word problem for finitely presented quandles is, in general, undecidable. Proof. Let G be Novikov s group (1952), then must have undecidable word problem.
43 Forward Direction The Proposition If G g = e then x g = x. Define ρ : A Inn( ) by ρ a = r a. Then ρ extends to a group homomorphism ρ : FGA Inn( ). Furthermore, for any h G and q, ρ h (q) = q h.
44 Forward Direction (Continued) The In particular, for each w W and a A x, so It follows that ρ w (a) = a w = a = id(a) Inn( ) ρ w = id. W ker(ρ). Let π G : FGA G be the canonical projection. Recall that ker(π G ) is the smallest normal subgroup containing W. Hence, ker(π G ) ker(ρ).
45 Forward Direction (Continued) The This means that ρ defines a homomorphism of type ρ : G Inn( ). Consequently, if G g = e then Inn( ) ρ g = id so that x g = ρ g (x) = id(x) = x.
46 Backward Direction The Proposition If x g = x then G g = e. First, consider the following finitely presented group: G x = A x C W, where C W = {w 1 aw = a a A x, w W }. The proposition is a consequence of the following: Fact 1: If x g = x then G x g 1 xg = x. Fact 2: if G x g 1 xg = x then G g = e.
47 Fact 1 The It is left to the audience to verify that for any h FGA and a A x, Conj(G x ) a h = a iff G x h 1 ah = a. In particular, for all w W and a A x, Conj(G x ) a w = a, so that the relations in R W hold in Conj(G x ). Therefore, there exists a quandle homomorphism φ : Conj(G x ) such that φ(a) = a for all a A x.
48 Fact 1 (Continued) The Then if x g = x the quandle homomorphism φ ensures Conj(G x ) x g = x. It follows that G x g 1 xg = x.
49 Fact 2 The Let the free product of G and x. G[x] = A x W = G x, Since the relations C W hold in G[x], there exists a unique homomorphism χ : G x G[x] such that χ(a) = a for all a A x.
50 Fact 2 (Continued) The Moreover, the following square commutes: χ π x = ι G π G where π x and π G are the canonical homomorphisms that fix A.
51 Fact 2 (Continued) The Consequently, if G x g 1 xg = x then, via χ, G[x] g 1 xg = x. However, since G[x] = G x, G[x] g = e, which, since G is included in G[x], means that G g = e.
52 Main Result The Theorem Given a finitely presented group G, Corollary G g = e iff x g = x. The word problem for finitely presented quandles is, in general, undecidable. Proof. Let G be Novikov s group (1952), then must have undecidable word problem.
53 R, a Term Rewriting System The ι rules: x x x x/x x ρ rules: (x y)/y x (x/y) y x δ rules: x (y z) ((x/z) y) z x (y/z) ((x z) y)/z x/(y z) ((x/z)/y) z x/(y/z) ((x z)/y)/z)
54 Basics The Definition Let t and t be terms over {, /}. We say t t if t rewrites to t in one step, t t if t rewrites to t in zero or more steps, and t + t if t rewrites to t in one or more steps.
55 The Definition A term t is a normal form if whenever t t, t is identical to t. Theorem (Golbus, Gutierrez, McGrail (GGM)) The R is strongly normalizing (SN). That is, every infinite rewrite sequence t 0 t 1... includes a normal form.
56 The Proof. (Sketch) Assume without loss of generality that t i + t i+1 for each i. Define a function m from terms to the natural numbers as follows: { 0, if t is a variable; m(t) = (1) 1 + m(t 1 ) + 3m(t 2 ), if t = t 1 o t 2. Then {m(t i ) i N} is a subset of N with no least element.
57 The Theorem (GGM) The R is confluent. That is whenever t u and t v there exists a term s with u w and v w. Notes: If S is SN and confluent, it has unique normal forms. So R has unique normal forms.
58 R Decides Q The Theorem (GGM) The R decides the pure equational theory of Q. That is, the following are equivalent for any two terms t and s: t = s is a theorem of Q t and s have the same normal form r over R.
59 The The There are n disks, each of unique size. There are k pegs. The disks are initially stacked on a source peg with smaller disks stacked directly on larger disks. The disks must all be moved to a target peg. Only one disk may be moved at one time. One may never stack a larger disk on a smaller disk.
60 and the The The encoded into : Initial Term y (x 3 (x 2 x 1 )) Normal Form ((((((y/x 1 )/x 2 ) x 1 ) x 3 )/x 1 ) x 2 ) x 1 Interpret both terms above in terms of number of pegs. Interpret t = ((y/(x 2 x 1 )) x 3 ) (x 2 x 1 ) as a four-peg solution.
61 Grand Daddy Term The Definition For n = 1, 2,..., define the term t n as follows: t 1 = x 1 ; and t n+1 = x n+1 t n. Definition For n = 1, 2,..., define g n as below: g 1 = y x 1 ; and g n+1 = ((y/t n ) x n+1 ) t n.
62 Solutions as Descendants The Definition A nice solution to the n-disk puzzle that uses no more than n pegs corresponds to some term s with g n s. Question If g n s, does s correspond to some solution?
63 The The Thank you!!! Any questions?
Toward Quandle Dichotomy
Robert McGrail, Mona Merling, Mary Sharac, Japheth Wood Laboratory for Algebraic and Symbolic Computation Reem-Kayden Center for Science and Computation Bard College Annandale-on-Hudson, NY 12504 April
More informationCSPs and Connectedness: P/NP-Complete Dichotomy for Idempotent, Right Quasigroups
CSPs and Connectedness: P/NP-Complete Dichotomy for Idempotent, Right Quasigroups Robert W McGrail, James Belk, Solomon Garber, and Japheth Wood Reem Kayden Center for Science and Computation Bard College
More informationGroups and Symmetries
Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group
More informationTeddy Einstein Math 4320
Teddy Einstein Math 4320 HW4 Solutions Problem 1: 2.92 An automorphism of a group G is an isomorphism G G. i. Prove that Aut G is a group under composition. Proof. Let f, g Aut G. Then f g is a bijective
More informationConjugacy in epigroups
October 2018 Conjugacy in epigroups António Malheiro (CMA/FCT/NOVA University of Lisbon) @ the York semigroup (joint work with João Araújo, Michael Kinyon, Janusz Konieczny) Acknowledgement: This work
More information1.1 Definition. A monoid is a set M together with a map. 1.3 Definition. A monoid is commutative if x y = y x for all x, y M.
1 Monoids and groups 1.1 Definition. A monoid is a set M together with a map M M M, (x, y) x y such that (i) (x y) z = x (y z) x, y, z M (associativity); (ii) e M such that x e = e x = x for all x M (e
More informationBounded width problems and algebras
Algebra univers. 56 (2007) 439 466 0002-5240/07/030439 28, published online February 21, 2007 DOI 10.1007/s00012-007-2012-6 c Birkhäuser Verlag, Basel, 2007 Algebra Universalis Bounded width problems and
More informationCLASSIFYING THE COMPLEXITY OF CONSTRAINTS USING FINITE ALGEBRAS
CLASSIFYING THE COMPLEXITY OF CONSTRAINTS USING FINITE ALGEBRAS ANDREI BULATOV, PETER JEAVONS, AND ANDREI KROKHIN Abstract. Many natural combinatorial problems can be expressed as constraint satisfaction
More informationAxioms of Kleene Algebra
Introduction to Kleene Algebra Lecture 2 CS786 Spring 2004 January 28, 2004 Axioms of Kleene Algebra In this lecture we give the formal definition of a Kleene algebra and derive some basic consequences.
More informationSelf-distributive quasigroups and quandles II
Self-distributive quasigroups and quandles II David Stanovský Charles University, Prague, Czech Republic Kazakh-British Technical University, Almaty, Kazakhstan stanovsk@karlin.mff.cuni.cz June 2015 David
More informationINVERSE SEMIQUANDLES. Michael Kinyon. 4th Mile High, 2 August University of Lisbon. Department of Mathematics 1 / 21
INVERSE SEMIQUANDLES Michael Kinyon Department of Mathematics University of Lisbon 4th Mile High, 2 August 2017 1 / 21 João This is joint work with João Araújo (Universidade Aberta). 2 / 21 Conjugation
More informationA Survey of Quandles with some recent developments
A Survey of Quandles with some recent developments University of South Florida QQQ 2016 Knots and their diagrams Overview of knot diagrams and Quandles A knot is the image of a smooth embeding S 1 R 3
More informationBernhard Nebel, Julien Hué, and Stefan Wölfl. June 27 & July 2/4, 2012
Bernhard Nebel, Julien Hué, and Stefan Wölfl Albert-Ludwigs-Universität Freiburg June 27 & July 2/4, 2012 vs. complexity For some restricted constraint languages we know some polynomial time algorithms
More informationTutorial on the Constraint Satisfaction Problem
Tutorial on the Constraint Satisfaction Problem Miklós Maróti Vanderbilt University and University of Szeged Nový Smokovec, 2012. September 2 7. Miklós Maróti (Vanderbilt and Szeged) The Constraint Satisfaction
More informationNOTES ON CONGRUENCE n-permutability AND SEMIDISTRIBUTIVITY
NOTES ON CONGRUENCE n-permutability AND SEMIDISTRIBUTIVITY RALPH FREESE Abstract. In [1] T. Dent, K. Kearnes and Á. Szendrei define the derivative, Σ, of a set of equations Σ and show, for idempotent Σ,
More informationQuandles and universal algebra
Quandles and universal algebra Quandles and knots, and groups, and universal algebra David Stanovský Charles University, Prague, Czech Republic Novi Sad, June 2017 David Stanovský (Prague) Quandles, knots,
More informationAlgebraic Tractability Criteria for Infinite-Domain Constraint Satisfaction Problems
Algebraic Tractability Criteria for Infinite-Domain Constraint Satisfaction Problems Manuel Bodirsky Institut für Informatik Humboldt-Universität zu Berlin May 2007 CSPs over infinite domains (May 2007)
More information2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a.
Chapter 2 Groups Groups are the central objects of algebra. In later chapters we will define rings and modules and see that they are special cases of groups. Also ring homomorphisms and module homomorphisms
More informationSelf-distributive quasigroups and quandles
Self-distributive quasigroups and quandles David Stanovský Charles University, Prague, Czech Republic Kazakh-British Technical University, Almaty, Kazakhstan stanovsk@karlin.mff.cuni.cz June 2015 David
More informationConstraint satisfaction problems over infinite domains
Constraint satisfaction problems over infinite domains Michael Kompatscher, Trung Van Pham Theory and Logic Group TU Wien Research Seminar, 27/04/2016 Schaefer s theorem Let Φ be a set of propositional
More informationMultivariable Calculus and Matrix Algebra-Summer 2017
Multivariable Calculus and Matrix Algebra-Summer 017 Homework 4 Solutions Note that the solutions below are for the latest version of the problems posted. For those of you who worked on an earlier version
More informationCommon idempotents in compact left topological left semirings
arxiv:1002.1599v1 [math.gn] 8 Feb 2010 Common idempotents in compact left topological left semirings Denis I. Saveliev 24 January 2010, Muscat ICAA A classical result of topological algebra states that
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More informationSolutions to Assignment 4
1. Let G be a finite, abelian group written additively. Let x = g G g, and let G 2 be the subgroup of G defined by G 2 = {g G 2g = 0}. (a) Show that x = g G 2 g. (b) Show that x = 0 if G 2 = 2. If G 2
More informationHandbook of Logic and Proof Techniques for Computer Science
Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives
More informationPALINDROMIC AND SŪDOKU QUASIGROUPS
PALINDROMIC AND SŪDOKU QUASIGROUPS JONATHAN D. H. SMITH Abstract. Two quasigroup identities of importance in combinatorics, Schroeder s Second Law and Stein s Third Law, share many common features that
More informationChapter 2: Switching Algebra and Logic Circuits
Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used
More informationSemigroup, monoid and group models of groupoid identities. 1. Introduction
Quasigroups and Related Systems 16 (2008), 25 29 Semigroup, monoid and group models of groupoid identities Nick C. Fiala Abstract In this note, we characterize those groupoid identities that have a (nite)
More informationarxiv: v1 [math.gt] 11 Aug 2008
Link invariants from finite Coxeter racks Sam Nelson Ryan Wieghard arxiv:0808.1584v1 [math.gt] 11 Aug 2008 Abstract We study Coxeter racks over Z n and the knot and link invariants they define. We exploit
More informationPractice Test III, Math 314, Spring 2016
Practice Test III, Math 314, Spring 2016 Dr. Holmes April 26, 2016 This is the 2014 test reorganized to be more readable. I like it as a review test. The students who took this test had to do four sections
More informationBoolean Algebra CHAPTER 15
CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationWHY WORD PROBLEMS ARE HARD
WHY WORD PROBLEMS ARE HARD KEITH CONRAD 1. Introduction The title above is a joke. Many students in school hate word problems. We will discuss here a specific math question that happens to be named the
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationPropositional and Predicate Logic - VII
Propositional and Predicate Logic - VII Petr Gregor KTIML MFF UK WS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - VII WS 2015/2016 1 / 11 Theory Validity in a theory A theory
More information120A LECTURE OUTLINES
120A LECTURE OUTLINES RUI WANG CONTENTS 1. Lecture 1. Introduction 1 2 1.1. An algebraic object to study 2 1.2. Group 2 1.3. Isomorphic binary operations 2 2. Lecture 2. Introduction 2 3 2.1. The multiplication
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationGroup Actions Definition. Let G be a group, and let X be a set. A left action of G on X is a function θ : G X X satisfying:
Group Actions 8-26-202 Definition. Let G be a group, and let X be a set. A left action of G on X is a function θ : G X X satisfying: (a) θ(g,θ(g 2,x)) = θ(g g 2,x) for all g,g 2 G and x X. (b) θ(,x) =
More informationMATH 3330 ABSTRACT ALGEBRA SPRING Definition. A statement is a declarative sentence that is either true or false.
MATH 3330 ABSTRACT ALGEBRA SPRING 2014 TANYA CHEN Dr. Gordon Heier Tuesday January 14, 2014 The Basics of Logic (Appendix) Definition. A statement is a declarative sentence that is either true or false.
More informationHandout #6 INTRODUCTION TO ALGEBRAIC STRUCTURES: Prof. Moseley AN ALGEBRAIC FIELD
Handout #6 INTRODUCTION TO ALGEBRAIC STRUCTURES: Prof. Moseley Chap. 2 AN ALGEBRAIC FIELD To introduce the notion of an abstract algebraic structure we consider (algebraic) fields. (These should not to
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationPERFECT SUBGROUPS OF HNN EXTENSIONS
PERFECT SUBGROUPS OF HNN EXTENSIONS F. C. TINSLEY (JOINT WITH CRAIG R. GUILBAULT) Introduction This note includes supporting material for Guilbault s one-hour talk summarized elsewhere in these proceedings.
More informationCHAPTER 2 BOOLEAN ALGEBRA
CHAPTER 2 BOOLEAN ALGEBRA This chapter in the book includes: Objectives Study Guide 2.1 Introduction 2.2 Basic Operations 2.3 Boolean Expressions and Truth Tables 2.4 Basic Theorems 2.5 Commutative, Associative,
More informationGenerators of certain inner mapping groups
Department of Algebra Charles University in Prague 3rd Mile High Conference on Nonassociative Mathematics, August 2013 Inner Mapping Group Definitions In a loop Q, the left and right translations by an
More informationAlgebra-I, Fall Solutions to Midterm #1
Algebra-I, Fall 2018. Solutions to Midterm #1 1. Let G be a group, H, K subgroups of G and a, b G. (a) (6 pts) Suppose that ah = bk. Prove that H = K. Solution: (a) Multiplying both sides by b 1 on the
More informationTopological clones. Michael Pinsker. Technische Universität Wien / Univerzita Karlova v Praze. Funded by Austrian Science Fund (FWF) grant P27600
Technische Universität Wien / Univerzita Karlova v Praze Funded by Austrian Science Fund (FWF) grant P27600 TACL 2015 Outline I: Algebras, function clones, abstract clones, Birkhoff s theorem II:, Topological
More informationINTRODUCTION TO THE GROUP THEORY
Lecture Notes on Structure of Algebra INTRODUCTION TO THE GROUP THEORY By : Drs. Antonius Cahya Prihandoko, M.App.Sc e-mail: antoniuscp.fkip@unej.ac.id Mathematics Education Study Program Faculty of Teacher
More informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
More informationMATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis
MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis PART B: GROUPS GROUPS 1. ab The binary operation a * b is defined by a * b = a+ b +. (a) Prove that * is associative.
More informationTHE REAL NUMBERS Chapter #4
FOUNDATIONS OF ANALYSIS FALL 2008 TRUE/FALSE QUESTIONS THE REAL NUMBERS Chapter #4 (1) Every element in a field has a multiplicative inverse. (2) In a field the additive inverse of 1 is 0. (3) In a field
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationRESIDUALLY FINITE VARIETIES OF NONASSOCIATIVE ALGEBRAS
RESIDUALLY FINITE VARIETIES OF NONASSOCIATIVE ALGEBRAS KEITH A. KEARNES AND YOUNG JO KWAK Abstract. We prove that if V is a residually finite variety of nonassociative algebras over a finite field, and
More informationCHAPTER III NORMAL SERIES
CHAPTER III NORMAL SERIES 1. Normal Series A group is called simple if it has no nontrivial, proper, normal subgroups. The only abelian simple groups are cyclic groups of prime order, but some authors
More informationABSTRACT ALGEBRA 1, LECTURES NOTES 5: SUBGROUPS, CONJUGACY, NORMALITY, QUOTIENT GROUPS, AND EXTENSIONS.
ABSTRACT ALGEBRA 1, LECTURES NOTES 5: SUBGROUPS, CONJUGACY, NORMALITY, QUOTIENT GROUPS, AND EXTENSIONS. ANDREW SALCH 1. Subgroups, conjugacy, normality. I think you already know what a subgroup is: Definition
More informationPartial, Total, and Lattice Orders in Group Theory
Partial, Total, and Lattice Orders in Group Theory Hayden Harper Department of Mathematics and Computer Science University of Puget Sound April 23, 2016 Copyright c 2016 Hayden Harper. Permission is granted
More informationThe complexity of recursive constraint satisfaction problems.
The complexity of recursive constraint satisfaction problems. Victor W. Marek Department of Computer Science University of Kentucky Lexington, KY 40506, USA marek@cs.uky.edu Jeffrey B. Remmel Department
More informationMA441: Algebraic Structures I. Lecture 14
MA441: Algebraic Structures I Lecture 14 22 October 2003 1 Review from Lecture 13: We looked at how the dihedral group D 4 can be viewed as 1. the symmetries of a square, 2. a permutation group, and 3.
More informationDISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3. Contents
DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3 T.K.SUBRAHMONIAN MOOTHATHU Contents 1. Cayley s Theorem 1 2. The permutation group S n 2 3. Center of a group, and centralizers 4 4. Group actions
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS.
ALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS. KEVIN MCGERTY. 1. RINGS The central characters of this course are algebraic objects known as rings. A ring is any mathematical structure where you can add
More informationGroups. 3.1 Definition of a Group. Introduction. Definition 3.1 Group
C H A P T E R t h r e E Groups Introduction Some of the standard topics in elementary group theory are treated in this chapter: subgroups, cyclic groups, isomorphisms, and homomorphisms. In the development
More informationFOUNDATIONS OF TOPOLOGICAL RACKS AND QUANDLES
FOUNDATIONS OF TOPOLOGICAL RACKS AND QUANDLES MOHAMED ELHAMDADI AND EL-KAÏOUM M. MOUTUOU Dedicated to Professor Józef H. Przytycki for his 60th birthday ABSTRACT. We give a foundational account on topological
More information1 Predicates and Quantifiers
1 Predicates and Quantifiers We have seen how to represent properties of objects. For example, B(x) may represent that x is a student at Bryn Mawr College. Here B stands for is a student at Bryn Mawr College
More informationComplexity of conservative Constraint Satisfaction Problems
Complexity of conservative Constraint Satisfaction Problems ANDREI A. BULATOV Simon Fraser University In a constraint satisfaction problem (CSP) the aim is to find an assignment of values to a given set
More informationLogic: The Big Picture
Logic: The Big Picture A typical logic is described in terms of syntax: what are the legitimate formulas semantics: under what circumstances is a formula true proof theory/ axiomatization: rules for proving
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationChapter 2 : Boolean Algebra and Logic Gates
Chapter 2 : Boolean Algebra and Logic Gates By Electrical Engineering Department College of Engineering King Saud University 1431-1432 2.1. Basic Definitions 2.2. Basic Theorems and Properties of Boolean
More informationALGEBRAIC PROPERTIES OF THE SHIFT MAPPING
proceedings of the american mathematical society Volume 106, Number 3, July 1989 ALGEBRAIC PROPERTIES OF THE SHIFT MAPPING PATRICK DEHORNOY (Communicated by Andreas Blass) Abstract. We investigate the
More informationAlgebra Ph.D. Entrance Exam Fall 2009 September 3, 2009
Algebra Ph.D. Entrance Exam Fall 2009 September 3, 2009 Directions: Solve 10 of the following problems. Mark which of the problems are to be graded. Without clear indication which problems are to be graded
More informationCollected trivialities on algebra derivations
Collected trivialities on algebra derivations Darij Grinberg December 4, 2017 Contents 1. Derivations in general 1 1.1. Definitions and conventions....................... 1 1.2. Basic properties..............................
More informationTree-adjoined spaces and the Hawaiian earring
Tree-adjoined spaces and the Hawaiian earring W. Hojka (TU Wien) Workshop on Fractals and Tilings 2009 July 6-10, 2009, Strobl (Austria) W. Hojka (TU Wien) () Tree-adjoined spaces and the Hawaiian earring
More informationAbstract Algebra I. Randall R. Holmes Auburn University. Copyright c 2012 by Randall R. Holmes Last revision: November 11, 2016
Abstract Algebra I Randall R. Holmes Auburn University Copyright c 2012 by Randall R. Holmes Last revision: November 11, 2016 This work is licensed under the Creative Commons Attribution- NonCommercial-NoDerivatives
More informationA GRAPH-THEORETIC APPROACH TO QUASIGROUP CYCLE NUMBERS
A GRAPH-THEORETIC APPROACH TO QUASIGROUP CYCLE NUMBERS BRENT KERBY AND JONATHAN D. H. SMITH Abstract. Norton and Stein associated a number with each idempotent quasigroup or diagonalized Latin square of
More informationAlgebras with finite descriptions
Algebras with finite descriptions André Nies The University of Auckland July 19, 2005 Part 1: FA-presentability A countable structure in a finite signature is finite-automaton presentable (or automatic)
More informationDiscrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST
Discrete Mathematics CS204: Spring, 2008 Jong C. Park Computer Science Department KAIST Today s Topics Combinatorial Circuits Properties of Combinatorial Circuits Boolean Algebras Boolean Functions and
More informationDEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY
HANDOUT ABSTRACT ALGEBRA MUSTHOFA DEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY 2012 BINARY OPERATION We are all familiar with addition and multiplication of two numbers. Both
More informationModel theory and algebraic geometry in groups, non-standard actions and algorithms
Model theory and algebraic geometry in groups, non-standard actions and algorithms Olga Kharlampovich and Alexei Miasnikov ICM 2014 1 / 32 Outline Tarski s problems Malcev s problems Open problems 2 /
More informationAn Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California. 2. Background: Semirings and Kleene algebras
An Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California 1. Residuated Lattices with iteration 2. Background: Semirings and Kleene algebras 3. A Gentzen system
More informationA MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ
A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ NICOLAS FORD Abstract. The goal of this paper is to present a proof of the Nullstellensatz using tools from a branch of logic called model theory. In
More informationSets, Structures, Numbers
Chapter 1 Sets, Structures, Numbers Abstract In this chapter we shall introduce most of the background needed to develop the foundations of mathematical analysis. We start with sets and algebraic structures.
More informationVAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0. Contents
VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0 BENJAMIN LEDEAUX Abstract. This expository paper introduces model theory with a focus on countable models of complete theories. Vaught
More informationEquational Logic. Chapter 4
Chapter 4 Equational Logic From now on First-order Logic is considered with equality. In this chapter, I investigate properties of a set of unit equations. For a set of unit equations I write E. Full first-order
More informationWe define the multi-step transition function T : S Σ S as follows. 1. For any s S, T (s,λ) = s. 2. For any s S, x Σ and a Σ,
Distinguishability Recall A deterministic finite automaton is a five-tuple M = (S,Σ,T,s 0,F) where S is a finite set of states, Σ is an alphabet the input alphabet, T : S Σ S is the transition function,
More informationINTRODUCTION TO SEMIGROUPS AND MONOIDS
INTRODUCTION TO SEMIGROUPS AND MONOIDS PETE L. CLARK We give here some basic definitions and very basic results concerning semigroups and monoids. Aside from the mathematical maturity necessary to follow
More informationUnit 2 Boolean Algebra
Unit 2 Boolean Algebra 2.1 Introduction We will use variables like x or y to represent inputs and outputs (I/O) of a switching circuit. Since most switching circuits are 2 state devices (having only 2
More informationCourse 311: Abstract Algebra Academic year
Course 311: Abstract Algebra Academic year 2007-08 D. R. Wilkins Copyright c David R. Wilkins 1997 2007 Contents 1 Topics in Group Theory 1 1.1 Groups............................... 1 1.2 Examples of Groups.......................
More informationMAL TSEV CONSTRAINTS MADE SIMPLE
Electronic Colloquium on Computational Complexity, Report No. 97 (2004) MAL TSEV CONSTRAINTS MADE SIMPLE Departament de Tecnologia, Universitat Pompeu Fabra Estació de França, Passeig de la circumval.lació,
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
More informationarxiv: v2 [math.gt] 16 Jul 2017
QUASI-TRIVIAL QUANDLES AND BIQUANDLES, COCYCLE ENHANCEMENTS AND LINK-HOMOTOPY OF PRETZEL LINKS MOHAMED ELHAMDADI, MINGHUI LIU, AND SAM NELSON ariv:1704.01224v2 [math.gt] 16 Jul 2017 ABSTRACT. We investigate
More information(i) By Corollary 1.3 (a) on P. 88, we know that the predicate. Q(x, y, z) S 1 (x, (z) 1, y, (z) 2 )
COMPUTABILITY: ANSWERS TO SOME EXERCISES IN CHAPTER 5 AND 6 5.1.5, P. 90. 1. This exercise is important for several reasons. For example, it tells us that taking inverses is an effect operation; see Example
More informationCommentationes Mathematicae Universitatis Carolinae
Commentationes Mathematicae Universitatis Carolinae Mark Greer; Lee Raney Moufang semidirect products of loops with groups and inverse property extensions Commentationes Mathematicae Universitatis Carolinae,
More informationChapter One. The Real Number System
Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and
More informationMath 210A: Algebra, Homework 6
Math 210A: Algebra, Homework 6 Ian Coley November 13, 2013 Problem 1 For every two nonzero integers n and m construct an exact sequence For which n and m is the sequence split? 0 Z/nZ Z/mnZ Z/mZ 0 Let
More informationarxiv: v2 [math.gr] 4 Jul 2018
CENTRALIZERS OF NORMAL SUBSYSTEMS REVISITED E. HENKE arxiv:1801.05256v2 [math.gr] 4 Jul 2018 Abstract. In this paper we revisit two concepts which were originally introduced by Aschbacher and are crucial
More information0.Axioms for the Integers 1
0.Axioms for the Integers 1 Number theory is the study of the arithmetical properties of the integers. You have been doing arithmetic with integers since you were a young child, but these mathematical
More informationOctonions. Robert A. Wilson. 24/11/08, QMUL, Pure Mathematics Seminar
Octonions Robert A. Wilson 4//08, QMUL, Pure Mathematics Seminar Introduction This is the second talk in a projected series of five. I shall try to make them as independent as possible, so that it will
More informationTutorial on Universal Algebra, Mal cev Conditions, and Finite Relational Structures: Lecture I
Tutorial on Universal Algebra, Mal cev Conditions, and Finite Relational Structures: Lecture I Ross Willard University of Waterloo, Canada BLAST 2010 Boulder, June 2010 Ross Willard (Waterloo) Universal
More informationDatalog and Constraint Satisfaction with Infinite Templates
Datalog and Constraint Satisfaction with Infinite Templates Manuel Bodirsky 1 and Víctor Dalmau 2 1 CNRS/LIX, École Polytechnique, bodirsky@lix.polytechnique.fr 2 Universitat Pompeu Fabra, victor.dalmau@upf.edu
More informationarxiv: v1 [math.gr] 23 Dec 2010
Automorphism groups of Quandles arxiv:1012.5291v1 [math.gr] 23 Dec 2010 Mohamed Elhamdadi University of South Florida Ricardo Restrepo Georgia Institute of Technology Abstract Jennifer MacQuarrie University
More information