Related papers: Structural aspects of semigroups based on digraphs

Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…

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…

Essential properties of semiclassical approximation for quantum mechanics are viewed as axioms of an abstract semiclassical mechanics. Its symmetry properties are discussed. Semiclassical systems being invariant under Lie groups are…

A Group Labeled Graph is a pair $(G,\Lambda)$ where $G$ is an oriented graph and $\Lambda$ is a mapping from the arcs of $G$ to elements of a group. A (not necessarily directed) cycle $C$ is called non-null if for any cyclic ordering of the…

The fractional arboricity of a digraph $D$, denoted by $\gamma(D)$, is defined as $\gamma(D)= \max_{H \subseteq D, |V(H)| >1} \frac {|A(H)|} {|V(H)|-1}$. Frank in [Covering branching, Acta Scientiarum Mathematicarum (Szeged) 41 (1979),…

Recently it has been noticed that many interesting combinatorial objects belong to a class of semigroups called left regular bands, and that random walks on these semigroups encode several well-known random walks. For example, the set of…

Let D be an acyclic orientation of a simple graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Define m and M to be the minimum and the maximum number of…

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

Given a $\Gamma$-semigroup $S$, we construct a semigroup $\Sigma$ in such a way that one sided ideals and quasi-ideals of $S$ can be regarded as one sided ideals and quasi-ideals respectively of $\Sigma$. This correspondence and other…

The reconfiguration problem for homomorphisms of digraphs to a reflexive digraph cycle, which amounts to deciding if a `reconfiguration graph' is connected, is known to by polynomially time solvable via a greedy algorithm based on certain…

In directed graphs, a cycle can be seen as a structure that allows its vertices to loop back to themselves, or as a structure that allows pairs of vertices to reach each other through distinct paths. We extend these concepts to temporal…

We give examples of $n \times n$ matrices $A$ and $B$ over the filed $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$ such that for almost every column vector $x \in \mathbb{K}^n$, the orbit of $x$ under the action of the semigroup generated by $A$…

It is shown how to construct *-homomorphic quantum stochastic Feller cocycles for certain unbounded generators, and so obtain dilations of strongly continuous quantum dynamical semigroups on C* algebras; this generalises the construction of…

We explicitly determine all CI-groups with respect to ternary relational structures that have the form $C \times D$, where $C$ is cyclic and $D$ is either a dicyclic group whose order is not divisible by $3$ or a dihedral group. Such groups…

Suppose that $X$ be a nonempty set. Denote by $\mathcal{T}(X)$ the full transformation semigroup on $X$. For $\varnothing \neq Z\subseteq Y\subseteq X$, let $\mathcal{T}(X,Y,Z)=\{\alpha \in \mathcal{T}(X): Y\alpha \subseteq Z \}$. Then…

In a graph $G$, let $\mu_G(xy)$ denote the number of edges between $x$ and $y$ in $G$. Let $\lambda K_{v,u}$ be the graph $(V\cup U,E)$ with $|V|=v$, $|U|=u$, and \[ \mu_G(xy)=\begin{cases} \lambda &\mbox{if $x\in U$ and $y\in V$ or if…

Let $H$ be a subgroup of $\text{Sym}_n$, the symmetric group of degree $n$. For a fixed integer $l \geq 2$, the group $G$ presented with generators $x_1, x_2, \ldots ,x_n$ and with relations $x_{i_1}x_{i_2}\cdots x_{i_l} =x_{\sigma (i_1)}…

The paper is an overview of recent results on algebraic structures (semigroups, groupoids, algebras, inverse semigroups, and groups) associated with objects with a rich set of partial symmetries. We discuss etale groupoids and inverse…

We determine when a permutation with cycle type $\mu$ admits a non-zero invariant vector in the irreducible representation $V_\lambda$ of the symmetric group. We find that a majority of pairs $(\lambda,\mu)$ have this property, with only a…