Related papers: When does an infinite ring have a finite compresse…
Let R be a unitary ring of finite cardinality P^k, where p is a prime number and $p\nmid k$. We show that if the group of units of $R$ has at most one subgroup of order $p$, then $R\cong A\bigoplus B,$ where $B$ is a finite ring of order…
The purpose of this note is to define a graph whose vertex set is a finite group $G$, whose edge set is contained in that of the commuting graph of $G$ and contains the enhanced power graph of $G$. We call this graph the deep commuting…
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…
We show that the commutator subgroup G' of a classical knot group G need not have subgroups of every finite index, but it will if G' has a surjective homomorphism to the integers and we give an exact criterion for that to happen. We also…
We classify the finite connected-homogeneous digraphs, as well as the infinite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.
Every end of an infinite graph $ G $ defines a tangle of infinite order in $ G $. These tangles indicate a highly cohesive substructure in the graph if and only if they are closed in some natural topology. We characterize, for every finite…
We develop a general ring theory in the o-minimal setting culminating in a description of all the definable rings in an arbitrary o-minimal structure. We show that every definably connected ring with non-trivial multiplication defines an…
For a division ring D, finite dimensional over its center F, we give a condiction for the connectedness of the commuting graph of a matrix ring over $D$. Furthermore, we prove that if the commuting graph is connected, then its diameter is…
We show that every non-trivial compact connected group and every non-trivial general or special linear group over an infinite field admits a generating set such that the associated Cayley graph has infinite diameter.
We will give a short proof of the fact that if the algebraic closure of a field $\mathbb F$ is a finite extension, then for $n\geq 3$ the commuting graph $\Gamma(M_n(\mathbb F))$ is connected and its diameter is four.
Interval graphs and interval orders are deeply linked. In fact, edges of an interval graphs represent the incomparability relation of an interval order, and in general, of different interval orders. The question about the conditions under…
In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…
Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…
We consider the infinite-dimensional hypercube graph. This graph is not connected and has isomorphic connected components. We describe the restrictions of its automorphisms to the connected components and the automorphism group of connected…
Coclass theory can be used to define infinite families of finite p-groups of a fixed coclass. It is conjectured that the groups in one of these infinite families all have isomorphic mod-p cohomology rings. Here we prove that almost all…
In this paper, we study some properties of the ring $C(X)_F$ of all real valued functions which are continuous except on some finite subsets of $X$. We show that $C(X)_F$ is closed under uniform limit if and only if the set of all…
Given a finite group $G$ and a subset $X$ of $G$, the commuting graph of $G$ on $X$, denoted by ${\cal C}(G,X)$, is the graph that has $X$ as its vertex set with $x,y\in X$ joined by an edge whenever $x\neq y$ and $xy=yx$. Let $T$ be a…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
We characterise the slices of the category of graphs that are algebraically universal in terms of the structure of the slicing graph. In particular, we show that algebraic universality is obtained if, and only if, the slicing graph contains…
Given a graph $X$ with a Hamilton cycle $C$, the {\em compression factor $\kappa(X,C)$ of $C$} is the order of the largest cyclic subgroup of $\operatorname{Aut}(C)\cap\operatorname{Aut}(X)$, and the {\em Hamilton compression $\kappa(X)$ of…