HUGE BREAKING NEWS IN THE WORLD OF AI AND MATH BECAUSE OPEN AI JUST ANNOUNCED THAT THEY HAVE DISPROVED A FAMOUS CONJECTURE IN COMBINATORICS IN DISCRETE GEOMETRY. THE PROBLEM ITSELF IS A CONJECTURE OF ERDOS. IN FACT, THIS WAS ONE OF HIS FAVORITE PROBLEMS TO WORK ON. THE PROBLEM IS ERDOS'S UNIT DISTANCE PROBLEM RAISED IN 1946 IS AMONG THE BEST KNOWN OPEN PROBLEMS IN COMBINATORICS. IT IS ALSO ARGUABLY THE BEST KNOWN PROBLEM IN DISCRETE GEOMETRY. INDEED, ITS DESCRIPTION IN THE BOOK OF BRASS, MOSER AND PACH ON RESEARCH PROBLEMS IN DISCRETE GEOMETRY IS: "THE FOLLOWING PROBLEM OF ERDOS IS POSSIBLY THE BEST KNOWN (AND SIMPLEST TO EXPLAIN) PROBLEM IN COMBINATORIAL GEOMETRY: HOW OFTEN CAN THE SAME DISTANCE OCCUR AMONG N POINTS IN THE PLANE?" HOW OFTEN CAN THE SAME DISTANCE OCCUR AMONG N POINTS IN THE PLANE? AND EXPERTS IN COMBINATORICS LIKE NOGA ALON HAVE DESCRIBED THIS AS ONE OF THE BEST KNOWN OPEN PROBLEMS IN COMBINATORICS. AND THAT MEANS THAT PEOPLE ARE AWARE AND HAVE WORKED ON THIS PROBLEM, INCLUDING ERDOS. YOU CAN FIX THE DISTANCE IN THE PROBLEM TO BE ONE, AND THEN IT BECOMES THE UNIT DISTANCE PROBLEM. HOW CAN YOU ARRANGE N POINTS IN THE PLANE SO THAT THERE ARE AS MANY POINTS AS POSSIBLE THAT ARE ONE UNIT APART FROM EACH OTHER? ERDOS THOUGHT THAT THIS CONFIGURATION WAS THE BEST. IT GAVE YOU SOME SORT OF UPPER ON HOW MANY POINTS CAN BE A UNIT APART. HOWEVER, THE DISCOVERY BY OPEN AI IS THAT ERDOS'S BOUND IS NOT TRUE. AND, IN FACT, THERE ARE CONFIGURATIONS SIMILAR TO THIS ONE THAT BEAT THAT BOUND. BY THE WAY, I ALSO MADE CHAT GPT MAKE THIS GRAPH. NOGA M. ALON (HEBREW: נגה אלון; BORN 1956) IS AN ISRAELI MATHEMATICIAN AND PROFESSOR OF MATHEMATICS AT PRINCETON UNIVERSITY NOTED FOR HIS CONTRIBUTIONS TO COMBINATORICS AND THEORETICAL COMPUTER SCIENCE, HAVING AUTHORED HUNDREDS OF PAPERS. NOGA ALON נגה אלון NOGA ALON WHAT DO THE EXPERTS SAY ABOUT THE PROOF THAT THE LLM HAS COME UP WITH? FOR EXAMPLE, NOGA ALON WHO IS AN EXPERT IN COMBINATORICS SAYS THAT THIS PROOF IS AN OUTSTANDING ACHIEVEMENT. JACOB TSIMERMAN WHO FIELDS MEDAL THIS YEAR JACOB TSIMERMAN SAYS THAT THIS IS A REALLY IMPRESSIVE PIECE OF WORK, AND I WOULD ACCEPT IT FOR ANY JOURNAL WITHOUT HESITATION. I ACTUALLY BRIEFLY WORKED ON THIS PROBLEM AND TRIED TO MAKE A COUNTEREXAMPLE, BUT FAILED TO MAKE PROGRESS. THIS MAY INDICATE ONE WAY THAT AI SYSTEMS HAVE AN EDGE: IT'S NOT JUST THAT THEY CAN TRY ALL KNOWN METHODS, BUT THEY CAN PLAY FOR LONGER AND IN MORE TREACHEROUS WATERS THAN MATHEMATICIANS WITHOUT GETTING OVERWHELMED. THIS IS NOT YET ROBUSTLY TRUE, BUT THIS MAY BE A FORESHADOWING. JACOB TSIMERMAN CONTINUES THAT THE AI'S OR LLMS HAVE AN EDGE BECAUSE THEY CAN TRY ALL KNOWN METHODS AND THEY CAN PLAY WITH IT LONGER THAN MATHEMATICIANS WITHOUT GETTING OVERWHELMED. DANIEL LITT MAKES SOME VERY INTERESTING POINTS HERE BECAUSE THE PROBLEM IS IN COMBINATORICS, BUT THE PROOF ITSELF USES SOME SOPHISTICATED ALGEBRAIC NUMBER THEORY FOR A HUMAN TO DISCOVER THIS THEY WOULD HAVE EXPERTS IN COMBINATORICS AND IN ALGEBRAIC NUMBER THEORY BECAUSE PEOPLE IN ALGEBRAIC NUMBER THEORY LIKE HE OR I HAD NEVER PROBLEM. NOW OTHER EXPERTS LIKE THOMAS BLOOM WHO IS THE PERSON WHO HAS CURATED THE COLLECTION OF ERDOS PROBLEMS ONLINE IS NOT SO ENTHUSIASTIC ABOUT THE PROOF ITSELF BECAUSE HE SAYS THAT IT IS HIGHLY NONTRIVIAL AT THE END, GENERALIZATION OF THE ORIGINAL LATTICE-BASED CONSTRUCTION OF ERDOS. MELANIE MATCHETT WOOD (BORN 1981) IS AN AMERICAN MELANIE MATCHETT WOOD WHO WAS THE FIRST WOMAN TO QUALIFY FOR THE U.S. INTERNATIONAL MATHEMATICAL OLYMPIAD TEAM. SHE COMPLETED HER PHD IN 2009 AT PRINCETON UNIVERSITY (UNDER MANJUL BHARGAVA). PREVIOUSLY, SHE WAS CHANCELLOR'S PROFESSOR OF MATHEMATICS AT UC BERKELEY, VILAS DISTINGUISHED ACHIEVEMENT PROFESSOR OF MATHEMATICS AT THE UNIVERSITY OF WISCONSIN, AND SPENT 2 YEARS AS SZEGŐ ASSISTANT PROFESSOR AT STANFORD UNIVERSITY. MELANIE WOOD WOOD IN 2019 MELANIE MATCHETT WOOD WHO IS A HARVARD PROFESSOR ALSO A MACARTHUR FELLOW SAYS THAT IT IS EASY TO JUMP TO HASTY CONCLUSIONS ABOUT WHAT THIS MEANS BECAUSE ASSEMBLED A NUMBER TO WORK FOR A MONTH ON THIS PARTICULAR PROBLEM AND THESE MATHEMATICIANS HAD A BROAD SET OF SKILLS AND BACKGROUNDS THEN THEY WOULD HAVE FOUND THE SAME COUNTEREXAMPLE. SIMILARLY ARUL SHANKAR IN HIS COMMENTS SAYS THAT THIS IS NOT AN ALIEN PROOF. SOME PROOF THAT INCLUDE SOME NEW IDEA THAT NOBODY HAS EVER SEEN THE METHODS THAT ARE BEING USED HERE ARE METHODS THAT ARE WELL KNOWN SO YES, VERY INGENIOUS PROOF, BUT IT IS NOT A PARADIGM CHANGE IN WHAT AI CAN DO. FINALLY I'LL SAY THAT THIS IS VERY IMPRESSIVE BUT COMPANY THAT IS THROWING A LOT OF MONEY TO SOLVE THESE PROBLEMS. THIS IS ONE ABLE TO SOLVE BUT I CAN ASSURE YOU THAT THERE ARE MANY OTHER PROBLEMS THAT HAVE SOME IT MORE FAMOUS THAN THIS PROBLEM THAT THESE COMPANIES ARE TRYING TO SOLVE THEY ARE NOT BEING ABLE TO SOLVE THEM. WHETHER WE ARE GOING TO GET THERE AND OPEN AI OR OTHER COMPANY WILL EVENTUALLY SOLVE A MILLENNIUM PROBLEM. WE DON'T KNOW. FOR NOW THEY ARE JUST TELLING YOU HERALDING ALL THEIR VICTORIES. THEY'RE NOT TELLING US ALL THE FAILURES.