Atlas home || Conferences | Abstracts | about Atlas

65th Workshop on General Algebra, 18th Conference for Young Algebraists
March 21-23, 2003
University of Potsdam
Potsdam, Germany

Organizers
Klaus Denecke, Jörg Koppitz

View Abstracts
Conference Homepage

On the scales of computability potentials of n-element unars
by
Sergey Zhurkov
Novosibirsk State Technical University

In [1] there was given the definition of the scale < CTn; <= > of computability potentials of n-element algebras. It determines what computability potential has an arbitrary n-element universal algebra. In [2]-[3] we present some results concerning the structure of these scales - a number of its atoms, coatoms, the length of the scale < CTn; <= > . Also we considered the problem of inserting the lattice into the scale and the problem of scale diagram planarity.

Let CTn1 be the set of computability potentials of n-element unar algebras. We call the partially ordered set < CTn1; <= > the scale of computability potentials of n-element unars.

We present the following results for the scale < CTn1; <= > :

Theorem 1: a). A number of coatoms of the scale < CTn1; <= > is equal to d(n)+n-1 where d(n) is a number of prime divisors of n except 1.

b). A number of atoms of the scale < CTn1; <= > is equal to D(1)+...+D(n)+T1n-1+T2n-2+...+Tn-11 where D(i) is a number of divisors of i except 1; Tij - a number of representations of i as sum of not more than j non-zero natural numbers.

Theorem 2: For n >= 3 the scale < CTn1; <= > is not up or down semilattice.

Theorem 3: For any m < n the scale < CTm1; <= > is a retract for the scale < CTn1; <= > .

Theorem 3': The scale < CTn1; <= > is a retract for the scale < CTn; <= > .

Theorem 4: For n >= 3 the scale < CTn1; <= > can't be represented as a planar graph.

Also we have found the structure of the scales < CT21; <= > and < CT31; <= > . The following statement takes place:

Statement: Any 2-element unar is conditionally rationally equivalent to one algebra from 4 pairwise conditionally rationally non-equivalent algebras B1, ..., B4. Any 3-element unar is conditionally rationally equivalent to one algebra from 14 pairwise conditionally rationally non-equivalent algebras A1, ..., A14.

[1] A.G.Pinus, S.V.Zhurkov. On the scales of computability potentials of universal algebras. // Contributions to Galois Connections, Potsdam, 2001 (in print).

[2] A.G.Pinus, S.V.Zhurkov. Some remarks on the scales of computability potentials of n-element algebras. // Algebra and Model Theory-3, Novosibirsk State Technical University, 2001, p.107-113.

[3] A.G.Pinus, S.V.Zhurkov. On the length of the scale of computability potentials of n-element algebras. // Siberian Mathematical Journal, 2002, vol.43, No.4, p.858-863.

Date received: January 17, 2003


Copyright © 2003 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cake-19.