Related papers: Answering Five Open Problems Involving Semigroup C…
We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…
A system $\mathcal M$ of equivalence relations on a set $E$ is \emph{semirigid} if only the identity and constant functions preserve all members of $\mathcal M$. We construct semirigid systems of three equivalence relations. Our…
The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
An irreducible norm closed semigroup of complex matrices is simultaneously similar to a semigroup of partial isometries if and only if (a) the norms of all nonzero members of it are uniformly bounded above and below, and (b) its idempotents…
A classical result about unit equations says that if $\Gamma_1$ and $\Gamma_2$ are finitely generated subgroups of $\mathbb C^\times$, then the equation $x+y=1$ has only finitely many solutions with $x\in\Gamma_1$ and $y\in \Gamma_2$. We…
Let $\lambda=(\lambda_1,\lambda_2,...)$ be a \emph{partition} of $n$, a sequence of positive integers in non-increasing order with sum $n$. Let $\Omega:=\{1,...,n\}$. An ordered partition $P=(A_1,A_2,...)$ of $\Omega$ has \emph{type}…
Let B be a sigma-unital C*-algebra. We show that every strongly continuous E_0-semigroup on the algebra of adjointable operators on a full Hilbert B-module E gives rise to a full continuous product system of correspondences over B. We show…
A binary relation on a finite set is called a Hall relation if it contains a permutation of the set. Under the usual relational product, Hall relations form a semigroup which is known to be a block-group, that is, a semigroup with at most…
We study quasi-semisimple elements of disconnected reductive algebraic groups over an algebraically closed field. We describe their centralizers, define isolated and quasi-isolated quasi-semisimple elements and classify their conjugacy…
When a semigroup has a unary operation, it is possible to define two binary operations, namely, left and right division. In addition it is well known that groups can be defined in terms of those two divisions. The aim of this paper is to…
The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…
We study a family of equivalence relations on $S_n$, the group of permutations on $n$ letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
In this note, we determine the finite groups whose poset of conjugacy classes of subgroups has breaking points. This leads to a new characterization of the generalized quaternion $2$-groups. A generalization of this property is also…
We show that the number of numerical semigroups with multiplicity three, four or five and fixed genus is increasing as a function in the genus. To this end we use the Kunz polytope for these multiplicities. Counting numerical semigroups…
We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…
We prove that every finitely generated residually finite group $G$ can be embedded in a finitely generated branch group $\Gamma$ such that two elements in $G$ are conjugate in $G$ if and only if they are conjugate in $\Gamma$. As an…
We formulate some problems and conjectures about semigroups of rational functions under composition. The considered problems arise in different contexts, but most of them are united by a certain relationship to the concept of amenability.
It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…