Bilateral semidirect product decompositions of transformation monoids

In this paper we consider the monoid OR(n) of all full transformations on a chain with n elements that preserve or reverse the orientation, as well as its submonoids OD(n) of all order-preserving or order-reversing elements, OP(n) of all orientation-preserving elements and O(n) of all order-preserving elements. By making use of some well known presentations, we show that each of these four monoids is a quotient of a bilateral semidirectproduct of two of its remarkable submonoids.

On lattices from combinatorial game theory modularity and a representation theorem: finite case

We show that a self-generated set of combinatorial games, S. may not be hereditarily closed but, strong self-generation and hereditary closure are equivalent in the universe of short games. In [13], the question "Is there a set which will give a non-distributive but modular lattice?" appears. A useful necessary condition for the existence of a finite non-distributive modular L(S) is proved. We show the existence of S such that L(S) is modular and not distributive, exhibiting the first known example. More, we prove a Representation Theorem with Games that allows the generation of all finite lattices in game context. Finally, a computational tool for drawing lattices of games is presented. (C) 2014 Elsevier B.V. All rights reserved.

Spectral and weak polynomial completeness for the product of nonsingular matrices

Let F be a field with at least four elements. In this paper, we identify all the pairs (A, B) of n x n nonsingular matrices over F, satisfying the following property: for every monic polynomial f (x) = x(n) + a(n-1)x(n-1) +... + a(1)x + a(0) over F, with a root in F and a(0) = (-1)(n) det(AB), there are nonsingular matrices X, Y is an element of F-nxn such that XAX(-1)Y BY-1 has characteristic polynomial f (x).