中文
相关论文

相关论文: Semisymmetric elementary abelian covers of the M\"…

200 篇论文

A hypermap is an embedding of a connected hypergraph into an orientable closed surface. A covering between hypermaps is a homomorphism between the embedded hypergraphs which extends to an orientation-preserving covering of the supporting…

组合数学 · 数学 2018-06-13 Na-Er Wang , Kan Hu

We discuss properties of complex algebraic orbifold groups, their characteristic varieties, and their abelian covers. In particular, we deal with the question of (quasi)-projectivity of orbifold groups. We also prove a structure theorem for…

代数几何 · 数学 2012-03-09 Enrique Artal Bartolo , Jose Ignacio Cogolludo-Agustin , Daniel Matei

The paper is devoted to the study of abelian (in the sense defined by Godsil and Hensel) distance-regular $r$-covers of the complete graphs $K_n$. According to the construction by Coutinho, Godsil, Shirazi, and Zhan (2016), each such cover…

组合数学 · 数学 2024-12-17 Ludmila Yu. Tsiovkina

Given a finite connected simple graph $\Gamma$, and a subgroup $G$ of its automorphism group, a general method for finding all finite abelian regular coverings of $\Gamma$ that admit a lift of each element of $G$ is developed. As an…

组合数学 · 数学 2024-02-27 Haimiao Chen , Hao Shen

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…

群论 · 数学 2024-12-05 Yunsong Gan , Weijun Liu , Binzhou Xia

A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin.…

组合数学 · 数学 2012-06-12 Li Wang , Shaofei Du

A graph covering projection, also referred to as a locally bijective homomorphism, is a mapping between the vertices and edges of two graphs that preserves incidences and is a local bijection. This concept originates in topological graph…

离散数学 · 计算机科学 2025-07-02 Jan Bok , Jiří Fiala , Nikola Jedličková , Jan Kratochvíl

In this paper we are interested in lifting a prescribed group of automorphisms of a finite graph via regular covering projections. Here we describe with an example the problems we address and refer to the introductory section for the…

组合数学 · 数学 2018-01-09 Pablo Spiga , Primož Potočnik

In order to complete (and generalize) results of Gardiner and Praeger on 4-valent symmetric graphs (European J. Combin, 15 (1994)) we apply the method of lifting automorphisms in the context of elementary-abelian covering projections. In…

组合数学 · 数学 2017-08-01 Boštjan Kuzman , Aleksander Malnič , Primož Potočnik

In line with the recent development in topological graph theory, we are considering undirected graphs that are allowed to contain {\em multiple edges}, {\em loops}, and {\em semi-edges}. A graph is called {\em simple} if it contains no…

离散数学 · 计算机科学 2023-12-12 Jan Bok , Jiří Fiala , Nikola Jedličková , Jan Kratochvíl , Paweł Rzążewski

A finitely presented, torsion free, abelian-by-cyclic group can always be written as an ascending HNN extension Gamma_M of Z^n, determined by an n x n integer matrix M with det(M) \ne 0. The group Gamma_M is polycyclic if and only if…

群论 · 数学 2007-05-23 Benson Farb , Lee Mosher

The `spider theorem' for a general Frobenius algebra $A$, classifies all maps $A^{\otimes m}\to A^{\otimes n}$ that are built from the operations and, in a graphical representation, represented by a {\it connected} diagram. Here the algebra…

量子代数 · 数学 2021-11-29 Shahn Majid , Konstanze Rietsch

The purpose of this paper is to introduce a new family of semigroups - the free projection-generated regular $*$-semigroups - and initiate their systematic study. Such a semigroup $PG(P)$ is constructed from a projection algebra $P$, using…

环与代数 · 数学 2025-04-11 James East , Robert D. Gray , P. A. Azeef Muhammed , Nik Ruškuc

Word-representable graphs, characterized by the existence of a semi-transitive orientation, form a well-studied class of graphs. Comparability graphs form another well-studied class and constitute a subclass of word-representable graphs.…

离散数学 · 计算机科学 2026-05-15 Benny George Kenkireth , Gopalan Sajith , Sreyas Sasidharan

It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…

组合数学 · 数学 2024-06-11 Bartłomiej Bychawski

In this paper we show that if $\phi_{i}:A_{i}\rightarrow{A}$ is a semisimple pointed $K$-rational $\ell$-isogeny graph of order $n$ for a prime $\ell$, then the group of $\ell$-torsion points $A[\ell](\overline{K})$ contains a subspace of…

代数几何 · 数学 2018-03-15 Paul Alexander Helminck

A regular covering projection $\p\colon \tX \to X$ of connected graphs is $G$-admissible if $G$ lifts along $\p$. Denote by $\tG$ the lifted group, and let $\CT(\p)$ be the group of covering transformations. The projection is called…

组合数学 · 数学 2007-05-23 Yan-Quan Feng , Klavdija Kutnar , Aleksander Malnic , Dragan Marusic

We classify the orientably regular maps which are elementary abelian regular branched coverings of Platonic maps M, in the case where the covering group and the rotation group G of M have coprime orders. The method involves studying the…

组合数学 · 数学 2012-01-26 Gareth A. Jones

The thesis is devoted to abstract, geometric and symmetric aspects of modern elementary particle theories. A new direction in constructing supersymmetric and superstring models based on consequent and strong consideration and inclusion of…

数学物理 · 物理学 2007-05-23 Steven Duplij

The kernel of the natural projection of a graph product of groups onto their direct product is called the Cartesian subgroup of the graph product. This construction generalises commutator subgroups of right-angled Coxeter and Artin groups.…

群论 · 数学 2025-07-30 Fedor Vylegzhanin
‹ 上一页 1 2 3 10 下一页 ›