BYU

Abstract by Erik Parkinson

Personal Infomation


Presenter's Name

Erik Parkinson

Co-Presenters

None

Degree Level

Undergraduate

Co-Authors

None

Abstract Infomation


Department

Mathematics

Faculty Advisor

Gary Lawlor, Rodney Forcade

Title

Tetrahedral Coverings of R3

Abstract

The problem of finding the least dense covering of Rn with different objects has been extensively studied. Here we focus on the problem of how to cover R3 the most efficiently with tetrahedra in a lattice covering. A new lower bound on the covering density is presented, along with the new techniques developed to get the bound.