相关论文: The groupoids of adaptable separated graphs and th…

We study in detail the profinite group G arising as geometric \'etale iterated monodromy group of an arbitrary quadratic polynomial over a field of characteristic different from two. This is a self-similar closed subgroup of the group of…

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…

The note contains a few results related to separation axioms and automatic continuity of operations in compact-like semitopological groups. In particular, is presented a semiregular semitopological group $G$ which is not $T_3$. We show that…

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

We show that a Hausdorff, ample groupoid $\mathcal{G}$ can be completely recovered from the $I$-norm completion of $C_c(\mathcal{G})$. More generally, we show that this is also the case for the algebra of symmetrized $p$-pseudofunctions, as…

Let $(G,*)$ and $(G',\cdot)$ be groupoids. A bijection $f: G \rightarrow G'$ is called a half-isomorphism if $f(x*y)\in\{f(x)\cdot f(y),f(y)\cdot f(x)\}$, for any $ x, y \in G$. A half-isomorphism of a groupoid onto itself is a…

The non-solvable graph of a finite group G is a simple graph whose vertices are the elements of G and there is an edge between x and y if and only if the subgroup generated by x and y is not solvable. The isolated vertices in the…

We consider a class of partial action groupoids called double groupoids which are constructed from pairs of subgroups satisfying similar conditions to those of a matched pair of groups. If the double groupoid is \'etale, then we show that…

In this article, we realize ultragraph Leavitt path algebras as Steinberg algebras. This realization allows us to use the groupoid approach to obtain structural results about these algebras. Using skew product groupoid, we show that…

We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…

In this paper we continue the study of prime graphs of finite solvable groups. The prime graph, or Gruenberg-Kegel graph, of a finite group G has vertices consisting of the prime divisors of the order of G and an edge from primes p to q if…

Some varieties of groupoids and quasigroups generated by linear-bivariate polynomials $P(x,y)=a+bx+cy$ over the ring $\mathbb{Z}_n$ are studied. Necessary and sufficient conditions for such groupoids and quasigroups to obey identities which…

We give several characterisations of groupoids determined by involutive automorphisms on semilattices of groups.

In \cite{Kramer11} Kramer proves for a large class of semisimple Lie groups that they admit just one locally compact $\sigma$-compact Hausdorff topology compatible with the group operations. We present two different methods of generalising…

In this paper we revisit the following inverse problem: given a curve invariant under an irreducible finite linear algebraic group, can we construct an ordinary linear differential equation whose Schwarz map parametrizes it? We present an…

In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…

The goal of this article is to study results and examples concerning finitely presented covers of finitely generated amenable groups. We collect examples of groups $G$ with the following properties: (i) $G$ is finitely generated, (ii) $G$…

A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…

We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic…

We introduce the normalising graph of a group and study the connectivity of the normalising and permuting graphs of a group when the group is finite and soluble. In particular, we classify finite soluble groups with disconnected normalising…