17-Year-Old Researcher Uses Computer-Assisted Proof to Complete the Noble Polyhedra Puzzle

Seventeen-year-old Connor Hill of Pennsylvania used a computer-assisted mathematical proof to complete the classification of noble polyhedra, highly symmetric three-dimensional shapes whose faces and vertices follow strict uniformity conditions. His work established that, beyond two previously known infinite families, there are exactly 146 additional isolated noble polyhedra, earning him the $250,000 first-place award in the 2026 Regeneron Science Talent Search.

A High School Research Project Tackles a Longstanding Geometry Problem

Some mathematical questions are difficult not because the individual calculations are impossible, but because the number of possible cases becomes enormous.

That was the challenge facing Connor Hill, a 17-year-old student from Port Matilda, Pennsylvania, whose mathematics project focused on a class of highly symmetric three-dimensional objects known as noble polyhedra.

A polyhedron is a three-dimensional shape made from flat polygonal faces connected by straight edges. Familiar examples include cubes and pyramids.

Noble polyhedra impose a much stronger symmetry requirement: their faces are equivalent to one another, while their vertices are also equivalent under the object’s symmetry. In mathematical terminology, they are both facet-transitive and vertex-transitive.

Hill set out to determine whether mathematicians could identify the complete collection of such shapes.

His project ultimately produced a classification containing two infinite families and 146 isolated examples.

From Known Examples to a Complete Classification

Before Hill’s work, mathematicians already knew of two infinite families of noble polyhedra and 61 isolated examples.

The problem was that having many examples is not the same as proving that the list is complete.

There could always be another shape hidden somewhere among the enormous number of possible geometric configurations.

Hill approached the problem computationally.

According to the Society for Science, he wrote a computer program capable of working through the conceivable ways a noble polyhedron could be constructed. His research then used a computer-assisted proof to establish the completeness of the resulting classification.

The final result was not simply another collection of interesting shapes.

It was an answer to a classification question: how many finite noble polyhedra are there?

How the Computer-Assisted Proof Works

Hill’s published research provides a mathematical framework for reducing the classification problem to a finite computational search.

The work begins with the symmetry groups of points in three-dimensional space. Hill parametrizes the relevant orbits of these groups and introduces a concept called criticality to organize the possible configurations.

He then defines an equivalence relation between certain symmetry orbits. Within each resulting equivalence class, the problem of determining possible noble facetings can be reduced to equivalent cases.

This ultimately produces a finite collection of test cases that can be examined computationally.

That structure is what makes the computer-assisted proof different from simply asking a program to generate geometric shapes.

The program is not being used as a black box that says which shapes exist.

Instead, the mathematics establishes why the computational search covers the relevant possibilities, while the computer performs the extensive calculations needed to examine them.

The Result: 146 Isolated Polyhedra

Hill’s classification found exactly 146 noble polyhedra in addition to the previously known infinite families of stephanoids, also called crown polyhedra, and disphenoids.

This distinction between infinite families and isolated examples is important.

An infinite family can be described by a mathematical construction that generates additional members indefinitely.

An isolated polyhedron, by contrast, does not belong to one of those infinite sequences. Finding all such individual cases requires proving that no additional examples have been missed.

Hill’s work therefore turns a collection of known geometric objects into a complete mathematical enumeration.

Why Symmetry Makes These Shapes Interesting

The study of noble polyhedra belongs to a broader mathematical tradition surrounding symmetry.

The most familiar highly symmetric polyhedra are the five Platonic solids: the tetrahedron, cube, octahedron, dodecahedron and icosahedron.

Those shapes have exceptionally strong symmetry properties. But the broader world of polyhedra contains many objects that do not fit the simple convex forms encountered in elementary geometry.

Noble polyhedra extend the investigation into this larger space by requiring uniformity among both their faces and vertices.

That makes them useful objects for studying how geometric structure, symmetry groups and mathematical classification interact.

Hill’s research does not introduce a new physical material or engineering device. Its significance lies in resolving a mathematical classification problem that had remained incomplete.

A $250,000 First-Place Science Talent Search Award

Hill’s result earned him first place in the 2026 Regeneron Science Talent Search, a competition organized by Society for Science for U.S. high school seniors.

He received $250,000, the top individual award.

The 2026 competition attracted more than 2,600 applicants, with 40 finalists receiving more than $1.8 million in total awards.

Hill’s project was titled “The Complete Set of Noble Polyhedra.”

The recognition also placed computational mathematics alongside projects in areas such as biomedical research, neuroscience and artificial intelligence among the competition’s leading student research efforts.

What Makes the Work Different From a Conventional Computer Search

Computer-generated mathematics is becoming increasingly important because modern mathematical problems can involve far more cases than a person could realistically examine individually.

But computation alone does not automatically constitute a proof.

A program can produce evidence, find patterns or test millions of possibilities without establishing that the search was mathematically complete.

Hill’s approach combines mathematical reasoning with computation.

The mathematical framework limits the problem to a finite set of relevant cases. The computer then handles the extensive calculations needed to test those cases.

That combination is increasingly known as computer-assisted proof.

It allows researchers to investigate mathematical questions where the logical structure can be established by humans while the detailed enumeration is carried out by machines.

The Research Is Already Public

Hill’s complete classification has also been published as a mathematical preprint titled “The complete set of noble polyhedra.”

The paper describes the computer-assisted proof and reports the final enumeration of the noble polyhedra. It was posted to arXiv in July 2026.

The research therefore extends beyond a student competition project. It provides a formal mathematical treatment that other researchers can examine, reproduce and potentially build upon.

The Society for Science also notes that Hill hopes his program can eventually be applied to other geometric configurations, including structures formed by interconnecting multiple polyhedra.

When Geometry Meets Computation

Hill’s work illustrates a broader change taking place across mathematics.

Computers are increasingly being used not simply to calculate answers faster, but to explore enormous mathematical spaces, identify patterns and help establish classifications that would be impractical to complete manually.

The important element is still the mathematics: defining the problem correctly, proving that the computational search is exhaustive and interpreting the resulting structures.

In the case of noble polyhedra, that combination allowed a 17-year-old researcher to address a question that had resisted complete enumeration and arrive at a precise answer.

The result is a reminder that some of the most interesting scientific discoveries do not require a laboratory or a telescope. Sometimes, they begin with a geometric question, a mathematical idea and a computer capable of checking possibilities far beyond the reach of manual calculation.

FAQs

What are noble polyhedra?

Noble polyhedra are highly symmetric three-dimensional shapes whose faces are equivalent to one another and whose vertices are also equivalent under the shape’s symmetry.

What did Connor Hill discover?

Hill’s computer-assisted proof established that there are exactly 146 isolated noble polyhedra in addition to two previously known infinite families.

How old was Connor Hill when he made the discovery?

Hill was 17 when he completed the research project that won first place in the 2026 Regeneron Science Talent Search.

What is a computer-assisted proof?

It is a mathematical proof in which humans establish the logical framework while a computer performs extensive calculations needed to verify the finite cases covered by that framework.

What prize did Connor Hill receive?

Hill received the $250,000 first-place award in the 2026 Regeneron Science Talent Search.