Twitxy Saved

Caltech Mathathon

Verified account This account is verified. Learn more

@math_hackathon

How can we use AI to augment human understanding of mathematics?
Pasadena, CA mathathonchallenge.com Joined August 2026
1 Following 62 Followers 11 Posts

Latest posts 5

Caltech Mathathon Verified account @math_hackathon
3 days until the Mathathon! Teams are getting ready to spend 40 hours uncovering new secrets in old theories.

Here’s a sneak peak at the NP-Completeness of the HP Protein Folding Model:

Berger and Leighton (RECOMB 1998) and Papadimitriou et al. proved that the protein folding problem, using the hydrophobic-hydrophilic (HP) model, is NP-complete on the 2D and 3D lattice. Teams will revisit the constructions in this proof to look for simplifications and develop more accessible explanations of the methodology.

Want to learn more? Check out Berger and Leighton’s paper (dl.acm.org/doi/pdf/10.114…)
Caltech Mathathon Verified account @math_hackathon
12 days until the Mathathon! Teams are getting ready to spend 40 hours uncovering new secrets in old theories.

Here’s a sneak peak at Unrepresentable Finite Lattices:

Recently, OpenAI provided a negative solution to the finite lattice representation problem, which asks whether every finite lattice is isomorphic to the congruence lattice of some finite algebra. They provided a finite lattice which does not exhibit this isomorphism; however, the minimum size of such a lattice is unknown. Teams will work to clarify these new results and improve the known bounds on the minimum size for unrepresentable finite lattices.

Want to learn more? Check out OpenAI’s preprint (github.com/openai/math/tr…). Application for judges is open at mathathonchallenge.com!
Caltech Mathathon Verified account @math_hackathon
13 days until the Mathathon! Teams are getting ready to spend 40 hours uncovering new secrets in old theories.

Here’s a sneak peak at the Definability of the Turing Jump:

In a 1999 paper, Slaman and Shore proved that the Turing jump, an operation that maps between decision problems of increasing difficulty, is definable in the first order theory of the Turing degrees. However, their work does not provide a simple definition of this jump. Teams will search for conditions in which an explicit definition is (or is not) attainable.

Want to learn more? Check out Slaman and Shore’s paper (math.berkeley.edu/~slaman/papers…). Application for judges is open at mathathonchallenge.com!