English
Related papers

Related papers: Vertex-transitive covers of semi-equivelar toroida…

200 papers

If a map has k transitivity classes of vertices that are subject to the action of the automorphism group, it is said to be k-uniform. The classification of 1-uniform maps on the torus is known. In this article, we classify 2-uniform maps on…

Combinatorics · Mathematics 2023-01-26 Arnab Kundu , Dipendu Maity

Evenly convex sets in a topological vector space are defined as the intersection of a family of open half spaces. We introduce a generalization of this concept in the conditional framework and provide a generalized version of the bipolar…

Probability · Mathematics 2012-09-06 Marco Frittelli , Marco Maggis

A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…

Combinatorics · Mathematics 2019-11-13 Heather A. Newman , Hector Miranda , Darren A. Narayan

We characterize connected tetravalent graphs $\Gamma$ which admit groups $M<H$ of automorphisms such that $\Gamma$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a…

Group Theory · Mathematics 2025-12-29 Yuandong Li , Binzhou Xia , Jin-Xin Zhou

A regular cover of a connected graph is called {\em cyclic} or {\em dihedral} if its transformation group is cyclic or dihedral respectively, and {\em arc-transitive} (or {\em symmetric}) if the fibre-preserving automorphism subgroup acts…

Combinatorics · Mathematics 2017-03-27 Da-Wei Yang , Yan-Quan Feng , Jin-Xin Zhou

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

This paper is an exploration of the faithful transitive permutation representations of the orientation-preserving automorphisms groups of highly symmetric toroidal maps and hypermaps. The main theorems of this paper give a list of all…

Group Theory · Mathematics 2023-09-01 Maria Elisa Fernandes , Claudio Alexandre Piedade

In this work, we present several new findings regarding the concepts of orbit-transitivity, strict orbit-transitivity, $\omega$-transitivity, and $\mu$-open-set transitivity for self-maps on generalized topological spaces. Let $(X,\mu)$…

General Topology · Mathematics 2025-12-15 M. R. Ahmadi Zand , N. Baimani

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

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with vertex set $X$ and diameter $D$. Let $A$ denote the adjacency matrix of $\Gamma$. For a vertex $x\in X$ and for $0 \leq i \leq D$, let $E^*_i(x)$ denote the projection matrix…

Combinatorics · Mathematics 2024-05-08 Jack H. Koolen , Jae-Ho Lee , Ying-Ying Tan

In this paper, we study edge-transitive surfaces, i.e. triangulated 2-dimensional manifolds whose automorphism groups act transitively on the edges of these triangulated surfaces. We show that there exist four types of edge-transitive…

Combinatorics · Mathematics 2025-11-12 Reymond Akpanya

A cap in PG(r,q) is a set of points, no three of which are collinear. A cap is said to be transitive if its automorphism group in PGammaL(r+1,q) acts transtively on the cap, and co-transitive if the automorphism group acts transtively on…

Combinatorics · Mathematics 2007-05-23 A. Cossidente , O. H. King

For every simplicial complex K there exists a vertex-transitive simplicial complex homotopy equivalent to a wedge of copies of K with some copies of the circle. It follows that every simplicial complex can occur as a homotopy wedge summand…

Combinatorics · Mathematics 2014-09-18 Michal Adamaszek

A graph $\G$ admitting a group $H$ of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over $H$. Such a graph $\G$ is called {\em normal\/} if $H$ is normal in the full…

Combinatorics · Mathematics 2016-06-16 Marston Conder , Jin-Xin Zhou , Yan-Quan Feng , Mi-Mi Zhang

A connected graph $\Gamma=(V,E)$ of valency at least $3$ is called a basic $2$-arc-transitive graph if its full automorphism group has a subgroup $G$ with the following properties: (i) $G$ acts transitively on the set of $2$-arcs of…

Combinatorics · Mathematics 2022-10-11 Zai Ping Lu , Ruo Yu Song

Let X be an algebraic variety covered by open charts isomorphic to the affine space and q: X' \to X be the universal torsor over X. We prove that the automorphism group of the quasiaffine variety X' acts on X' infinitely transitively. Also…

Algebraic Geometry · Mathematics 2014-10-07 Ivan Arzhantsev , Alexander Perepechko , Hendrik Süß

A semiregular permutation group on a set $\Ome$ is called {\em bi-regular} if it has two orbits. A classification is given of quasiprimitive permutation groups with a biregular dihedral subgroup. This is then used to characterize the family…

Group Theory · Mathematics 2023-08-31 Jiangmin Pan , Fu-Gang Yin , Jin-Xin Zhou

Every finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which…

Combinatorics · Mathematics 2007-05-23 Barry Monson , Tomaz Pisanski , Egon Schulte , Asia Ivic Weiss

We introduce a natural notion of quaternionic map between almost quaternionic manifolds and we prove the following, for maps of rank at least one: 1) A map between quaternionic manifolds endowed with the integrable almost twistorial…

Differential Geometry · Mathematics 2015-05-13 S. Ianus , S. Marchiafava , L. Ornea , R. Pantilie

It is well-known that a simple $G$-arc-transitive graph can be represented as a coset graph for the group $G$. This representation is extended to a construction of $G$-arc-transitive coset graphs $\Cos(G,H,J)$ with finite valency and finite…

Combinatorics · Mathematics 2022-02-16 Cai Heng Li , Cheryl E. Praeger , Shu Jiao Song