English
Related papers

Related papers: On oriented $m$-semiregular representations of fin…

200 papers

An oscillator group $G$ is a semidirect product of a Heisenberg group with a one-parameter group. In this article we construct Olshanski semigroups for infinite-dimensional oscillator groups. These are complex involutive semigroups which…

Representation Theory · Mathematics 2015-06-23 Christoph Zellner

Let $G$ be a finite abelian group. Bridges and Mena characterized the Cayley graphs of $G$ that have only integer eigenvalues. Here we consider the $(0,1,-1)$ adjacency matrix of an oriented Cayley graph or of a signed Cayley graph $X$ on…

Combinatorics · Mathematics 2024-05-24 Chris Godsil , Xiaohong Zhang

Let G be a Lie group modelled on a locally convex space, with Lie algebra g, and k be a non-negative integer or infinity. We say that G is C^k-semiregular if each C^k-curve c in g admits a left evolution Evol(c) in G. If, moreover, the map…

Functional Analysis · Mathematics 2016-02-09 Helge Glockner

This paper investigates the enumeration of Cayley digraphs, focusing on counting Cayley digraphs on dihedral groups up to CI-isomorphism. By leveraging the Cauchy-Frobenius Lemma and properties of automorphisms, we derive an explicit…

Combinatorics · Mathematics 2025-07-30 Zai Ping Lu , Jia Yin Xie , Jin-Hua Xie

Let G be a Lie groupoid over M such that the target-source map from G to M x M is proper. We show that, if O is an orbit of finite type (i.e. which admits a proper function with finitely many critical points), then the restriction G|U of G…

Differential Geometry · Mathematics 2007-05-23 Alan Weinstein

First, I construct an isomorphism between the categories of (topological) groups of nilpotency class 2 with 2-divisible center and (topological) Lie rings of nilpotency class 2 with 2-divisible center. That isomorphism allows us to…

Representation Theory · Mathematics 2007-05-23 Aleksandrs Mihailovs

A graph $\Ga=(V,E)$ is called a Cayley graph of some group $T$ if the automorphism group $\Aut(\Ga)$ contains a subgroup $T$ which acts on regularly on $V$. If the subgroup $T$ is normal in $\Aut(\Ga)$ then $\Ga$ is called a normal Cayley…

Group Theory · Mathematics 2021-04-01 Jing Jian Li , Zai Ping Lu

The concept of directed strongly regular graphs (DSRG) was introduced by Duval in 1988 \cite{A}.In the present paper,we use representation theory of finite groups in order to investigate the directed strongly regular Cayley graphs.We first…

Combinatorics · Mathematics 2018-05-28 Yiqin He , Bicheng Zhang

An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…

Combinatorics · Mathematics 2023-11-17 Stefan Gyurki , Sona Pavlikova , Jozef Siran

Let $G$ be a finite group. The co-prime order graph of $G$ is the graph whose vertex set is $G$, and two distinct vertices $x,y$ are adjacent if gcd$(o(x),o(y))$ is either $1$ or a prime, where $o(x)$ and $o(y)$ are the orders of $x$ and…

Combinatorics · Mathematics 2021-09-28 Xuanlong Ma , Zhonghua Wang

In this paper we consider a class of connected closed $G$-manifolds with a non-empty finite fixed point set, each $M$ of which is totally non-homologous to zero in $M_G$ (or $G$-equivariantly formal), where $G={\Bbb Z}_2$. With the help of…

Algebraic Topology · Mathematics 2009-02-17 Bo Chen , Zhi Lü

According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a…

Combinatorics · Mathematics 2021-01-08 R. A. Bailey , Peter J. Cameron

Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…

Combinatorics · Mathematics 2023-11-15 Xueyi Huang , Lu Lu , Xiongfeng Zhan

Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…

Group Theory · Mathematics 2021-05-07 R. A. Bailey , Peter J. Cameron , Cheryl E. Praeger , Csaba Schneider

For any positive integer $k$, let $\mathcal{G}_k$ denote the set of finite groups $G$ such that all Cayley graphs ${\rm Cay}(G,S)$ are integral whenever $|S|\le k$. Est${\rm \acute{e}}$lyi and Kov${\rm \acute{a}}$cs \cite{EK14} classified…

Group Theory · Mathematics 2015-06-18 Xuanlong Ma , Kaishun Wang

A Cayley graph for a group $G$ is CCA if every automorphism of the graph that preserves the edge-orbits under the regular representation of $G$ is an element of the normaliser of $G$. A group $G$ is then said to be CCA if every connected…

Group Theory · Mathematics 2017-03-24 Luke Morgan , Joy Morris , Gabriel Verret

Let $\Gamma=\mathrm{Cay}(G,S)$ be a Cayley digraph on a group $G$ and let $A=\mathrm{Aut}(\Gamma)$. The Cayley index of $\Gamma$ is $|A:G|$. It has previously been shown that, if $p$ is a prime, $G$ is a cyclic $p$-group and $A$ contains a…

Combinatorics · Mathematics 2017-03-08 Luke Morgan , Joy Morris , Gabriel Verret

If M is a manifold with an action of a group G, then the homology group H_1(M,Q) is naturally a Q[G]-module, where Q[G] denotes the rational group ring. We prove that for every finite group G, and for every Q[G]-module V, there exists a…

Geometric Topology · Mathematics 2019-05-20 Alex Bartel , Aurel Page

Let $S$ be a closed oriented surface and $G$ a finite group of orientation preserving automorphisms of $S$ whose orbit space has genus at least $2$. There is a natural group homomorphism from the $G$-centralizer in $Diff^+(S)$ to the…

Geometric Topology · Mathematics 2025-05-21 Eduard Looijenga

In this paper, we begin by partitioning the edges (or arcs) of a circulant (di)graph according to which generator in the connection set leads to each edge. We then further refine the partition by subdividing any part that corresponds to an…

Combinatorics · Mathematics 2014-02-13 Joy Morris