English
Related papers

Related papers: Genus Bounds for Harmonic Group Actions on Finite …

200 papers

For a graph G, M(G) denotes the maximum multiplicity occurring of an eigenvalue of a symmetric matrix whose zero-nonzero pattern is given by edges of G. We introduce two combinatorial graph parameters T^-(G) and T^+(G) that give a lower and…

Combinatorics · Mathematics 2016-07-06 Keivan Hassani Monfared , Sudipta Mallik

A coloring of vertices of a graph is called perfect if, for every vertex, the collection of colors of its neighbors depends only on its own color. The correspondent color partition of vertices is called equitable. We note that a number of…

Combinatorics · Mathematics 2025-05-16 Vladimir N. Potapov

In this article we extend results of Zomorrodian to determine upper bounds for the order of a nilpotent group of automorphisms of a complex $d$-dimensional family of compact Riemann surfaces, where $d \geqslant 1.$ We provide conditions…

Algebraic Geometry · Mathematics 2021-05-20 Sebastián Reyes-Carocca

We prove that, to every abstract group $G$, we can associate a sequence of graphs $\Gamma_n$ such that the automorphism group of $\Gamma_n$ is isomorphic to $G$ and the genus of $\Gamma_n$ is an unbounded function of $n$.

Group Theory · Mathematics 2025-08-29 Marco Barbieri

Let S be a compact Riemann surfaces of genus g >= 2 and G a conformal automoprhism group of order n acting on S. In this paper we give the definition of an adapted generating set and an adapted basis for the first homology group of such a…

Group Theory · Mathematics 2017-11-28 Jane Gilman

The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…

Combinatorics · Mathematics 2015-12-14 Eran Nevo , Guillermo Pineda-Villavicencio , David R. Wood

Consider the family of all finite graphs with maximum degree $\Delta(G)<d$ and matching number $\nu(G)<m$. In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all…

Combinatorics · Mathematics 2007-05-23 Niranjan Balachandran , Niraj Khare

Let ${\mathcal M}_g$ be the moduli space of compact connected Riemann surfaces of genus $g\geq 2$ and let $\widehat{{\mathcal M}_g}$ be its Deligne-Mumford compactification, which is stratified by the topological type of the stable Riemann…

Algebraic Geometry · Mathematics 2024-11-18 Raquel Díaz , Víctor González-Aguilera

The genus of a maximal curve over a finite field with r^2 elements is either g_0=r(r-1)/2 or less than or equal to g_1=(r-1)^2/4. Maximal curves with genus g_0 or g_1 have been characterized up to isomorphism. A natural genus to be studied…

Algebraic Geometry · Mathematics 2007-05-23 A. Cossidente , J. W. P. Hirschfeld , G. Korchmaros , F. Torres

In this paper we consider all orientation-preserving $\mathbb{Z}_{4}$-actions on $3$-dimensional handlebodies $V_g$ of genus $g>0$. We study the graph of groups $(\Gamma($v$),\mathbf{G(v)})$, which determines a handlebody orbifold…

General Topology · Mathematics 2017-04-27 Jesse Prince-Lubawy

The edge domination number $\gamma_e(G)$ of a graph $G$ is the minimum size of a maximal matching in $G$. It is well known that this parameter is computationally very hard, and several approximation algorithms and heuristics have been…

Combinatorics · Mathematics 2019-05-30 Julien Baste , Maximilian Fürst , Michael A. Henning , Elena Mohr , Dieter Rautenbach

Recently there has been renewed interest in the mapping-class group of a compact surface of genus $g \ge 2$ and also in its finite order elements. A finite order element of the mapping-class group will be a conformal automorphisms on some…

Geometric Topology · Mathematics 2007-05-23 Jane Gilman

We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on…

Combinatorics · Mathematics 2021-02-17 László Lovász , Balázs Szegedy

We prove that an arbitrary compact metrizable group can be realized as the automorphism group of a graphing; this is a continuous analogue to Frucht's theorem recovering arbitrary finite groups are automorphism groups of finite graphs. The…

Group Theory · Mathematics 2022-06-27 Alexandru Chirvasitu

We describe an algorithm that constructs a list of all topological types of holomorphic actions of a finite group on a compact Riemann surface $C$ of genus at least $g \geq 2$ with $C/G \cong \mathbb{P}^1$.

Algebraic Geometry · Mathematics 2023-05-15 Diego Conti , Alessandro Ghigi , Roberto Pignatelli

The gonality of a smooth geometrically connected curve over a field $k$ is the smallest degree of a nonconstant $k$-morphism from the curve to the projective line. In general, the gonality of a curve of genus $g \ge 2$ is at most $2g - 2$.…

Algebraic Geometry · Mathematics 2025-06-18 Xander Faber , Jon Grantham , Everett W. Howe

It is well-known that every maximal planar graph has a matching of size at least $\tfrac{n+8}{3}$ if $n\geq 14$. In this paper, we investigate similar matching-bounds for maximal \emph{1-planar} graphs, i.e., graphs that can be drawn such…

Combinatorics · Mathematics 2023-01-05 Therese Biedl , John Wittnebel

The mapping class group $\mathrm{Mod}_{g, 1}$ of a surface with one marked point can be identified with an index two subgroup of $\mathrm{Aut}(\pi_1 \Sigma_g)$. For a surface of genus $g \geq 2$, we show that any action of $\mathrm{Mod}_{g,…

Geometric Topology · Mathematics 2020-10-07 Kathryn Mann , Maxime Wolff

We find a sharp bound for the order of the automorphism group of a stable curve of genus $g$ with $3g-3$ nodes, and a sharp bound for the order of the automorphism group of such a curve with all smooth components. Combined with the results…

Algebraic Geometry · Mathematics 2007-05-23 Michael A. van Opstall , Razvan Veliche

A 2-edge-colored graph or a signed graph is a simple graph with two types of edges. A homomorphism from a 2-edge-colored graph $G$ to a 2-edge-colored graph $H$ is a mapping $\varphi: V(G) \rightarrow V(H)$ that maps every edge in $G$ to an…

Combinatorics · Mathematics 2020-09-14 Christopher Duffy , Fabien Jacques , Mickael Montassier , Alexandre Pinlou