Approaches to tiling semigroups
|
|
- Baldwin Dean
- 5 years ago
- Views:
Transcription
1 Nick Gilbert Heriot-Watt University, Edinburgh (joint work with Erzsi Dombi)
2 Periodic tilings
3 Non-periodic tilings Ulrich Kortenkamp: Paving the Alexanderplatz
4 Tilings of R n A tile in R n is a connected bounded subset t that is the closure of its interior, with a colour assigned from a set Σ. A tiling T of R n is a union of tiles meeting only at their boundaries. We always assume there are only finitely many different types of tiles: type equivalence up to Σ-preserving translation in R n. One tile type and one colour give a vanilla tiling of R n. A marked pattern in T is a finite connected collection of tiles in T, with two chosen distinguished tiles, the in-tile and the out tile (possibly equal) up to equivalence under translation.
5 History Johannes Kellendonk (1997): intro tiling semigroups Kellendonk & Mark Lawson (2000): general theory Yongwen Zhu (2002): algebraic properties Lawson (2004): specific theory for one-dimensional case Alan Forrest, John Hunton & Kellendonk ( ): cohomological invariants Don McAlister & Filipa Soares ( ) Erzsi Dombi & NDG ( )
6 The tiling semigroup tiling T has tiling semigroup S(T ), with 0 S(T ), non-zero elements are marked patterns, multiply P, Q by matching out-tile of P with in-tile of Q: if resultant overlap matches, and then if P Q is a pattern, PQ = P Q marked at the in-tile of P and the out-tile of Q. Non-matching = PQ = 0. Three possible reasons for PQ = 0: in- and out- tiles don t match, rest of overlap doesn t match, P Q isn t a pattern in T
7 Multiplication in S(T )
8 Basic properties of tiling semigroups idempotent in-tile = out-tile tiling semigroups are inverse: get P 1 by switching the inand out- tiles tiling semigroups are combinatorial, completely semisimple, E unitary inverse semigroups. natural partial order is reverse inclusion of marked patterns: P Q P Q as marked patterns so big patterns are below small ones in the natural partial order.
9 One dimensional tilings Fix a finite alphabet A = {a 1,..., a n } (n 2 most of the time). We can identify a one dimensional tiling as a bi-infinite string over A: T = a i 2 a i 1 a i0 a i1 a i2 Language L(T ) is the set of finite substrings of T L(T ) is factorial closed under substrings A marked pattern is now a word in L(T ) with distinguished inand out- letters à and b
10 The free monogenic inverse monoid denote by FIM 1 tiling semigroup of 1-diml vanilla tiling (with 0 removed) elements are marked strings on a single letter t multiply by matching out- and in- markers and superposing strings strings always match, and ť = 1 gap between in- and out- letter is a hom to Z Give coords in Z 3 : t p t p+1 t 1 `t 0 t 1 t r t q (p, q, r)
11 A presentation for S(T ) Let T be a one-dimensional tiling with alphabet A = {a 1,..., a n }. Theorem (McAlister-Soares 2006) S(T ) is generated by the single-tile idempotents ǎ i and the two-tile patterns t ij = à i á j, with defining relations ǎ i 2 = ǎ i, ǎ i ǎ j = 0, ǎ i t ij = t ij = t ij ǎ j t 1 ij t ik = 0 if j k, t ij t 1 kj = 0 if i k w = 0 if w has underlying word L(T )
12 Finite presentability Corollary S(T ) is a finitely presented inverse semigroup iff L(T ) is a locally testable language. Locally testable: determine membership by substrings of fixed length. Factorial and locally testable iff membership determined by finitely many forbidden subwords. More on finite presentability in dimension > 1 later.
13 F inverse 1-diml tiling semigroups are F inverse: each non-zero element is below a unique maximal element in the natural partial order: u û where û is the smallest substring of π carrying the in- and out- tiles of the marked string u. n-diml tiling semigroups (n > 1) need not be F inverse but more of this later.
14 Periodic tilings For detailed structure, simplify to periodic T : repeat fixed finite string ad bi-infinitum... Theorem (Dombi-NDG 2009) abcababcababcababcab The tiling semigroup of a one-dimensional periodic tiling with period of length m embeds into P(Z m ) 0 FIM 1, and the subsemigroups that arise are completely determined.
15 Embeds where? P(Z m ) power set of subsets of Z m FIM 1 free monogenic inverse monoid FIM 1 Z Z m so FIM 1 acts on P(Z m ) by translation P(Z m ) 0 FIM 1 is the semidirect product of monoids, with (, w) = 0 for all w FIM 1.
16 Sketch proof of the theorem T periodic with alphabet A = {t 1, t 2,..., t n } and period p 0 p 1 p m 1. Let π be a marked string in T of length l. Find coords τ(π) Z 3 just by counting (ignore spelling!) If l m, the in-letter is a unique p j and we set Ω(π) = {j}, but if l < m then the in-letter may be p j with j in some finite subset Ω(π). Theorem S(T ) embedded in P(Z m ) 0 FIM 1 by π (Ω(π), τ(π)).
17 Hypercubic tilings of R n McAlister-Soares 2009 tiling R n by (coloured) regular cubic lattice dual graph is the Cayley graph of Z n with coloured vertices tiling is replaced by colouring map χ : Z n Σ
18 Commutators are idempotents: In any tiling semigroup S(T ), u 1 v 1 uv is an idempotent: distance between in-tile and out-tile must be 0.
19 High dimensional, but vanilla For the n diml vanilla hypercubic tiling V: all patterns have non-zero product, so 0 is removable Set M = Inv a, b : (u 1 v 1 uv) 2 = u 1 v 1 uv(u, v {a ±, b ± } + Margolis-Meakin (1989): M is the universal E unitary inverse monoid with max group image Z 2 So have φ : M S(V) Theorem (McAlister-Soares 2009) ker φ is not finitely generated as a congruence on M.
20 LF Y-HNN Locally full Yamamura HNN-extensions of semilattices with zero: E a semilattice, 0 E: (e) = {x E : x e}, Family of isomorphisms φ i : (e i ) (f i ), S = Inv 0 E, t i : t i t 1 i Theorem (Yamamura 1999) = e i, t 1 i t i = f i, t 1 i xt i = xφ i (x e i ) E(S) = E, every subgroup of S is free, and S is (strongly) F inverse.
21 The path extension For an n-diml tiling T, non-zero elements of the path extension Π(T ) are pairs (P, u) where P S(T ) is a marked pattern, u is a reduced path in the dual graph of T from the in-tile to the out-tile of P Multiply componentwise: (P, u)(q, v) = (PQ, uv), where uv is the free reduction of the concatenation of u and v (ie we work in the fundamental groupoid of the dual graph).
22 Multiplication in Π(T )
23 Path extension covers... For any n-diml tiling T : Theorem (Dombi-NDG 2010?) The path extension is a strongly F inverse cover of S(T ) and is isomorphic to a locally full Yamamura HNN extension of E(S(T )). (If n = 1 the covering map is an isomorphism.)
24 Y-HNN ingredients E = E(S(T )) = E(Π(T )), Idempotents e i are all possible two-tile patterns with a fixed choice of marked tile, Idempotents f i choose the other tile, Isom φ : E i F i switches the marking.
Adequate and Ehresmann semigroups
Adequate and Ehresmann semigroups NSAC2013: June 8th, 2013, Novi Sad Victoria Gould University of York What is this talk about? Classes of semigroups with semilattices of idempotents inverse ample adequate
More informationValence automata over E-unitary inverse semigroups
Valence automata over E-unitary inverse semigroups Erzsi Dombi 30 May 2018 Outline Motivation Notation and introduction Valence automata Bicyclic and polycyclic monoids Motivation Chomsky-Schützenberger
More informationResearch Statement. MUHAMMAD INAM 1 of 5
MUHAMMAD INAM 1 of 5 Research Statement Preliminaries My primary research interests are in geometric inverse semigroup theory and its connections with other fields of mathematics. A semigroup M is called
More informationCombinatorial Methods in Study of Structure of Inverse Semigroups
Combinatorial Methods in Study of Structure of Inverse Semigroups Tatiana Jajcayová Comenius University Bratislava, Slovakia Graphs, Semigroups, and Semigroup Acts 2017, Berlin October 12, 2017 Presentations
More informationOverlapping tile automata:
Overlapping tile automata: towards a language theory of overlapping structures David Janin LaBRI, Université de Bordeaux Computer Science in Russia, Ekaterinburg, june 2013 1. From strings to overlapping
More informationCSA16: Embedding in factorisable restriction monoids
Embedding in factorisable restriction monoids Bolyai Institute University of Szeged International Conference on Semigroups and Automata Lisbon, 20 24 June, 2016 Restriction semigroups restriction (formerly
More informationThe kernel of a monoid morphism. Part I Kernels and extensions. Outline. Basic definitions. The kernel of a group morphism
Outline The kernel of a monoid morphism Jean-Éric Pin1 (1) Kernels and extensions (2) The synthesis theoem (3) The finite case (4) Group radical and effective characterization (5) The topological approach
More informationSYNTACTIC SEMIGROUP PROBLEM FOR THE SEMIGROUP REDUCTS OF AFFINE NEAR-SEMIRINGS OVER BRANDT SEMIGROUPS
SYNTACTIC SEMIGROUP PROBLEM FOR THE SEMIGROUP REDUCTS OF AFFINE NEAR-SEMIRINGS OVER BRANDT SEMIGROUPS JITENDER KUMAR AND K. V. KRISHNA Abstract. The syntactic semigroup problem is to decide whether a given
More informationF -inverse covers of E-unitary inverse monoids
F -inverse covers of E-unitary inverse monoids Outline of Ph.D. thesis Nóra Szakács Supervisor: Mária B. Szendrei Doctoral School of Mathematics and Computer Science University of Szeged 2016 1 1 Introduction
More informationarxiv: v1 [math.gr] 16 Aug 2016
CLOSED INVERSE SUBSEMIGROUPS OF GRAPH INVERSE SEMIGROUPS arxiv:1608.04538v1 [math.gr] 16 Aug 2016 AMAL ALALI & N.D. GILBERT School of Mathematical and Computer Sciences and the Maxwell Institute for the
More informationPseudo-finite monoids and semigroups
University of York NBSAN, 07-08 January 2018 Based on joint work with Victoria Gould and Dandan Yang Contents Definitions: what does it mean for a monoid to be pseudo-finite, or pseudo-generated by a finite
More informationOne Relation Semigroups
One Relation Semigroups Nik Ruskuc nik@mcs.st-and.ac.uk School of Mathematics and Statistics, NBSAN, York, 28 January 2009 Statement of the Problem Open Problem Is the word problem soluble for every semigroup
More informationAn Introduction to Thompson s Group V
An Introduction to Thompson s Group V John Fountain 9 March 2011 Properties 1. V contains every finite group 2. V is simple 3. V is finitely presented 4. V has type F P 5. V has solvable word problem 6.
More informationTightness and Inverse Semigroups
Tightness and Inverse Semigroups Allan Donsig University of Nebraska Lincoln April 14, 2012 This work is a) joint with David Milan, and b) in progress. Allan Donsig (UNL) Tightness and Inverse Semigroups
More informationOn the membership problem for pseudovarieties
On the membership problem for pseudovarieties K. Auinger NBSAN, Edinburgh, July 2014 All semigroups/monoids/categories are finite! A pseudovariety is a class of semigroups/monoids closed under P f, S and
More informationAttempt QUESTIONS 1 and 2, and THREE other questions. Do not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2016 17 SEMIGROUP THEORY MTHE6011A Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. Notes are not permitted
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 informationAttempt QUESTIONS 1 and 2, and THREE other questions. Do not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2016 17 SEMIGROUP THEORY WITH ADVANCED TOPICS MTHE7011A Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationCompletely regular semigroups and (Completely) (E, H E )-abundant semigroups (a.k.a. U-superabundant semigroups): Similarities and Contrasts
Completely regular semigroups and (Completely) (E, H E )-abundant semigroups (a.k.a. U-superabundant semigroups): Similarities and Contrasts Xavier MARY Université Paris-Ouest Nanterre-La Défense, Laboratoire
More informationENDS FOR MONOIDS AND SEMIGROUPS
ENDS FOR MONOIDS AND SEMIGROUPS DAVID A. JACKSON and VESNA KILIBARDA (May 22, 2008) Abstract We give a graph-theoretic definition for the number of ends of Cayley digraphs for finitely generated semigroups
More informationNOTES ON AUTOMATA. Date: April 29,
NOTES ON AUTOMATA 1. Monoids acting on sets We say that a monoid S with identity element ɛ acts on a set Q if q(st) = (qs)t and qɛ = q. As with groups, if we set s = t whenever qs = qt for all q Q, then
More informationCHAPTER 4. βs as a semigroup
CHAPTER 4 βs as a semigroup In this chapter, we assume that (S, ) is an arbitrary semigroup, equipped with the discrete topology. As explained in Chapter 3, we will consider S as a (dense ) subset of its
More informationMV-algebras and fuzzy topologies: Stone duality extended
MV-algebras and fuzzy topologies: Stone duality extended Dipartimento di Matematica Università di Salerno, Italy Algebra and Coalgebra meet Proof Theory Universität Bern April 27 29, 2011 Outline 1 MV-algebras
More informationSemigroup presentations via boundaries in Cayley graphs 1
Semigroup presentations via boundaries in Cayley graphs 1 Robert Gray University of Leeds BMC, Newcastle 2006 1 (Research conducted while I was a research student at the University of St Andrews, under
More informationERRATA: MODES, ROMANOWSKA & SMITH
ERRATA: MODES, ROMANOWSKA & SMITH Line 38 + 4: There is a function f : X Ω P(X) with xf = {x} for x in X and ωf = for ω in Ω. By the universality property (1.4.1) for (X Ω), the mapping f can be uniquely
More informationPermutation Groups and Transformation Semigroups Lecture 2: Semigroups
Permutation Groups and Transformation Semigroups Lecture 2: Semigroups Peter J. Cameron Permutation Groups summer school, Marienheide 18 22 September 2017 I am assuming that you know what a group is, but
More informationCartan MASAs and Exact Sequences of Inverse Semigroups
Cartan MASAs and Exact Sequences of Inverse Semigroups Adam H. Fuller (University of Nebraska - Lincoln) joint work with Allan P. Donsig and David R. Pitts NIFAS Nov. 2014, Des Moines, Iowa Cartan MASAs
More informationMAXIMAL ORDERS IN COMPLETELY 0-SIMPLE SEMIGROUPS
MAXIMAL ORDERS IN COMPLETELY 0-SIMPLE SEMIGROUPS John Fountain and Victoria Gould Department of Mathematics University of York Heslington York YO1 5DD, UK e-mail: jbf1@york.ac.uk varg1@york.ac.uk Abstract
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 informationSolving the word problem of the O Hare monoid far, far away from sweet home Chicago
Solving the word problem of the O Hare monoid far, far away from sweet home Chicago dockie@dmi.uns.ac.rs Department of Mathematics and Informatics, University of Novi Sad Winter One-Relator Workshop (WOW
More informationFiniteness conditions and index in semigroup theory
Finiteness conditions and index in semigroup theory Robert Gray University of Leeds Leeds, January 2007 Robert Gray (University of Leeds) 1 / 39 Outline 1 Motivation and background Finiteness conditions
More informationF. Blanchet-Sadri and F.D. Gaddis, "On a Product of Finite Monoids." Semigroup Forum, Vol. 57, 1998, pp DOI: 10.
On a Product of Finite Monoids By: F. Blanchet-Sadri and F. Dale Gaddis F. Blanchet-Sadri and F.D. Gaddis, "On a Product of Finite Monoids." Semigroup Forum, Vol. 57, 1998, pp 75-91. DOI: 10.1007/PL00005969
More informationON F -INVERSE COVERS OF FINITE-ABOVE INVERSE MONOIDS
ON F -INVERSE COVERS OF FINITE-ABOVE INVERSE MONOIDS NÓRA SZAKÁCS AND MÁRIA B. SZENDREI Abstract. Finite-above inverse monoids are a common generalization of finite inverse monoids and Margolis Meakin
More informationSEMIGROUP PRESENTATIONS FOR CONGRUENCES ON GROUPS
Bull. Korean Math. Soc. 50 (2013), No. 2, pp. 445 449 http://dx.doi.org/10.4134/bkms.2013.50.2.445 SEMIGROUP PRESENTATIONS FOR CONGRUENCES ON GROUPS Gonca Ayık and Basri Çalışkan Abstract. We consider
More informationMonoids of languages, monoids of reflexive. relations and ordered monoids. Ganna Kudryavtseva. June 22, 2010
June 22, 2010 J -trivial A monoid S is called J -trivial if the Green s relation J on it is the trivial relation, that is aj b implies a = b for any a, b S, or, equivalently all J -classes of S are one-element.
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 informationA four element semigroup that is inherently nonfinitely based?
A four element semigroup that is inherently nonfinitely based? Peter R. Jones Marquette University NBSAN Workshop, York, November 21, 2012 Finite basis properties A (finite) algebra A is finitely based
More informationThe structure of euclidean Artin groups
The structure of euclidean Artin groups Jon McCammond UC Santa Barbara Cortona Sept 2014 Coxeter groups The spherical and euclidean Coxeter groups are reflection groups that act geometrically on spheres
More informationDuality and Automata Theory
Duality and Automata Theory Mai Gehrke Université Paris VII and CNRS Joint work with Serge Grigorieff and Jean-Éric Pin Elements of automata theory A finite automaton a 1 2 b b a 3 a, b The states are
More informationMonoids and Their Cayley Graphs
Monoids and Their Cayley Graphs Nik Ruskuc nik@mcs.st-and.ac.uk School of Mathematics and Statistics, University of St Andrews NBGGT, Leeds, 30 April, 2008 Instead of an Apology Then, as for the geometrical
More informationRegular and synchronizing transformation monoids
Regular and synchronizing transformation monoids Peter J. Cameron NBSAN, York 23 November 2011 Mathematics may be defined as the subject in which we never know what we are talking about, nor whether what
More informationContinuous and Borel Dynamics of Countable Borel Equivalence Relations
Continuous and Borel Dynamics of Countable Borel Equivalence Relations S. Jackson (joint with S. Gao, E. Krohne, and B. Seward) Department of Mathematics University of North Texas June 9, 2015 BLAST 2015,
More informationOn divisors of pseudovarieties generated by some classes of full transformation semigroups
On divisors of pseudovarieties generated by some classes of full transformation semigroups Vítor H. Fernandes Departamento de Matemática Faculdade de Ciências e Tecnologia Universidade Nova de Lisboa Monte
More informationVarieties Generated by Certain Models of Reversible Finite Automata
Varieties Generated by Certain Models of Reversible Finite Automata Marats Golovkins 1 and Jean-Eric Pin 2 1 Institute of Mathematics and Computer Science, University of Latvia, Raiņa bulv. 29, Riga, Latvia
More informationThis Lecture will Cover...
Last Lecture Covered... DFAs, NFAs, -NFAs and the equivalence of the language classes they accept Last Lecture Covered... This Lecture will Cover... Introduction to regular expressions and regular languages
More informationAbstract Algebra II Groups ( )
Abstract Algebra II Groups ( ) Melchior Grützmann / melchiorgfreehostingcom/algebra October 15, 2012 Outline Group homomorphisms Free groups, free products, and presentations Free products ( ) Definition
More informationPolycyclic monoids and their generalisations
Heriot-Watt University Polycyclic monoids and their generalisations David G. Jones 30 th April 2011 Submitted for the degree of Doctor of Philosophy in Mathematics on completion of research in the Department
More informationExercises on chapter 1
Exercises on chapter 1 1. Let G be a group and H and K be subgroups. Let HK = {hk h H, k K}. (i) Prove that HK is a subgroup of G if and only if HK = KH. (ii) If either H or K is a normal subgroup of G
More information2. ETALE GROUPOIDS MARK V. LAWSON
2. ETALE GROUPOIDS MARK V. LAWSON Abstract. In this article, we define étale groupoids and describe some of their properties. 1. Generalities 1.1. Categories. A category is usually regarded as a category
More informationAperiodic languages and generalizations
Aperiodic languages and generalizations Lila Kari and Gabriel Thierrin Department of Mathematics University of Western Ontario London, Ontario, N6A 5B7 Canada June 18, 2010 Abstract For every integer k
More informationTHE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS
THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 Abstract. This paper is devoted to the semilattice ordered V-algebras of the form (A, Ω, +), where
More informationSEPARATING REGULAR LANGUAGES WITH FIRST-ORDER LOGIC
Logical Methods in Computer Science Vol. 12(1:5)2016, pp. 1 30 www.lmcs-online.org Submitted Jun. 4, 2014 Published Mar. 9, 2016 SEPARATING REGULAR LANGUAGES WITH FIRST-ORDER LOGIC THOMAS PLACE AND MARC
More informationALGEBRA EXERCISES, PhD EXAMINATION LEVEL
ALGEBRA EXERCISES, PhD EXAMINATION LEVEL 1. Suppose that G is a finite group. (a) Prove that if G is nilpotent, and H is any proper subgroup, then H is a proper subgroup of its normalizer. (b) Use (a)
More informationA DESCRIPTION OF INCIDENCE RINGS OF GROUP AUTOMATA
Contemporary Mathematics A DESCRIPTION OF INCIDENCE RINGS OF GROUP AUTOMATA A. V. KELAREV and D. S. PASSMAN Abstract. Group automata occur in the Krohn-Rhodes Decomposition Theorem and have been extensively
More informationCongruences on Inverse Semigroups using Kernel Normal System
(GLM) 1 (1) (2016) 11-22 (GLM) Website: http:///general-letters-in-mathematics/ Science Reflection Congruences on Inverse Semigroups using Kernel Normal System Laila M.Tunsi University of Tripoli, Department
More informationHNN-EXTENSIONS OF FINITE INVERSE SEMIGROUPS
POLITECNICO DI MILANO DEPARTMENT OF MATHEMATICS DOCTORAL PROGRAMME IN MATHEMATICAL MODELS AND METHODS IN ENGINEERING HNN-EXTENSIONS OF FINITE INVERSE SEMIGROUPS Doctoral Dissertation of: Mohammed Abu Ayyash
More informationAdvanced Automata Theory 9 Automatic Structures in General
Advanced Automata Theory 9 Automatic Structures in General Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Advanced Automata
More informationMöbius Functions and Semigroup Representation Theory
Möbius Functions and Semigroup Representation Theory December 31, 2007 Inverse Semigroups Just as groups abstract permutations, inverse semigroups abstract partial permutations. A semigroup S is an inverse
More informationResearch Article Tight Representations of 0-E-Unitary Inverse Semigroups
Abstract and Applied Analysis Volume 2011, Article ID 353584, 6 pages doi:10.1155/2011/353584 Research Article Tight Representations of 0-E-Unitary Inverse Semigroups Bahman Tabatabaie Shourijeh and Asghar
More informationRATIONAL MONOID AND SEMIGROUP AUTOMATA
RATIONAL MONOID AND SEMIGROUP AUTOMATA A thesis submitted to the University of Manchester for the degree of Doctor of Philosophy in the Faculty of Engineering and Physical Sciences 2010 Elaine L. Render
More informationOn the Singular Part of the Partition Monoid
On the Singular Part of the Partition Monoid James East School of Mathematics and Statistics, University of Sydney, New South Wales 2006, Australia December 10, 2009 Abstract We study the singular part
More informationJournal Algebra Discrete Math.
Algebra and Discrete Mathematics Number 4. (2005). pp. 28 35 c Journal Algebra and Discrete Mathematics RESEARCH ARTICLE Presentations and word problem for strong semilattices of semigroups Gonca Ayık,
More informationCONGRUENCES OF STRONGLY MORITA EQUIVALENT POSEMIGROUPS. 1. Introduction
CONGRUENCES OF STRONGLY MORITA EQUIVALENT POSEMIGROUPS T. TÄRGLA and V. LAAN Abstract. We prove that congruence lattices of strongly Morita equivalent posemigroups with common joint weak local units are
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationEKT of Some Wonderful Compactifications
EKT of Some Wonderful Compactifications and recent results on Complete Quadrics. (Based on joint works with Soumya Banerjee and Michael Joyce) Mahir Bilen Can April 16, 2016 Mahir Bilen Can EKT of Some
More informationIdentities in upper triangular tropical matrix semigroups and the bicyclic monoid
Identities in upper triangular tropical matrix semigroups and the bicyclic monoid Marianne Johnson (Joint work with Laure Daviaud and Mark Kambites) York Semigroup Seminar, May 2017 Semigroup identities
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 informationIdentities in upper triangular tropical matrix semigroups and the bicyclic monoid
Identities in upper triangular tropical matrix semigroups and the bicyclic monoid Marianne Johnson (University of Manchester) Joint work with Laure Daviaud and Mark Kambites AAA94 + NSAC 2017, 17th June
More informationBoundary Quotients of Semigroup C*-algebras
Boundary Quotients of Semigroup C*-algebras Charles Starling uottawa May 14, 2015 Charles Starling (uottawa) Boundary Quotients of Semigroup C*-algebras May 14, 2015 1 / 23 Overview P - left cancellative
More informationAn algebraic view of topological -machines
An algebraic view of topological -machines Luke Grecki Graduate Group in Applied Mathematics lgrecki@math.ucdavis.edu June 8, 2010 1 Contents 1 Semigroups 3 2 Semigroups of automata 4 3 -machine words
More informationOn a topological simple Warne extension of a semigroup
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 16, Number 2, 2012 Available online at www.math.ut.ee/acta/ On a topological simple Warne extension of a semigroup Iryna Fihel, Oleg
More informationEmbedding theorems for normal divisible residuated lattices
Embedding theorems for normal divisible residuated lattices Chapman University Department of Mathematics and Computer Science Orange, California University of Siena Department of Mathematics and Computer
More informationgroup Jean-Eric Pin and Christophe Reutenauer
A conjecture on the Hall topology for the free group Jean-Eric Pin and Christophe Reutenauer Abstract The Hall topology for the free group is the coarsest topology such that every group morphism from the
More informationTHE SEMIGROUP βs APPLICATIONS TO RAMSEY THEORY
THE SEMIGROUP βs If S is a discrete space, its Stone-Čech compactification βs can be described as the space of ultrafilters on S with the topology for which the sets of the form A = {p βs : A p}, where
More informationCONGRUENCES OF STRONGLY MORITA EQUIVALENT POSEMIGROUPS. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXXI, 2 (2012), pp. 247 254 247 CONGRUENCES OF STRONGLY MORITA EQUIVALENT POSEMIGROUPS T. TÄRGLA and V. LAAN Abstract. We prove that congruence lattices of strongly Morita
More informationFormal Languages 2: Group Theory
2: Group Theory Matilde Marcolli CS101: Mathematical and Computational Linguistics Winter 2015 Group G, with presentation G = X R (finitely presented) X (finite) set of generators x 1,..., x N R (finite)
More informationTwo-way automata and regular languages of overlapping tiles
Two-way automata and regular languages of overlapping tiles Anne Dicky, David Janin To cite this version: Anne Dicky, David Janin. Two-way automata and regular languages of overlapping tiles. Fundamenta
More informationA NOTE ON FREE QUANTUM GROUPS
A NOTE ON FREE QUANTUM GROUPS TEODOR BANICA Abstract. We study the free complexification operation for compact quantum groups, G G c. We prove that, with suitable definitions, this induces a one-to-one
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 informationDiscrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
More informationGROUPS AS GRAPHS. W. B. Vasantha Kandasamy Florentin Smarandache
GROUPS AS GRAPHS W. B. Vasantha Kandasamy Florentin Smarandache 009 GROUPS AS GRAPHS W. B. Vasantha Kandasamy e-mail: vasanthakandasamy@gmail.com web: http://mat.iitm.ac.in/~wbv www.vasantha.in Florentin
More informationVarieties Generated by Certain Models of Reversible Finite Automata
Varieties Generated by Certain Models of Reversible Finite Automata Marats Golovkins Faculty of Computing, University of Latvia, Raiņa bulv. 29, Riga LV-1459, Latvia marats at latnet dot lv Jean-Eric Pin
More informationPrimer of Quasivariety Lattices
A Kira Adaricheva, Jennifer Hyndman, J. B. Nation, Joy Nishida Hofstra University, UNBC, University of Hawai i Hofstra, October 2017 Backus International Airport Two problems of Birkhoff and Mal cev Describe
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More informationNeural Codes and Neural Rings: Topology and Algebraic Geometry
Neural Codes and Neural Rings: Topology and Algebraic Geometry Ma191b Winter 2017 Geometry of Neuroscience References for this lecture: Curto, Carina; Itskov, Vladimir; Veliz-Cuba, Alan; Youngs, Nora,
More informationACTING FREELY GABRIEL GASTER
ACTING FREELY GABRIEL GASTER 1. Preface This article is intended to present a combinatorial proof of Schreier s Theorem, that subgroups of free groups are free. While a one line proof exists using the
More informationVarieties of P -restriction semigroups
Varieties of P -restriction semigroups Peter R. Jones October 27, 2011 Abstract The restriction semigroups, in both their one-sided and two-sided versions, have arisen in various fashions, meriting study
More informationCANCELLATIVE AND MALCEV PRESENTATIONS FOR FINITE REES INDEX SUBSEMIGROUPS AND EXTENSIONS
J. Aust. Math. Soc. 84 (2008), 39 61 doi:10.1017/s1446788708000086 CANCELLATIVE AND MALCEV PRESENTATIONS FOR FINITE REES INDEX SUBSEMIGROUPS AND EXTENSIONS ALAN J. CAIN, EDMUND F. ROBERTSON and NIK RUŠKUC
More informationALGEBRAIC GROUPS J. WARNER
ALGEBRAIC GROUPS J. WARNER Let k be an algebraically closed field. varieties unless otherwise stated. 1. Definitions and Examples For simplicity we will work strictly with affine Definition 1.1. An algebraic
More informationCATEGORY THEORY. Cats have been around for 70 years. Eilenberg + Mac Lane =. Cats are about building bridges between different parts of maths.
CATEGORY THEORY PROFESSOR PETER JOHNSTONE Cats have been around for 70 years. Eilenberg + Mac Lane =. Cats are about building bridges between different parts of maths. Definition 1.1. A category C consists
More informationTopics in Representation Theory: Fourier Analysis and the Peter Weyl Theorem
Topics in Representation Theory: Fourier Analysis and the Peter Weyl Theorem 1 Fourier Analysis, a review We ll begin with a short review of simple facts about Fourier analysis, before going on to interpret
More informationSymbol Index Group GermAnal Ring AbMonoid
Symbol Index 409 Symbol Index Symbols of standard and uncontroversial usage are generally not included here. As in the word index, boldface page-numbers indicate pages where definitions are given. If a
More informationMath 210C. The representation ring
Math 210C. The representation ring 1. Introduction Let G be a nontrivial connected compact Lie group that is semisimple and simply connected (e.g., SU(n) for n 2, Sp(n) for n 1, or Spin(n) for n 3). Let
More informationIntro to Theory of Computation
Intro to Theory of Computation 1/19/2016 LECTURE 3 Last time: DFAs and NFAs Operations on languages Today: Nondeterminism Equivalence of NFAs and DFAs Closure properties of regular languages Sofya Raskhodnikova
More informationDuality in Logic. Duality in Logic. Lecture 2. Mai Gehrke. Université Paris 7 and CNRS. {ε} A ((ab) (ba) ) (ab) + (ba) +
Lecture 2 Mai Gehrke Université Paris 7 and CNRS A {ε} A ((ab) (ba) ) (ab) + (ba) + Further examples - revisited 1. Completeness of modal logic with respect to Kripke semantics was obtained via duality
More informationON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 4 (2004), #A21 ON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS Sergey Kitaev Department of Mathematics, University of Kentucky,
More informationPolynomial closure and unambiguous product
Polynomial closure and unambiguous product Jean-Eric Pin and Pascal Weil pin@litp.ibp.fr, weil@litp.ibp.fr 1 Introduction This paper is a contribution to the algebraic theory of recognizable languages,
More informationLearning Context Free Grammars with the Syntactic Concept Lattice
Learning Context Free Grammars with the Syntactic Concept Lattice Alexander Clark Department of Computer Science Royal Holloway, University of London alexc@cs.rhul.ac.uk ICGI, September 2010 Outline Introduction
More informationLarge subsets of semigroups
CHAPTER 8 Large subsets of semigroups In the van der Waerden theorem 7.5, we are given a finite colouring ω = A 1 A r of the commutative semigroup (ω, +); the remark 7.7(b) states that (at least) one of
More informationSubdirectly irreducible commutative idempotent semirings
Subdirectly irreducible commutative idempotent semirings Ivan Chajda Helmut Länger Palacký University Olomouc, Olomouc, Czech Republic, email: ivan.chajda@upol.cz Vienna University of Technology, Vienna,
More information