Related papers: Willis Theory via Graphs
A major step in the graph minors theory of Robertson and Seymour is the transition from the Grid Theorem which, in some sense uniquely, describes areas of large treewidth within a graph, to a notion of local flatness of these areas in form…
We formulate a Yang-Mills action principle for noncommutative connections on an endomorphism algebra of a vector bundle. It is shown that there is an influence of the topology of the vector bundle onto the structure of the vacuums of the…
A visualized graph is a powerful tool for data analysis and synthesis tasks. In this case, the task of visualization constitutes not only in displaying vertices and edges according to the graph representation, but also in ensuring that the…
Holographic tensor networks model AdS/CFT, but so far they have been limited by involving only systems that are very different from gravity. Unfortunately, we cannot straightforwardly discretize gravity to incorporate it, because that would…
The unitary representation theory of locally compact contraction groups and their semi-direct products with $\mathbb{Z}$ is studied. We put forward the problem of completely characterising such groups which are type I or CCR and this…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
Graphs are quickly emerging as a leading abstraction for the representation of data. One important application domain originates from an emerging discipline called "connectomics". Connectomics studies the brain as a graph; vertices…
The path spaces of a directed graph play an important role in the study of graph $\css$. These are topological spaces that were originally constructed using groupoid and inverse semigroup techniques. In this paper, we develop a simple,…
We classify C$^*$ near-group categories by using Vaughan Jones theory of subfactors and the Cuntz algebra endomorphisms. Our results show that there is a sharp contrast between two essentially different cases, integral and irrational cases.…
The minimum height of vertex and edge partition trees are well-studied graph parameters known as, for instance, vertex and edge ranking number. While they are NP-hard to determine in general, linear-time algorithms exist for trees.…
It is well-known that a complete Riemannian manifold M which is locally isometric to a symmetric space is covered by a symmetric space. Here we prove that a discrete version of this property (called local to global rigidity) holds for a…
Under hypotheses required for the Taylor-Wiles method, we prove for forms of $U(3)$ which are compact at infinity that the lattice structure on upper alcove algebraic vectors or on principal series types given by the $\lambda$-isotypic part…
Recent work has established that large informatics graphs such as social and information networks have non-trivial tree-like structure when viewed at moderate size scales. Here, we present results from the first detailed empirical…
As a model problem for clustering, we consider the densest k-disjoint-clique problem of partitioning a weighted complete graph into k disjoint subgraphs such that the sum of the densities of these subgraphs is maximized. We establish that…
We introduce a new geometric approach to a manifold equipped with a smooth density function that takes a torsion-free affine connection, as opposed to a weighted measure or Laplacian, as the fundamental object of study. The connection…
We study the Fourier transform for compactly supported distributional sections of complex homogeneous vector bundles on symmetric spaces of non-compact type $X = G/K$. We prove a characterisation of their range. In fact, from Delorme's…
This work is concerned with a representation of shapes that disentangles fine, local and possibly repeating geometry, from global, coarse structures. Achieving such disentanglement leads to two unrelated advantages: i) a significant…
In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs.…
Any endomorphism of a finitely generated free group naturally descends to an injective endomorphism of its stable quotient. In this paper, we prove a geometric incarnation of this phenomenon: namely, that every expanding irreducible train…
In this paper, we construct and study derived character maps of finite-dimensional representations of $\infty$-groups. As models for $\infty$-groups we take homotopy simplicial groups, i.e. homotopy simplicial algebras over the algebraic…