Tetrahedron-Intersecting Families of 3-Uniform Hypergraphs
Owen solved a long-standing math problem concerning objects called 3-uniform hypergraphs.
View Poster
Owen Jianwen Zhang, 18, of Bellevue, developed a solution to a problem about objects called 3-uniform hypergraphs for his Regeneron Science Talent Search mathematics project. This project is in an area of theoretical math called combinatorics, which focuses on counting and the properties of certain structures. Combinatorics has applications within other fields of math and computer science. Three-uniform hypergraphs are like clusters of people in social networks. Each edge of the hypergraph connects three points called vertices. These connected points are like three close friends in the network. These structures can vary by how these vertices are connected, creating unique formations.
For his project, Owen used computer programming techniques to answer a long-standing question about the maximum number of unique connection conformations that can be found in 3-uniform hypergraphs with the same vertices. Owen believes his result is the first time such a problem has been solved in a hypergraph setting.
Owen, the son of Yunjing Ma and Geqiang Zhang, attends Bellevue High School. He competes in DECA events, where his team analyzes business scenarios and presents strategic solutions.
Beyond the Project
Owen leads his school’s math and physics clubs. He has attended the Mathematical Olympiad Program and Canada/USA Mathcamp.
FUN FACTS: Owen coaches a middle school math club, where his lesson plans include creative and funny stories about “Robby the Robber,” a comically inept crook who uses math to overcome absurd obstacles.
