arXiv subjects
Publications and source records attributed to Michael Kinyon.
Antilattices $(S;\lor, \land)$ for which the Green's equivalences $\mathcal L_{(\lor)}$, $\mathcal R_{(\lor)}$, $\mathcal L_{(\land)}$ and $\mathcal R_{(\land)}$ are all congruences of the entire antilattice are studied and enumerated.
Wolfgang Rump showed that there is a one-to-one correspondence between nondegenerate involutive set-theoretic solutions of the Yang-Baxter equation and binary algebras in which all left translations $L_x$ are bijections, the squaring map is a bijection, and the identity $(xy)(xz) = (yx)(yz)$ holds. We call these algebras \emph{rumples} in analogy with quandles, another class of binary algebras giving solutions of the Yang-Baxter equation. We focus on latin rumples, that is, on rumples in which all right translations are bijections as well. We prove that an affine latin rumple of order $n$ exists if and only if $n=p_1^{p_1 k_1}\cdots p_m^{p_m k_m}$ for some distinct primes $p_i$ and positive integers $k_i$. A large class of affine solutions is obtained from nonsingular near-circulant matrices $A$, $B$ satisfying $[A,B]=A^2$. We characterize affine latin rumples as those latin rumples for which the displacement group generated by $L_x L_y\inv$ is abelian and normal in the group generated by all translations. We develop the extension theory of rumples sufficiently to obtain examples of latin rumples that are not affine, not even isotopic to a group. Finally, we investigate latin rumples in which the dual identity $(zx)(yx) = (zy)(xy)$ holds as well, and we show, among other results, that the generators $L_x L_y\inv$ of their displacement group have order dividing four.
The class of nonassociative right hoops, or narhoops for short, is defined as a subclass of right-residuated magmas, and is shown to be a variety. These algebras generalize both right quasigroups and right hoops, and we characterize the subvarieties in which the operation $x\sqcap y=(x / y)y$ is associative and/or commutative. Narhoops with a left unit are proved to have a top element if and only if $\sqcap$ is commutative, and their congruences are determined by the equivalence class of the left unit. We also show that the four identities defining narhoops are independent.
In a group $G$, elements $a$ and $b$ are conjugate if there exists $g\in G$ such that $g^{-1} ag=b$. This conjugacy relation, which plays an important role in group theory, can be extended in a natural way to inverse semigroups: for elements $a$ and $b$ in an inverse semigroup $S$, $a$ is conjugate to $b$, which we will write as $a\sim_{\mathrm{i}} b$, if there exists $g\in S^1$ such that $g^{-1} ag=b$ and $gbg^{-1} =a$. The purpose of this paper is to study the conjugacy $\sim_{\mathrm{i}}$ in several classes of inverse semigroups: symmetric inverse semigroups, free inverse semigroups, McAllister $P$-semigroups, factorizable inverse monoids, Clifford semigroups, the bicyclic monoid and stable inverse semigroups.
The proofs first generated by automated theorem provers are far from optimal by any measure of simplicity. In this paper I describe a technique for simplifying automated proofs. Hopefully this discussion will stimulate interest in the larger, still open, question of what reasonable measures of proof simplicity might be.
In this note we prove a selection of commutativity theorems for various classes of semigroups. For instance, if in a separative or completely regular semigroup $S$ we have $x^p y^p = y^p x^p$ and $x^q y^q = y^q x^q$ for all $x,y\in S$ where $p$ and $q$ are relatively prime, then $S$ is commutative. In a separative or inverse semigroup $S$, if there exist three consecutive integers $i$ such that $(xy)^i = x^i y^i$ for all $x,y\in S$, then $S$ is commutative. Finally, if $S$ is a separative or inverse semigroup satisfying $(xy)^3=x^3y^3$ for all $x,y\in S$, and if the cubing map $x\mapsto x^3$ is injective, then $S$ is commutative.
There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by $\sim_p$, $\sim_o$, and $\sim_c$) in certain classes of finitely presented monoids. We will show that in the class of polycyclic monoids, $p$-conjugacy is "almost" transitive, $\sim_c$ is strictly included in $\sim_p$, and the $p$- and $c$-conjugacy problems are decidable with linear compexity. For other classes of monoids, the situation is more complicated. We show that there exists a monoid $M$ defined by a finite complete presentation such that the $c$-conjugacy problem for $M$ is undecidable, and that for finitely presented monoids, the $c$-conjugacy problem and the word problem are independent, as are the $c$-conjugacy and $p$-conjugacy problems.
Right Bol loops are loops satisfying the identity $((zx)y)x = z((xy)x)$, and right Bruck loops are right Bol loops satisfying the identity $(xy)^{-1} = x^{-1}y^{-1}$. Let $p$ and $q$ be odd primes such that $p>q$. Advancing the research program of Niederreiter and Robinson from $1981$, we classify right Bol loops of order $pq$. When $q$ does not divide $p^2-1$, the only right Bol loop of order $pq$ is the cyclic group of order $pq$. When $q$ divides $p^2-1$, there are precisely $(p-q+4)/2$ right Bol loops of order $pq$ up to isomorphism, including a unique nonassociative right Bruck loop $B_{p,q}$ of order $pq$. Let $Q$ be a nonassociative right Bol loop of order $pq$. We prove that the right nucleus of $Q$ is trivial, the left nucleus of $Q$ is normal and is equal to the unique subloop of order $p$ in $Q$, and the right multiplication group of $Q$ has order $p^2q$ or $p^3q$. When $Q=B_{p,q}$, the right multiplication group of $Q$ is isomorphic to the semidirect product of $\mathbb{Z}_p\times \mathbb{Z}_p$ with $\mathbb{Z}_q$. Finally, we offer computational results as to the number of right Bol loops of order $pq$ up to isotopy.
The action of any group on itself by conjugation and the corresponding conjugacy relation play an important role in group theory. There have been many attempts to find notions of conjugacy in semigroups that would be useful in special classes of semigroups occurring in various areas of mathematics, such as semigroups of matrices, operator and topological semigroups, free semigroups, transition monoids for automata, semigroups given by presentations with prescribed properties, monoids of graph endomorphisms, etc. In this paper we study four notions of conjugacy for semigroups, their interconnections, similarities and dissimilarities. They appeared originally in various different settings (automata, representation theory, presentations or transformation semigroups). Here we study them in maximum generality. The paper ends with a large list of open problems.
We describe a large-scale project in applied automated deduction concerned with the following problem of considerable interest in loop theory: If $Q$ is a loop with commuting inner mappings, does it follow that $Q$ modulo its center is a group and $Q$ modulo its nucleus is an abelian group? This problem has been answered affirmatively in several varieties of loops. The solution usually involves sophisticated techniques of automated deduction, and the resulting derivations are very long, often with no higher-level human proofs available.
We prove that if the squaring map in the factor loop of a Moufang loop $Q$ over its nucleus is surjective, then every half-isomorphism of $Q$ onto a Moufang loop is either an isomorphism or an anti-isomorphism. This generalizes all earlier results in this vein.
It was shown by van Rees \cite{vR} that a latin square of order $n$ has at most $n^2(n-1)/18$ latin subsquares of order $3$. He conjectured that this bound is only achieved if $n$ is a power of $3$. We show that it can only be achieved if $n\equiv3\bmod6$. We also state several conditions that are equivalent to achieving the van Rees bound. One of these is that the Cayley table of a loop achieves the van Rees bound if and only if every loop isotope has exponent $3$. We call such loops \emph{van Rees loops} and show that they form an equationally defined variety. We also show that (1) In a van Rees loop, any subloop of index 3 is normal, (2) There are exactly 6 nonassociative van Rees loops of order $27$ with a non-trivial nucleus and at least 1 with all nuclei trivial, (3) Every commutative van Rees loop has the weak inverse property and (4) For each van Rees loop there is an associated family of Steiner quasigroups.
A celebrated result of J. Thompson says that if a finite group $G$ has a fixed-point-free automorphism of prime order, then $G$ is nilpotent. The main purpose of this note is to extend this result to finite inverse semigroups. An earlier related result of B. H. Neumann says that a uniquely 2-divisible group with a fixed-point-free automorphism of order 2 is abelian. We similarly extend this result to uniquely 2-divisible inverse semigroups.
Distributive skew lattices satisfying $x\wedge (y\vee z)\wedge x = (x\wedge y\wedge x) \vee (x\wedge z\wedge x)$ and its dual are studied, along with the larger class of linearly distributive skew lattices, whose totally preordered subalgebras are distributive. Linear distributivity is characterized in terms of the behavior of the natural partial order between comparable $\DD$-classes. This leads to a second characterization in terms of strictly categorical skew lattices. Criteria are given for both types of skew lattices to be distributive.
Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most skew lattices of interest are categorical, not all are. They are characterized by a countable family of forbidden subalgebras. We also consider the subclass of strictly categorical skew lattices.
An open problem in the theory of inverse semigroups was whether the variety of such semigroups, when viewed as algebras with a binary operation and a unary operation, is 2-based, that is, has a base for its identities consisting of 2 independent axioms. In this note, we announce the affirmative solution to this problem: the identities \[ \quad x(x'x) = x \qquad \quad x (x' (y (y' ((z u)' w')'))) = y (y' (x (x' ((w z) u)))) \] form a base for inverse semigroups where ${}'$ turns out to be the natural inverse operation. We recount here the history of the problem including our previous efforts to find a 2-base using automated deduction and the method that finally worked. We describe our efforts to simplify the proof using \textsc{Prover9}, present the simplified proof itself and conclude with some open problems.
Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes, for instance, groups and commutative Moufang loops. We study uniquely 2-divisible automorphic loops, particularly automorphic loops of odd order, from the point of view of the associated Bruck loops (motivated by Glauberman's work on uniquely 2-divisible Moufang loops) and the associated Lie rings (motivated by a construction of Wright). We prove that every automorphic loop $Q$ of odd order is solvable, contains an element of order $p$ for every prime $p$ dividing $|Q|$, and $|S|$ divides $|Q|$ for every subloop $S$ of $Q$. There are no finite simple nonassociative commutative automorphic loops, and there are no finite simple nonassociative automorphic loops of order less than 2500. We show that if $Q$ is a finite simple nonassociative automorphic loop then the socle of the multiplication group of $Q$ is not regular. The existence of a finite simple nonassociative automorphic loop remains open. Let $p$ be an odd prime. Automorphic loops of order $p$ or $p^2$ are groups, but there exist nonassociative automorphic loops of order $p^3$, some with trivial nucleus (center) and of exponent $p$. We construct nonassociative "dihedral" automorphic loops of order $2n$ for every $n>2$, and show that there are precisely $p-2$ nonassociative automorphic loops of order $2p$, all of them dihedral.
We prove that every finite, commutative automorphic loop is solvable. We also prove that every finite, automorphic 2-loop is solvable. The main idea of the proof is to associate a simple Lie algebra of characteristic 2 to a hypothetical finite simple commutative automorphic loop. The "crust of a thin sandwich" theorem of Zel'manov and Kostrikin leads to a contradiction.