DeepAI AI Chat
Log In Sign Up

Word problems in Elliott monoids

by   Daniele Mundici, et al.

Algorithmic issues concerning Elliott local semigroups are seldom considered in the literature, although these combinatorial structures completely classify AF algebras. In general, the addition operation of an Elliott local semigroup is partial, but for every AF algebra B whose Murray-von Neumann order of projections is a lattice, this operation is uniquely extendible to the addition of an involutive monoid E( B). Let M_1 be the Farey AF algebra introduced by the present author in 1988 and rediscovered by F. Boca in 2008. The freeness properties of the involutive monoid E( M_1) yield a natural word problem for every AF algebra B with singly generated E( B), because B is automatically a quotient of M_1. Given two formulas ϕ and ψ in the language of involutive monoids, the problem asks to decide whether ϕ and ψ code the same equivalence of projections of B. This mimics the classical definition of the word problem of a group presented by generators and relations. We show that the word problem of M_1 is solvable in polynomial time, and so is the word problem of the Behnke-Leptin algebras A_n,k, and of the Effros-Shen algebras F_θ, for θ∈ [0,1]∖ Q a real algebraic number, or θ = 1/e. We construct a quotient of M_1 having a Gödel incomplete word problem, and show that no primitive quotient of M_1 is Gödel incomplete.


page 1

page 2

page 3

page 4


On Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

We present a quasilinear time algorithm to decide the word problem on a ...

Deciding the existence of quasi weak near unanimity terms in finite algebras

We show that for a fixed positive integer k one can efficiently decide i...

The power word problem

In this work we introduce a new succinct variant of the word problem in ...

Polytime reductions of AF-algebraic problems

We assess the computational complexity of several decision problems conc...

Some relations on prefix reversal generators of the symmetric and hyperoctahedral group

The pancake problem is concerned with sorting a permutation (a stack of ...

Edmonds' problem and the membership problem for orbit semigroups of quiver representations

A central problem in algebraic complexity, posed by J. Edmonds, asks to ...

Existence of cube terms in finite finitely generated clones

We study the problem of whether a given finite clone generated by finite...