Maximality of subfields as cliques in Cayley graphs over finite fields

Chi Hoi Yip

REVIEW

Maximality of subfields as cliques in Cayley graphs over finite fields

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2209.00864 v2 pith:5E6WWUX3 submitted 2022-09-02 math.CO math.NT

Maximality of subfields as cliques in Cayley graphs over finite fields

Chi Hoi Yip This is my paper

classification math.CO math.NT

keywords graphscayleycliquesfinitemaximalitysubfieldsadditiveconfirms

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We show the maximality of subfields as cliques in a special family of Cayley graphs defined on the additive group of a finite field. In particular, this confirms a conjecture of Yip on generalized Paley graphs.

Maximality of subfields as cliques in Cayley graphs over finite fields

discussion (0)