Related papers: Folding-like techniques for CAT(0) cube complexes
We construct a finitely generated 2-dimensional group that acts properly on a locally finite CAT(0) cube complex but does not act properly on a finite dimensional CAT(0) cube complex.
In the present paper a novel graph-based approach to the shape decomposition problem is addressed. The shape is appropriately transformed into a visibility graph enriched with local neighborhood information. A two-step diffusion process is…
The "folding algorithm"\cite{fold1} is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the…
We produce a sequence of finite dimensional representations of the fundamental group $\pi_1(S)$ of a closed surface where all simple closed curves act with finite order, but where each non--simple closed curve eventually acts with infinite…
This thesis captures the ongoing development of twisted cubes, which is a modification of cubes (in a topological sense) where its homotopy type theory does not require paths or higher paths to be invertible. My original motivation to…
Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying…
We show that any filtering family of closed convex subsets of a finite-dimensional CAT(0) space $X$ has a non-empty intersection in the visual bordification $ \bar{X} = X \cup \partial X$. Using this fact, several results known for proper…
We show that the pushout of an \'etale morphism and an open immersion exists in the category of algebraic stacks and show that such pushouts behave similarly to the gluing of two open substacks. For example, quasi-coherent sheaves on the…
We provide groupoid models for Toeplitz and Cuntz-Krieger algebras of topological higher-rank graphs. Extending the groupoid models used in the theory of graph algebras and topological dynamical systems to our setting, we prove results on…
Given a field F, one may ask which finite groups are Galois groups of field extensions E/F such that E is a maximal subfield of a division algebra with center F. This question was originally posed by Schacher, who gave partial results over…
Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…
We present fully polynomial-time (deterministic or randomised) approximation schemes for Holant problems, defined by a non-negative constraint function satisfying a generalised second order recurrence modulo a couple of exceptional cases.…
We construct explicit generating sets S_n and \tilde S_n of the for the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), S_n) and C(Sym(n), \tilde S_n) into a family of bounded degree expanders for all n. This…
Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive…
The phase diagram of a vertex model introduced by P. Di Francesco (Nucl. Phys. B 525, 507 1998) representing the configurations of a square lattice which can fold with different bending energies along the main axes and the diagonals has…
The main technical result of this paper is to characterize the contracting isometries of a CAT(0) cube complex without any assumption on its local finiteness. Afterwards, we introduce the combinatorial boundary of a CAT(0) cube complex, and…
A subperiodic group is a group of motions of $d$-dimensional Euclidean space $\R^d$ which contains a translation lattice $\Z^r$ of rank $r < d$ as a subgroup of finite index. A classification into abstract group isomorphism classes is…
A fundamental challenge of bipartite graph representation learning is how to extract informative node embeddings. Self-Supervised Learning (SSL) is a promising paradigm to address this challenge. Most recent bipartite graph SSL methods are…
Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…
We introduce a notion of "simulation" for labelled graphs, in which edges of the simulated graph are realized by regular expressions in the simulating graph, and prove that the tiling problem (aka "domino problem") for the simulating graph…