<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>Closed Form — AI mathematics, explained</title>
    <link>https://nishachay.github.io/closed-form/</link>
    <description>Newly explained entries from Closed Form, newest first.</description>
    <item>
      <title>369 · On smooth flat shapes without holes, the lasting hot and cold spots lie on the edge.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-369/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-369/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>334 · Some smooth rules for measuring length cannot be built as a surface in space, even near one point.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-334/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-334/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>322 · Every distance-keeping map between unit spheres of two real Banach spaces extends to a linear map of the spaces.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-322/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-322/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>312 · Grothendieck's algebraic ∞-groupoids capture all shapes of spaces, a paper claims, with its key step checked in Lean.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-312/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-312/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>297 · An algebra with one irreducible representation that is not the compact operators, built without extra axioms.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-297/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-297/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>296 · Every type II₁ factor with separable predual is generated by a single operator.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-296/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-296/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>288 · Every bounded map from a C*-algebra to operators can be straightened to respect the mirror operation.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-288/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-288/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>266 · Dimension six fits only three mutually unbiased bases, by a computer-assisted search.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-266/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-266/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>263 · A nucleus can hold only a fixed number of extra electrons, however large its charge.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-263/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-263/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>248 · Thompson's group F, a famous group of interval stretchings, is not amenable.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-248/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-248/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>246 · A hyperbolic group whose boundary is a sphere acts geometrically on hyperbolic three-space.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-246/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-246/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>244 · Fitting sets back inside their images does not give you the Axiom of Choice.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-244/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-244/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>213 · At the exact tipping point, random networks of a broad, symmetric kind form no endless cluster.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-213/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-213/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>196 · A group with no looping moves still lets two nonzero sums multiply to zero.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-196/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-196/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>180 · Every Barnette graph has a round trip through all its points.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-180/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-180/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>179 · Circulant Hadamard matrices exist only in sizes 1 and 4.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-179/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-179/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>173 · In every network of one-way arrows, some point reaches at least as many points in two steps as in one.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-173/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-173/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>165 · The classic crossing formulas for drawing complete networks are exact.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-165/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-165/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>162 · Ryser's covering conjecture is false: some intersecting hypergraphs with r parts need r vertices to cover.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-162/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-162/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>161 · A 35-vertex bipartite pattern appears less often in some graph than random would predict.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-161/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-161/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>159 · Any set of whole numbers whose reciprocals add to infinity holds evenly spaced runs of every length.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-159/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-159/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>158 · No way of coloring the plane with five colors keeps every unit-distance pair apart.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-158/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-158/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>156 · A set in nine-dimensional space cannot be cut into ten smaller pieces, so Borsuk's conjecture fails there.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-156/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-156/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>154 · For mixing systems, averages along k, 2k, …, nk are claimed to settle at almost every starting point, for every n.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-154/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-154/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>153 · Claimed singular Bernoulli convolutions beyond Pisot reciprocals, plus an arithmetic test for every parameter.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-153/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-153/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>152 · An abstract zero-entropy system with no smooth, volume-keeping copy in any dimension.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-152/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-152/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>151 · A smooth-enough map can double a shape's homology while its orbits stay orderly.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-151/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-151/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>150 · A paper claims billiards in every triangle with an irrational angle forget their start: they are weakly mixing.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-150/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-150/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>149 · With fixed rates, every weakly reversible chemical network herds each class of states into one common window.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-149/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-149/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>148 · A single formula gives the dimension of every self-similar measure on the line, even when its pieces collide.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-148/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-148/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>147 · Two papers claim that a smooth billiard table with an unbroken band of caustics along its edge must be an ellipse.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-147/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-147/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>146 · The standard map is chaotic on a region of positive area for every large enough parameter.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-146/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-146/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>145 · If long waits make any two moments independent, they make every finite group of moments independent.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-145/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-145/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>144 · A smooth map of a 3D torus where one measurement’s past and future build every average-zero measurement.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-144/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-144/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>143 · Claims a finite cap, set by degree alone, on limit cycles of planar polynomial systems.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-143/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-143/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>142 · A claimed coin-free algorithm that factors any polynomial modulo a prime in time polynomial in the input size.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-142/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-142/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>141 · Deciding “there is x so that for every y” questions about real numbers claimed at one fixed counting level.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-141/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-141/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>140 · Exact clues still cost more reading for each extra digit of accuracy when memory is limited.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-140/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-140/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>139 · Sampling from a gently curved bowl needs no fixed power of the dimension in queries.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-139/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-139/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>138 · A randomized algorithm claims to decide every Subset Sum instance in O(2^(0.49n)) time, below the 2^(n/2) scale.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-138/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-138/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>137 · A one-tape machine's run can be replayed with far less memory than the old square-root rule allowed.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-137/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-137/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>135 · Five-layer recipes for multiplying n matrices need n to a power that grows like √n.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-135/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-135/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>134 · Three nested stars are enough to describe any regular language once complement is allowed.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-134/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-134/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>133 · Deciding Weisfeiler–Leman equivalence at dimension k needs time n to a power proportional to k.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-133/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-133/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>132 · Block sensitivity can outgrow any constant times sensitivity squared.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-132/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-132/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>131 · Random rewiring reaches a fair random network quickly, for every possible list of degrees.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-131/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-131/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>130 · In exact arithmetic, the discrete Fourier transform can be computed in slightly fewer than n log n steps.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-130/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-130/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>129 · Removing guesses from simple two-way reading machines can cost exponentially many states.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-129/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-129/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>128 · A fast method builds a string containing all given pieces, never more than twice the shortest possible.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-128/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-128/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>127 · Yes-or-no rules built from degree-d polynomials on n inputs have average sensitivity at most 8d√n.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-127/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-127/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>126 · Exact semidefinite descriptions of perfect matching need exponential size, a new paper claims.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-126/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-126/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>125 · The best possible guarantee for placing k facilities is exactly 1 + 2/e, assuming P ≠ NP.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-125/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-125/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>124 · The best schedule for one-hour jobs with order rules on three machines can be found in polynomial time.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-124/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-124/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>122 · Rebuilding a string from randomly thinned copies needs more than polynomially many copies.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-122/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-122/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>121 · Edit distance can be estimated to within any fixed accuracy in barely more than linear time.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-121/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-121/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>119 · No yes-or-no summary of random bits survives noise better than simply keeping one bit.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-119/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-119/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>118 · Rounding up the fractional bin count can be wrong by any fixed number of bins.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-118/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-118/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>117 · Finding a network's weakest split even roughly is claimed NP-hard, and a key relaxation can miss by almost √log n.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-117/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-117/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>116 · One fixed set of matrices exposes every nonzero small formula whose variables do not commute.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-116/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-116/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>115 · Number grids with fixed row and column sums can be sampled fairly and counted fast, whatever their size.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-115/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-115/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>114 · Shared solutions of two capacity rules can be counted approximately, at a cost set by digits, not size.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-114/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-114/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>113 · A fast coin-flipping method estimates the number of perfect matchings in any network, to any chosen accuracy.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-113/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-113/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>112 · One fast-to-decide problem needs three-layer circuits bigger than any 2^(A√n) for large inputs.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-112/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-112/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>111 · One sample per item lets an online rule keep a fixed share of the best, even against an all-seeing opponent.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-111/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-111/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>110 · Randomized k-server costs at most a squared-logarithm factor on every space, matching the known lower bound.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-110/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-110/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>109 · A tape-based computer can multiply huge whole numbers slightly faster than the long-conjectured n log n limit.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-109/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-109/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>108 · Disguising the permanent as a determinant needs a matrix that grows at least like the cube of its size.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-108/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-108/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>107 · Huge n-by-n complex matrices can be multiplied in about n^(9/4) arithmetic steps, up to any tiny slack.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-107/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-107/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>106 · Even a three-colorable graph can be NP-hard to tell from one with only tiny independent sets.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-106/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-106/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>105 · Telling fully solvable 2-to-1 games from nearly worthless ones is NP-hard.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-105/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-105/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>104 · Who wins a mean-payoff game can be found in quasipolynomial time, however large the scores.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-104/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-104/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>103 · Coin flips give no extra power to computers with tiny memory: L = RL = BPL.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-103/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-103/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>102 · Telling almost-solvable puzzles from hopeless ones can be impossibly hard.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-102/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-102/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>100 · Cylinders can cover a regular tetrahedron for less than half its smallest shadow.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-100/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-100/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>099 · Edit distance between words can be drawn as ℓ1 distance only with distortion of size exp(√(log d·log log d)).</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-099/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-099/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>098 · Some uncrowded point sets in infinite dimensions cannot be copied faithfully into any finite dimension.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-098/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-098/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>097 · One choice of signs keeps every running total of unit vectors within a constant times √d, at any length.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-097/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-097/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>096 · Three 120-degree wedges are the best way to cut a bell-curve cloud, in every dimension.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-096/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-096/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>095 · A claimed proof that some hyperbolicity cones have no semidefinite description, even with hidden variables.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-095/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-095/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>094 · Points in Lp space can be squeezed into far fewer coordinates if distances may stretch slightly.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-094/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-094/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>092 · The worst convex shape needs covering density about n log n in dimension n, lattice or not.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-092/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-092/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>091 · Blending two symmetric shapes the thrifty way never loses volume below their geometric mean.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-091/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-091/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>090 · No arrangement of points in the plane beats the triangular lattice for any steadily fading repulsion.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-090/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-090/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>089 · Every planar road network can be redrawn in taxicab distance with stretch below one fixed number.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-089/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-089/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>088 · In four or more dimensions, ellipsoids have the smallest shadow body for their volume.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-088/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-088/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>087 · Symmetric convex bodies cannot beat Mahler's volume bound.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-087/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-087/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>085 · Taking the best disk average at each point never multiplies a surface's total slope by more than a fixed factor.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-085/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-085/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>084 · A set covering almost all of [0, 1] can dodge every copy of a geometric list like 1/2, 1/4, 1/8, …</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-084/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-084/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>083 · Hilbert transforms along any Lipschitz direction field in the plane obey one energy bound at short lengths.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-083/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-083/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>082 · A triangle-shaped singular integral stays bounded at the symmetric L³ point, whatever cutoffs each point picks.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-082/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-082/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>081 · A bounded Riesz transform forces surfaces in higher codimension to contain big flat-like pieces.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-081/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-081/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>076 · Polynomials with only +1 and −1 coefficients can be almost perfectly flat on the unit circle.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-076/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-076/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>075 · Fourier sums of every L log L function converge to it at almost every point of the circle.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-075/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-075/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>074 · Claimed proofs: the Kakeya maximal conjecture in 3D, and full dimension for every Kakeya set in 4D.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-074/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-074/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>073 · Any closed, bounded set whose dimension is more than half that of its space has distances with positive total length.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-073/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-073/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>072 · Reshaping a region into a disk can never squeeze too hard: Brennan's 1978 conjecture is proved.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-072/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-072/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>071 · Every region of the sphere, however many holes it has, can be reshaped so that each hole is round.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-071/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-071/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>066 · One complement index, fixed by dimension and singularity bound, works for every mildly singular Fano contraction.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-066/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-066/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>058 · Unrolled shapes with a polynomial description split into just three kinds of pieces.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-058/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-058/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>052 · Two integrable families of directions on a compact Kähler manifold make its universal cover a product.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-052/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-052/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>050 · Algebraic positivity need not come with positive curvature, even on the simple surface built from two spheres.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-050/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-050/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>049 · A polynomial that becomes a coordinate with one extra variable, but not without it, disproves two conjectures.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-049/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-049/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>047 · A four-dimensional shape that is not ordinary space, until you add one line.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-047/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-047/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>039 · Nagata's 1959 rule for curves through random points holds for every count from 10 points up.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-039/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-039/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>038 · On every smooth shape, n + 1 copies of a positive bundle are always enough for Fujita's freeness.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-038/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-038/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>033 · Twisting a family of shapes never destroys the forms its fibers and base contribute.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-033/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-033/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>028 · No walk through Gaussian primes with steps of bounded length can go on forever.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-028/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-028/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>027 · On every curve, whole-number matrix rules spread across the character variety after one enlargement of the integers.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-027/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-027/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>026 · For any size bar, a fixed share of prime gaps clears it, all the way out.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-026/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-026/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>025 · Every fraction below 1 is a sum of about log log b distinct unit fractions, as Erdős conjectured.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-025/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-025/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>024 · Counting totient values up to x gets an exact leading formula, and doubling x doubles the count in the limit.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-024/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-024/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>023 · Cubic Gauss sums over primes lean positive at exactly the rate Patterson predicted in 1978.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-023/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-023/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>021 · Every run of about k² whole numbers holds one sharing no factor with a number that has k prime factors.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-021/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-021/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>020 · Whole-number quartics like n⁴ + 2 take squarefree values at exactly the share the local guess predicts.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-020/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-020/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>017 · Fractions can never get unusually close to π.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-017/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-017/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>015 · Number-field grids spread evenly over all grid shapes in prime degrees from five, and in degrees four and six.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-015/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-015/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>013 · The primes cannot be built by adding two sets of whole numbers.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-013/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-013/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>012 · The largest prime factors of n and n + 1 act like independent dice, so each wins half the time.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-012/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-012/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>010 · Odd two-dimensional 2-adic Galois representations are claimed to come from modular forms, with no condition mod 2.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-010/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-010/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>009 · A field of functions can be rebuilt from its multiplication, blurred by powers, plus one trace of addition.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-009/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-009/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>008 · A short list of braid equations has exactly the solutions Deligne and Drinfeld predicted, in every size.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-008/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-008/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>007 · Neighboring numbers stop agreeing on prime-factor parity.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-007/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-007/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>006 · Among the quadratic twists of any elliptic curve, half are claimed to have analytic rank 0 and half rank 1.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-006/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-006/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>005 · Catalan's constant, 1 − 1/9 + 1/25 − 1/49 + …, is not a fraction.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-005/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-005/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>004 · No algorithm can decide whether a whole-number polynomial equation has a solution in fractions, the paper claims.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-004/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-004/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>003 · No zero of Riemann's zeta function, or of any Dirichlet L-function, lies to the right of real part 7/8.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-003/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-003/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>002 · The full Birch–Swinnerton-Dyer formula is claimed for every elliptic curve with a small Selmer group at one prime.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-002/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-002/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
    <item>
      <title>001 · After reduction mod p, Hodge classes on abelian varieties are claimed to give one rational number in every cohomology.</title>
      <link>https://nishachay.github.io/closed-form/e/openai-math-2026-001/</link>
      <guid>https://nishachay.github.io/closed-form/e/openai-math-2026-001/</guid>
      <pubDate>Thu, 08 Oct 2026 17:12:00 GMT</pubDate>
    </item>
  </channel>
</rss>
