Related papers: Willis Theory via Graphs
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
Let $G$ be a totally disconnected, locally compact group and let $H$ be a virtually flat (for example, polycyclic) group of automorphisms of $G$. We study the structure of, and relationships between, various subgroups of $G$ defined by the…
One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65--110, 1995], also known as the weak structure theorem, revealed the local structure of graphs…
Multiple scales coexist in complex networks. However, the small world property makes them strongly entangled. This turns the elucidation of length scales and symmetries a defiant challenge. Here, we define a geometric renormalization group…
In analogy to the topological entropy for continuous endomorphisms of totally disconnected locally compact groups, we introduce a notion of topological entropy for continuous endomorphisms of locally linearly compact vector spaces. We study…
Automorphism groups of locally finite trees provide a large class of examples of simple totally disconnected locally compact groups. It is desirable to understand the connections between the global and local structure of such a group.…
Let $G$ be a topological group, let $\phi$ be a continuous endomorphism of $G$ and let $H$ be a closed $\phi$-invariant subgroup of $G$. We study whether the topological entropy is an additive invariant, that is,…
Treewidth is a parameter that emerged from the study of minor closed classes of graphs (i.e. classes closed under vertex and edge deletion, and edge contraction). It in some sense describes the global structure of a graph. Roughly, a graph…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
Borchers and Wiesbrock have demonstrated certain results concerning the one-parameter semigroups of endomorphisms of von Neumann algebras that appear as lightlike translations in the theory of algebras of local observables. These results…
We study analogues of Cartan decompositions of Lie groups for totally disconnected locally compact groups. It is shown using these decompositions that a large class of totally disconnected locally compact groups acting on trees and…
We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degree of locality. The global structure of the graph, as…
Let $\phi: G \rightarrow H$ be a group homomorphism such that $H$ is a totally disconnected locally compact (t.d.l.c.) group and the image of $\phi$ is dense. We show that all such homomorphisms arise as completions of $G$ with respect to…
We present a selection of results contributing to a structure theory of totally disconnected locally compact groups.
Network theory has proven to be a powerful tool in describing and analyzing systems by modelling the relations between their constituent objects. In recent years great progress has been made by augmenting `traditional' network theory.…
The class, denoted by $\mathscr{S}$, of totally disconnected locally compact groups which are non-discrete, compactly generated, and topologically simple contains many compelling examples. In recent years, a general theory for these groups,…
We study the topological full group of ample groupoids over locally compact spaces. We extend Matui's definition of the topological full group from the compact, to the locally compact case. We provide two general classes of groupoids for…
Ellis's "functional approach" allows one to obtain proper compactifications of a topological group $G$ if $G$ can be represented as a subgroup of the homeomorphism group of a space $X$ in the topology of pointwise convergence and $G$-space…
We study totally disconnected, locally compact (t.d.l.c.) groups from an algorithmic perspective. We give various approaches to defining computable presentations of t.d.l.c.\ groups, and show their equivalence. In the process, we obtain an…
This is the announcement, and the long summary, of a series of articles on the algorithmic study of Thurston maps. We describe branched coverings of the sphere in terms of group-theoretical objects called bisets, and develop a theory of…