arXiv subjects

Michael Kinyon

Publications and source records attributed to Michael Kinyon.

At least 19 recordsLinked to original sources

arXiv2026

Complete Mappings of Semigroups

A complete mapping of a semigroup $S$ is a bijection $\alpha\colon S\to S$ such that the map $\theta\colon S\to S$ defined by $x\theta=x\cdot x\alpha$ is also a bijection. Equivalently, it determines a transversal of the multiplication table of $S$. Complete mappings connect group theory, Latin squares, and cryptography, and their existence for finite groups was characterized by the resolution of the Hall--Paige conjecture. In this paper, we develop the corresponding theory for finite semigroups. We prove that every finite semigroup admitting a complete mapping is regular and that the problem reduces to principal factors. We classify the existence of a complete mapping in Rees matrix semigroups without zero, give a Hall-type criterion for Rees $0$-matrix semigroups over groups with complete mappings, and prove sufficient conditions for Rees $0$-matrix semigroups whose maximal subgroups do not have complete mappings. As the main application of the Rees $0$-matrix analysis, we show that $T_n$ has a complete mapping if and only if $n=1$ or $n\geq 4$. Equivalently, $T_n$ has a complete mapping if and only if the same holds for $S_n$. We prove that the full linear monoid of a finite-dimensional vector space has a complete mapping except in dimension $1$ over a field of odd order and in dimension $2$ over $\mathbb F_2$. We also prove that the partition monoid $\mathcal P_n$ has a complete mapping if and only if $n=1$ or $n\ge4$, and that every finite aperiodic regular $*$-semigroup has a complete mapping. As a consequence, the planar partition, Motzkin and Jones monoids have complete mappings. The paper concludes with open problems.

math.GR↗

arXiv2026

The Inverse Monoid of Partial Inner Automorphisms of a Semigroup

We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner automorphisms with a zero adjoined. We then describe this structure for completely simple semigroups, the full transformation monoid, and the endomorphism monoid of a finite $G$-set when $G$ is a finite abelian group. The paper ends with some open problems.

math.GR↗

arXiv2026

Rings with finitely many zero divisors

We give an elementary proof of a result which is not as well known as it should be: a ring with a specified finite number of zero divisors is finite, with a precise bound on its order.

math.RA↗

arXiv2026

Elementary proofs of ring commutativity theorems

Jacobson's commutativity theorem says that a ring is commutative if, for each $x$, $x^n = x$ for some $n > 1$. Herstein's generalization says that the condition can be weakened to $x^n-x$ being central. In both theorems, $n$ may depend on $x$. In this paper, in certain cases where $n$ is a fixed constant, we find equational proofs of each theorem. For the odd exponent cases $n = 2k+1$ of Jacobson's theorem, our main tool is a lemma stating that for each $x$, $x^k$ is central. For Herstein's theorem, we consider the cases $n=4$ and $n=8$, obtaining proofs with the assistance of the automated theorem prover Prover9.

math.RA↗

arXiv2025

Loops with squares in two nuclei

Although little can be gleaned about a loop with the property that its squares are, say, left nuclear ($xx\cdot yz = (xx\cdot y)z$), if its squares are also, say, middle nuclear ($(x\cdot yy)z = x(yy\cdot z)$), then the loop exhibits more structure than one might initially guess. Loops with squares in (at least) two nuclei include many well known classes of loops, such as C loops and extra loops, and not so well known classes such left C loops. In any loop with, say, left and middle nuclear squares, the intersection of the left and middle nuclei is a normal subloop; hence such a loop is simple if and only if it is a group or a simple unipotent loop. Loops in which squaring is a centralizing endomorphism have even more structure; they are power-associative, and a torsion loop in that class is a direct product of a loop of $2$-elements and a loop of elements of odd order.

math.GR↗

arXiv2025

Bol loops of order 27

We classify Bol loops of order $27$, using a combination of theoretical results and computer search. There are $15$ Bol loops of order $27$, including five groups. New constructions for the ten nonassociative Bol loops of order $27$ are given.

math.GR↗

arXiv2023

Loops with universal and semi-universal flexibility

We study loops which are universal (that is, isotopically invariant) with respect to the property of flexibility ($xy\cdot x = x\cdot yx$). We also weaken this to semi-universality, that is, loops in which every left and right isotope is flexible, but not necessarily every isotope. One of our main results is that universally flexible, inverse property loops are Moufang loops. On the other hand, semi-universally flexible, inverse property loops are diassociative. We also examine the relationship between universally flexible loops and middle Bol loops. The paper concludes with some open problems.

math.GR↗

arXiv2023

Conjugacy in Abstract Semigroups, Transformation and Diagram Monoids, and Conjugacy Growth

We study conjugacy relations on semigroups and monoids, focusing on the relation $a \cfn b$, defined by the existence of $g,h \in S^1$ such that $ag = gb$, $bh = ha$, $hag = b$, and $gbh = a$. This notion emerged as one that yields particularly elegant results. The interplay between $\cfn$ and other standard conjugacy relations is analyzed, and some results on special classes of abstract semigroups are established. We then specialize to the case of transformation semigroups. A complete classification of $\cfn$-classes is obtained for the full transformation monoid $\mathcal{T}_n$, the symmetric inverse monoid $\mathcal{I}_n$, and the endomorphism monoid of $G$-sets, among others. We also investigate the natural conjugacy in diagram semigroups, including the partition monoid, the Brauer monoid, and the partial Brauer monoid. Finally, we investigate the conjugacy growth function in polycyclic monoids and obtain a precise asymptotic estimate. The paper concludes with some open problems.

math.GR↗

arXiv2022

Regular Double $p$-Algebras: A converse to a Katri\v{n}\'{a}k's Theorem, and Applications

In 1973, Katri\v{n}\'{a}k proved that regular double $p$-algebras can be regarded as (regular) double Heyting algebras by ingeniously constructing binary terms for the Heying implication and its dual in terms of pseudocomplement and its dual. In this paper we prove a converse to the Katri\v{n}\'{a}k's theorem, in the sense that in the variety RDPCH of regular dually pseudocomplemented Heyting algebras, the implication operation $\to$ satisfies the Katri\v{n}\'{a}k's formula. As applications of this result together with the above-mentioned Katri\v{n}\'{a}k's theorem, we show that the varieties RDBLP, RDPCH, RPCH$^d$ and RDBLH of regular double $p$-algebras, regular dually pseudocomplemented Heyting algebras, regular pseudocomplemented dual Heyting algebras, and regular double Heyting algebras, respectively, are term-equivalent to each other and also that the varieties RDMP, RDMH, RDMDBLH, RDMDBLP of regular De Morgan $p$-algebras, regular De Morgan Heyting algebras, regular De Morgan double Heyting algebras, and regular De Morgan double $p$-algebras, respectively, are also term equivalent to each other. From these results and recent results of Adams, Sankappanavar and vaz de Carvalho, we deduce that the lattices of subvarieties of all these varieties have cardinality $2^{\aleph_0}$. We then define new logics, RDPCH, RPCHd, and RDMH, and show that they are algebraizable with RDPCH, RPCH$^d$ and RDMH, respectively as their equivalent algebraic semantics. It is also deduced that the lattices of extensions of all of the above mentioned logics have cardinality $2^{\aleph_0}$.

math.LO↗

arXiv2022

Abelianness and centrality in inverse semigroups

We adapt the abstract concepts of abelianness and centrality of universal algebra to the context of inverse semigroups. We characterize abelian and central congruences in terms of the corresponding congruence pairs. We relate centrality to conjugation in inverse semigroups. Subsequently we prove that solvable and nilpotent inverse semigroups are groups.

math.GR↗

arXiv2022

Varieties of Lazy Magmas Characterized by Forbidden Substructure Theorems

A magma (or groupoid) is a set with a binary operation $(A,f)$. Roughly speaking, a magma is said to be lazy if compositions such as $f(x,f(f(y,z),u))$ depend on at most two variables. Recently, Kaprinai, Machida and Waldhauser described the lattice of all the varieties of lazy groupoids. A forbidden structure theorem is one that charcaterizes a smaller class $A$ inside a larger class $B$ as all the elements in $B$ that avoid some substructures. For example, a lattice is distributive (smaller class $A$) if and only if it is a lattice (larger class $B$) and avoids the pentagon and the diamond. In this paper we provide a characterization of all pairs of lazy groupoid varieties $A\le B$ by forbidden substructure theorems. Some of the results are straightforward, but some other are very involved. All of these results and proofs were found using a computational tool that proves theorems of this type (for many different classes of relational algebras) and that we make available to every mathematician.

math.GR↗

arXiv2021

On elementary, odd, semimagic and other classes of antilattices

An \emph{antilattice} is an algebraic structure based on the same set of axioms as a lattice except that the two commutativity axioms for $\land$ and $\lor$ are replaced by anticommutative counterparts. In this paper we study certain classes of antilattices, including elementary (no nontrivial subantilattices), odd (no subantilattices of order $2$), simple (no nontrivial congruences) and irreducible (not expressible as a direct product). In the finite case, odd antilattices are the same as Leech's \emph{Latin} antilattices which arise from the construction of semimagic squares from pairs of orthogonal Latin squares.

math.RA↗

arXiv2021

Diagonal groups and arcs over groups

In an earlier paper by three of the present authors and Csaba Schneider, it was shown that, for $m\ge2$, a set of $m+1$ partitions of a set $Ω$, any $m$ of which are the minimal non-trivial elements of a Cartesian lattice, either form a Latin square (if $m=2$), or generate a join-semilattice of dimension $m$ associated with a diagonal group over a base group $G$. In this paper we investigate what happens if we have $m+r$ partitions with $r\geq 2$, any $m$ of which are minimal elements of a Cartesian lattice. If $m=2$, this is just a set of mutually orthogonal Latin squares. We consider the case where all these squares are isotopic to Cayley tables of groups, and give an example to show the groups need not be all isomorphic. For $m>2$, things are more restricted. Any $m+1$ of the partitions generate a join-semilattice admitting a diagonal group over a group $G$. It may be that the groups are all isomorphic, though we cannot prove this. Under an extra hypothesis, we show that $G$ must be abelian and must have three fixed-point-free automorphisms whose product is the identity. Under this hypothesis, such a structure gives an orthogonal array, and conversely in some cases. If the group is cyclic of prime order $p$, then the structure corresponds exactly to an arc of cardinality $m+r$ in the $(m-1)$-dimensional projective space over the field with $p$ elements, so all known results about arcs are applicable. More generally, arcs over a finite field of order $q$ give examples where $G$ is the elementary abelian group of order $q$. These examples can be lifted to non-elementary abelian groups using $p$-adic techniques.

math.CO↗

arXiv2020

Normality, nuclear squares and Osborn identities

Let $Q$ be a loop. If $S\leq Q$ is such that $φ(S) \subseteq S$ for each standard generator of $\mathrm{Inn}(Q)$, then $S$ does not have to be a normal subloop. In an LC loop the left and middle nucleus coincide and form a normal subloop. The identities of Osborn loops are obtained by applying the idea of nuclear identification, and various connections of Osborn loops to Moufang and CC loops are discussed. Every Osborn loop possesses a normal nucleus, and this nucleus coincides with the left, the right and the middle nucleus. Loops that are both Buchsteiner and Osborn are characterized as loops in which each square is in the nucleus.

math.GR↗

arXiv2020

Variants of epigroups and primary conjugacy

In a semigroup $S$ with fixed $c\in S$, one can construct a new semigroup $(S,\cdot_c)$ called a \emph{variant} by defining $x\cdot_c y:=xcy$. Elements $a,b\in S$ are \emph{primarily conjugate} if there exist $x,y\in S^1$ such that $a=xy, b=yx$. This coincides with the usual conjugacy in groups, but is not transitive in general semigroups. Araújo \emph{et al.} proved that transitivity holds in a variety $\mathcal{W}$ of epigroups containing all completely regular semigroups and their variants, and asked if transitivity holds for all variants of semigroups in $\mathcal{W}$. We answer this affirmatively as part of a study of varieties and variants of epigroups.

math.GR↗

arXiv2020

The solution of an open problem on semigroup inclusion classes

The semigroup inclusion class $\mathbf{I} = [xyxy = xy; xyz \in \{xywz, xuyz\}]$ is the union of two maximal subvarieties of $\mathbf{GRB} = [xyzxy=xy]$. Monzo ( arXiv:1411.4860 ) described the lattice of semigroup inclusion classes below $\mathbf{I}$ and asked if $\mathbf{I}$ is covered by $\mathbf{GRB}$. Our main result is a characterization of $\mathbf{I}$ which makes it easy to answer Monzo's question in the negative.

math.RA↗

arXiv2019

Regular Antilattices

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.

math.RA↗

arXiv2019

Involutive latin solutions of the Yang-Baxter equation

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.

math.GR↗