arXiv subjects

Olexandr Ganyushkin

Publications and source records attributed to Olexandr Ganyushkin.

5 recordsLinked to original sources

arXiv2011

On Kiselman quotients of 0-Hecke monoids

Combining the definition of 0-Hecke monoids with that of Kiselman semigroups, we define what we call Kiselman quotients of 0-Hecke monoids associated with simply laced Dynkin diagrams. We classify these monoids up to isomorphism, determine their idempotents and show that they are $\mathcal{J}$-trivial. For type $A$ we show that Catalan numbers appear as the maximal cardinality of our monoids, in which case the corresponding monoid is isomorphic to the monoid of all order-preserving and order-decreasing total transformations on a finite chain. We construct various representations of these monoids by matrices, total transformations and binary relations. Motivated by these results, with a mixed graph we associate a monoid, which we call a Hecke-Kiselman monoid, and classify such monoids up to isomorphism. Both Kiselman semigroups and Kiselman quotients of 0-Hecke monoids are natural examples of Hecke-Kiselman monoids.

math.GR↗

arXiv2007

On the irreducible representations of a finite semigroup

Work of Clifford, Munn and Ponizovski{\uı} parameterized the irreducible representations of a finite semigroup in terms of the irreducible representations of its maximal subgroups. Explicit constructions of the irreducible representations were later obtained independently by Rhodes and Zalcstein and by Lallement and Petrich. All of these approaches make use of Rees's theorem characterizing 0-simple semigroups up to isomorphism. Here we provide a short modern proof of the Clifford-Munn-Ponizovski{\uı} result based on a lemma of J. A. Green, which allows us to circumvent the theory of 0-simple semigroups. A novelty of this approach is that it works over any base ring.

math.RT↗

arXiv2005

Combinatorics and distributions of partial injections

We obtain several combinatorial results about chains, cycles and orbits of the elements of the symmetric inverse semigroup $\IS_n$ and the set $T_n$ of nilpotent elements in $\IS_n$. We also get some estimates for the growth of $|\IS_n|$ and $|T_n|$, and study random products of elements from $\IS_n$.

math.CO↗

arXiv2005

On nilpotent subsemigroups in some matrix semigroups

We describe maximal nilpotent subsemigroups of a given nilpotency class in the semigroup $Ω_n$ of all $n\times n$ real matrices with non-negative coefficients and the semigroup $\mathbf{D}_n$ of all doubly stochastic real matrices.

math.GR↗

arXiv2005

On classification of maximal nilpotent subsemigroups

We develop a general approach to the study of maximal nilpotent subsemigroups of finite semigroups. This approach can be used to recover many known classifications of maximal nilpotent subsemigroups, in particular, for the symmetric inverse semigroup, the symmetric semigroup, and the factor power of the symmetric group. We also apply this approach to obtain a classification of maximal nilpotent subsemigroups in the semigroup of binary relations and in certain 0-simple finite semigroups.

math.GR↗