Icosahedral Polytope Classification in 4D

ISEF Category: Mathematics

Subcategory: Geometry and Topology  ·  Difficulty: Advanced  ·  Setup: University Lab  ·  Time: Full Year

The Hook

A 4D shape can have more symmetry than a snowflake, yet still hide a huge number of distinct forms. Your job is to sort those forms into a clean classification. That sounds abstract, but the core skill is simple, count the possibilities without missing any and without counting any twice. That is real research math.

What Is It?

This project asks you to classify a family of 4-dimensional polytopes, which are the 4D version of solid shapes. A polytope is like a polygon in 2D or a polyhedron in 3D, but one dimension higher. The phrase "pyritohedra-like" points to shapes that share a certain symmetry pattern with the pyritohedron, a familiar 3D crystal shape with many symmetric faces.

Think of symmetry as a rule that says, "If you rotate the object this way, it looks the same." Full icosahedral symmetry means the shape matches the symmetry of an icosahedron, the 20-faced solid related to soccer-ball style symmetry. Orbit count tells you how many distinct pieces of a shape fall into the same symmetry group. In this project, you are not just drawing one shape. You are organizing every allowed shape in the family and proving which ones belong.

This kind of work mixes geometry, group action, and combinatorics. Group action means studying how symmetry operations move vertices, edges, or faces around. Combinatorics helps you count possibilities. SageMath can help you test candidate structures and compare them against known symmetry rules.

Why This Is a Good Topic

This is a strong science fair topic because the question is precise, checkable, and rich enough for real investigation. You can test whether a candidate polytope really fits the symmetry rules, compare orbit sizes, and build a complete list from a defined search space. The topic connects to crystallography, symmetry classification, and computational geometry, so it has real math and real applications. A student can learn how to turn a vague shape idea into a proof-backed classification.

Research Questions

• How does changing the orbit size limit change the number of valid 4D pyritohedra-like polytopes?
• What is the effect of restricting to full icosahedral symmetry on the number of distinct combinatorial types?
• Does every candidate polytope with the right symmetry also satisfy the same face-incidence pattern?
• To what extent do different generating sets produce isomorphic polytopes after symmetry reduction?
• Which combinatorial invariants best separate non-isomorphic shapes in this family?
• How does the Euler characteristic analog behave across the classified polytopes?
• What is the effect of using graph isomorphism tests versus manual symmetry checks on classification accuracy?

Basic Materials

• Laptop or desktop computer with internet access.
• SageMath installed locally or accessed through a university or school setup.
• Spreadsheet software for tracking candidate polytopes and invariants.
• Notebook for proof sketches, definitions, and classification rules.
• Reference text on polyhedra, polytopes, or group theory.
• Access to a printer or PDF viewer for reading papers and diagrams.

Advanced Materials

• Workstation with SageMath and enough memory for symbolic and combinatorial computation.
• NetworkX or another graph analysis package for isomorphism checks.
• LaTeX editor for writing proofs and formatting diagrams.
• Software for generating and comparing polytope visualizations.
• Access to journal articles on polytope classification and symmetry groups.
• Optional access to GAP for group-theoretic verification.

Software & Tools

• SageMath: Computes polytopes, symmetry data, and combinatorial invariants.
• Python: Helps automate searches, clean data, and compare candidate structures.
• NetworkX: Tests graph isomorphism when you encode polytopes as incidence graphs.
• GAP: Checks symmetry group calculations and subgroup structure.
• LaTeX: Formats your final paper, tables, and proof outlines.

Experiment Steps

1. Define the exact family you will classify and write down the symmetry rules in plain math language.
2. Choose the combinatorial objects you will generate, such as incidence graphs, vertex orbits, or face lattices.
3. Build a search plan that filters candidates by symmetry, orbit size, and known structural constraints.
4. Create a comparison method for deciding when two candidates are the same up to relabeling or rotation.
5. Record invariants for each valid object, then group them into equivalence classes and check for duplicates.
6. Write a proof outline that explains why your list is complete and why each listed object belongs.

Common Pitfalls

• Treating two shapes as different just because their vertices are labeled differently, which creates fake duplicates.
• Mixing up combinatorial equivalence with geometric similarity, which can make the classification inconsistent.
• Using symmetry tests on incomplete data, which can wrongly reject valid candidates.
• Skipping invariant checks, which makes it hard to prove that the list is complete.
• Letting computer output replace proof, which leaves you with a database of guesses instead of a research result.

What Makes This Competitive

A competitive version of this project needs more than a list of shapes. You need a clean definition, a complete search strategy, and a proof that your classification is exhaustive. Strong entries often include a novel computational pipeline, a new invariant that separates tricky cases, or a careful comparison with prior database entries. If you can explain why your method catches every valid polytope and rejects every impostor, your work gets much stronger.

Project Variations

• Classify the same family under a tighter orbit bound and compare how the number of types changes.
• Replace icosahedral symmetry with another finite symmetry group and test whether the classification pattern still holds.
• Focus on one invariant, such as face count or orbit structure, and see how far it can distinguish non-isomorphic polytopes.

Learn More

• Polytope Wiki: Search for entries on polytopes, symmetry classes, and database notation to see how researchers record classification data.
• SageMath Documentation: Search the official SageMath docs for polyhedron, graph, and group theory modules.
• MIT OpenCourseWare, Algebra and Group Theory: Search the course catalog for lectures on groups, orbits, and symmetry.
• Convex Polytopes by Branko Grünbaum: A classic reference for polytope theory, often available through libraries or previews.
• PubMed or arXiv-style math preprint searches are not the right fit here, so use arXiv Mathematics for recent papers on polytope classification and symmetry.