nach oben

Designs, Codes and Cryptography

Erschienen in:

01.01.2016

A survey of the multiplier conjecture

verfasst von: Daniel M. Gordon, Bernhard Schmidt

Erschienen in: Designs, Codes and Cryptography | Ausgabe 1/2016

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

We review the current status of the multiplier conjecture for difference sets, present some new results on it, and determine the open cases of the conjecture for abelian groups of order \(<\)10\(^6\). It turns out that for Paley parameters \((4n-1,2n-1,n-1,n)\), where \(4n-1\) is a prime power, the validity of the multiplier conjecture can be verified in the vast majority of cases, while for other parameter sets numerous cases remain open.

Vorheriger Artikel Finite field constructions of combinatorial arrays

Nächster Artikel Sequences with small correlation

Nur mit Berechtigung zugänglich

Baumert L.D., Gordon D.M.: On the existence of cyclic difference sets with small parameters. In: High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams. Fields Inst. Commun., vol. 41, pp. 61–68.

Beth T., Jungnickel D., Lenz H.: Design Theory, 2nd edn. Cambridge University Press, Cambridge (1999).

Gordon D.: La Jolla Difference Set Repository. http://www.ccrwest.org/diffsets.html.

Hall M.: Cyclic projective planes. Duke Math. J. 14, 1079–1090 (1947).

Hall M.: A survey of difference sets. Proc. Am. Math. Soc. 7, 975–986 (1956).

Hall M., Ryser H.J.: Cyclic incidence matrices. Can. J. Math. 3, 495–502 (1951).

Lander E.S.: Restrictions upon multipliers of a abelian difference set. Arch. Math. 50, 241–242 (1988).

Lehmer E.: On residue difference sets. Can. J. Math. 5, 425–432 (1953).

Leung K.H., Ma S.L., Schmidt B.: A multiplier theorem. J. Comb. Theory Ser. A 124, 228–243 (2014).

10.

McFarland R.L.: On multipliers of abelian difference sets. Ph.D. Dissertation, Ohio State University (1970).

11.

McFarland R.L., Rice B.F.: Translates and multipliers of abelian difference sets. Proc. Am. Math. Soc. 68, 375–379 (1978).

12.

Menon K.P.: Difference sets in Abelian groups. Proc. Am. Math. Soc. 11, 368–376 (1960).

13.

Muzychuk M.: Difference Sets with \(n=2p^m\). J. Algebraic Comb. 7, 77–89 (1999).

14.

Qiu W.S.: The multiplier conjecture for elementary abelian groups. J. Comb. Des. 2, 117–129 (1994).

15.

Qiu W.S.: A method of studying the multiplier conjecture and some partial solutions for it. Ars Comb. 39, 5–23 (1995).

16.

Qiu W.S.: The multiplier conjecture for the case \(n=4n_1\). J. Comb. Des. 3, 393–397 (1995).

17.

Sage Mathematics Software (Version 6.1.1), The Sage Developers. http://www.sagemath.org (2015).

18.

Tao F.: Difference sets with \(n=5p^r\). Des. Codes Cryptogr. 51, 175–194 (2009).

19.

Turyn R.J.: Character sums and difference sets. Pac. J. Math. 15, 319–346 (1965).

20.

Xiang Q., Chen Y.Q.: On the size of the multiplier groups of cyclic difference sets. J. Comb. Theory Ser. A 69, 168–169 (1995).

21.

Yamamoto K.: On Jacobi sums and difference sets. J. Comb. Theory 3, 146–181 (1967).

22.

Yamamoto K.: On the application of half-norms to cyclic difference sets. In: Bose R.C., Dowling T.A. (eds) Combinatorial Mathematics and Its Applications, pp. 247–255. University of North Carolina Press, Chapel Hill (1969).

Titel: A survey of the multiplier conjecture
verfasst von: Daniel M. Gordon
Bernhard Schmidt
Publikationsdatum: 01.01.2016
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 1/2016
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-015-0153-8

Springer Professional

A survey of the multiplier conjecture

Abstract

Premium Partner

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 1/2016

Cryptocash, cryptocurrencies, and cryptocontracts

A survey of some applications of finite fields

Recent progress on the elliptic curve discrete logarithm problem

(Secure) Linear network coding multicast

Almost perfect and planar functions

Disjoint difference families and their applications

Premium Partner