Algebraic degrees of quasi-abelian semi-Cayley digraphs
Shixin Wang, Majid Arezoomand, Tao Feng

TL;DR
This paper investigates the algebraic degrees and splitting fields of quasi-abelian semi-Cayley digraphs, extending previous results from Cayley graphs over abelian groups to a broader class of semi-Cayley digraphs.
Contribution
It provides a general method to determine the splitting field and algebraic degree of quasi-abelian semi-Cayley digraphs using irreducible characters of groups, broadening prior work.
Findings
Determines the splitting field of quasi-abelian semi-Cayley digraphs.
Calculates the algebraic degree in terms of group characters.
Generalizes previous results on Cayley graphs and semi-Cayley digraphs.
Abstract
For a digraph , if is the smallest field that contains all roots of the characteristic polynomial of the adjacency matrix of , then is called the splitting field of . The extension degree of over the field of rational numbers is said to be the algebraic degree of . A digraph is a semi-Cayley digraph over a group if it admits as a semiregular automorphism group with two orbits of equal size. A semi-Cayley digraph is called quasi-abelian if each of and is a union of some conjugacy classes of . This paper determines the splitting field and the algebraic degree of a quasi-abelian semi-Cayley digraph over any finite group in terms of irreducible characters of groups. This work generalizes the previous works on algebraic degrees of Cayley graphs over…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Coding theory and cryptography
