Related papers: Embeddability and universal theory of partially co…

The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups…

In this note we give two examples of partially commutative subgroups of partially commutative groups. Our examples are counterexamples to the Extension Graph Conjecture and to the Weakly Chordal Conjecture of Kim and Koberda, \cite{KK}. On…

For a finite simplicial graph $\Gamma$, let $A(\Gamma)$ denote the right-angled Artin group on $\Gamma$. Recently Kim and Koberda introduced the extension graph $\Gamma^e$ for $\Gamma$, and established the Extension Graph Theorem: for…

In the Partially Embedded Planarity problem, we are given a graph $G$ together with a topological drawing of a subgraph $H$ of $G$. The task is to decide whether the drawing can be extended to a drawing of the whole graph such that no two…

This paper deals with the extension of partial actions of topological groups on topological spaces. Within this framework, we introduce a class of topological embeddings defined via the inverse semigroup of homeomorphisms between open…

Let $\Gamma$ be a finitely generated group which is hyperbolic relative to a finite family $\{H_1,...,H_n\}$ of subgroups. We prove that $\Gamma$ is uniformly embeddable in a Hilbert space if and only if each subgroup $H_i$ is uniformly…

We study Measurable Imbeddability between groups, which is an order-like generalization of Measure Equivalence that allows the imbedded group to have an infinite measure fundamental domain. We prove if $\Lambda_1$ measurably imbeds into…

Let $\Gamma$ be a finite graph and let $\Gamma^{\mathrm{e}}$ be its extension graph. We inductively define a sequence $\{\Gamma_i\}$ of finite induced subgraphs of $\Gamma^{\mathrm{e}}$ through successive applications of an operation called…

Let $T$ be a complete, model-complete, geometric dp-minimal $\mathcal{L}$-theory of topological fields of characteristic $0$ and let $T(\partial)$ be the theory of expansions of models of $T$ by a derivation $\partial$. We assume that…

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…

A finite simple graph $\Gamma$ determines a quotient $P_\Gamma$ of the pure braid group, called a graphic arrangement group. We analyze homomorphisms of these groups defined by deletion of sets of vertices, using methods developed in prior…

It is proved that the assembly map in algebraic K- and L-theory with respect to the family of finite subgroups is injective for groups $\Gamma$ with finite quotient finite decomposition complexity (a strengthening of finite decomposition…

In this paper we expand on previous results, studying the extent to which one can detect fusion in certain finite groups $\Gamma$, from information about the universal deformation rings of absolutely irreducible…

For a finite graph $\Gamma$, let $G(\Gamma)$ be the right-angled Artin group defined by the complement graph of $\Gamma$. We show that, for any linear forest $\Lambda$ and any finite graph $\Gamma$, $G(\Lambda)$ can be embedded into…

Let $\Gamma$ be a finitely generated cocompact lattice of a totally disconnected locally compact group $G$, and $C$ a dense subgroup of $G$ that contains and commensurates $\Gamma$. We study the problem of describing all finitely generated…

For any torsion-free hyperbolic group $\Gamma$ and any group $G$ that is fully residually $\Gamma$, we construct algorithmically a finite collection of homomorphisms from $G$ to groups obtained from $\Gamma$ by extensions of centralizers,…

The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…

The end compactification |\Gamma| of the locally finite graph \Gamma is the union of the graph and its ends, endowed with a suitable topology. We show that \pi_1(|\Gamma|) embeds into a nonstandard free group with hyperfinitely many…

The algorithm of Gutwenger et al. to insert an edge $e$ in linear time into a planar graph $G$ with a minimal number of crossings on $e$, is a helpful tool for designing heuristics that minimize edge crossings in drawings of general graphs.…

We consider the embeddability problem of a graph G into a two-dimensional simplicial complex C: Given G and C, decide whether G admits a topological embedding into C. The problem is NP-hard, even in the restricted case where C is…