Related papers: On a small cancellation theorem of Gromov

We give a proof that groups satisfying the "uniform C'(1/6)" small cancellation condition admit a geometric action on a CAT(-1) space. It follows that random groups at density <1/12 are CAT(-1). The proof consists of a direct construction…

We study for subgroups $G\subseteq U(N)$ partial summations of the $\theta$-expanded perturbation theory. On diagrammatic level a summation procedure is established, which in the U(N) case delivers the full star-product induced rules.…

The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…

We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…

In the local, characteristic 0, non archimedean case, we consider distributions on GL(n+1) which are invariant under the adjoint action of GL(n). We prove that such distributions are invariant by transposition. This implies that an…

In this paper we prove a combination theorem for Veech subgroups of the mapping class group analogous to the first Klein-Maskit combination theorem for Kleinian groups in which two Fuchsian subgroups are amalgamated along a parabolic…

We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…

The goal of this paper is to lay the foundations for a combinatorial study, via orthogonal functions and intertwining operators, of category O for the rational Cherednik algebra of type G(r,p,n). As a first application, we give a…

The groupoid of projectivities, introduced by M. Joswig, serves as a basis for a construction of parallel transport of graph and more general $Hom$-complexes. In this framework we develop a general conceptual approach to the Lovasz…

We prove the decoration theorem for the Mandelbrot set (and Multibrot sets) which says that when a "little Mandelbrot set" is removed from the Mandelbrot set, then most of the resulting connected components have small diameters.

Given a finitely generated group $\Gamma$, a directed graph $\Lambda$, and a map $R:\Lambda\to\Gamma$, we introduce the notion of an $(R,\Lambda)$-directed Anosov representation. This is a weakening of the notion of Anosov representations.…

We generalize Gruber--Sisto's construction of the coned--off graph of a small cancellation group to build a partially ordered set $\mathcal{TC}$ of cobounded actions of a given small cancellation group whose smallest element is the action…

Thurston obtained a combinatorial characterization for generic branched self-coverings that preserve the orientation of the oriented 2-sphere by associating a planar graph to them [arXiv:1502.04760]. In this work, the Thurston result is…

We introduce a set of iterative equations that exactly solves the size distribution of components on small arbitrary graphs after the random removal of edges. We also demonstrate how these equations can be used to predict the distribution…

This paper generalizes the basic notions of additive and multiplicative combinatorics to the setting of group actions: if $G$ is a group acting on a set $X$, and we have subsets $A\subseteq G$ and $Y\subseteq X$ such that the set of pairs…

This paper introduces a notion of presentation for locally inverse semigroups and develops a graph structure to describe the elements of locally inverse semigroups given by these presentations. These graphs will have a role similar to the…

We define a new Gromov-Witten theory relative to simple normal crossing divisors as a limit of Gromov-Witten theory of multi-root stacks. Several structural properties are proved including relative quantum cohomology, Givental formalism,…

In this article, we give an elementary combinatorial proof of a conjecture about the determination of automorphism group of the power graph of finite cyclic groups, proposed by Doostabadi, Erfanian and Jafarzadeh in 2013.

We give a new simple characterization of the set of Kleshchev multipartitions, and more generally of the set of Uglov multipartitions. These combinatorial objects play an important role in various areas of representation theory of quantum…

We consider descent data in cosimplicial crossed groupoids. This is a combinatorial abstraction of the descent data for gerbes in algebraic geometry. The main result is this: a weak equivalence between cosimplicial crossed groupoids induces…