2000 character limit reached
Almost Difference Sets, Normally Regular Digraphs and Cyclotomic Schemes from Cyclotomy of Order Twelve
Published 4 Oct 2013 in math.CO | (1310.1164v2)
Abstract: Using cyclotomic classes of order twelve for certain finite fields, we construct an infinite family of almost difference sets and normally regular graphs applying the theory of cyclotomy. We show that in each of these fields neither the multiplicative cyclic subgroup $C$ of index twelve nor $C\cup {0}$ forms an almost difference set, but a union of cosets of $C$ provides us an almost difference set. We also calculate the intersection numbers and character tables of cyclotomic association schemes of class two, three and four obtained from these fields.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.