Overlaps in Field Generated Circular Planar Nearrings
Wen-Fong Ke, Hubert Kiechle
TL;DR
This paper studies the structure of circular planar nearrings built from finite fields and complex numbers, focusing on how their associated basic graphs overlap within the context of 2-designs.
Contribution
It characterizes the overlaps of basic graphs in circular planar nearrings derived from finite fields and complex numbers, advancing understanding of their combinatorial properties.
Findings
Characterization of overlaps in basic graphs
Analysis of circular planar nearrings from finite fields
Insights into 2-design structures
Abstract
We investigate circular planar nearrings constructed from finite fields as well the complex number field using a multiplicative subgroup of order , and characterize the overlaps of the basic graphs which arise in the associated -designs.
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
TopicsCoding theory and cryptography · Cooperative Communication and Network Coding · Finite Group Theory Research