Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Planarity ranks of modular varieties of semigroups

Solomatin Denis Vladimirovich

Abstract

By the planarity rank of a semigroup variety we mean the largest number of generators of a free semigroup of a variety with respect to which the semigroup admits a planar Cayley graph. Since the time when L.M.Martynov formulated the problem of describing the planarity ranks of semigroup varieties, many specific results have been obtained in this direction. A modular variety of semigroups is a variety of semigroups with a modular lattice of subvarieties. In this paper, we calculate the exact values of the planarity ranks of an infinite countable set of all possible modular varieties of semigroups. It turns out that these values do not exceed 3. Machine calculations are mostly used in the proof. Prover9 and Mace4 are used to check the equalities of elements of free semigroups of varieties defined by a large number of identities. To prove the non-planarity of graphs, the Pontryagin-Kuratovsky criterion is used, and the Colin de Verdiere invariant is indirectly used to justify planarity.

Planarity ranks of modular varieties of semigroups

Abstract

By the planarity rank of a semigroup variety we mean the largest number of generators of a free semigroup of a variety with respect to which the semigroup admits a planar Cayley graph. Since the time when L.M.Martynov formulated the problem of describing the planarity ranks of semigroup varieties, many specific results have been obtained in this direction. A modular variety of semigroups is a variety of semigroups with a modular lattice of subvarieties. In this paper, we calculate the exact values of the planarity ranks of an infinite countable set of all possible modular varieties of semigroups. It turns out that these values do not exceed 3. Machine calculations are mostly used in the proof. Prover9 and Mace4 are used to check the equalities of elements of free semigroups of varieties defined by a large number of identities. To prove the non-planarity of graphs, the Pontryagin-Kuratovsky criterion is used, and the Colin de Verdiere invariant is indirectly used to justify planarity.
Paper Structure (3 sections, 2 theorems, 3 equations)

This paper contains 3 sections, 2 theorems, 3 equations.

Table of Contents

  1. Introduction
  2. Main Result
  3. Conclusion

Key Result

Lemma 1

A variety of semigroups is modular if and only if it satisfies one of the following systems of identities (where $n$ is a natural number): ($m1_n$) : $xy\ =\ {\left(xy\right)}^{n+1}\ $; ($m2_n$) : $xy\ =x^{n+1}y$, ${\left(xy\right)}^{n+1}=xy^{n+1}$, $xyzt=xyx^nzt$; ($m3_n$) : $xy=xy^{n+1}$, ${\left(

Theorems & Definitions (7)

  • Lemma 1: 1, Theorem 1 (equational version) as a result of 2
  • Definition 2
  • Definition 3
  • Definition 4
  • Definition 5
  • Definition 6
  • Theorem 7