Mark Braverman
Israeli mathematicianWikipedia
2
MENTIONS
2
EPISODES
2
PODCASTS
Search complete. 2 mentions across 2 episodes found for "Mark Braverman".
Oct 8, 2026
Ben BrubakerSOUNDBITE_SPEAKER
Mincer, Fay, and Wong's new result now also implies that in these cases, no matter how many extra colors you're allowed to use, there will always be perverse graphs where it's still hard to find a solution.
Ben BrubakerSOUNDBITE_SPEAKER
"'You cannot do it even with the entire Crayola box,' said Mark Braverman of Princeton University." Computer scientists had sought to prove this result for decades.
Ben BrubakerSOUNDBITE_SPEAKER
In fact, it was one of the problems that originally motivated Cote to propose his graph coloring conjectures.
Ben BrubakerSOUNDBITE_SPEAKER
OpenAI's October release included a lean verified proof of the 2-to-1 conjecture, but in an AI-generated manuscript that didn't undergo any human editing or review by independent experts.
speaker_0HOST
But an AI wrote that manuscript, and no person edited it, and no outside expert has reviewed it.
speaker_0HOST
The Princeton computer scientist Mark Braverman said in September, "Math by press release is not that healthy for math." [upbeat music] That's the Valley Morning Briefing for Thursday, October 8th.
speaker_0HOST
If you enjoy the show, the best way to help is to send it to a friend.
speaker_0HOST
Thanks for listening, and see you tomorrow.