English
Related papers

Related papers: Classification of finite groups that admit an orie…

200 papers

Motivated by applications to equivariant neural networks and cryo-electron microscopy we consider the problem of recovering the generic orbit in a representation of a finite group from invariants of low degree. The main result proved here…

Representation Theory · Mathematics 2025-03-04 Dan Edidin , Josh Katz

A necessary condition for a Cayley digraph Cay$(R,S)$ to be a regular representation is that there are no non-trivial group automorphisms of $R$ that fix $S$ setwise. A group is DRR-detecting or GRR-detecting if this condition is also…

Combinatorics · Mathematics 2023-10-17 Joy Morris , Gabriel Verret

In this paper we characterize groups according to the number of end vertices in the associated coprime graphs. An upper bound on the order of the group that depends on the number of end vertices is obtained. We also prove that $2-$groups…

Group Theory · Mathematics 2018-03-08 Tariq A. Alraqad , Muhammad S. Saeed. , Etaf S. Alshawarbeh

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

A graph is \textit{rigid} if it only admits the identity endomorphism. We show that for every $d\ge 3$ there exist infinitely many mutually rigid $d$-regular graphs of arbitrary odd girth $g\geq 7$. Moreover, we determine the minimum order…

Combinatorics · Mathematics 2025-02-18 Kolja Knauer , Gil Puig i Surroca

In this paper we are interested in the asymptotic enumeration of Cayley graphs. It has previously been shown that almost every Cayley digraph has the smallest possible automorphism group: that is, it is a digraphical regular representation…

Combinatorics · Mathematics 2020-05-18 Joy Morris , Mariapia Moscatiello , Pablo Spiga

In this paper we shall be looking at several results relating Schur rings to sufficient conditions for a graph to be a graphical regular representation (GRR) of a finite group, and then applying these specifically in the case of certain…

Combinatorics · Mathematics 2024-01-09 Josef Lauri , Jonathan Ebejer

Let ${\rm GK}(G)$ be the prime graph associated with a finite group $G$ and $D(G)$ be the degree pattern of $G$. A finite group $G$ is said to be $k$-fold OD-characterizable if there exist exactly $k$ non-isomorphic groups $H$ such that…

Group Theory · Mathematics 2017-05-23 B. Akbari , A. R. Moghaddamfar

For any finite group $G$, a natural question to ask is the order of the smallest possible automorphism group for a Cayley graph on $G$. A particular Cayley graph whose automorphism group has this order is referred to as an MRR (Most Rigid…

Combinatorics · Mathematics 2017-03-29 Joy Morris , Josh Tymburski

This article investigates the properties of order-divisor graphs associated with finite groups. An order-divisor graph of a finite group is an undirected graph in which the set of vertices includes all elements of the group, and two…

Group Theory · Mathematics 2024-08-30 Shafiq ur Rehman , Raheela Tahir , Farhat Noor

Threshold graphs are a prevalent and widely studied class of simple graphs. They have several equivalent definitions which makes them a go-to class for finding examples and counter examples when testing and learning. This versatility has…

Combinatorics · Mathematics 2018-03-07 Derek Boeckner

The random ordered graph is the up to isomorphism unique countable homogeneous linearly ordered graph that embeds all finite linearly ordered graphs. We determine the reducts of the random ordered graph up to first-order interdefinability.

Logic · Mathematics 2017-05-17 Manuel Bodirsky , Michael Pinsker , András Pongrácz

We consider groups of orientation-preserving real analytic diffeomorphisms of the circle which have a finite image under the rotation number function. We show that if such a group is nondiscrete with respect to the $C^1$-topology then it…

Dynamical Systems · Mathematics 2008-11-04 Yoshifumi Matsuda

For groups $G$ that can be generated by an involution and an element of odd prime order, this paper gives a sufficient condition for a certain Cayley graph of $G$ to be a graphical regular representation (GRR), that is, for the Cayley graph…

Group Theory · Mathematics 2024-08-28 Binzhou Xia

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

Dynamical Systems · Mathematics 2018-09-10 Omer Angel , Alexander S. Kechris , Russell Lyons

Rotary maps (orientably regular maps) are highly symmetric graph embeddings on orientable surfaces. This paper classifies all rotary maps whose underlying graphs are Praeger-Xu graphs, denoted $\operatorname{C}(p,r,s)$, for any odd prime…

Combinatorics · Mathematics 2025-07-03 Zhaochen Ding , Zheng Guo , Luyi Liu

We obtain a classification of discrete series representations of odd general spin groups, generalizing the M{\oe}glin-Tadi\'c classification for classical groups. Using mostly algebraic methods, available in both classical and the odd…

Representation Theory · Mathematics 2022-09-27 Yeansu Kim , Ivan Matić

A graphical regular representation (GRR) of a group $G$ is a Cayley graph of $G$ whose full automorphism group is equal to the right regular permutation representation of $G$. In this paper we study cubic GRRs of $\mathrm{PSL}_{n}(q)$…

Group Theory · Mathematics 2022-01-21 Binzhou Xia , Shasha Zheng , Sanming Zhou

In this paper we extend the notion of digraphical regular representations in the context of Haar digraphs. Given a group $G$, a {\em Haar digraph} $\Gamma$ over $G$ is a bipartite digraph having a bipartition $\{X,Y\}$ such that $G$ is a…

Combinatorics · Mathematics 2020-01-15 Jia-Li Du , Yan-Quan Feng , Pablo Spiga

In this note, we classify all finite groups having exactly 6, 7 or 8 cyclic subgroups. This gives a partial answer to the open problem posed by Tarnauceanu (Amer. Math. Monthly, 122 (2015), 275-276). As a consequence of our results, we also…

Group Theory · Mathematics 2018-05-08 Hemant Kalra