Related papers: Degree 2 Transformation Semigroups as Continuous M…
We study finitely generated pairs of groups $H \leq G$ such that the Schreier graph of $H$ has at least two ends and is \emph{narrow}. Examples of narrow Schreier graphs include those that are quasi-isometric to finitely ended trees or have…
In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…
The study of ORR was inspired by L\'{a}zsl\'{o} Babai in 1980 when he asked a question: Which [finite] groups admit an oriented graph as a DRR? And it has been solved by Joy Morris and Pablo Spiga through a series of papers in 2018. In this…
A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…
We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…
For a smooth, closed $n$-manifold $M$, we define an upper semi-continuous integer-valued complexity function on $H^1(M;{\mathbb R})$ using Morse theory. This measures how far an integral class is from being a fiber of a fibration. The fact…
Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to…
We study two actions of big mapping class groups. The first is an action by isometries on a Gromov-hyperbolic graph. The second is an action by homeomorphisms on a circle in which the vertices of the graph naturally embed. The first two…
Cremona maps defined by monomials of degree 2 are thoroughly analyzed and classified via integer arithmetic and graph combinatorics. In particular, the structure of the inverse map to such a monomial Cremona map is made very explicit as is…
We investigate various groupoids associated to an arbitrary inverse semigroup with zero. We show that the groupoid of filters with respect to the natural partial order is isomorphic to the groupoid of germs arising from the standard action…
Ara\'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest…
A framework for higher gauge theory based on a 2-group is presented, by constructing a groupoid of connections on a manifold acted on by a 2-group of gauge transformations, following previous work by the authors where the general notion of…
In the present work we prove that given any two unicycle graphs (pseudoforests) that share the same degree sequence there is a finite sequence of 2-switches transforming one into the other such that all the graphs in the sequence are also…
For any graph inverse semigroup $G(E)$ we describe subsemigroups $D^0=D\cup\{0\}$ and $J^0=J\cup\{0\}$ of $G(E)$ where $D$ and $J$ are arbitrary $\mathcal{D}$-class and $\mathcal{J}$-class of $G(E)$, respectively. In particular, we prove…
This paper introduces a notion of presentation for locally inverse semigroups and develops a graph structure to describe the elements of locally inverse semigroups given by these presentations. These graphs will have a role similar to the…
In graph signal processing, one of the most important subjects is the study of filters, i.e., linear transformations that capture relations between graph signals. One of the most important families of filters is the space of shift invariant…
We present a Myhill-Nerode theorem for hypergraphs. The theorem involves an operation which takes two input structures and produces a hypergraph as output. Using this operation, we define a Myhill-Nerode-type equivalence relation and show…
In this work we solve the problem of providing a Morita invariant definition of Lie and Courant algebroids over Lie groupoids. By relying on supergeometry, we view these structures as instances of vector fields on graded groupoids which are…
We describe the structure of $E-$dense acts over $E-$dense semigroups in an analogous way to that for inverse semigroup acts over inverse semigroups. This is based, to a large extent, on the work of Schein on representations of inverse…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…