English
Related papers

Related papers: Schreier graphs: transitivity and coverings

200 papers

We show that the identity component of the group of diffeomorphisms of a closed oriented surface of positive genus admits many unbounded quasi-morphisms. As a corollary, we also deduce that this group is not uniformly perfect and its…

Geometric Topology · Mathematics 2020-03-31 Jonathan Bowden , Sebastian Hensel , Richard Webb

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

Dynamical Systems · Mathematics 2018-09-10 Omer Angel , Alexander S. Kechris , Russell Lyons

This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.

Combinatorics · Mathematics 2025-05-28 Sergio G. Gómez-Galicia , Octavio B. Zapata-Fonseca

Let $G$ be a group. The intersection graph of subgroups of $G$, denoted by $\mathscr{I}(G)$, is a graph with all the proper subgroups of $G$ as its vertices and two distinct vertices in $\mathscr{I}(G)$ are adjacent if and only if the…

Group Theory · Mathematics 2015-06-03 R. Rajkumar , P. Devi

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

A proof of Sharkovsky's Theorem is given. It is shown how this proof naturally generalizes to looking at maps on graphs and to Sharkovsky-type theorems for these maps. The paper is written at an elementary level and is meant as an…

Dynamical Systems · Mathematics 2012-01-18 Chris Bernhardt

We characterize when a generalized Baumslag-Solitar group is linear, and extend the result to the fundamental groups of a graph of groups with infinite virtually cyclic vertex and edge groups.

Group Theory · Mathematics 2026-05-27 Hsuan-Yu Wang

The work provides a brief intuitive overview theory of graph on surfaces. We considers graphs with an additional structure, wich we call discs with ribbons, also known as one-vertex ribbon graphs. And solves the problem (Skopenkov's) about…

Combinatorics · Mathematics 2025-07-03 Tim Berezin

Let I be a toric ideal. We say I is robust if its universal Groebner basis is a minimal generating set. We show that any robust toric ideal arising from a graph G is also minimally generated by its Graver basis. We then completely…

We propose the study of Markov chains on groups as a "quasi-isometry invariant" theory that encompasses random walks. In particular, we focus on certain classes of groups acting on hyperbolic spaces including (non-elementary) hyperbolic and…

Group Theory · Mathematics 2022-11-24 Antoine Goldsborough , Alessandro Sisto

We prove that simple, thick hyperbolic P-manifolds of dimension >2 exhibit Mostow rigidity. We also prove a quasi-isometry rigidity result for the fundamental groups of simple, thick hyperbolic P-manifolds of dimension >2. The key tool in…

Geometric Topology · Mathematics 2007-05-23 J. -F. Lafont

This paper considers the problem of defining distributions over graphical structures. We propose an extension of the hyper Markov properties of Dawid and Lauritzen [Ann. Statist. 21 (1993) 1272-1317], which we term structural Markov…

Statistics Theory · Mathematics 2020-04-28 Simon Byrne , A. Philip Dawid

A new approach to find all the transitive orientations for a comparability graph (finite or infinite) is presented. This approach is based on the link between the notion of ``strong'' partitive set and the forcing theory (notions of…

alg-geom · Mathematics 2008-02-03 A. Belkasri , M. Hamade

Turaev's shadow can be seen locally as the Stein factorization of a stable map. In this paper, we define the notion of stable map complexity for a compact orientable 3-manifold bounded by (possibly empty) tori counting, with some weights,…

Geometric Topology · Mathematics 2014-03-05 Masaharu Ishikawa , Yuya Koda

Some families of graphs, such as the n-cubes and Sierpinski gaskets, are self-similar. In this paper we show how such recursive structure can be used systematically to prove isoperimetric theorems.

Combinatorics · Mathematics 2016-10-10 L. H. Harper

We study lines through the origin of finite-dimensional complex vector spaces that enjoy a doubly transitive automorphism group. This paper classifies those lines that exhibit almost simple symmetries. We introduce a general recipe…

Combinatorics · Mathematics 2022-12-27 Joseph W. Iverson , Dustin G. Mixon

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

Group Theory · Mathematics 2009-05-08 M. J. Dunwoody

We give two criteria for diagrams of Heegaard splittings of 3-manifolds. Weaker one of them guarantees that the splitting is strongly irreducible, and the stronger one guarantees in addition that the Goeritz group is finite. They are…

Geometric Topology · Mathematics 2024-04-23 Yuya Koda , Kazuto Takao

We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…

Logic · Mathematics 2024-07-24 M. Malliaris , S. Shelah

This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…

Combinatorics · Mathematics 2024-11-04 Peter J. Cameron