ProbXiv
sign in
Problem archiveProblem record

Statement

How few vertices can a triangulation of RP5\mathbb{RP}^5 have? The paper presents a 6-dimensional centrally symmetric simplicial polytope whose antipodal boundary quotient gives a 24-vertex triangulation, far below previous constructions in the Adiprasito-Avvakumov-Karasev line.

Record

Added

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. construction · #1

    Dan Guyer, Stefan Steinerberger and Yirong Yang, using AlphaEvolve

    That credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.

    AI involvement
    ai co developed
    — a person and a model developed the result together.

    The construction reduces to a 240-variable optimization over centrally symmetric point sets on the sphere; "we used Google DeepMind's AlphaEvolve as a way to do black-box optimization and ran a large number of instances" before finding the 48-point configuration the triangulation is built from.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.