The algebra of adjacency patterns: Rees matrix semigroups with reversion

We establish a surprisingly close relationship between universal Horn classes of directed graphs and varieties generated by so-called adjacency semigroups which are Rees matrix semigroups over the trivial group with the unary operation of reversion. In particular, the lattice of subvarieties of the variety generated by adjacency semigroups that are regular unary semigroups is essentially the same as the lattice of universal Horn classes of reflexive directed graphs. A number of examples follow, including a limit variety of regular unary semigroups and finite unary semigroups with NP-hard variety membership problems.Comment: 30 pages, 9 figure

Iterative algorithm for reconstruction of entangled states

An iterative algorithm for the reconstruction of an unknown quantum state from the results of incompatible measurements is proposed. It consists of Expectation-Maximization step followed by a unitary transformation of the eigenbasis of the density matrix. The procedure has been applied to the reconstruction of the entangled pair of photons.Comment: 4 pages, no figures, some formulations changed, a minor mistake correcte