Related papers: Graphical C(3)-T(6) implies CAT(0)
We present an interactive framework that, given a membership test for a graph class $\mathcal{G}$ and a number $k$, finds and tests unavoidable sets for the class of graphs in $\mathcal{G}$ of path-width at most $k$. We put special emphasis…
We introduce a graphical refutation calculus for relational inclusions: it reduces establishing a relational inclusion to establishing that a graph constructed from it has empty extension. This sound and complete calculus is conceptually…
Let $G$ be a graph and $S\subseteq V(G)$. If every two adjacent vertices of $G$ have different metric $S$-representations, then $S$ is a local metric generator for $G$. A local metric generator of smallest order is a local metric basis for…
We will show that if a proper complete CAT(0) space X has a visual boundary homeomorphic to the join of two Cantor sets, and X admits a geometric group action by a group containing a subgroup isomorphic to Z^2, then its Tits boundary is the…
Mechanistic interpretability aims to reverse-engineer transformer computations by identifying causal circuits through activation patching. However, scaling these interventions across diverse prompts and task families produces…
Counting the solutions to Boolean formulae defines the problem #SAT, which is complete for the complexity class #P. We use the ZH-calculus, a universal and complete graphical language for linear maps which naturally encodes counting…
We prove some finiteness results for discrete isometry groups $\Gamma$ of uniformly packed CAT$(0)$-spaces $X$ with uniformly bounded codiameter (up to group isomorphism), and for CAT$(0)$-orbispaces $M = \Gamma \backslash X$ (up to…
We present here some results on particular elimination schemes for chordal graphs, namely we show that for any chordal graph we can construct in linear time a simplicial elimination scheme starting with a pending maximal clique attached via…
This expository article builds on lecture notes from a minicourse entitled "Cremona groups and CAT(0) cube complexes" and given by the author as part of the 2023 Riverside Workshop on Geometric Group Theory. It presents recent constructions…
Chirality is one of the important assymmetrical property in wide area of natural science, which has been studied to predict molecular behavior. One of good methods to analyze molecules with complex structures is representing them as graphs…
An infinite graph G is minor excluded if there is a finite graph that is not a minor of G. We prove that minor excluded graphs have finite Assouad-Nagata dimension and study minor exclusion for Cayley graphs of finitely generated groups.…
We prove that finitely generated (not necessarily finitely presented) $C'(\frac{1}{33})$-groups are bi-exact. This is a new class of bi-exact groups.
We define and investigate separable K-linear categories. We show that such a category C is locally finite and that every left C-module is projective. We apply our main results to characterize separable linear categories that are spanned by…
We exhibit a variety of groups that act properly and even cocompactly on median graphs (a.k.a. one-skeletons of CAT(0) cube complexes), with quasi-isometric groups that do not admit any proper action on a median graph. This answes a…
We introduce a compactification construction for abstract quasi-local C*-algebras over countable metric spaces equipped with an isometric group action which is functorial with respect to bounded spread isomorphisms. In $1$D, the…
Various authors have been generalizing some unital ring properties to nonunital rings. We consider properties related to cancellation of modules (being unit-regular, having stable range one, being directly finite, exchange, or clean) and…
In the present paper we develop a small cancellation theory for associative algebras with a basis of invertible elements. Namely, we study quotients of a group algebra of a free group and introduce three axioms for the corresponding…
We introduce and study the framework of compact metric structures and their associated notions of isomorphisms such as homeomorphic and bi-Lipschitz isomorphism. This is subsequently applied to model various classification problems in…
We study the way in which the abstract structure of a small overlap monoid is reflected in, and may be algorithmically deduced from, a small overlap presentation. We show that every C(2) monoid admits an essentially canonical C(2)…
A proof labelling scheme for a graph class $\mathcal{C}$ is an assignment of certificates to the vertices of any graph in the class $\mathcal{C}$, such that upon reading its certificate and the certificates of its neighbors, every vertex…