Related papers: On a small cancellation theorem of Gromov

In this paper, we extend the sampling theory on graphs by constructing a framework that exploits the structure in product graphs for efficient sampling and recovery of bandlimited graph signals that lie on them. Product graphs are graphs…

In this work, we prove a general version of the reduction lemmas for eigenfunctions of graphs admitting involutive automorphisms of a special type.

We produce a new, shorter construction of a minor-universal planar graph.

Let $A$ be an additively cancellative semialgebra over an additively cancellative semifield $K$ as defined in [9]. For a given partial action $\alpha$ of a group $G$ on an algebra, the associativity of partial skew group ring together with…

We give a geometric proof of a well known theorem that describes splittings of a free group as an amalgamated product or HNN extension over the integers. The argument generalizes to give a similar description of splittings of a virtually…

We describe recent advances in the study of random analogues of combinatorial theorems.

The theory of covering spaces is often used to prove the Nielsen-Schreier theorem, which states that every subgroup of a free group is free. We apply the more general theory of semicovering spaces to obtain analogous subgroup theorems for…

We discuss a very general Kirillov Theory for the representations of certain nilpotent groups which gives a combined view an many known examples from the literature.

Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered.

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…

Using small cancellation for rotating families of groups, we construct new examples of aspherical polyhedra.

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…

We establish a quantitative version of the Gromov compactness theorem for closed genus 0 pseudoholomorphic curves in the setting of a tamed almost complex manifold with bounded geometry.

The paper is devoted to a generalized and improved version of author's approach to Gromov bounded cohomology theory. In particular, the awkward countability assumption is removed and the aspects related to homological algebra are clarified.…

We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…

Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835--4842], we define a new class of combinatorial designs which simultaneously provide a generalization…

For smooth projective G-varieties, we equate the gauged Gromov-Witten invariants for sufficiently small area and genus zero with the invariant part of equivariant Gromov-Witten invariants. As an application we deduce a gauged version of…

We establish a broad generalization of Whitney's broken circuit theorem on the chromatic polynomial of a graph to sums of type $\sum_{A\subseteq S} f(A)$ where $S$ is a finite set and $f$ is a mapping from the power set of $S$ into an…

We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…

We present a simple proof of the fundamental theorem of Galois theory, which establishes a correspondence between the intermediate fields of a finite Galois extension and the subgroups of its Galois group. The proof is based on the…