Advertisement

A graphic theory of associativity and wordchain patterns

  • Dov Tamari
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 969)

Abstract

The problem of deciding whether a partial binary operation, a "bin", can be embedded in a semigroup is the associativity problem (for general bins). It is known that it is equivalent to the word problem for (semi)groups and thus unsolvable, even for the class of finite bins. This paper establishes a close association between bins and their wordchains and 3-connected 3-regular planar graphs, or, equivalently convex 3-regular polyhedral nets (skeletons). This permits a constructive approach revealing the combinatorial depth of the associativity problem in detail and leads to a naturally enumerable hierarchy of standard wordchain patterns, of universal bins, and of associative laws. Each bin is a superposition of homomorphic images, i.e. "colourings" of edges, of universal bins. One side result is a purely algebraic equivalent of the 4-colour-theorem. The obtained results open further ways for an efficient search by computer for simplest non-associativity contradictions. It is hoped that they lead to solutions of the associativity problem for further subclasses of bins, further insight into the structure of partial binary operations and of polyhedra and will yield precise measures of presentations for associative systems and their classifications.

Keywords

Word Problem Homomorphic Image Multiplication Table Semi Group Triangular Prism 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    C. Berge, Graphs and Hypergraphs. North Holland (2nd edition) 1976.Google Scholar
  2. 2.
    Paul W. Bunting, Jan van Leeuwen and Dov Tamari, Deciding Associativity for Partial Multiplication Tables of Order 3. Mathematics of Computation, 32 (1978), 593–605.MathSciNetzbMATHGoogle Scholar
  3. 3.
    Branko Grünbaum, Convex Polytopes. Interscience Publ.1967, Ch.13 and Table 1, p.424.Google Scholar
  4. 4.
    Danièle Huguet et Dov Tamari, La Structure Polyédrale des Complexes de Parenthésages. J. of Combinatorics, Information and System Sciences, 3 (1978), 69–81.MathSciNetzbMATHGoogle Scholar
  5. 5.
    Kevin E. Osondu, Symmetrisations of Semigroups. Semigroup Forum, 24 (1982), 67–75.MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Dov Tamari, The Associativity Problem for Monoids and the Word Problem for Semigroups. In "Word Problems", North Holland Publ.Co., Amsterdam 1973, 591–607.Google Scholar

Copyright information

© Springer-Verlag 1982

Authors and Affiliations

  • Dov Tamari
    • 1
  1. 1.New YorkUSA

Personalised recommendations