Bugün öğrendim ki: David A Cox ve Steven Zucker, "Cox-Zucker makinesi" adlı bir algoritma yayınladı. Cox, tanıştıklarından sadece haftalar sonra birlikte bir makale yazmaya karar verdiklerini söyleyerek, isim kombinasyonları nedeniyle kasıtlı olarak işbirliği yaptılar.

---

Mathematical algorithm The **Cox–Zucker machine** is an [algorithm](/wiki/Algorithm "Algorithm") created by [David A. Cox](/wiki/David_A._Cox "David A. Cox") and [Steven Zucker](/wiki/Steven_Zucker "Steven Zucker"). This algorithm determines if a given set of sections provides a basis (up to torsion) for the [Mordell–Weil group](/wiki/Mordell–Weil_group "Mordell–Weil group") of an [elliptic surface](/wiki/Elliptic_surface "Elliptic surface") _E_ → _S_ where _S_ is isomorphic to the [projective line](/wiki/Projective_line "Projective line").[1] The algorithm was first published in the 1979 paper "Intersection numbers of sections of [elliptic surfaces](/wiki/Elliptic_surface "Elliptic surface")" by Cox and Zucker,[2] and it was later named the "Cox–Zucker machine" by Charles Schwartz in 1984.[1] The name is a homophone for an obscenity, and was a deliberate move by Cox and Zucker, who conceived of the idea of coauthoring a paper as graduate students at [Princeton](/wiki/Princeton "Princeton") for the express purpose of enabling this joke, a joke they followed through on while professors at [Rutgers](/wiki/Rutgers "Rutgers") five years later.[3] Cox wrote in the NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, August 2021 edition: "A few weeks after [Cox and Zucker] met, we realized that we had to write a joint paper because the combination of our last names, in the usual alphabetical order , is remarkably obscene." [3]