Related papers: Endomorphisms of semigroups of monotone transforma…
A monoid is aperiodic if all its subgroups are trivial. We completely classify all varieties of aperiodic monoids whose subvariety lattice is distributive.
We describe the endomorphisms of the direct product of two free groups of finite rank and obtain conditions for which the subgroup of fixed points is finitely generated and we do the same for periodic points. We also describe the…
Let $X$ be an arbitrary set and let $T(X)$ denote the full transformation monoid on $X$. We prove that an element of $T(X)$ is unit-regular if and only if it is semi-balanced. For infinite $X$, we discuss regularity of the submonoid of…
We characterize in terms of characteristic sequences the semigroups corresponding to branches at infinity of plane affine curves $\Gamma$ for which there exists a polynomial automorphism mapping $\Gamma$ onto the axis $x=0$.
Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…
We give an explicit description of the automorphism group of a product of complete toric varieties over an arbitrary field in terms of the respective automorphism groups of its components. More precisely, we prove that, up to permutation of…
In the present paper, we will study geometric properties of harmonic mappings whose analytic and co-analytic parts are (shifted) generated functions of completely monotone sequences.
It is shown that the category of \emph{semi-biproducts} of monoids is equivalent to the category of \emph{pseudo-actions}. A semi-biproduct of monoids is a new notion, obtained through generalizing a biproduct of commutative monoids. By…
We investigate the monoid of transformations that are induced by sequences of writing to and reading from a queue storage. We describe this monoid by means of a confluent and terminating semi-Thue system and study some of its basic…
We analyze the notions of monotonicity and complete monotonicity for Markov Chains in continuous-time, taking values in a finite partially ordered set. Similarly to what happens in discrete-time, the two notions are not equivalent. However,…
We extend Grood's tableau construction of irreducible representations of the rook monoid and Steinberg's analogous result for the full transformation monoid. Our approach is characteristic-free and applies to any submonoid $\mathcal{M}(n)$…
In this paper we prove that every automorphism of the semigroup of invertible matrices with nonnegative elements over a linearly oredered associative ring on some specially defined subgroup concides with the composition of an inner…
We define and study quantum permutations of infinite sets. This leads to discrete quantum groups which can be viewed as infinite variants of the quantum permutation groups introduced by Wang. More precisely, the resulting quantum groups…
Let $A$ be a finite dimensional algebra over an algebraically closed field $k$. We investigate the structure properties of the endomorphism algebras of semi-tilting $A$-modules, and prove that the endomorphism algebras arising from the…
We describe isomorphisms of groups of several periodic infinite matrices and isomorphisms of groups of invertible elements of unital locally matrix algebras.
We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…
We consider a few types of bounded homomorphisms on a topological group. These classes of bounded homomorphisms are, in a sense, weaker than the class of continuous homomorphisms. We show that with appropriate topologies each class of these…
We give a general constructive proof for hierarchical coordinatizations (Lagrange Decompositions) of permutation groups. The generalization originates from the investigation of how the subgroup chains of finite permutation groups yield…
We characterize all permutations which realize as the $z$-monodromies of faces in connected simple finite graphs embedded in surfaces whose duals are also simple.
This paper is a contribution to the theory of finite semigroups and their classification in pseudovarieties, which is motivated by its connections with computer science. The question addressed is what role can play the consideration of an…