Related papers: Hecke-Kiselman Monoids of Small Cardinality

This note is motivated by an old result of Kronecker on monic polynomials with integer coefficients having all their roots in the unit disc. We call such polynomials Kronecker polynomials for short. Let $k(n)$ denote the number of Kronecker…

Here we prove that the homological dimension of the category of sheaves on a topological space satisfying some suitable conditions is finite. In particular, we find conditions to bound the homological dimension of o-minimal and subanalytic…

We establish a new sufficient condition under which a monoid is non-finitely based and apply this condition to show that the 9-element monoid $L_4^1$ is non-finitely based. The monoid $L_4^1$ was the only unsolved case in the finite basis…

We expound a concise construction of finite groups and groupoids whose Cayley graphs satisfy graded acyclicity requirements. Our acyclicity criteria concern cyclic patterns formed by coset-like configurations w.r.t. subsets of the generator…

In this paper we prove the following new sufficient condition for a digraph to be Hamiltonian: {\it Let $D$ be a 2-strong digraph of order $n\geq 9$. If $n-1$ vertices of $D$ have degrees at least $n+k$ and the remaining vertex has degree…

Suppose $1\le \ell <k$ such that $(k-\ell)\nmid k$. Given an $n$-vertex $k$-uniform hypergraph $\mathcal H$, for all $k/2<\ell< 3k/4$ and sufficiently large $n\in (k-\ell)\mathbb N$, we prove that if $\mathcal H$ has minimum co-degree at…

We explore residually finite and profinite quandles. We prove that the endomorphism monoid and the automorphism group of finitely generated residually finite quandles are residually finite. In fact, we establish the similar result for a…

Recently, Morier-Genoud and Ovsienko introduced the $q$-deformed modular group. For construction, they first gave a group $G_q \subset \operatorname{GL}(2, {\mathbb Z}[q^{\pm}])$ and then set $\operatorname{PSL}_q(2,{\mathbb…

We study various aspects of the structure and representation theory of singular Artin monoids. This includes a number of generalizations of the desingularization map and explicit presentations for certain finite quotient monoids of…

We characterize which groups splitting as finite graphs of free groups with cyclic edge groups are residually finite. Such a group $G$ is residually finite if and only if all its Baumslag-Solitar subgroups are residually finite. From a…

A fundamental result in structural graph theory states that every graph with large average degree contains a large complete graph as a minor. We prove this result with the extra property that the minor is small with respect to the order of…

Given a digraph $D$, we say that a set of vertices $Q\subseteq V(D)$ is a $q$-kernel if $Q$ is an independent set and if every vertex of $D$ can be reached from $Q$ by a path of length at most $q$. In this paper, we initiate the study of…

Let ${\rm GK}(G)$ be the prime graph associated with a finite group $G$ and $D(G)$ be the degree pattern of $G$. A finite group $G$ is said to be $k$-fold OD-characterizable if there exist exactly $k$ non-isomorphic groups $H$ such that…

A slight modification of the definition of the Thompson-Higman groups G_k1 and F_k1 leads to inverse monoids that map onto G_k1 (respectively F_k1), and that have interesting properties: they are finitely generated, and residually finite.…

In the paper we present various characterizations of chain-compact and chain-finite topological semilattices. A topological semilattice $X$ is called chain-compact (resp. chain-finite) if each closed chain in $X$ is compact (finite). In…

A $k$-uniform hypergraph $M$ is set-homogeneous if it is countable (possibly finite) and whenever two finite induced subhypergraphs $U,V$ are isomorphic there is $g\in Aut(M)$ with $U^g=V$; the hypergraph $M$ is said to be homogeneous if in…

A monoid presentation is called special if the right-hand side of each defining relation is equal to 1. We prove results which relate the two-sided homological finiteness properties of a monoid defined by a special presentation with those…

Z-mapping graph is a balanced bipartite graph $G$ of a digraph $D$ by split each vertex of $D$ into a pair of vertices of $G$. Based on the property of the $G$, it is proved that if $D$ is strong connected and $G$ is Hamiltonian, then $D$…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

A monoid $M$ is called surjunctive if every injective cellular automata with finite alphabet over $M$ is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all…