Related papers: Deciding Isomorphy using Dehn fillings, the splitt…
In the perfect tiling problem, we aim to cover the vertices of a hypergraph~$G$ with pairwise vertex-disjoint copies of a hypergraph $F$. There are three essentially necessary conditions for such a perfect tiling, which correspond to…
Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…
We verify a conjecture of Vershik by showing that Hall's universal countable locally finite group can be embedded as a dense subgroup in the isometry group of the Urysohn space and in the automorphism group of the random graph. In fact, we…
Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…
We give three infinite families of examples of nonhyperbolic Dehn fillings on hyperbolic manifolds. A manifold in the first family admits two Dehn fillings of distance two apart, one of which is toroidal and annular, and the other is…
We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random $k$-uniform hypergraph $H_{n,p;k}$, for a wide range of $p$. We also show that it is solvable w.h.p. for random…
The Decomposition Problem in the class $LIP(\mathbb{S}^2)$ is to decompose any bi-Lipschitz map $f:\mathbb{S}^2 \to \mathbb{S}^2$ as a composition of finitely many maps of arbitrarily small isometric distortion. In this paper, we construct…
We introduce an optimal transport based approach for comparing undirected graphs with non-negative edge weights and general vertex labels, and we study connections between the resulting linear program and the graph isomorphism problem. Our…
In this paper, we address the following two general problems: given two algebraic varieties in ${\bf C}^n$, find out whether or not they are (1) isomorphic; (2) equivalent under an automorphism of ${\bf C}^n$. Although a complete solution…
J.H.C. Whitehead's second free-group algorithm determines whether or not two given elements of a free group lie in the same orbit of the automorphism group of the free group. The algorithm involves certain connected graphs, and Whitehead…
Given two tuples of subspaces, can you tell whether the tuples are isomorphic? We develop theory and algorithms to address this fundamental question. We focus on isomorphisms in which the ambient vector space is acted on by either a unitary…
Consider the mapping class group $\Mod_{g,p}$ of a surface $\Sigma_{g,p}$ of genus $g$ with $p$ punctures, and a finite collection $\{f_1,...,f_k\}$ of mapping classes, each of which is either a Dehn twist about a simple closed curve or a…
In this paper we extend Thurston's hyperbolic Dehn surgery theorem to a class of geometrically infinite hyperbolic 3-manifolds. As an application we prove a modest density theorem for Kleinian groups. We also discuss hyperbolic Dehn surgery…
The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…
We study the cohomology of group theoretic Dehn fillings. Applying the Cohen-Lyndon property for sufficiently deep Dehn fillings of hyperbolically embedded subgroups $H\hookrightarrow_h G$, obtained by the second named author, we derive a…
The smooth (resp. metric and complex) Nielsen Realization Problem for K3 surfaces $M$ asks: when can a finite group $G$ of mapping classes of $M$ be realized by a finite group of diffeomorphisms (resp. isometries of a Ricci-flat metric, or…
It is shown that there exist infinitely many non-integers $r>2$ such that the Dehn function of some finitely presented group is $\simeq n^r$. For each positive rational number $s$ we construct pairs of finitely presented groups $H\subset G$…
We propose a method for solving the hidden subgroup problem in nilpotent groups. The main idea is iteratively transforming the hidden subgroup to its images in the quotient groups by the members of a central series, eventually to its image…
The main results in this paper provide upper bounds of the second order Dehn functions for three-dimensional groups Nil and Sol. These upper bounds are obtained by using the Varopoulos transport argument on dual graphs. The first step is to…
Let $A \leq G$ be a subgroup of a group $G$. An $A$-complement of $G$ is a subgroup $H$ of $G$ such that $G = A H$ and $A \cap H = \{1\}$. The \emph{classifying complements problem} asks for the description and classification of all…