63 research outputs found
The rank of the semigroup of transformations stabilising a partition of a finite set
Let be a partition of a finite set . We say that a full
transformation preserves (or stabilizes) the partition
if for all there exists such that
. Let denote the semigroup of all full
transformations of that preserve the partition .
In 2005 Huisheng found an upper bound for the minimum size of the generating
sets of , when 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 , when
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
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
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 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 , 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
elements (if the clone of \A does not contain any constant operations) or
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 , the monoid of
partial transformations on , the monoid of endomorphisms of a free -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.Comment: To appear in Linear Algebra and its Application
Orbits of primitive k-homogenous groups on (N − k)-partitions with applications to semigroups
© 2018 American Mathematical Society. The purpose of this paper is to advance our knowledge of two of the most classic and popular topics in transformation semigroups: automorphisms and the size of minimal generating sets. In order to do this, we examine the k-homogeneous permutation groups (those which act transitively on the subsets of size k of their domain X) where |X| = n and k < n/2. In the process we obtain, for k-homogeneous groups, results on the minimum numbers of generators, the numbers of orbits on k-partitions, and their normalizers in the symmetric group. As a sample result, we show that every finite 2-homogeneous group is 2-generated. Underlying our investigations on automorphisms of transformation semigroups is the following conjecture: If a transformation semigroup S contains singular maps and its group of units is a primitive group G of permutations, then its automorphisms are all induced (under conjugation) by the elements in the normalizer of G in the symmetric group. For the special case that S contains all constant maps, this conjecture was proved correct more than 40 years ago. In this paper, we prove that the conjecture also holds for the case of semigroups containing a map of rank 3 or less. The effort in establishing this result suggests that further improvements might be a great challenge. This problem and several additional ones on permutation groups, transformation semigroups, and computational algebra are proposed at the end of the paper
Supernilpotence prevents dualizability
We address the question of the dualizability of nilpotent Mal’cev algebras, showing that nilpotent finite Mal’cev algebras with a nonabelian supernilpotent congruence are inherently nondualizable. In particular, finite nilpotent nonabelian Mal’cev algebras of finite type are nondualizable 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 nonabelian, but dualizable. To our knowledge this is the first construction of a nonabelian nilpotent dualizable algebra. It has the curious property that all its nonabelian finitary reducts with group operation are nondualizable. 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
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 of finite automatic algebras that are alternately dualizable and
non-dualizable
- …