English
Related papers

Related papers: Proportion of chiral maps with automorphism group …

200 papers

We study incidence geometries that are thin and residually connected. These geometries generalise abstract polytopes. In this generalised setting, guided by the ideas from the polytopes theory, we introduce the concept of chirality, a…

Group Theory · Mathematics 2016-04-13 Maria Elisa Fernandes , Dimitri Leemans , Asia Ivić Weiss

Although the phenomenon of chirality appears in many investigations of maps and hypermaps no detailed study of chirality seems to have been carried out. Chirality of maps and hypermaps is not merely a binary invariant but can be quantified…

Combinatorics · Mathematics 2007-05-23 Antonio Breda d'Azevedo , Gareth Jones , Roman Nedela , Martin Skoviera

Generalising a conjecture of Singerman, it is shown that there exist orientably regular chiral hypermaps of every non-spherical type. The proof uses the representation theory of automorphism groups acting on homology and on various spaces…

Combinatorics · Mathematics 2013-11-19 Gareth A. Jones

A map is a connected topological graph $\Gamma$ cellularly embedded in a surface. In this paper, applying Tutte's algebraic representation of map, new ideas for enumerating non-equivalent orientable or non-orientable maps of graph are…

General Mathematics · Mathematics 2009-09-29 Linfan Mao , Yanpei Liu

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

A combinatorial map is a connected topological graph cellularly embedded in a surface. This monograph concentrates on the automorphism group of a map, which is related to the automorphism group of a Klein surface and a Smarandache manifold,…

General Mathematics · Mathematics 2007-05-23 Linfan Mao

We classify the regular maps $\mathcal M$ which have automorphism groups $G$ acting faithfully and primitively on their vertices. As a permutation group $G$ must be of almost simple or affine type, with dihedral point stabilisers. We show…

Group Theory · Mathematics 2023-03-07 Gareth A. Jones , Martin Mačaj

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

Combinatorics · Mathematics 2012-03-06 Soumya Bhoumik , Edward Dobson , Joy Morris

This paper proves the existence of a chiral map with alternating automorphism group for every hyperbolic type. We present a set of constructions using permutations for when at least one parameter is even, and call on previously known…

Combinatorics · Mathematics 2024-02-28 Olivia Reade

We present an enumeration of orientably-regular maps with automorphism group isomorphic to the twisted linear fractional group $M(q^2)$ for any odd prime power $q$.

Combinatorics · Mathematics 2017-01-23 Grahame Erskine , Katarína Hriňáková , Jozef Širáň

With the help of the theory of holomorphic and anti-holomorphic differentials, G. A. Jones [Chiral covers of hypermaps, Ars Math. Contemp. 8 (2015), 425-431] proved that every regular hypermap of a non-spherical type is covered by an…

Group Theory · Mathematics 2024-02-23 Olivia Reade , Jozef Širáň

Consider the geometric graph on $n$ independent uniform random points in a connected compact region $A$ of ${\bf R}^d, d \geq 2$, with $C^2$ boundary, or in the unit square, with distance parameter $r_n$. Let $K_n$ be the number of…

Probability · Mathematics 2026-04-09 Mathew D. Penrose , Xiaochuan Yang

In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…

Combinatorics · Mathematics 2024-08-30 Gunnar Brinkmann

Given a map with underlying graph $\mathcal{G}$, if the set of prime divisors of $|V(\mathcal{G}|$ is denoted by $\pi$, then we call the map a {\it $\pi$-map}. An orientably-regular (resp. A regular ) $\pi$-map is called {\it solvable} if…

Combinatorics · Mathematics 2022-09-19 Xiaogang Li , Yao Tian

If the face\mbox{-}cycles at all the vertices in a map are of the same type, then the map is said to be a semi-equivelar map. Automorphism (symmetry) of a map can be thought of as a permutation of the vertices which preserves the…

Combinatorics · Mathematics 2021-01-13 Marbarisha M. Kharkongor , Debashis Bhowmik , Dipendu Maity

The present work investigates regular, semiregular, and chiral polytopes of any rank $d\geq 3$, whose automorphism groups are 2-groups. There is a large variety of rather small finite regular or alternating semiregular polytopes with…

Group Theory · Mathematics 2025-12-18 Gabriel Cunningham , Yan-Quan Feng , Dong-Dong Hou , Egon Schulte

The randomly oriented graph $G_{n,p}^{\sigma}$ is an Erd\H{o}s-R\'enyi random graph $G_{n,p}$ with a random orientation $\sigma$, which assigns to each edge a direction so that $G_{n,p}^{\sigma}$ becomes a directed graph. Denote by $S_n$…

Combinatorics · Mathematics 2018-09-05 Yilun Shang

Cayley maps are combinatorial structures built upon Cayley graphs on a group. As such the original group embeds in their group of automorphisms, and one can ask in which situation the two coincide (one then calls the Cayley map a mapical…

Combinatorics · Mathematics 2023-01-20 Dario Sterzi , Pablo Spiga

In this paper, we provide the first known infinite family of simple graphs, each of which is the skeleton of a chiral map, a skeleton of a reflexible map on an orientable surfaces, as well as a skeleton of a reflexible map on a…

Combinatorics · Mathematics 2025-03-18 Isabel Hubard , Primož Potočnik , Primož Šparl

Let $S$ be a set of transpositions that generates the symmetric group $S_n$, where $n \ge 3$. The transposition graph $T(S)$ is defined to be the graph with vertex set $\{1,\ldots,n\}$ and with vertices $i$ and $j$ being adjacent in $T(S)$…

Discrete Mathematics · Computer Science 2015-12-11 Ashwin Ganesan
‹ Prev 1 2 3 10 Next ›