English
Related papers

Related papers: Quasi-actions on trees II: Finite depth Bass-Serre…

200 papers

We give necessary and sufficient conditions under which a quasi-action of any group on an arbitrary metric space can be reduced to a cobounded isometric action on some bounded valence tree, following a result of Mosher, Sageev and Whyte.…

Group Theory · Mathematics 2023-05-23 J. O. Button

Coarse geometry is the study of large-scale properties of spaces. In this paper we study group coarse structures (i.e., coarse structures on groups that agree with the algebraic structures), by using group ideals. We introduce a large class…

General Topology · Mathematics 2019-05-15 Dikran Dikranjan , Nicolò Zava

In this paper, we examine the structure of vertex- and edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using…

Combinatorics · Mathematics 2009-07-10 Joy Morris , Cheryl E. Praeger , Pablo Spiga

We construct quasi-isometry invariants of a one-ended finitely presented group by considering the tree of cylinders of a two-ended JSJ decomposition of the group. When the group satisfies additional quasi-isometric rigidity hypotheses we…

Group Theory · Mathematics 2016-01-28 Christopher H. Cashen

Given a group acting on a graph quasi-isometric to a tree, we give sufficent conditions for a pseudocharacter to be bushy. We relate this with the conditions studied by M. Bestvina and K. Fujiwara on their work on bounded cohomology and…

Group Theory · Mathematics 2015-03-19 Álvaro Martínez-Pérez

We study the construction of quasimorphisms on groups acting on trees introduced by Monod and Shalom, that we call median quasimorphisms, and in particular we fully characterise actions on trees that give rise to non-trivial median…

Group Theory · Mathematics 2014-12-01 Alessandra Iozzi , Cristina Pagliantini , Alessandro Sisto

The emergence of massive graph data sets requires fast mining algorithms. Centrality measures to identify important vertices belong to the most popular analysis methods in graph mining. A measure that is gaining attention is forest…

Data Structures and Algorithms · Computer Science 2021-01-18 Alexander van der Grinten , Eugenio Angriman , Maria Predari , Henning Meyerhenke

We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative…

Combinatorics · Mathematics 2026-05-14 Joseph Paul MacManus

In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…

Group Theory · Mathematics 2016-03-23 Cora Welsch

We prove that a minimal second countable ample groupoid has dynamical comparison if and only if its type semigroup is almost unperforated. Moreover, we investigate to what extent a not necessarily minimal almost finite groupoid has an…

Dynamical Systems · Mathematics 2021-09-14 Pere Ara , Christian Bönicke , Joan Bosa , Kang Li

In this monograph we lay the foundation for a theory of coarse groups and coarse actions. Coarse groups are group objects in the category of coarse spaces, and can be thought of as sets with operations that satisfy the group axioms "up to…

Group Theory · Mathematics 2023-07-10 Arielle Leitner , Federico Vigolo

A recent result of Condon, Kim, K\"{u}hn and Osthus implies that for any $r\geq (\frac{1}{2}+o(1))n$, an $n$-vertex almost $r$-regular graph $G$ has an approximate decomposition into any collections of $n$-vertex bounded degree trees. In…

Combinatorics · Mathematics 2018-08-28 Jaehoon Kim , Younjin Kim , Hong Liu

It is known that PQ-symmetric maps on the boundary characterize the quasi-isometry type of visual hyperbolic spaces, in particular, of geodesically complete \br-trees. We define a map on pairs of PQ-symmetric ultrametric spaces which…

Geometric Topology · Mathematics 2010-02-08 Álvaro Martínez-Pérez

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…

Combinatorics · Mathematics 2016-09-05 Lord Clifford Kavi

Well-graded families, extremal systems and maximum systems (the last two in the sense of VC-theory and Sauer-Shelah lemma on VC-dimension) are three important classes of set systems. This paper aims to study the notion of duality in the…

Combinatorics · Mathematics 2022-12-19 Alireza Mofidi

In this paper we study group actions on quasi-median graphs, or 'CAT(0) prism complexes', generalising the notion of CAT(0) cube complexes. We consider hyperplanes in a quasi-median graph $X$ and define the contact graph $\mathcal{C}X$ for…

Group Theory · Mathematics 2021-03-26 Motiejus Valiunas

Let C be a smooth, projective and geometrically integral curve defined over a finite field F. For each closed point P of C, let R be the ring of functions that are regular outside P, and let K be the completion at P of the function field of…

Group Theory · Mathematics 2022-05-17 Claudio Bravo

We consider the problem of deciding if a group is the fundamental group of a smooth connected complex quasi-projective (or projective) variety using Alexander-based invariants. In particular, we solve the problem for large families of…

Algebraic Geometry · Mathematics 2010-05-31 Enrique Artal Bartolo , Jose Ignacio Cogolludo-Agustin , Daniel Matei

Recently, there has been interest in the question of whether a partial matrix in which many of the fully defined principal submatrices are PSD is approximately PSD completable. These questions are related to graph theory because we can…

Optimization and Control · Mathematics 2021-07-27 Kevin Shu

Quasi-isometries are mappings on graphs, with distance-distortions parameterized by a multiplicative factor and an additive constant. The distance-distortions of quasi-isometries are in a general form that captures a wide range of…

Data Structures and Algorithms · Computer Science 2022-08-22 Khí-Uí Soo , Bakhadyr Khoussainov , Simone Linz
‹ Prev 1 4 5 6 7 8 10 Next ›