English
Related papers

Related papers: Nowhere-zero 3-flows in nilpotently vertex-transit…

200 papers

Recently, the work on quantum automorphism groups of graphs has seen renewed progress, which we expand in this paper. Quantum symmetry is a richer notion of symmetry than the classical symmetries of a graph. In general, it is non-trivial to…

Quantum Algebra · Mathematics 2024-04-24 Julien Schanz

The main result of this paper is that, if $\Gamma$ is a connected 4-valent $G$-arc-transitive graph and $v$ is a vertex of $\Gamma$, then either $\Gamma$ is one of a well understood infinite family of graphs, or $|G_v|\leq 2^43^6$ or…

Combinatorics · Mathematics 2010-10-14 Primoz Potocnik , Pablo Spiga , Gabriel Verret

Quasi-vertex-transitive maps are the homogeneous maps on the plane with finitely many vertex orbits under the action of their automorphism groups. We show that there exist quasi-vertex-transitive maps of types $[p^3, 3]$ for $p \equiv 1$…

Geometric Topology · Mathematics 2020-03-26 Arun Maiti

A graph is said to be {\em half-arc-transitive} if its automorphism group acts transitively on the set of its vertices and edges but not on the set of its arcs. With each half-arc-transitive graph of valency 4 a collection of the so called…

Combinatorics · Mathematics 2007-05-23 Primoz Sparl

In this article we study the notion of capacity of a vertex for infinite graphs over non-Archimedean fields. In contrast to graphs over the real field monotone limits do not need to exist. Thus, in our situation next to positive and null…

Analysis of PDEs · Mathematics 2025-01-03 Florian Fischer , Matthias Keller , Anna Muranova , Noema Nicolussi

We show that the automorphism group of every zero entropy infinite shift admits a "drift" homomorphism to $(\mathbb{R},+)$ that maps the shift map to 1. This homomorphism arises as the expectation, under an invariant measure, of a cocycle…

Dynamical Systems · Mathematics 2022-02-21 Omer Tamuz

For a graph $\Gamma$, a positive integer $s$ and a subgroup $G\leq \Aut(\Gamma)$, we prove that $G$ is transitive on the set of $s$-arcs of $\Gamma$ if and only if $\Gamma$ has girth at least $2(s-1)$ and $G$ is transitive on the set of…

Combinatorics · Mathematics 2012-01-23 Alice Devillers , Wei Jin , Cai Heng Li , Cheryl E. Praeger

We prove that if a group is nilpotent (resp. metabelian), then so is the subgroup of its automorphism group generated by all polynomial automorphisms.

Group Theory · Mathematics 2007-05-23 G. Endimioni

We prove that every locally finite vertex-transitive graph $G$ admits a non-constant Lipschitz harmonic function.

Combinatorics · Mathematics 2023-09-13 Gideon Amir , Guy Blachar , Maria Gerasimova , Gady Kozma

We study (topological) pseudo-Anosov flows from the perspective of the associated group actions on their orbit spaces and boundary at infinity. We extend the definition of Anosov-like action from [BFM22] from the transitive to the general…

Dynamical Systems · Mathematics 2026-02-16 Thomas Barthelmé , Christian Bonatti , Kathryn Mann

A graph is said to be globally rigid in $d$-dimensional space if almost all of its embeddings are unique up to isometries. If a graph has enough automorphisms to send any of its vertices into any other, then it is called vertex-transitive.…

Combinatorics · Mathematics 2026-01-19 Angelo El Saliby

We observe that automorphism groups of right-angled Artin groups contain nilpotent non-abelian subgroups, namely $H_3(\mathbb{Z})$ the three-dimensional integer Heisenberg group, provided they admit a certain type of element, called an…

Group Theory · Mathematics 2018-03-23 Javier Aramayona , Anthony Genevois

A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. If the isolated vertex is excluded as trivial, nut graphs have seven or more vertices;…

Combinatorics · Mathematics 2023-12-07 Nino Bašić , Patrick W. Fowler , Tomaž Pisanski

For each of the 14 classes of edge-transitive maps described by Graver and Watkins, necessary and sufficient conditions are given for a group to be the automorphism group of a map, or of an orientable map without boundary, in that class.…

Combinatorics · Mathematics 2019-06-26 Gareth A. Jones

Identities obtained by elementary finite Fourier analysis are used to derive a variety of evaluations of the Tutte polynomial of a graph G at certain points (a,b) where (a-1)(b-1) equals 2 or 4. These evaluations are expressed in terms of…

Combinatorics · Mathematics 2007-09-20 Andrew J. Goodall

A finite simple graph $\Gamma$ is called a Nest graph if it is regular of valency $6$ and admits an automorphism $\rho$ with two orbits of the same length such that at least one of the subgraphs induced by these orbits is a cycle. We say…

Combinatorics · Mathematics 2022-08-29 István Kovács

A theorem of Hoffman gives an upper bound on the independence ratio of regular graphs in terms of the minimum $\lambda_{\min}$ of the spectrum of the adjacency matrix. To complement this result we use random eigenvectors to gain lower…

Probability · Mathematics 2016-08-11 Viktor Harangi , Bálint Virág

We show that for every non-elementary hyperbolic group, an associated topological flow space admits a coding based on a transitive subshift of finite type. Applications include regularity results for Manhattan curves, the uniqueness of…

Dynamical Systems · Mathematics 2024-03-19 Stephen Cantrell , Ryokichi Tanaka

In this paper, we study arc-transitive Cayley graphs on non-abelian simple groups with soluble stabilizers and valency seven. Let $\Ga$ be such a Cayley graph on a non-abelian simple group $T$. It is proved that either $\Ga$ is a normal…

Combinatorics · Mathematics 2017-08-01 Jiangmin Pan , Fugang Yin , Bo Ling

We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…

Group Theory · Mathematics 2024-05-24 Martin W. Liebeck , Cheryl E. Praeger