Related papers: Endomorphisms of semigroups of monotone transforma…
We study the homology of pointed sets over a partially commutative monoid.
We investigate the question as to when the members of a finite regular semigroup may be permuted in such a way that each member is mapped to one of its inverses. In general this is not possible. However we reformulate the problem in terms…
Given a finite nonabelian semisimple group $G$, we describe those groups that have the same holomorph as $G$, that is, those regular subgroups $N\simeq G$ of $S(G)$, the group of permutations on the set $G$, such that…
The main result of this paper is the construction of a trace and a trace pairing for endomorphisms satisfying suitable conditions in a monoidal category. This construction is a common generalization of the trace for endomorphisms of…
We study the semigroup $\overline{\boldsymbol{End}}(\boldsymbol{B}_{\omega}^{\mathscr{F}^2})$ of all endomorphisms of the bicyclic extension $\boldsymbol{B}_{\omega}^{\mathscr{F}^2}$ with the two-element family $\mathscr{F}^2$ of inductive…
In this paper, we study the atomic structure of Puiseux monoids generated by monotone sequences. To understand this atomic structure, it is often useful to know whether the monoid has a bounded generating set. We provide necessary and…
We classify all functions which, when applied term by term, leave invariant the sequences of moments of positive measures on the real line. Rather unexpectedly, these functions are built of absolutely monotonic components, or reflections of…
Permutation polynomials have been a subject of study for a long time and have applications in many areas of science and engineering. However, only a small number of specific classes of permutation polynomials are described in the literature…
We construct a category equivalent to the category $\mathbf{Mon}$ of monoids and monoid homomorphisms, based on categories with strict factorization systems. This equivalence is then extended to the category $\mathbf{Mon_s}$ of unital…
A representation theorem is proved for De Morgan monoids that are (i) semilinear, i.e., subdirect products of totally ordered algebras, and (ii) negatively generated, i.e., generated by lower bounds of the neutral element. Using this…
We give a complete classification of homomorphisms from the braid group on $n$ strands to the braid group on $2n$ strands when $n$ is at least 5. We also classify endomorphisms of the braid group on 4 strands, as well as homomorphisms from…
In this paper we give an algebraic characterization of assemblies in terms of bands of groups. We also consider substructures and homomorphisms of assemblies. We give many examples and counterexamples.
All isolated, completely isolated, and nilpotent subsemigroups in the semigroup $\IS$ of all injective partial transformations of an $n$-element set, considered as a semigroup with a sandwich multiplication are described.
For a finite field k and a triple of integers g \ge r \ge s \ge 0, we count the number of semilinear endomorphisms of a g-dimensional k-vector space which have rank r and stable rank s. Such endomorphisms show up naturally in the…
We provide a variant of Baer's theorem about isomorphism of endomorphism rings of vector spaces over division rings, where the full endomorphism rings are replaced by some subrings of finitary maps.
For any class $\mathcal{C}$ of bipartite graphs, we define quasi-$\cal C$ to be the class of all graphs $G$ such that every bipartition of $G$ belongs to $\cal C$. This definition is motivated by a generalisation of the switch Markov chain…
Structures of commuting semigroups of isometries under certain additional assumptions like double commutativity or dual double commutativity are found.
Endomorphisms of the measure algebra of commutative hypergroups are investigated. We focus on derivations and higher order derivations which are closely related to moment function sequences of higher rank. We describe the exact connection…
We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks…
We define the affinization of an arbitrary monoidal category $\mathcal{C}$, corresponding to the category of $\mathcal{C}$-diagrams on the cylinder. We also give an alternative characterization in terms of adjoining dot generators to…