Orply.
Archive

October 2026

Article · Oct 9, 2026 · Perplexity
A New Falconer Theorem Claims Positive-Measure Distances Above d/2

An OpenAI manuscript dated September 23, 2026, claims that any compact set in ℝᵈ with Hausdorff dimension greater than d/2 determines a set of distances with positive Lebesgue measure. The result addresses the unpinned Falconer distance conjecture in every integer dimension d ≥ 2, but does not cover the equality case or distances measured from a fixed point. The proof combines frequency estimates with a multiscale argument to obtain a distance measure with an integrable density.

Article · Oct 9, 2026 · Perplexity
Ellipsoids Minimize Projection-Body Volume Ratios in Dimensions Four and Higher

An OpenAI preprint claims a sharp solution to Petty’s projection-volume problem in every dimension \(n\ge4\): among convex bodies with fixed volume, ellipsoids—and only ellipsoids—minimize the volume of the body defined by their shadows. The manuscript reduces the global inequality to a bound on pairings of measures, with the hardest step controlling directional variation through higher spherical-harmonic components. Its geometric examples illustrate the result but do not establish the proof.

Article · Oct 9, 2026 · Perplexity
A Fixed Distortion Gap Cuts Lp Embedding Dimension Below Every Polynomial

An OpenAI preprint argues that any finite set of \(n\) points in a real \(L_p\) space, for fixed \(1<p<\infty\) with \(p\ne2\), can be embedded in finite-dimensional \(\ell_p\) using fewer than \(n^\varepsilon\) coordinates for every fixed \(\varepsilon>0\), provided any fixed distortion greater than 1 is allowed. The bound is not uniform as distortion approaches 1: the paper contrasts it with a quadratic coordinate requirement for exact preservation.

Article · Oct 9, 2026 · Perplexity
Logarithmic Brunn–Minkowski Holds for All Origin-Symmetric Convex Bodies

An OpenAI preprint proves the logarithmic Brunn–Minkowski conjecture for origin-symmetric convex bodies in every positive dimension. It shows that when support bounds are combined by a geometric average and used to define a new body, that body’s volume is at least the geometric mean of the original volumes. The proof approximates volume with smoothed integrals and establishes their log-concavity through a variance bound.

Article · Oct 9, 2026 · Perplexity
The Symmetric Mahler Bound Has Equality Exactly for Hanner Bodies

An OpenAI preprint on the symmetric Mahler problem claims that, in dimension \(n\), the product of the volumes of an origin-symmetric convex body and its polar is at least \(4^n/n!\). It says equality holds exactly for linear images of Hanner polytopes, a family built recursively from intervals using Cartesian products and convex-hull joins. The paper’s proof turns feasibility probabilities into a volume bound, then uses a metric median property to identify the equality cases.

Article · Oct 9, 2026 · Perplexity
Fourier Extension Is Bounded for Every Exponent Above Three

An OpenAI manuscript proves a diagonal Fourier extension estimate for every finite \(p>3\) on compact, smooth surfaces in three dimensions with positive curvature: the wave’s \(L^p\) norm across space is bounded by the input’s \(L^p\) norm on the surface. The authors build the global bound by combining packet-propagation and Kakeya estimates, using a local density inequality to connect them. The endpoint \(p=3\) is not covered.

Article · Oct 9, 2026 · Perplexity
A Sharp Three-Dimensional Kakeya Bound Tracks Sparse Tube Density

An OpenAI manuscript claims a sharp three-dimensional Kakeya maximal estimate, allowing a δ⁻ε loss as tubes become thinner. Its central claim is density-sensitive: the bound must hold even when only a sparse subset of each tube is retained, with the resulting union estimate weakening cubically in the retained fraction. The manuscript’s proof argues that near-extremal tube families must recur in a constrained geometric pattern across scales, then uses projection and information estimates to rule out the configurations that would violate the bound.

Article · Oct 9, 2026 · Perplexity
Three-Dimensional Wave Estimate Allows Arbitrarily Small Positive Loss

An OpenAI preprint claims a spacetime \(L^3\) smoothing estimate for the three-dimensional wave equation, but its derivation depends on a difficult estimate for a single frequency band that the later frequency summation does not prove. Conditional on that bound, any positive loss of derivatives makes the sum converge; the argument does not establish the zero-loss endpoint. The same qualification applies to the derived range for finite \(p>2\), whose regularity boundary is also excluded.

Article · Oct 9, 2026 · Perplexity
Schrödinger Waves Converge Pointwise at the Sobolev Endpoint in Dimensions Three and Higher

The paper claims pointwise convergence for the free Schrödinger equation at the exact Sobolev regularity threshold in every fixed dimension \(n \ge 3\). For data in \(H^{n/(2(n+1))}(\mathbb{R}^n)\), it first removes Gaussian damping and then takes time to zero, recovering the datum’s Lebesgue value on one full-measure spatial set that works for every time in the stated interval. The proof’s endpoint challenge is to sum frequency estimates without losing regularity.

Article · Oct 9, 2026 · Perplexity
Univalent Maps Have a Uniform Reciprocal-Derivative Growth Gap Below One Quarter

An OpenAI preprint proves that the average reciprocal derivative of a normalized univalent map grows more slowly near the unit-circle boundary than Kraetzer’s proposed one-quarter exponent permits. The bound holds uniformly across all such maps, with an exponent at least some fixed positive amount below \(1/4\); the paper establishes that a gap exists but does not calculate its size.

Article · Oct 9, 2026 · Perplexity
Bounded Treewidth Guarantees Finite-Distortion L1 Embeddings

An OpenAI preprint proves that every finite connected graph with bounded treewidth embeds into finite-dimensional \(L_1\) with distortion bounded by a constant determined by the tree-decomposition bag size—not by the graph’s number of vertices or the length of its decomposition. The paper’s central challenge is ensuring that distant vertex pairs remain separated, not merely that the embedding does not stretch distances too far. It addresses this with weighted cuts, using reservations and anchor cuts to preserve separation across the graph.

Article · Oct 9, 2026 · Perplexity
Short-Segment Hilbert Transforms Remain Bounded Under Lipschitz Direction Changes

An OpenAI preprint proves a uniform \(L^2\) bound for a Hilbert transform whose direction varies across the plane, under a short-segment restriction. The authors show that when the direction field is Lipschitz, the bound holds uniformly across truncations, with constants independent of the field and the input; the direction is fixed at each output point along the segment. Their proof uses a frequency-localized gain to control contributions as it reassembles the estimate across directions.

Article · Oct 9, 2026 · Perplexity
Planar Schrödinger Evolution Converges at the H¹ᐟ³ Endpoint

A September 2026 OpenAI manuscript claims that planar Schrödinger evolution converges almost everywhere to its initial data for functions with exactly \(1/3\) of a Sobolev derivative, reaching a boundary where earlier results required more regularity. The authors’ proof rests on a local \(L^1\) maximal estimate that controls the evolution uniformly over time at that endpoint. They define the evolution through a Gaussian-regularized Fourier integral and show the convergence holds on one full-measure set for all times approaching zero.

Article · Oct 9, 2026 · Perplexity
Near-Full-Measure Sets Can Avoid Every Copy of a Fixed Geometric Progression

An October 5, 2026 OpenAI manuscript claims that, for any fixed ratio between zero and one, a compact subset of the unit interval can have measure arbitrarily close to one while containing no translated, nonzero-scaled or reflected copy of the corresponding infinite geometric progression. The result concerns the entire sequence: positive measure guarantees copies of every finite prefix, but the manuscript constructs a set in which every such infinite copy has at least one term missing. Its proof organizes small holes to catch every center and scale, then uses convergence of the progression to cover centers missed by finite tests.

Article · Oct 9, 2026 · Perplexity
Real Littlewood Polynomials Attain the √N Peak Bound at Every Large Length

An OpenAI preprint proves that for every sufficiently large length, a real Littlewood polynomial—one whose coefficients are all +1 or −1—can have a maximum modulus on the unit circle arbitrarily close to the unavoidable lower bound of √N. The result holds across all sufficiently large lengths, not just a subsequence, and concerns the largest peak rather than uniform flatness. The proof constructs high-energy coefficients, separates their leading spectral contributions, then uses coordinated rounding to turn them into signs.

Article · Oct 9, 2026 · Perplexity
Gaussian Partitions Have a Sharp First-Moment Bound in Every Dimension

An OpenAI preprint proves that, in every positive dimension, the sum of the squared first-moment vectors of any finite partition of Gaussian space is at most 9/(8π). The bound is attained by dividing a plane into three 120-degree sectors and extending them across any remaining dimensions. The paper’s main argument rules out a better partition by reducing a hypothetical improvement to geometric constraints on the moments and probabilities of its cells; it also derives a sharp bound for the expected maximum of finitely many centered Gaussian scores.

Article · Oct 9, 2026 · Perplexity
Planar Graph Metrics Admit Constant-Distortion Embeddings Into L1

An OpenAI preprint claims that every finite, connected, undirected planar graph with positive real edge lengths can be embedded into \(L_1\) with distortion bounded by a universal constant, independent of graph size and edge-length ratios. Its proof uses weighted cuts and argues that planarity helps coordinate local separation rules and preserve their gains across scales. Perplexity Computer adapted the manuscript into an animated video, writing the script and generating the narration and visuals.

Article · Oct 9, 2026 · Perplexity
Bochner–Riesz Multipliers Are Bounded on L³ for Every Positive Smoothing Order

An OpenAI preprint argues that in three dimensions, the Bochner–Riesz multiplier is bounded on \(L^3\) for every positive smoothing order \(\delta\), though the bound need not stay uniform as \(\delta\) approaches zero. Its proof uses cancellation in oscillatory wave packets to improve the decay of the operator on distant spatial shells; summing those bounds gives the result. The manuscript also derives a strict range of bounds for other exponents, but does not establish the sharp-cutoff case.

Article · Oct 9, 2026 · Perplexity
Zero-Sum Vector Sets Can Be Ordered With Prefix Radius O(√d)

An OpenAI preprint on the Euclidean Steinitz–Bergström theorem argues that bounded vectors in \(d\) dimensions can be signed so every partial sum stays within an absolute constant times \(\sqrt d\) of the origin, regardless of sequence length. For vectors that sum to zero, it also proves they can be reordered to achieve the same scale without changing their signs; a regular simplex shows that the square-root dependence on dimension is necessary up to constant factors. Perplexity Computer adapted the preprint into an animated video.

Article · Oct 9, 2026 · Perplexity
Triangular Hilbert Transform Has Annular Variation Bounds for Every r Greater Than 2

An OpenAI preprint on the triangular Hilbert transform proves an \(L^{3/2}\) bound for its annular \(r\)-variation when \(r>2\), controlled by the product of the inputs’ \(L^3\) norms and uniform over choices of scales. The manuscript reduces variation to a counting estimate for disjoint annuli, whose sublinear growth makes the bound possible; its argument does not establish the endpoint \(r=2\). The estimate also yields almost-everywhere and \(L^{3/2}\) convergence of the joint principal value as the two truncation endpoints move independently.

Article · Oct 9, 2026 · Perplexity
Irrational Levels Yield a Global Quantum Langlands Equivalence

An OpenAI manuscript claims a global equivalence between the full twisted D-module categories for a simple complex group and its Langlands dual at every irrational complex level, with the two parameters related by a negative reciprocal scaled by the groups’ lacing number. The authors’ argument uses irrationality to eliminate local modes that would otherwise survive, then combines a categorical cutoff with reconstruction and global comparison results to establish the equivalence. The local calculation is only one part of that proof.

Article · Oct 9, 2026 · Perplexity
A Nonspectrahedral Hyperbolicity Cone Has an Exact 307-Variable Semidefinite Lift

An OpenAI preprint gives an exact semidefinite lift for a hyperbolicity cone that a companion paper shows cannot be represented directly by a positive semidefinite matrix in its original coordinates. The authors add 307 auxiliary variables and impose one 100-by-100 matrix inequality; projecting away those variables recovers the cone, including its singular boundary points. The construction establishes that the obstruction is to a direct representation, not to semidefinite representation by lifting.

Article · Oct 9, 2026 · Perplexity
Brennan’s Conjecture Holds for Derivative Integrals Between 4/3 and 4

An OpenAI manuscript dated September 24, 2026, argues that Brennan’s conjecture holds for conformal maps from any simply connected plane domain onto the unit disk: the integral of the map’s derivative to the power \(s\) is finite for \(4/3<s<4\), without assumptions that the domain is bounded or has a smooth boundary. Its key estimate makes one the sharp limiting radial growth exponent for the inverse-square derivative mean, with the Koebe map showing why the exponent cannot be lower.

Article · Oct 9, 2026 · Perplexity
A Hyperbolicity Cone in 23 Variables Has No Finite LMI Representation

An OpenAI preprint constructs a hyperbolicity cone in 23 real variables that cannot be represented directly by any finite-size real symmetric linear matrix inequality. The authors’ obstruction applies to the region itself, not merely to a particular polynomial used to define it: even a different defining polynomial cannot make the cone spectrahedral. The proof turns on a nonnegative form that cannot dominate the square of any nonzero bilinear form; the result does not rule out representations using auxiliary variables.