Difference sets with few character values

DOI10.1007/S10623-013-9830-7MaRDI QIDQ404936zbMATH OpenOpenAlexFDO

Authors Tao Feng, Sihuang Hu, Shuxing Li, Gennian Ge

Publication date 4 September 2014

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1303.1659

zbMATH Keywords

difference setscharacter valuesassociation schemescharacter divisible property

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Abstract: The known families of difference sets can be subdivided into three classes: difference sets with Singer parameters, cyclotomic difference sets, and difference sets with gcd$(v,n)>1$. It is remarkable that all the known difference sets with gcd$(v,n)>1$ have the so-called character divisibility property. In 1997, Jungnickel and Schmidt posed the problem of constructing difference sets with gcd$(v,n)>1$ that do not satisfy this property. In an attempt to attack this problem, we use difference sets with three nontrivial character values as candidates, and get some necessary conditions.

Recommendations

• A new family of cyclic difference sets with Singer parameters in characteristic three
• Publication:4934411
• New cyclic difference sets with Singer parameters
• Cyclic near difference sets of type 1
• scientific article; zbMATH DE number 5732561

Cites work

• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 4089559 (Why is no real title available?)
• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• scientific article; zbMATH DE number 1066161 (Why is no real title available?)
• scientific article; zbMATH DE number 1382769 (Why is no real title available?)
• A unifying construction for difference sets
• Difference set constructions of DRADs and association schemes
• Finite geometry and character theory
• Multiplicative cones - a family of three eigenvalue graphs
• Multiplicative designs I: The normal and reducible cases
• Multiplicative designs II. Uniform normal and related structures
• On Difference Sets Whose Parameters Satisfy a Certain Relation
• On the existence of abelian Hadamard difference sets and a new family of difference sets
• Polynomial addition sets and polynomial digraphs
• Spectra of graphs
• Subschemes of some association schemes

Cited in

(1)

• scientific article; zbMATH DE number 1390141 (Why is no real title available?)

This page was built for publication: Difference sets with few character values

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404936)