Related papers: Green's Relations in Finite Transformation Semigro…

The essential variables in a finite function $f$ are defined as variables which occur in $f$ and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When…

It is shown that the Green's function on a finite lattice in arbitrary space dimension can be obtained from that of an infinite lattice by means of translation operator. Explicit examples are given for one- and two-dimensional lattices.

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (1)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

In the paper we introduce a notion of a key relation, which is similar to the notion of a critical relation introduced by Keith A.Kearnes and \'Agnes Szendrei. All clones on finite sets can be defined by only key relations. In addition…

Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…

We investigate the computational complexity for determining various properties of a finite transformation semigroup given by generators. We introduce a simple framework to describe transformation semigroup properties that are decidable in…

We will show that every element of a finitely generated abelian group is automorphically equivalent what we will define to be a {\em representative element} in a {\em repeat-free subgroup}, and for finite abelian groups we can count the…

We study generalized inverses on semigroups by means of Green's relations. We first define the notion of inverse along an element and study its properties. Then we show that the classical generalized inverses (group inverse, Drazin inverse…

A subsemigroup S of a semigroup Q is a left order in Q and Q is a semigroup of left quotients of S if every element of Q can be expressed as a# b where a and b are elements of S and if, in addition, every element of S that is square…

Let ${\cal I}_n$ be the symmetric inverse semigroup on $X_n = \{1, 2,..., n\}$ and let ${\cal DP}_n$ and ${\cal ODP}_n$ be its subsemigroups of partial isometries and of order-preserving partial isometries of $X_n$, respectively. In this…

We give a new characterization of primitive permutation groups tied to the notion of completely reachable automata. Also, we introduce sync-maximal permutation groups tied to the state complexity of the set of synchronizing words of certain…

We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…

For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…

Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…

The solubility graph $\Gamma_S(G)$ associated with a finite group $G$ is a simple graph whose vertices are the elements of $G$, and there is an edge between two distinct vertices if and only if they generate a soluble subgroup. In this…

In a previous work [Andrade \textit{et al.}, Phys. Rep. \textbf{647}, 1 (2016)], it was shown that the exact Green's function (GF) for an arbitrarily large (although finite) quantum graph is given as a sum over scattering paths, where local…

Since its introduction by Symons, the semigroup of maps with restricted range has been studied in the context of transformations on a set, or of linear maps on a vector space. Sets and vector spaces being particular examples of independence…

We demonstrate the existence of a family of finitely generated subgroups of Richard Thompson's group $F$ which is strictly well-ordered by the embeddability relation in type $\epsilon_0 +1$. All except the maximum element of this family…

A Cayley graph over a group $G$ is said to be central if its connection set is a normal subset of $G$. We prove that every central Cayley graph over a simple group $G$ has at most two pairwise nonequivalent Cayley representations over $G$…

A piece of a labelled graph $\Gamma$ defined by D. Gruber is a labelled path that embeds into $\Gamma$ in two essentially different ways. We prove that graphical $Gr'(\frac{1}{6})$ small cancellation groups whose associated pieces have…