English
Related papers

Related papers: Maximal harmonic group actions on finite graphs

200 papers

This is a survey on the automorphism groups in various classes of affine algebraic surfaces and the algebraic group actions on such surfaces. Being infinite-dimensional, these automorphism groups share some important features of algebraic…

Algebraic Geometry · Mathematics 2025-03-06 Sergei Kovalenko , Alexander Perepechko , Mikhail Zaidenberg

With any self-similar action of a finitely generated group $G$ of automorphisms of a regular rooted tree $T$ can be naturally associated an infinite sequence of finite graphs $\{\Gamma_n\}_{n\geq 1}$, where $\Gamma_n$ is the Schreier graph…

Group Theory · Mathematics 2015-03-13 Daniele D'Angeli , Alfredo Donno , Michel Matter , Tatiana Nagnibeda

A group with a geometric action on some hyperbolic space is necessarily word hyperbolic, but on the other hand every countable group acts (metrically) properly by isometries on a locally finite hyperbolic graph. In this paper we consider…

Group Theory · Mathematics 2021-11-29 J. O. Button

A graph $\G$ with a group $H$ of automorphisms acting semiregularly on the vertices with two orbits is called a {\em bi-Cayley graph} over $H$. When $H$ is a normal subgroup of $\Aut(\G)$, we say that $\G$ is {\em normal} with respect to…

Combinatorics · Mathematics 2016-07-15 Jin-Xin Zhou

For given graphs $G$ and $H$, let $|Hom(G,H)|$ denote the set of graph homomorphisms from $G$ to $H$. We show that for any finite, $n$-regular, bipartite graph $G$ and any finite graph $H$ (perhaps with loops), $|Hom(G,H)|$ is maximum when…

Combinatorics · Mathematics 2012-06-15 David Galvin , Prasad Tetali

Let $G$ be $2$-generated group. The generating graph of $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G=\langle g,h\rangle$. This graph encodes the combinatorial…

Group Theory · Mathematics 2020-06-15 Scott Harper , Andrea Lucchini

We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.

Group Theory · Mathematics 2015-10-26 John R. Britnell , Nick Gill

Let Gamma_0 be a discrete group. For a pair (j,rho) of representations of Gamma_0 into PO(n,1)=Isom(H^n) with j geometrically finite, we study the set of (j,rho)-equivariant Lipschitz maps from the real hyperbolic space H^n to itself that…

Geometric Topology · Mathematics 2017-03-29 François Guéritaud , Fanny Kassel

In previous work, all finite simple groups that act with fixity 4 have been classified. In this article we investigate which ones of these groups act faithfully on a compact Riemann surface of genus at least 2 with fixity four in total and…

Group Theory · Mathematics 2026-03-17 Patrick Salfeld , Rebecca Waldecker

Magnitude homology is a bigraded homology theory for finite graphs defined by Hepworth and Willerton, categorifying the power series invariant known as magnitude which was introduced by Leinster. We analyze the structure and implications of…

Combinatorics · Mathematics 2020-01-01 Radmila Sazdanovic , Victor Summers

In this paper, we investigate certain graphs defined on groups, with a focus on infinite groups. The graphs discussed are the power graph, the enhanced power graph, and the commuting graph whose vertex set is a group $G$. The power graph is…

Group Theory · Mathematics 2024-10-15 Surbhi , Geetha Venkataraman

Perfect matchings and maximum weight matchings are two fundamental combinatorial structures. We consider the ratio between the maximum weight of a perfect matching and the maximum weight of a general matching. Motivated by the computer…

Discrete Mathematics · Computer Science 2018-11-08 Emilio Vital Brazil , Guilherme D. da Fonseca , Celina de Figueiredo , Diana Sasaki

We show that the (topological) full group of a minimal pseudogroup over the Cantor set satisfies various rigidity phenomena of topological dynamical and combinatorial nature. Our main result applies to its possible homomorphisms into other…

Group Theory · Mathematics 2018-12-12 Nicolás Matte Bon

We determine all finite maximal elementary abelian group actions on compact oriented surfaces of genus $\sigma\geq 2$ which are unique up to topological equivalence. For certain special classes of such actions, we determine group extensions…

Algebraic Topology · Mathematics 2007-12-06 S. A. Broughton , A. Wootton

The mapping class group $\Gamma$ of the complement of a Cantor set in the plane arises naturally in dynamics. We show that the ray graph, which is the analog of the complex of curves for this surface of infinite type, has infinite diameter…

Dynamical Systems · Mathematics 2016-03-09 Juliette Bavard

We prove a tropical analogue of the theorem of Hurwitz: a leafless metric graph of genus $g \ge 2$ has at most $12$ automorphisms when $g = 2$; $2^g g!$ automorphisms when $g \ge 3$. These inequalities are optimal; for each genus, we give…

Combinatorics · Mathematics 2021-10-13 Yusuke Nakamura , JuAe Song

We study the action of (big) mapping class groups on the first homology of the corresponding surface. We give a precise characterization of the image of the induced homology representation.

Geometric Topology · Mathematics 2024-03-11 Federica Fanoni , Sebastian Hensel , Nicholas G. Vlamis

The natural automorphism group of a translation surface is its group of translations. For finite translation surfaces of genus g > 1 the order of this group is naturally bounded in terms of g due to a Riemann-Hurwitz formula argument. In…

Geometric Topology · Mathematics 2013-12-02 Jan-Christoph Schlage-Puchta , Gabriela Weitze-Schmithuesen

In this paper, we classify groups which faithfully act on smooth cubic threefolds. It turns out that there are exactly $6$ maximal ones and we describe them with explicit examples of target cubic threefolds.

Algebraic Geometry · Mathematics 2019-08-05 Li Wei , Xun Yu

We investigate the ratio $\avM(G)$ of the average size of a maximal matching to the size of a maximum matching in a graph $G$. If many maximal matchings have a size close to $\maxM(G)$, this graph invariant has a value close to 1.…

Combinatorics · Mathematics 2024-03-11 Alain Hertz , Sébastien Bonte , Gauvain Devillez , Hadrien Mélot