Related papers: Graphical complexes of groups

We introduce Hochschild (co-)homology of morphisms of schemes or analytic spaces and study its fundamental properties. In analogy with the cotangent complex we introduce the so called (derived) Hochschild complex of a morphism; the…

Probabilistic graphical models combine the graph theory and probability theory to give a multivariate statistical modeling. They provide a unified description of uncertainty using probability and complexity using the graphical model.…

We provide a necessary and sufficient condition on a finite flag simplicial complex, L, for which there exists a unique CAT(0) cube complex whose vertex links are all isomorphic to L. We then find new examples of such CAT(0) cube complexes…

We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…

Cell complexes are topological spaces constructed from simple blocks called cells. They generalize graphs, simplicial complexes, and polyhedral complexes that form important domains for practical applications. They also provide a…

We present simple graph-theoretic characterizations of Cayley graphs for monoids, semigroups and groups. We extend these characterizations to commutative monoids, semilattices, and abelian groups.

The purpose of this paper is to consider some basic constructions in the category of compact quantum groups --for example de case of extensions, of Drinfeld twists, of matched pairs, of extensions, of linked pairs and of cocycle Singer…

For every $n \geq 1$, let $(\mathrm{FW}_n)$ denote the fixed-point property for median graphs of cubical dimension $n$ (or equivalently, for CAT(0) cube complexes of dimension $n$). In this article, we construct explicit examples of groups…

We provide a condition on the links of polygonal complexes that is sufficient to ensure groups acting properly discontinuously and cocompactly on such complexes contain a virtually free codimension-1 subgroup. We provide stronger conditions…

For globally subanalytic manifolds we define de Rham complexes of globally subanalytic differential forms and of constructible differential forms. Whereas the de Rham theorem does not hold for the former in the non-compact case, it does…

We show that two uniform lattices of a regular right-angled Fuchsian building are commensurable, provided the chamber is a polygon with at least six edges. We show that in an arbitrary Gromov-hyperbolic regular right-angled building…

The configuration space of causal sets is vast. It is a critical goal to map out this space. Here, we take a practical step towards this goal. We investigate nine classes of causal sets, most of them not studied before. These include…

A group is SimpHAtic if it acts geometrically on a simply connected simplicially hereditarily aspherical (SimpHAtic) complex. We show that finitely presented normal subgroups of the SimpHAtic groups are either: finite, or of finite index,…

Building on previous work, this paper extends the modeling of political structures from simplicial complexes to hypergraphs. This allows the analysis of more complex political dynamics where agents who are willing to form coalitions contain…

We study lattices acting on $\mathrm{CAT}(0)$ spaces via their commensurated subgroups. To do this we introduce the notions of a graph of lattices and a complex of lattices giving graph and complex of group splittings of $\mathrm{CAT}(0)$…

We study the large-scale geometry of graph braid groups $\mathbb{B}_n(\mathsf{\Gamma})$, viewed as the fundamental groups of discrete configuration spaces $UD_n(\mathsf{\Gamma})$, which are special cube complexes in the sense of…

We use the structure theory of minimal dynamical systems to show that, for a general group $\Gamma$, a tame, metric, minimal dynamical system $(X, \Gamma)$ has the following structure: \begin{equation*} \xymatrix {& \tilde{X} \ar[dd]_\pi…

Graph-based signal processing techniques have become essential for handling data in non-Euclidean spaces. However, there is a growing awareness that these graph models might need to be expanded into `higher-order' domains to effectively…

We expound a concise construction of finite groups and groupoids whose Cayley graphs satisfy graded acyclicity requirements. Our acyclicity criteria concern cyclic patterns formed by coset-like configurations w.r.t. subsets of the generator…

We define two different simplicial complexes, the common divisor simplicial complex and the prime divisor simplicial complex, from a set of integers, and explore their similarities. We will define a map between the two simplicial complexes,…