DOI QR코드

DOI QR Code

The Monoid of Linear Hypersubstitutions

  • Changphas, Thawhat (Department of Mathematics, Faculty of Science, Khon Kaen University) ;
  • Pibaljommee, Bundit (Department of Mathematics, Faculty of Science, Khon Kaen University) ;
  • Denecke, Klaus (Department of Mathematics, Faculty of Science, Khon Kaen University)
  • Received : 2018.08.22
  • Accepted : 2018.12.19
  • Published : 2019.12.23

Abstract

A term is called linear if each variable which occurs in the term, occurs only once. A hypersubstitution is said to be linear if it maps any operation symbol to a linear term of the same arity. Linear hypersubstitutions have some importance in Theoretical Computer Science since they preserve recognizability [7]. We show that the collection of all linear hypersubstitutions forms a monoid. Linear hypersubstitutions are used to define linear hyperidentities. The set of all linear term operations of a given algebra forms with respect to certain superposition operations a function algebra. Hypersubstitutions define endomorphisms on this function algebra.

Keywords

References

  1. M. N. Bleicher, H. Schneider, R. L. Wilson, Permanence of identities on algebras, Algebra Universalis, 3(1973), 72-93. https://doi.org/10.1007/BF02945106
  2. P. Burmeister, A model theoretic oriented approach to partial algebras. Introduction to theory and application of partial algebras Part I, Mathematical Research 32, Akademie-Verlag, Berlin, 1986.
  3. I. Chajda, G. Czedli, R. Halas, Tolerances as images of congruences in varieties defined by linear identities, Algebra Universalis, 69(2013), 167-169. https://doi.org/10.1007/s00012-013-0219-2
  4. M. Couceiro, E. Lehtonen, Galois theory for sets of operations closed under permutation, cylindrification and composition, Algebra Universalis, 67(2012), 273-297. https://doi.org/10.1007/s00012-012-0184-1
  5. K. Denecke, S. L. Wismath, Hyperidentities and clones, Gordon and Breach Science Publishers, Amsterdam, 2000.
  6. S. L. Wismath, The monoid of hypersubstitutions of type (n), Southeast Asian Bull. Math., 24(1)(2000), 115-128. https://doi.org/10.1007/s10012-000-0115-5
  7. F. Gecseg, M. Steinby, Tree automata, Akademiai Kiado, Budapest, 1984.
  8. J. Koppitz, K. Denecke, M-solid Varieties of algebras, Advances in Mathematics 10, Springer, New York, 2006.
  9. A. Pilitowska, Linear identities in graph algebras, Comment. Math Univ. Carolin., 50(2009), 11-24.
  10. A. I. Mal'cev, Iterative Algebras and Post's Varieties, Algebra Logic, 5(2)(1966), 5-24.
  11. M. Reichel, Bihomomorphisms and hyperidentities, Dissertation, Universitat Potsdam, 1994.