Related papers: Hecke-Kiselman Monoids of Small Cardinality
We investigate Cayley graphs of finite semigroups and monoids. First, we look at semigroup digraphs, i.e., directed Cayley graphs of semigroups, and give a Sabidussi-type characterization in the case of monoids. We then correct a proof of…
We exhibit explicit and easily realisable bijections between Hecke--Kiselman monoids of type $A_n$/$\widetilde{A}_n$; certain braid diagrams on the plane/cylinder; and couples of integer sequences of particular types. This yields a fast…
For integers $n\geq k\geq 1$, the Kneser graph $K(n,k)$ is the graph with vertex set $V=[n]^{(k)}$ and edge set $E=\{\{x,y\} \in V^{(2)}: x\cap y=\emptyset\}$. Chen proved that for $n\geq 3k$, Kneser graphs are Hamiltonian and later…
A monoid is said to be special if it admits a presentation in which all defining relations are of the form $w = 1$. Groups are familiar examples of special monoids. This article studies the geometric and structural properties of the Cayley…
Necessary and sufficient conditions are given for the endomorphism monoid of a profinite semigroup to be profinite. A similar result is established for the automorphism group.
A finitely generated commutative monoid is uniquely presented if it has only a minimal presentation. We give necessary and sufficient conditions for finitely generated, combinatorially finite, cancellative, commutative monoids to be…
Let $(R,m)$ be a Noetherian local ring of dimension $d$ and $K,Q$ be $m$-primary ideals in $R.$ In this paper we study the finiteness properties of the sets $\Lambda_i^K(R):=\{g_i^K(Q): Q$ is a parameter ideal of $R\},$ where $g_i^K(Q)$…
We present a method for proving that a semigroup is finitely based and find some new sufficient conditions under which a monoid is finitely based. As an application, we find a class of finite monoids where the finite basis property behaves…
Let $H$ be an additively written monoid and let $\mathcal{P}_{0}(H)$ denote the reduced power monoid of $H$, that is, the monoid consisting of all subsets of $H$ containing $0$ with set addition as operation. Following work of Tringali, Wen…
In this note we prove that all connected Cayley graphs of every finite group $Q \times H$ are 1-factorizable, where $Q$ is any non-trivial group of 2-power order and $H$ is any group of odd order.
Suppose that $M$ is a topological monoid satisfying $\pi_0M=\mathbb{N}$ to which the McDuff-Segal group-completion theorem applies. This implies that a certain map $f: \mathbb{M}_{\infty}\rightarrow \Omega BM$ defined on an infinite mapping…
Y. Manoussakis (J. Graph Theory 16, 1992, 51-59) proposed the following conjecture. \noindent\textbf{Conjecture}. {\it Let $D$ be a 2-strongly connected digraph of order $n$ such that for all distinct pairs of non-adjacent vertices $x$, $y$…
In our previous papers we introduced categorical invariants, which are, roughly speaking, sets of triangulated subcategories in a given triangulated category and their quotients. Here is extended the list of examples, where these sets are…
In 2009, Brown gave a set of conditions which when satisfied imply that a Feynman integral evaluates to a multiple zeta value. One of these conditions is called reducibility, which loosely says there is an order of integration for the…
A type of directed multigraph called a W-digraph is introduced to model the structure of certain representations of Hecke algebras, including those constructed by Lusztig and Vogan from involutions in a Weyl group. Building on results of…
We give sufficient conditions when a topological inverse $\lambda$-polycyclic monoid $P_{\lambda}$ is absolutely $H$-closed in the class of topological inverse semigroups. Also, for every infinite cardinal $\lambda$ we construct the…
We consider the following two finiteness conditions on normalizers and centralizers in a group G: (i) |N_G(H):H| is finite for every non-normal subgroup H of G, and (ii) |C_G(x):<x>| is finite for every non-normal cyclic subgroup <x> of G.…
Let $G$ be an abstract Kac-Moody group over a finite field and $\bar{G}$ be the closure of the image of $G$ in the automorphism group of its positive building. We show that if the Dynkin diagram associated to $G$ is irreducible and neither…
Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…
The $k$-dominating graph $D_k(G)$ of a graph $G$ is defined on the vertex set consisting of dominating sets of $G$ with cardinality at most $k$, two such sets being adjacent if they differ by either adding or deleting a single vertex. A…