Academia.eduAcademia.edu

Outline

Twin Bent Functions and Clifford Algebras

2015, Springer Proceedings in Mathematics & Statistics

https://doi.org/10.1007/978-3-319-17729-8_15

Abstract

This paper examines a pair of bent functions on Z 2m 2 and their relationship to a necessary condition for the existence of an automorphism of an edge-coloured graph whose colours are defined by the properties of a canonical basis for the real representation of the Clifford algebra R m,m. Some other necessary conditions are also briefly examined. Note that the existence of such an automorphism automatically implies that the subgraphs ∆ m [−1] and ∆ m [1] are isomorphic. Considering that it is known that ∆ m [−1] is a strongly regular graph, a more general question can be asked concerning such graphs.

References (16)

  1. Bernasconi, A., Codenotti, B.: Spectral analysis of Boolean functions as a graph eigenvalue problem. IEEE Transactions on Computers 48(3), 345-351 (1999)
  2. Bose, R.C.: Strongly regular graphs, partial geometries and partially balanced designs. Pacific J. Math 13(2), 389-419 (1963)
  3. Brouwer, A., Cohen, A., Neumaier, A.: Distance-Regular Graphs. Ergebnisse der Mathematik und Ihrer Grenzgebiete, 3 Folge/A Series of Modern Surveys in Mathematics Series. Springer London, Limited (2011)
  4. Canteaut, A., Carlet, C., Charpin, P., Fontaine, C.: On cryptographic properties of the cosets of R (1, m). Information Theory, IEEE Transactions on 47(4), 1494-1513 (2001)
  5. Canteaut, A., Charpin, P.: Decomposing bent functions. Information Theory, IEEE Transac- tions on 49(8), 2004-2019 (2003)
  6. van Dam, E.R.: Strongly regular decompositions of the complete graph. Journal of Algebraic Combinatorics 17(2), 181-201 (2003)
  7. van Dam, E.R., Muzychuk, M.: Some implications on amorphic association schemes. Journal of Combinatorial Theory, Series A 117(2), 111-127 (2010)
  8. Dillon, J.F.: Elementary Hadamard difference sets. Ph.D. thesis, University of Maryland Col- lege Park, Ann Arbor, USA (1974)
  9. Leopardi, P.: Regular graphs with strongly regular edge colorings. MathOverflow. URL:http://mathoverflow.net/q/182148 (version: 2014-10-01)
  10. Leopardi, P.: Hadamard-fractious. GitHub (2013). URL:https://github.com/penguian/Hadamard- fractious (accessed 2015-01-12)
  11. Leopardi, P.: Constructions for Hadamard matrices, Clifford algebras, and their relation to amicability / anti-amicability graphs. Australasian Journal of Combinatorics 58(2), 214-248 (2014)
  12. Menon, P.K.: On difference sets whose parameters satisfy a certain relation. Proceedings of the American Mathematical Society 13(5), 739-745 (1962)
  13. Ó Catháin, P.: Nesting symmetric designs. Irish Math. Soc. Bull. (72), 71-74 (2013)
  14. Rothaus, O.S.: On "bent" functions. Journal of Combinatorial Theory, Series A 20(3), 300- 305 (1976)
  15. Seidel, J.J.: Strongly regular graphs. In: Surveys in combinatorics (Proc. Seventh British Combinatorial Conf., Cambridge, 1979), London Mathematical Society Lecture Note Series, vol. 38, pp. 157-180. Cambridge Univ. Press, Cambridge-New York (1979)
  16. Tokareva, N.: On the number of bent functions from iterative constructions: lower bounds and hypotheses. Adv. in Math. of Comm. 5(4), 609-621 (2011)