arXiv subjects

Wolfram Bentz

Publications and source records attributed to Wolfram Bentz.

At least 19 recordsLinked to original sources

arXiv2026

Complete Mappings of Semigroups

A complete mapping of a semigroup $S$ is a bijection $α\colon S\to S$ such that the map $θ\colon S\to S$ defined by $xθ=x\cdot xα$ 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

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↗

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↗

arXiv2022

CREAM: a Package to Compute [Auto, Endo, Iso, Mono, Epi]-morphisms, Congruences, Divisors and More for Algebras of Type $(2^n,1^n)$

The CREAM GAP package computes automorphisms, congruences, endomorphisms and subalgebras of algebras with an arbitrary number of binary and unary operations; it also decides if between two such algebras there exists a monomorphism, an epimorphism, an isomorphism or if one is a divisor of the other. Thus it finds those objects for almost all algebras used in practice (groups, quasigroups in their various signatures, semigroups possibly with many unary operations, fields, semi-rings, quandles, logic algebras, etc). As a one-size-fits-all package, it only relies on universal algebra theorems, without taking advantage of specific theorems about, eg, groups or semigroups to reduce the search space. Canon and Holt produced very fast code to compute automorphisms of groups that outperform CREAM on orders larger than 128. Similarly, Mitchell et al. take advantage of deep theorems to compute automorphisms and congruences of completely 0-simple semigroups in a very efficient manner. However these domains (groups of order above 128 and completely 0-simple semigroups) are among the very few examples of GAP code faster than our general purpose package CREAM. For the overwhelming majority of other classes of algebras, either ours is the first code computing the above mentioned objects, or the existing algorithms are outperformed by CREAM, in some cases by several orders of magnitude. To get this performance, CREAM uses a mixture of universal algebra algorithms together with GAP coupled with artificial intelligence theorem proving tools (AITP) and very delicate C implementations. As an example of the latter, we re-implement Freese's very clever algorithm for computing congruences in universal algebras, in a way that outperforms all other known implementations.

math.GR↗

arXiv2019

A Transversal Property for Permutation Groups Motivated by Partial Transformations

In this paper we introduce the definition of $(k,l)$-universal transversal property, which is a refinement of the definition of $k$-universal transversal property, which in turn is a refinement of the classic definition of $k$-homogeneity for permutation groups. In particular, a group possesses the $(2,n)$-universal transversal property if and only if it is primitive; it possesses the $(2,2)$-universal transversal property if and only if it is $2$-homogeneous. Up to a few undecided cases, we give a classification of groups satisfying the $(k,l)$-universal transversal property, for $k\ge 3$. Then we apply this result for studying regular semigroups of partial transformations.

math.GR↗

arXiv2019

Primitive Permutation Groups and Strongly Factorizable Transformation Semigroups

Let $Ω$ be a finite set and $T(Ω)$ be the full transformation monoid on $Ω$. The rank of a transformation $t\in T(Ω)$ is the natural number $|Ωt|$. Given $A\subseteq T(Ω)$, denote by $\langle A\rangle$ the semigroup generated by $A$. Let $k$ be a fixed natural number such that $2\le k\le |Ω|$. In the first part of this paper we (almost) classify the permutation groups $G$ on $Ω$ such that for all rank $k$ transformation $t\in T(Ω)$, every element in $S_t:=\langle G,t\rangle$ can be written as a product $eg$, where $e^2=e\in S_t$ and $g\in G$. In the second part we prove, among other results, that if $S\le T(Ω)$ and $G$ is the normalizer of $S$ in the symmetric group on $Ω$, then the semigroup $SG$ is regular if and only if $S$ is regular. (Recall that a semigroup $S$ is regular if for all $s\in S$ there exists $s'\in S$ such that $s=ss's$.) The paper ends with a list of problems.

math.GR↗

arXiv2019

Independence algebras, basis algebras and the distributivity condition

Stable basis algebras were introduced by Fountain and Gould and developed in a series of articles. They form a class of universal algebras, extending that of independence algebras. If a stable basis algebra $\mathbb{B}$ of finite rank satisfies the distributivity condition (a condition satisfied by all the previously known examples), it is a reduct of an independence algebra $\mathbb{A}$. Our first aim is to give an example of an independence algebra not satisfying the distributivity condition. Gould showed that if a stable basis algebra $\mathbb{B}$ with the distributivity condition has finite rank, then so does the independence algebra $\mathbb{A}$ of which it is a reduct, and in this case the endomorphism monoid End$(\mathbb{B})$ of $\mathbb{B}$ is a left order in the endomorphism monoid End$(\mathbb{A})$ of $\mathbb{A}$. We complete the picture by determining when End$(\mathbb{B})$ is a right, and hence a two-sided, order in End$(\mathbb{A})$. In fact (for rank at least 2), this happens precisely when every element of End$(\mathbb{A})$ can be written as $α^\sharpβ$ where $α,β\in$ End$(\mathbb{B})$, $α^\sharp$ is the inverse of $α$ in a subgroup of End$(\mathbb{A})$ and $α$ and $β$ have the same kernel. This is equivalent to End$(\mathbb{B})$ being a special kind of left order in End$(\mathbb{A})$ known as straight.

math.RA↗

arXiv2018

The existential transversal property: a generalization of homogeneity and its impact on semigroups

Let $G$ be a permutation group of degree $n$, and $k$ a positive integer with $k\le n$. We say that $G$ has the $k$-existential property, or $k$-et for short, if there exists a $k$-subset $A$ of the domain $Ω$ such that, for any $k$-partition $\mathcal{P}$ of $Ω$, there exists $g\in G$ mapping $A$ to a transversal (a section) for $\mathcal{P}$. This property is a substantial weakening of the $k$-universal transversal property, or $k$-ut, investigated by the first and third author, which required this condition to hold for all $k$-subsets $A$ of the domain. Our first task in this paper is to investigate the $k$-et property and to decide which groups satisfy it. For example, we show that, for $8\le k\le n/2$, the only groups with $k$-et are the symmetric and alternating groups; this is best possible since the Mathieu group $M_{24}$ has $7$-et. We determine all groups with $k$-et for $4\le k\le n/2$, up to some unresolved cases for $k=4,5$, and describe the property for $k=2,3$ in permutation group language. In the previous work, the results were applied to semigroups, in particular, to the question of when the semigroup $\langle G,t\rangle$ is regular, where $t$ is a map of rank $k$ (with $k<n/2$); this turned out to be equivalent to the $k$-ut property. The question investigated here is when there is a $k$-subset $A$ of the domain such that $\langle G, t\rangle$ is regular for all maps $t$ with image $A$. This turns out to be more delicate; the $k$-et property (with $A$ as witnessing set) is a necessary condition, and the combination of $k$-et and $(k-1)$-ut is sufficient, but the truth lies somewhere between. Given the knowledge that a group under consideration has the necessary condition of $k$-et, we solve the regularity question for $k\le n/2$ except for one sporadic group.

math.GR↗

arXiv2016

Optimal Packings of 22 and 33 Unit Squares in a Square

Let $s(n)$ be the side length of the smallest square into which $n$ non-overlapping unit squares can be packed. In 2010, the author showed that $s(13)=4$ and $s(46)=7$. Together with the result $s(6)=3$ by Keaney and Shiu, these results strongly suggest that $s(m^2-3)=m$ for $m\ge 3$, in particular for the values $m=5,6$, which correspond to cases that lie in between the previous results. In this article we show that indeed $s(m^2-3)=m$ for $m=5,6$, implying that the most efficient packings of 22 and 33 squares are the trivial ones. To achieve our results, we modify the well-known method of sets of unavoidable points by replacing them with continuously varying families of such sets.

math.CO↗

arXiv2016

Congruences on Direct Products of Transformation and Matrix Monoids

Malcev described the congruences of the monoid $T_n$ of all full transformations on a finite set $X_n=\{1, \dots,n\}$. Since then, congruences have been characterized in various other monoids of (partial) transformations on $X_n$, such as the symmetric inverse monoid $In_n$ of all injective partial transformations, or the monoid $PT_n$ of all partial transformations. The first aim of this paper is to describe the congruences of the direct products $Q_m\times P_n$, where $Q$ and $P$ belong to $\{T, PT,In\}$. Malcev also provided a similar description of the congruences on the multiplicative monoid $F_n$ of all $n\times n$ matrices with entries in a field $F$, our second aim is provide a description of the principal congruences of $F_m \times F_n$. The paper finishes with some comments on the congruences of products of more than two transformation semigroups, and a fairly large number of open problems.

math.GR↗

arXiv2015

Primitive groups and synchronization

Let $Ω$ be a set of cardinality $n$, $G$ a permutation group on $Ω$, and $f:Ω\toΩ$ a map which is not a permutation. We say that $G$ \emph{synchronizes} $f$ if the transformation semigroup $\langle G,f\rangle$ contains a constant map, and that $G$ is a \emph{synchronizing group} if $G$ synchronizes \emph{every} non-permutation. A synchronizing group is necessarily primitive, but there are primitive groups that are not synchronizing. Every non-synchronizing primitive group fails to synchronize at least one uniform transformation (that is, transformation whose kernel has parts of equal size), and it has previously been conjectured that a primitive group synchronizes every non-uniform transformation. The first goal of this paper is to prove that this conjecture is false, by exhibiting primitive groups that fail to synchronize specific non-uniform transformations of ranks $5$ and $6$. In addition we produce graphs whose automorphism groups have approximately $\sqrt{n}$ \emph{non-synchronizing ranks}, thus refuting another conjecture on the number of non-synchronizing ranks of a primitive group. The second goal of this paper is to extend the spectrum of ranks for which it is known that primitive groups synchronize every non-uniform transformation of that rank. It has previously been shown that a primitive group of degree $n$ synchronizes every non-uniform transformation of rank $n-1$ and $n-2$, and here this is extended to $n-3$ and $n-4$. Determining the exact spectrum of ranks for which there exist non-uniform transformations not synchronized by some primitive group is just one of several natural, but possibly difficult, problems on automata, primitive groups, graphs and computational algebra arising from this work; these are outlined in the final section.

math.GR↗

arXiv2015

Finite Abelian algebras are fully dualizable

We show that every finite Abelian algebra A from congruence-permutable varieties admits a full duality. In the process, we prove that A also allows a strong duality, and that the duality may be induced by a dualizing structure of finite type. We give an explicit bound on the arities of the partial and total operations appearing in the dualizing structure. In addition, we show that the enriched partial hom-clone of A is finitely generated as a clone.

math.RA↗

arXiv2014

The Largest Subsemilattices of the Endomorphism Monoid of an Independence Algebra

An algebra $\A$ is said to be an independence algebra if it is a matroid algebra and every map $\al:X\to A$, defined on a basis $X$ of $\A$, can be extended to an endomorphism of $\A$. These algebras are particularly well behaved generalizations of vector spaces, and hence they naturally appear in several branches of mathematics such as model theory, group theory, and semigroup theory. It is well known that matroid algebras have a well defined notion of dimension. Let $\A$ be any independence algebra of finite dimension $n$, with at least two elements. Denote by $\End(\A)$ the monoid of endomorphisms of $\A$. We prove that a largest subsemilattice of $\End(\A)$ has either $2^{n-1}$ elements (if the clone of $\A$ does not contain any constant operations) or $2^n$ elements (if the clone of $\A$ contains constant operations). As corollaries, we obtain formulas for the size of the largest subsemilattices of: some variants of the monoid of linear operators of a finite-dimensional vector space, the monoid of full transformations on a finite set $X$, the monoid of partial transformations on $X$, the monoid of endomorphisms of a free $G$-set with a finite set of free generators, among others. The paper ends with a relatively large number of problems that might attract attention of experts in linear algebra, ring theory, extremal combinatorics, group theory, semigroup theory, universal algebraic geometry, and universal algebra.

math.GR↗

arXiv2014

The rank of the semigroup of transformations stabilising a partition of a finite set

Let $\mathcal{P}$ be a partition of a finite set $X$. We say that a full transformation $f:X\to X$ preserves (or stabilizes) the partition $\mathcal{P}$ if for all $P\in \mathcal{P}$ there exists $Q\in \mathcal{P}$ such that $Pf\subseteq Q$. Let $T(X,\mathcal{P})$ denote the semigroup of all full transformations of $X$ that preserve the partition $\mathcal{P}$. In 2005 Huisheng found an upper bound for the minimum size of the generating sets of $T(X,\mathcal{P})$, when $\mathcal{P}$ is a partition in which all of its parts have the same size. In addition, Huisheng conjectured that his bound was exact. In 2009 the first and last authors used representation theory to completely solve Hisheng's conjecture. The goal of this paper is to solve the much more complex problem of finding the minimum size of the generating sets of $T(X,\mathcal{P})$, when $\mathcal{P}$ is an arbitrary partition. Again we use representation theory to find the minimum number of elements needed to generate the wreath product of finitely many symmetric groups, and then use this result to solve the problem. The paper ends with a number of problems for experts in group and semigroup theories.

math.GR↗

arXiv2012

The modularity conjecture holds for linear idempotent varieties

The "Modularity Conjecture" is the assertion that the join of two nonmodular varieties is nonmodular. We establish the veracity of this conjecture for the case of linear idempotent varieties. We also establish analogous results concerning $n$-permutability for some $n$, and the satisfaction of nontrivial congruence identities. Our theorems require a technical result about the equational theory of linear varieties, which might be of independent interest.

math.RA↗

arXiv2012

Supernilpotence prevents dualizability

We address the question of the dualizability of nilpotent Mal'cev algebras, showing that nilpotent finite Mal'cev algebras with a non-abelian supernilpotent congruence are inherently non-dualizable. In particular, finite nilpotent non-abelian Mal'cev algebras of finite type are non-dualizable if they are direct products of algebras of prime power order. We show that these results cannot be generalized to nilpotent algebras by giving an example of a group expansion of infinite type that is nilpotent and non-abelian, but dualizable. To our knowledge this is the first construction of a non-abelian nilpotent dualizable algebra. It has the curious property that all its non-abelian finitary reducts with group operation are non-dualizable. We were able to prove dualizability by utilizing a new clone theoretic approach developed by Davey, Pitkethly, and Willard. Our results suggest that supernilpotence plays an important role in characterizing dualizability among Mal'cev algebras.

math.RA↗

arXiv2012

Dualizability of automatic algebras

We make a start on one of George McNulty's Dozen Easy Problems: "Which finite automatic algebras are dualizable?" We give some necessary and some sufficient conditions for dualizability. For example, we prove that a finite automatic algebra is dualizable if its letters act as an abelian group of permutations on its states. To illustrate the potential difficulty of the general problem, we exhibit an infinite ascending chain $\mathbf A_1 \le \mathbf A_2 \le \mathbf A_3 \le ...b$ of finite automatic algebras that are alternately dualizable and non-dualizable.

math.RA↗

arXiv2012

The Commuting Graph of the Symmetric Inverse Semigroup

The commuting graph of a finite non-commutative semigroup $S$, denoted $\cg(S)$, is a simple graph whose vertices are the non-central elements of $S$ and two distinct vertices $x,y$ are adjacent if $xy=yx$. Let $\mi(X)$ be the symmetric inverse semigroup of partial injective transformations on a finite set $X$. The semigroup $\mi(X)$ has the symmetric group $\sym(X)$ of permutations on $X$ as its group of units. In 1989, Burns and Goldsmith determined the clique number of the commuting graph of $\sym(X)$. In 2008, Iranmanesh and Jafarzadeh found an upper bound of the diameter of $\cg(\sym(X))$, and in 2011, Doluzan and Oblak claimed (but their proof has a GAP) that this upper bound is in fact the exact value. The goal of this paper is to begin the study of the commuting graph of the symmetric inverse semigroup $\mi(X)$. We calculate the clique number of $\cg(\mi(X))$, the diameters of the commuting graphs of the proper ideals of $\mi(X)$, and the diameter of $\cg(\mi(X))$ when $|X|$ is even or a power of an odd prime. We show that when $|X|$ is odd and divisible by at least two primes, then the diameter of $\cg(\mi(X))$ is either 4 or 5. In the process, we obtain several results about semigroups, such as a description of all commutative subsemigroups of $\mi(X)$ of maximum order, and analogous results for commutative inverse and commutative nilpotent subsemigroups of $\mi(X)$. The paper closes with a number of problems for experts in combinatorics and in group or semigroup theory.

math.CO↗