Related papers: Graphical C(3)-T(6) implies CAT(0)
CFTs are naturally defined on Riemann surfaces. The rational ones can be solved using methods from algebraic geometry. One particular feature is the covariance of the partition function under the mapping class group. In genus $g=1$, this…
An expansion set is a set $\mathcal{B}$ such that each $b \in \mathcal{B}$ is equipped with a set of expansions $\mathcal{E}(b)$. The theory of expansion sets offers a systematic approach to the construction of classifying spaces for…
In this article, we associate to isometries of CAT(0) cube complexes specific subspaces, referred to as \emph{median sets}, which play a similar role as minimising sets of semisimple isometries in CAT(0) spaces. Various applications are…
We prove that if $G = G_1\times\dots\times G_n$ acts essentially, properly and cocompactly on a CAT(0) cube complex X, then the cube complex splits as a product. We use this theorem to give various examples of groups for which the minimal…
We introduce the coherent algebra of a compact metric measure space by analogy with the corresponding concept for a finite graph. As an application we show that upon topologizing the collection of isomorphism classes of compact metric…
Contrastive learning methods based on InfoNCE loss are popular in node representation learning tasks on graph-structured data. However, its reliance on data augmentation and its quadratic computational complexity might lead to inconsistency…
We consider groups defined by cyclic presentations where the defining word has length three and the cyclic presentation satisfies the T(6) small cancellation condition. We classify when these groups are hyperbolic. When combined with known…
We introduce the notion of coupled link cube complex (CLCC) as a means of constructing interesting cocompactly cubulated groups. CLCCs are defined locally, making them a useful tool when precise control over the links is required. In this…
A new class of graphical models capturing the dependence structure of events that occur in time is proposed. The graphs represent so-called local independences, meaning that the intensities of certain types of events are independent of some…
A phenomenon of classical quantization is discussed. This is revealed in the class of pseudoclassical gauge systems with nonlinear nilpotent constraints containing some free parameters. Variation of parameters does not change local (gauge)…
In this paper we study locally chordal graphs, i.e. graphs where every small-radius ball is chordal. We prove four characterizations of locally chordal graphs. Two are counterparts of the classic descriptions of chordal graphs via induced…
We demonstrate how category theory provides specifications that can efficiently be implemented via imperative algorithms and apply this to the field of graph rewriting. By examples, we show how this paradigm of software development makes it…
We investigate the collapsibility of systolic finite simplicial complexes of arbitrary dimension. The main tool we use in the proof is discrete Morse theory. We shall consider a convex subcomplex of the complex and project any simplex of…
The partition function of a factor graph can sometimes be accurately estimated by Monte Carlo methods. In this paper, such methods are extended to factor graphs with negative and complex factors.
We examine some variants of computation with closed timelike curves (CTCs), where various restrictions are imposed on the memory of the computer, and the information carrying capacity and range of the CTC. We give full characterizations of…
We give a criterion for the non-vanishing of some generalised modular symbols. The criterion is in terms of the non-vanishing of some classes on the compact dual of the locally symmetric manifold. As an application, we construct non-zero…
We continue in this paper the study of locally minimal groups started in \cite{LocMin}. The minimality criterion for dense subgroups of compact groups is extended to local minimality. Using this criterion we characterize the compact abelian…
Given a small category C, a C-module M is a functor from C to the category of finite-dimensional vector spaces over a field k. Associated to M is its local structure, given as a functor from C to the category of bi-closed multi-flags over…
In the context of distributed certification, the recognition of graph classes has started to be intensively studied. For instance, different results related to the recognition of planar, bounded tree-width and $H$-minor free graphs have…
We define a notion of quantum automorphism group of Graph C*-algebras for finite, connected graphs. Under the assumption that the underlying graph does not have any multiple edge or loop, the quantum automorphism group of underlying…