Spherical codes are higher-dimensional analogues of Tammes problem, which arose as an attempt to explain the distribution of pores on pollen grains.
The Tammes problem may be stated as the problem of finding a spherical code with minimal t for given n and N.
Year 2000 problem | Waring's problem | The Final Problem | The Problem with Popplers | Hume and the Problem of Causation | Dirichlet problem | Boolean satisfiability problem | The Dog Problem | Tammes problem | Species problem | problem solving | Problem gambling | Packing problem | packing problem | chess problem | Znám's problem | Year 10,000 problem | Yamabe problem | Weber problem | Undecidable problem | Travelling salesman problem | travelling salesman problem | The Problem of Thor Bridge | The Problem of the Media: U.S. Communication Politics in the 21st Century | The Problem of Social Cost | Tarski's circle squaring problem | Steiner tree problem | Shortest path problem | RSA problem | Quadratic eigenvalue problem |