Related papers: Green's Relations in Finite Transformation Semigro…
Let $n$ be a positive integer, $\sigma$ be an element of the symmetric group $\mathcal{S}_n$ and let $\sigma$ be a cycle of length $n$. The elements $\alpha ,\beta \in \mathcal{S}_n$ are $\sigma$-equivalent, if there are natural numbers $k$…
A new expression for the Green's function of a finite one-dimensional lattice with nearest neighbor interaction is derived via discrete Fourier transform. Solution of the Heisenberg spin chain with periodic and open boundary conditions is…
The Sylow graph $\Gamma(G)$ of a finite group $G$ originated from recent investigations on the so--called $\mathbf{N}$--closed classes of groups. The connectivity of $\Gamma(G)$ was proved only few years ago, involving the classification of…
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such as the full transformation semigroups, the general linear semigroups, and the semigroups of order-preserving transformations of finite…
The aim of this note is to point out some inaccuracies in our paper \cite{HD} and to fix them. Some new notions are introduced and properties of them are investigated.
This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…
A graph $\Gamma$ is said to be a semi-Cayley graph over a group $G$ if it admits $G$ as a semiregular automorphism group with two orbits of equal size. We say that $\Gamma$ is normal if $G$ is a normal subgroup of ${\rm Aut}(\Gamma)$. We…
In this paper we study ends of finitely generated semigroups. The ends we are working with are the ends of the undirected graphs of Cayley graphs of finitely generated semigroups. We prove that the number of ends is preserved for…
The aim of this small note is to prove an elementary yet useful properties of finitely presented groups. Let G be a finitely generated group with one end. Fix a (finite) generating set and let $B_n$ be the ball of radius $n$ around $e$. Let…
We show that picture groups are directly related to maximal green sequences for valued Dynkin quivers of finite type. Namely, there is a bijection between maximal green sequences and positive expressions (words in the generators without…
A new type of semigroups which appears while dealing with $N=1$ superconformal symmetry in superstring theories is considered. The ideal series having unusual abstract properties is constructed. Various idealisers are introduced and…
Here we review the many aspects and distinct phenomena associated to quantum dynamics on general graph structures. For so, we discuss such class of systems under the energy domain Green's function ($G$) framework. This approach is…
Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case…
In Finite Group Modular Representation Theory, the basic objects are the indecomposable and simple modules. This paper offers a new classification of these objects that refines the Green Theory Classification of indecomposable and simple…
We prove a version of the Green correspondence for complex algebraic supergroups, constructing a correspondence between certain indecomposable representations of G and the normalizer of a Sylow subgroup of G.
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 (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…
On the basis of the tight-binding formalism and Green function technique we obtain all the Green functions matrix elements for a biased chain with a linear variation of the electron on-site energy. Their dependence on the system parameters…
This paper studies when an arithmetical equivalence relation $E$ can be realized as the connectedness relation of a graph $G$ which is simpler to define than $E$. Several examples of such equivalence relations are established. In…
In this article, we study the relationship among maximal green sequences, complete forward hom-orthogonal sequences and stability functions in abelian length categories. Mainly, we firstly give a one-to-one correspondence between maximal…
A quasi-automatic semigroup is a finitely generated semigroup with a rational set of representatives such that the graph of right multiplication by any generator is a rational relation. A asynchronously automatic semigroup is a…