MLQ
2002
13 years 4 months ago
2002
A modal logic is called invariant if for all automorphisms of NExt K, () = . An invariant logic is therefore uniquely determined by its surrounding in the lattice. It will be est...
IJAC
2007
13 years 4 months ago
2007
Let K x, y be the free associative algebra of rank 2 over an algebraically closed constructive field of any characteristic. We present an algorithm which decides whether or not tw...
JCT
2008
13 years 4 months ago
2008
A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all t...
ARSCOM
2006
13 years 4 months ago
2006
Automorphisms of Steiner 2-designs S(2, 4, 37) are studied and used to find many new examples. Some of the constructed designs have S(2, 3, 9) subdesigns, closing the last gap in t...