Science Fair Projects

From the Nimber-Simplex Graph to Codes, Lattices, and Groups

Abstract

The objective: This project is about the relationship between the Nimber-Simplex graph, error-correcting codes, lattices, and finite simple groups. My previous projects defined the Nimber-Simplex graph (NSG) as a map between finite groups under Nim addition and n-dimensional simplexes, then linked the NSG in n-1 dimensions to n-cubes. The goals of this year's project are to explore coding theory and sphere packing with the specific hypotheses that the NSG can be used to construct binary error-correcting codes, lattices, and finite simple groups.

Methods/Materials

In this project, a relationship between binary linear codes and the NSG is shown, specifically that the NSG retains its fundamental properties when used as the word space and codeword space of a binary linear code. The NSG is shown to be closely related to Hamming codes, and the Ham(3) and Golay G24 codes are constructed using the graph. The relationships between lattices and codes are discussed, and the D3 and E8 lattices are constructed using n-cubes, the Z(n) lattice, and codes. The 24-dimensional Leech lattice is constructed from the G24 code. The NSG is defined as a Steiner system, and a particularly nice isomorphism between the automorphism group of the NSG and GL(n, 2) is shown. Lastly, the structure of the automorphism group of the Leech lattice is described in order to show the relationship of the project to finite simple groups.

Results

This project represents a unique approach to coding theory and sphere packing. Original contributions include the construction of the Ham(k) codes from the NSG, the use of the NSG as the word and codeword space of a binary linear code, the NSG as a Steiner (2, 3, 2^n-1)-system, and the isomorphism between the NSG's automorphism group and GL(n, 2).

Conclusions/Discussion

The three hypotheses of this project were proven: the Ham(k) and G24 codes can be constructed using the Nimber-Simplex graph; the Leech lattice, as well as the E7, E8, and Z(n) lattices, can be constructed using the graph; and certain simple groups associated with the Leech lattice's automorphism group can be constructed using the graph.

This Mathematical project links the Nimber-Simplex graph to error-correcting coding theory, lattices, and finite simple groups.

Science Fair Project done By Rebecca E. Jacobs

 

Related Projects : Parallax, Adaptive Interference Rejection in Wireless Networking, Statistical Comparison of Radial and Transect Sampling, Centripetally Accelerating Pi, Software and Hardware Implementation of Rubik's Cube Solving Algorithms, Mathematical Model for the Optimal Arrangement of Cell Phone Towers, Complete Mathematical and Physical Relativistic Soliton Universe, Effect of Quantum Computing on Hash Functions, Radical Obsession, Finding Hidden Sequences In Nature, Do Odds-Makers Make Accurate Predictions, Goldbach's Conjecture: True or False?, Debruijn Sequence Taken to Higher Powers, Symmetries and Transformations of n-Cubes and the Nimber-Simplex Graph, Shape to the Max

 

<<Back To Topics Page........................................................................................>> Next Topic

 

 

Copyright © sciencefairprojects.co.in 2013 through 2015