English
Related papers

Related papers: Algorithms and topology for Cayley graphs of group…

200 papers

In this paper we describe how one can obtain Lie group structures on the group of (vertical) bundle automorphisms for a locally convex principal bundle P over the compact manifold M. This is done by first considering Lie group structures on…

Differential Geometry · Mathematics 2007-11-28 Christoph Wockel

We prove that in dimensions not equal to 4, 5, or 7, the homology and homotopy groups of the classifying space of the topological group of diffeomorphisms of a disk fixing the boundary are finitely generated in each degree. The proof uses…

Algebraic Topology · Mathematics 2019-10-23 Alexander Kupers

We prove that the first homology group of every planar locally transitive finite graph $G$ is a finitely generated ${\rm Aut}(G)$-module and we prove a similar result for the fundamental group of locally finite planar Cayley graphs.…

Combinatorics · Mathematics 2016-05-13 Matthias Hamann

A Cayley graph for a group $G$ is CCA if every automorphism of the graph that preserves the edge-orbits under the regular representation of $G$ is an element of the normaliser of $G$. A group $G$ is then said to be CCA if every connected…

Group Theory · Mathematics 2017-03-24 Luke Morgan , Joy Morris , Gabriel Verret

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…

Group Theory · Mathematics 2025-04-03 Murray Elder , Adam Piggott , Florian Stober , Alexander Thumm , Armin Weiß

We offer a new structural basis for the theory of 3-connected graphs, providing a unique decomposition of every such graph into parts that are either quasi 4-connected, wheels, or thickened $K_{3,m}$'s. Our construction is explicit,…

Combinatorics · Mathematics 2025-07-25 Johannes Carmesin , Jan Kurkofka

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

Combinatorics · Mathematics 2009-10-30 Reinhard Diestel , Philipp Sprüssel

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

Combinatorics · Mathematics 2009-04-14 Julia Brown

Let $k \geq 1$ be an integer and $n=3k-1$. Let $\mathbb{Z}_n$ denote the additive group of integers modulo $n$ and let $C$ be the subset of $\mathbb{Z}_n$ consisting of the elements congruent to 1 modulo 3. The Cayley graph…

Combinatorics · Mathematics 2022-06-03 S. Morteza Mirafzal

We deal with first-order definability in the substructure ordering $(\mathcal{D}; \sqsubseteq)$ of finite directed graphs. In two papers, the author has already investigated the first-order language of the embeddability ordering $(…

Logic · Mathematics 2021-01-22 Ádám Kunos

We compute Aut(W) for any even Coxeter group whose Coxeter diagram is connected, contains no edges labeled 2, and cannot be separated into more than 2 connected components by removing a single vertex. The description is given explicitly in…

Group Theory · Mathematics 2007-05-23 Patrick Bahls

We study the density of periodic configurations for shift spaces defined on (the Cayley graph of) a finitely generated group. We prove that in the case of a full shift on a residually finite group and in that of a group shift space on an…

Formal Languages and Automata Theory · Computer Science 2014-02-27 Francesca Fiorenzi

Let (S, B) be the log pair associated with a projective completion of a smooth quasi-projective surface V . Under the assumption that the boundary B is irreducible, we obtain an algorithm to factorize any automorphism of V into a sequence…

Algebraic Geometry · Mathematics 2016-10-25 Adrien Dubouloz , Stéphane Lamy

We introduce uniformly vertex-transitive graphs as vertex-transitive graphs satisfying a stronger condition on their automorphism groups, motivated by a problem which arises from a Sinkhorn-type algorithm. We use the derangement graph…

Combinatorics · Mathematics 2019-12-03 Simon Schmidt , Chase Vogeli , Moritz Weber

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

General Mathematics · Mathematics 2007-05-23 Aleksandr Golubchik

We prove the existence of an automorphism-invariant coupling for the wired and the free uniform spanning forests on Cayley graphs of finitely generated residually amenable groups.

Probability · Mathematics 2007-05-23 Lewis Bowen

We compute the topological mapping class group of every compact, simply connected, topological 4-manifold. This was previously only known in the closed case. If the 4-manifold is smooth, we deduce an analogous description of the stable…

Geometric Topology · Mathematics 2024-08-16 Patrick Orson , Mark Powell

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…

Probability · Mathematics 2021-02-05 Jonathan Hermon , Sam Olesker-Taylor

By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…

Combinatorics · Mathematics 2021-01-08 Ken-ichi Kawarabayashi , Bojan Mohar , Roman Nedela , Peter Zeman

We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable…

Combinatorics · Mathematics 2017-12-29 Micheal Pawliuk , Miodrag Sokic