Related papers: On the congruence subgroup problem for branch grou…

The overlap graphs of subtrees in a tree (SOGs) generalise many other graphs classes with set representation characterisations. The complexity of recognising SOGs in open. The complexities of recognising many subclasses of SOGs are known.…

This is a continuation of the study, begun by Ceccherini-Silberstein and Woess, of context-free pairs of groups and the related context-free graphs in the sense of Muller and Schupp. Instead of the cones (connected components with respect…

We consider the existence of the topological entropy of shift spaces on a finitely generated semigroup whose Cayley graph is a tree. The considered semigroups include free groups. On the other hand, the notion of stem entropy is introduced.…

A branch vertex in a tree is a vertex of degree at least three. We prove that, for all $s\geq 1$, every connected graph on $n$ vertices with minimum degree at least $(\frac{1}{s+3}+o(1))n$ contains a spanning tree having at most $s$ branch…

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…

We give a branching law for subgroups fixed by an involution. As an application we give a generalization of the Cartan-Helgason theorem and a noncompact analogue of the Borel-Weil theorem.

The notion of adequate subgroups was introduced by Jack Thorne. It is a weakening of the notion of big subgroup used by Wiles and Taylor in proving automorphy lifting theorems for certain Galois representations. Using this idea, Thorne was…

A topology is defined on the mapping class group of a compact connected orientable surface. It is shown that a notion of "genericity" on subsets of the mapping class group arises from this definition. Many plausible results follow from this…

In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…

We prove that a topological group is isomorphic to the real line if and only if it is a one-parameteric, metrizable, and not monothetic. This result is used in the authors' other paper to prove that one-parametric groups in strictly convex…

For our own education, we reconstruct the Hopf algebra of Connes and Moscovici obtained by the action of vector fields on a crossed product of functions by diffeomorphisms. We extend the realization of that Hopf algebra in terms of rooted…

There has been substantial work studying consensus problems for which there is a single common final state, although there are many real-world complex networks for which the complete consensus may be undesirable. More recently, the concept…

We prove that for a set of communicating agents to compute the average of their initial positions (average consensus problem), the optimal topology of communication is given by a de Bruijn's graph. Consensus is then reached in a finitely…

A hole in a graph is an induced subgraph which is a cycle of length at least four. A graph is chordal if it contains no holes. Following McKee and Scheinerman (1993), we define the chordality of a graph $G$ to be the minimum number of…

Let $G$ be a group. The power graph of $G$ is a graph with vertex set $G$ in which two distinct elements $x,y$ are adjacent if one of them is a power of the other. We characterize all groups whose power graphs have finite independence…

The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…

We introduce some canonical topologies induced by actions of topological groups on groups and rings. For $H$ being a group [or a ring] and $G$ a topological group acting on $H$ as automorphisms, we describe the finest group [ring] topology…

We prove a homological stability theorem for the subgroup of the mapping class group acting as the identity on some fixed portion of the first homology group of the surface. We also prove a similar theorem for the subgroup of the mapping…

We construct an efficient model for graphs of finitely generated subgroups of free groups. Using this we give a very short proof of Dicks's reformulation of the strengthened Hanna Neumann Conjecture as the Amalgamated Graph Conjecture. In…

An independent $[1,k]$-set $S$ in a graph $G$ is a dominating set which is independent and such that every vertex not in $S$ has at most $k$ neighbors in it. The existence of such sets is not guaranteed in every graph and trees having an…