Browse

Classical Analysis and ODEs

math.CA — Classical Analysis and ODEs

math.CA RSS feed

Works in math.CA

35 works

math.CA — Classical Analysis and ODEs

Even Asymptotic Expansions and Uniform Hard-Edge Approximations for Wigner 3j3j and 6j6j Symbols at Fixed Rank

Contributed by Antony Lewis

We study Wigner 3j3j symbols with two large and one small angular momentum, and the 6j6j symbols with one small entry (Edmonds' limit), both at fixed rank: the small labels stay fixed while the large ones grow. Their classical limits are Wigner rotation matrix elements. Combining a Regge symmetry with the Weyl shift j↦j+12j\mapsto j+\tfrac12 singles out midpoint variables: for 3j3j, the large scale N=j−+j++1N=j_-+j_++1 (j∓j_\mp the two large angular momenta) and x=2μ/Nx=2\mu/N (2μ2\mu the difference of the two large magnetic indices), and, for 6j6j, large lengths A,B,CA,B,C shifted by offsets that depend on the small labels. Among constant shifts of the large labels and magnetic coordinate, and up to rank-independent gauge factors, these are the only centerings that remove the generic first-order term of the exact recurrences. In these variables the normalized symbols are values of analytic functions of the inverse square of the large scale, for integer and half-integer small labels alike (including spin–orbit coefficients): the expansions contain only even powers and converge. The first correction is a closed formula in one Wigner dd function and its derivative, improving the error from second to fourth order in the inverse large scale; all higher corrections are constructed as local differential operators. The exact finite problems are Hahn and Racah spectral systems with undeformed Wigner spectra. Near the ends of the physical lattice (the hard edges), an explicit product of Pochhammer factors carries the difference between the discrete and continuum weights; extracting it gives expansions that are uniform on the whole lattice, including the 6j6j corner where two large lengths nearly coincide (A≈BA\approx B). We also show that centered Hahn and Racah polynomials are even deformations of Jacobi polynomials.

Author comments: 55 pages, 1 figure.

Primarily AI-generated textHuman understanding: no partsHahn polynomialsRacah polynomialsRegge symmetryWigner 3j symbolsWigner 6j symbols
Nov 16, 202655 pages
PDFView work

math.CV — Complex Variables

Sheil-Small's (1974) covering problem has a positive answer, and other miscellanea

Contributed by Dave Goel

T. Sheil-Small asked whether every self-inversive polynomial maps the unit disc onto a domain that contains a disc whose radius is the largest modulus of the polynomial's coefficients (Problem 4.24 in Hayman and Lingham's problem book). We show that the answer is yes. More generally, every non-constant polynomial whose coefficients have the same moduli when read in reverse order maps the unit disc onto a domain that contains an open disc of this radius. This class contains both the self-inversive polynomials, whose zeros are symmetric with respect to the unit circle, and the polynomials whose zeros, with multiplicity, are symmetric under taking reciprocals (the literal reading of the problem as printed), so the theorem answers the question under either reading. The radius cannot be increased. For a polynomial with all its zeros on the unit circle, the largest disc in the image has radius exactly half the maximum modulus of the polynomial on the circle. For these polynomials the question is therefore equivalent to asking whether every coefficient has modulus at most half this maximum. O'Hara and Rodriguez and, independently, Saff and Sheil-Small proved this in 1974 for every coefficient except the middle one, and Kristiansen proved the middle case in 1979. The new case is that of polynomials with zeros off the unit circle. We treat this case with the Schur–Cohn Hermitian form of the polynomial minus a value that it does not take in the disc. This expanded version adds a description by rays of the image of a self-inversive polynomial, two examples, and the trigonometric form of the middle case. The results of Sections 2–5 are also proved in Lean 4, with the coefficient bound taken as given.

Author comments: First version: November 2026. This is the expanded version of the paper "Sheil-Small's (1974) covering problem has a positive answer", which is at https://hexagonmath.org/2611.00154 on Hexagon.

A mix of human-written and AI-generated textHuman understanding: some partsSchur-Cohn formcoveringde Bruijn's theoremself-inversive polynomial
Nov 16, 202611 pages
PDFView work

math.CA — Classical Analysis and ODEs

Closed-Form Adiabatic Asymptotics of the Solution of the Amsler Equation

Contributed by Anton Kalmykov

We consider the regular solution y(x;s)y(x;s) of the Amsler equation (xy′)′=sin⁡y(xy')'=\sin y, y(0)=πsy(0)=\pi s, y′(0)=sin⁡πsy'(0)=\sin\pi s, with s∈(0,1)s\in(0,1), and prove that as x→∞x\to\infty it is approximated, with accuracy O(τ−5/2)O(\tau^{-5/2}) for τ=2x\tau=2\sqrt{x}, by an explicit closed-form adiabatic ansatz yady_{\rm ad}: a libration of the pendulum w′′+sin⁡w=0w''+\sin w=0 (w=y−πw=y-\pi) whose parameter m0(τ)m_0(\tau) is determined by the adiabatic invariant τ ℓ(m0)=πν\tau\,\ell(m_0)=\pi\nu, where ℓ(m)=E(m)−(1−m)K(m)\ell(m)=E(m)-(1-m)K(m) and ν=π−1ln⁡csc⁡πs2\nu=\pi^{-1}\ln\csc\frac{\pi s}{2}, and whose phase is Φ=τf(m0)+Θ0−18τ\Phi=\tau f(m_0)+\Theta_0-\frac{1}{8\tau} with f(m)=E(1−m)−mK(1−m)f(m)=E(1-m)-mK(1-m) and Θ0=C2+ν(1+ln⁡8ν)\Theta_0=C_2+\nu(1+\ln\frac{8}{\nu}); explicitly, yadx)=π+2arcsin⁡ ⁣(m0 sn(2K(m0)πΦ ∣ m0))y_{\rm ad} x)=\pi+2\arcsin\!\bigl(\sqrt{m_0}\,\mathrm{sn}\bigl(\tfrac{2K(m_0)}{\pi}\Phi\,\big|\,m_0\bigr)\bigr). The proof combines elementary adiabatic analysis of the damped pendulum (residual estimates, absence of low-order resonances, an approximate fundamental system) with two external inputs stated explicitly: Maevsky's asymptotics for yy and the Its--Novokshenov/Kitaev connection formula for the sine-Gordon (D8D_8) reduction of the Painlev\'e III equation. The matching of the two determines the amplitude and phase constants in closed form, C1=8νC_1=\sqrt{8\nu}, C2=5π4+arg⁡Γ(1+iν)−3νln⁡2C_2=\frac{5\pi}{4}+\arg\Gamma(1+i\nu)-3\nu\ln2; in particular, the result is a closed-form description of the large-xx behaviour of every regular solution (up to the symmetries y↦−yy\mapsto-y, y↦y+2πy\mapsto y+2\pi), conditional on the two external inputs and with no fitting parameters.

Primarily human-written textHuman understanding: all partsAmsler equationPainleve III equationadiabatic invariantsconnection formulaselliptic integralssine-Gordon equation
Nov 16, 202634 pages
PDFView work

math.CA — Classical Analysis and ODEs

Bounds for the sign uncertainty constant in dimension one

Contributed by Tejasvi Singh Tomar

Bourgain, Clozel and Kahane proved that a nonzero even real function ff on R\mathbb{R} with ff and f^\widehat{f} integrable, f(0)≤0f(0)\le0 and f^(0)≤0\widehat{f}(0)\le0 cannot have ff and f^\widehat{f} both nonnegative outside an arbitrarily small neighborhood of the origin. The sharp constant in this sign uncertainty principle is A+(1)A_+(1), the infimum of A(f)A(f^)\sqrt{A(f)A(\widehat{f})} over all such ff, where A(f)A(f) is the radius beyond which ff is nonnegative; its square is the constant of Problem 6.11 in the list of Georgiev, Gómez-Serrano, Tao and Wagner. We prove 0.5502<A+(1)≤0.55090.5502<A_+(1)\le0.5509, improving the previous bounds 0.45≤A+(1)≤0.30890.45\le A_+(1)\le\sqrt{0.3089}; in particular A+(1)<0.555A_+(1)<0.555, as conjectured by Gonçalves, Oliveira e Silva and Ramos. The lower bound comes from a weight in the spirit of the summation formulas of Cohn and Gonçalves, built from Gaussians and cosines and corrected near the origin by an approximate solution of a Fredholm integral equation, and the upper bound from an explicit self-dual combination of Gaussians. The numerical inequalities in both proofs are verified in ball arithmetic, and the bounds 0.5502≤A+(1)≤0.55090.5502\le A_+(1)\le0.5509 also have formal proofs in Lean 4.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716092

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202610 pages
PDFView work

math.CV — Complex Variables

A lower bound for the Bohr radius of the bidisc

Contributed by Tejasvi Singh Tomar

We prove that the Bohr radius K2K_2 of the bidisc, whose exact value is unknown, satisfies K2>0.301665K_2>0.301665, improving Patel's bound K2>0.30158758K_2>0.30158758. As in his argument, we pass to functions with positive real part and value 11 at the origin; we bound the sum of the moduli of their coefficients of degree nn by 2Sn2S_n instead of 2n2\sqrt n, where SnS_n is the Sidon constant of {0,1,…,n}\{0,1,\dots,n\}, and we bound S5S_5, S6S_6 and S7S_7 with computer-assisted certificates. In Lean 4 we also prove K2≥0.301665K_2\ge0.301665, assuming Patel's inequality coupling the coefficients of degrees two and three.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716439

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202610 pages
PDFView work

math.CA — Classical Analysis and ODEs

Bounds for the weak type (1,1) constant of the centred maximal operator over squares

Contributed by Tejasvi Singh Tomar

Let c2c_2 be the best constant in the weak type (1,1)(1,1) inequality for the centred Hardy–Littlewood maximal operator over axis-parallel squares in the plane. We prove 1.7027237335≤c2≤3.591231.7027237335\le c_2\le3.59123, improving the bounds 1.6855…≤c2<3.6157491.6855\ldots\le c_2<3.615749 obtained by Lin. The upper bound comes from a new kernel in Lin's comparison principle, which bounds c2c_2 by half the integral of a suitable kernel; closed forms for the fractional operator in this principle make its conditions checkable. The lower bound comes from a periodic measure obtained by modifying Lin's lattice of point masses. Both proofs are computer-assisted and formally verified in Lean.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716077

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202612 pages
PDFView work

math.CV — Complex Variables

An explicit bound below 2/π for the maximum term of an entire function

Contributed by Tejasvi Singh Tomar

For a transcendental entire function ff let μ(r)\mu(r) be its maximum term and M(r)M(r) its maximum modulus on ∣z∣=r|z|=r. Erdős asked for the largest possible value BB of lim inf⁡r→∞μ(r)/M(r)\liminf_{r\to\infty}\mu(r)/M(r). An argument of Clunie gives B≤2/π=0.636619…B\le 2/\pi=0.636619\ldots, and Clunie and Hayman proved B≤2/π−cB\le 2/\pi-c for an absolute constant c>0c>0 that they did not compute. We prove B≤0.63005B\le0.63005. We make the stability argument of Clunie and Hayman quantitative by testing ff against trigonometric polynomials at one or both of two consecutive radii where the central index jumps. The proof is computer-assisted, and the theorem is also proved in the Lean proof assistant.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716682

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202610 pages
PDFView work

math.DS — Dynamical Systems

Limit Cycles under Concave Per-Capita Growth

Contributed by Zhenyu Sun

We study predator--prey systems with a fixed globally linear functional response and a strictly concave prey per-capita growth rate. For every N≥1N\ge1 and K≥2K\ge2, we construct a growth polynomial of degree 2N+2⌈K/2⌉+22N+2\lceil K/2\rceil+2 with exactly NN positive periodic orbits, all hyperbolic. The construction retains a chosen center KK-jet and the low-density growth rate and carrying capacity of its limiting profile, subject to an explicit relation between the center height and curvature. A limiting Lyapunov function and return-map estimates at three amplitude scales exclude additional cycles. A dissipative extension gives exact global counts with prescribed limiting center energies. We also prove that profiles with at least NN hyperbolic cycles are C2C^2-dense in the admissible class, while preserving the entire germ at the maximum and both ecological endpoint values. The first nonzero canonical odd term determines the sharp differentiability threshold. Further results give parity restrictions for fixed focus jets, degree lower bounds, quantitative polynomial approximation under concavity and interpolation constraints, and amplitude and multiplicity interpolation by Abelian integrals. Finally, a single smooth strictly concave profile has infinitely many nested hyperbolic cycles converging to coexistence.

Author comments: 45 pages, 3 figures. Symbolic and numerical verification scripts and data are included in anc/.

A mix of human-written and AI-generated textHuman understanding: some partsAbelian integralsdifferentiabilityfinite jetslimit cyclespolynomial degreepredator-prey systemstrict concavity
Nov 12, 202645 pages
PDFView work

math.CA — Classical Analysis and ODEs

Certified lower bounds for the first and the signed third autocorrelation constants

Contributed by Tejasvi Singh Tomar

Let C1C_1 be the largest constant such that sup⁡∣t∣≤1/2∫f(t−x)f(x) dx≥C1(∫−1/41/4f)2\sup_{|t|\le 1/2}\int f(t-x)f(x)\,dx\ge C_1\bigl(\int_{-1/4}^{1/4}f\bigr)^2 for every nonnegative function ff on the real line. We prove C1≥1.337C_1\ge 1.337, improving the bound 1.29371.2937 of Kim and Pilanci, by a spatial branch-and-bound over the masses of ff on equal bins. Consequently, for every large gg, every gg-Sidon set in {1,…,N}\{1,\dots,N\} has fewer than 1.2231gN1.2231\sqrt{gN} elements once NN is large enough in terms of gg. For real-valued ff supported in [−1/4,1/4][-1/4,1/4], let C3C_3 and C3′C_3' be the analogous constants for the essential suprema of ∣f∗f∣|f*f| and of f∗ff*f; no lower bound better than the trivial bound 11 was recorded for them. We prove C3≥C3′≥4/3C_3\ge C_3'\ge 4/3 with the argument principle. Both proofs are computer-assisted, and both theorems are also proved in Lean 4.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715655

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 12, 202619 pages
PDFView work

math.CA — Classical Analysis and ODEs

Some positivity properties of Riemann Ξ\Xi under smoothing

Contributed by Suvrit Sra

We show that smoothing the zeros of the Riemann Ξ\Xi-function makes it easy to establish positivity properties that are otherwise hard (as they are equivalent to the Riemann hypothesis). Specifically, we smooth each zero with a small density centered at it, and then test the impact of this smoothing on complete monotonicity (CM) of the heat sum H(t)=∑ρe−tzρ2H(t)=\sum_\rho e^{-tz_\rho^2} over the zeros 12+izρ\tfrac12+iz_\rho. A sufficiently wide density quickly implies CM of the smoothed heat sum. We bound the width (i.e., half-variance) the density needs using increasingly precise facts about the zeros. If we only use that they lie in the critical strip, half-variance 1/81/8 suffices; the primes lower this width to π2/288\pi^2/288; and zeros verified through height TT further lower it to π2/(8log⁡2T)\pi^2/(8\log^2T) asymptotically. Ultimately, however, smoothing seems to be of limited utility: despite the CM result, the smoothed reciprocal laws of Ξ\Xi are not even log-concave, unlike the unsmoothed ones.

A mix of human-written and AI-generated textHuman understanding: some partsGaussian smoothingPolya frequencyRiemann Xicomplete monotonicitygeneralized Laguerre inequalitieslog-concavityzeta zeros
Nov 12, 202635 pages
PDFView work

math.FA — Functional Analysis

COUNTABLY INFINITE-DIMENSIONAL SPACES OF CRYSTALLINE MEASURES

Contributed by Jamie Martin

We construct a symmetric locally finite set Λ ⊂ R for which the space MΛ of crystalline measures with support and spectrum in Λ has countably infinite Hamel dimension; Meyer asked what the dimension of such spaces can be. More precisely, there is a sequence of crystalline measures such that every element of MΛ is a unique finite linear combination of them. Every layer of MΛ of fixed Hermite–Sobolev order is finite-dimensional, but the layer dimensions are unbounded; in one construction they grow linearly, and in general their growth can be prescribed up to a linear change of the order. (For every locally finite set the dimension is finite, countably infinite or equal to the continuum, and the countable case is exactly this behaviour of the layers.) The construction uses clusters of atoms that imitate derivatives of Dirac masses, which produce one-dimensional blocks of prescribed Hermite order. The main difficulty is to show that the union of infinitely many blocks supports no other crystalline measures. We prove this by placing the blocks at random scales, separated by rapidly growing gaps, and showing that every element of fixed Hermite order splits into finitely many block components. We also obtain disjoint sets A, B such that the crystalline measures with support in B and spectrum in A form a countably infinite-dimensional space, while MA = MB = {0}. The existence statement, without the symmetry of Λ, has been formalised and machine-checked in Lean 4; the formal development is recorded in Palomar

Primarily AI-generated textHuman understanding: no partsCrystalline MeasuresFourier Quasicrystals
Nov 11, 202657 pages
PDFView work

math.NT — Number Theory

Odd/Odd Records for a Relative Approximation Error: Three Quadratic Classifications and an Exact Certificate

Contributed by Elias De Jesús

For a quadratic irrational α > 1 and positive odd integers m, k, set H = mα + k and ε = |mα − k|/(mα + k). A state (m, k) is a strict chronological record if ε is smaller than at every admissible state of smaller H. We classify the strict records completely for α = φ, α = 1 + √3 and α = √3. In each case they are a finite explicit union of orbits of a single unimodular matrix, with signed defect cycles (−1, +1, −5), (−3, +1, −11) and (−2) respectively. The proofs rest on two exact identities that make ε a function of the defect N and the conjugate factor η alone, on a norm cutoff |N| ≤ 18, 204, 27 derived from heights, and on a finite exact certificate that decides every remaining comparison. Two phenomena require care and are isolated: at φ the competition between the Fibonacci and Lucas ladders is a genuine tie at leading order, decided by an integer identity N_B = −5N_A; and at √3 a companion family has exactly equal error at larger height, so it is excluded by equality rather than by loss. The results resolve two conjectures of the author's earlier note and correct one assertion there. Nothing here is formally verified or refereed, and the uniform generalisation is left open.

Author comments: First version, 17 pages. Supporting materials—including the exact-arithmetic certificate, verification scripts, complete orbit tables, and supplementary documentation—are available at: https://github.com/innerlightr-wq/two-mode-oscillator-record-chronologies/tree/main/congruence-records

A mix of human-written and AI-generated textHuman understanding: all partsCongruence restrictionsDiophantine approximationExact arithmeticOdd/odd rational approximationPell equationsQuadratic irrationalsRelative approximation errorStrict and weak recordsUnit orbitscomputer-assisted proofs
Nov 10, 202617 pages
PDFView work

cs.LO — Logic in Computer Science

Formalizing the interpolation lemma of the openai/math Landau–Siegel paper and substituting it into a Comparator-accepted proof

Contributed by Joseph Reilly

OpenAI’s openai/math release includes a Lean formalization of “Uniform exclusion of Landau–Siegel zeros” (OpenAI, October 1, 2026). Its Comparator challenge has two checked theorems, whose statements we prove equivalent in Lean. OpenAI proves them by two routes, neither through the paper’s proof of Lemma 3. The catalogued main result, exists_absolute_real_zero_gap, gets its spanning step from a local Bézout argument and does not use OpenAI’s Corollary 4 theorem. The second theorem, dirichletRealZeroBound_proof, proves Corollary 4 by a multiplicity estimate. We formalized the paper’s proofs of Lemma 3 and Corollary 4 in Lean. By reading, the Lean statements match the paper’s, and the declarations use only the axioms propext, Classical.choice and Quot.sound. A +2/-1 substitution puts the paper’s Corollary 4 into dirichletRealZeroBound_proof. Comparator accepts the result with both kernels at openai/math fd4aeeb under a deny list of all 45 socket address families, and that theorem’s closure no longer contains the three named OpenAI lemmas. Our replay of the corpus agrees with an independent replay on all 402 configurations where both have a verdict.

Primarily AI-generated textHuman understanding: some parts
Nov 10, 202620 pages
PDFView work

math.DS — Dynamical Systems

Normal Cone Is All You Need: Unsoftened Symplectic Integration Of The Newtonian N-Body Problem Across Collisions In Finite Steps

Contributed by Jeremy Nusa

In the classical formulation of the Newtonian NN-body problem, symplectic geometry and collision singularities appear fundamentally irreconcilable: fixed-step symplectic integrators preserve the Poincaré integral invariants on smooth orbits only by softening the gravitational potential or breaking down at close encounters, whereas classical Sundman and Levi-Civita regularizations resolve collisions only by deforming the global time flow or altering the canonical phase-space structure. In this work, we show that this dichotomy is not an intrinsic obstruction of Hamiltonian mechanics, but an artifact of working on the unblown Cartesian configuration space. By lifting the dynamics to the standard cotangent bundle T∗Q[N]T^*\mathbf{Q}[N] of the real oriented Fulton–MacPherson compactification Q[N]=Bl⁡Π(N)(M/R3)\mathbf{Q}[N] = \operatorname{Bl}_{\Pi(N)}(M/\mathbb{R}^3) and applying the Calaque–Safronov shifted cotangent deformation to the normal cone DZQ[N]→A1\mathcal{D}_Z \mathbf{Q}[N] \to \mathbb{A}^1, we construct an exact, unsoftened (ε=0\varepsilon = 0) Hamiltonian splitting covered by the combinatorial atlas of (2N−3)!!(2N-3)!! rooted binary Jacobi trees. Along the normal-cone degeneration, the interaction decomposes canonically into commuting Kepler–Sundman leaf flows, synchronous anti-Zeno supernodes, and a scale-invariant quadrupolar-screened apex potential of global C1,1\mathcal{C}^{1,1} regularity. Endowing the exceptional collision divisors with McGehee's unitary elastic bounce involution (BC2=Id\mathcal{B}_C^2 = \mathrm{Id}) renders the leaf flows globally complete and time-reversible across binary collisions in a finite number of physical steps, thereby lifting the Sheng–Suzuki negative-timestep barrier for high-order symmetric compositions. In the bi-graded Poisson–Lie algebra Ln,m\mathcal{L}_{n,m} associated with this splitting, we establish a Universal Double Obstruction Theorem at order six: momentum-parity alternation prevents any pure configuration-space corrector from cancelling the leading secular error, while a non-vanishing Hall cohomology class in H1(DA,L5,2)H^1(D_A, \mathcal{L}_{5,2}) creates an incompressible O(ε2h4)\mathcal{O}(\varepsilon^2 h^4) quadratic tidal floor. We overcome the parity obstruction by introducing a torque-free cotangent corrector K4∈L4,1∩P1K_4 \in \mathcal{L}_{4,1} \cap \mathcal{P}_1, realized via a palindromic Lie conjugator Z4BM4(h)\mathcal{Z}_4^{\mathrm{BM4}}(h) that vanishes naturally as O(r7/2)\mathcal{O}(r^{7/2}) at collisions (scheme PBM4\mathrm{PBM}_4). Whenever the trajectory changes local Jacobi chart or dyadic step-size level, a non-commutative covariant gauge connection TA→B(PBM4)T_{A\to B}^{(\mathrm{PBM4})} closes the Čech 1-cocycle on the atlas groupoid and eliminates interfacial shadow-energy jumps. Accompanied by a complete, axiom-free Lean 4 formalization and validated up to 116-bit quadruple precision against the REBOUND integrator suite (IAS15, TRACE, MERCURIUS, and WHFast), the resulting architecture preserves all Galilean Lie–Bargmann invariants to machine precision across secular, collisional, and chaotic multi-body regimes.

A mix of human-written and AI-generated textHuman understanding: some partsFulton-MacPherson compactificationHall Lie algebraLie-Bargmann algebraN-body problemcelestial mechanicscollision regularizationdeformation to the normal conesymplectic correctorssymplectic integration
Nov 06, 2026195 pages
PDFView work

math.CV — Complex Variables

Sheil-Small's (1974) covering problem has a positive answer

Contributed by Dave Goel

T. Sheil-Small asked whether every self-inversive polynomial maps the unit disc onto a domain that contains a disc whose radius is the largest modulus of the polynomial's coefficients (Problem 4.24 in Hayman and Lingham's problem book). We show that the answer is yes. More generally, every non-constant polynomial whose coefficients have the same moduli when read in reverse order maps the unit disc onto a domain that contains an open disc of this radius. This class contains the self-inversive polynomials and the polynomials whose zeros, with multiplicity, are symmetric under taking reciprocals (the problem's printed definition of self-inversive). The radius cannot be increased. For a polynomial with all its zeros on the unit circle, the largest disc in the image has radius exactly half the maximum modulus on the circle. For these polynomials the question is therefore equivalent to the known bound: every coefficient has modulus at most half this maximum (O'Hara-Rodriguez, Saff-Sheil-Small, Kristiansen). The new case is that of polynomials with zeros off the unit circle. We treat this case with the Schur-Cohn Hermitian form and that bound. The main theorem is also proved in the Lean 4 proof assistant, with that bound taken as given.

Author comments: An expanded version of this paper, with further results, is posted on Zenodo: https://doi.org/10.5281/zenodo.23908408

A mix of human-written and AI-generated textHuman understanding: some partsSchur-Cohn formcoveringde Bruijn's theoremself-inversive polynomial
Nov 06, 20269 pages
PDFView work

math.NT — Number Theory

Exact Intervals and Arithmetic Structure in Fuchs' Extremal Problem

Contributed by Zhenyu Sun

We determine Fuchs' weighted unit-circle extremum for monic integer polynomials for 0<λ≤30<\lambda\le3. The proof combines a fractional difference energy with a sharp rearrangement inequality and an explicit gap for nonnegative integer sequences that are not interval indicators. We obtain the finite-degree minimum on (1,2)(1,2) at every degree and on (2,3)(2,3) at every degree at least five. Every minimizing sequence on these intervals eventually consists, up to monomial factors, of Dirichlet polynomials and products of two adjacent Dirichlet polynomials, respectively. At integer parameters, Parseval's identity reduces the problem to integer coefficient norms. The lower bound is attained exactly when a multiplicity-free ideal Prouhet--Tarry--Escott pair exists. Classical PTE constructions give exact values for the integers 11 through 1010 and for 1212, and a two-value alternative at 1111. Subset counting gives a quadratic upper bound in general. The interval formulas and explicit constructions show that 22, 33 and 44 are strict local maxima; the formula on (2,3)(2,3) has a unique minimum. A Pell construction gives an upper bound on (4,5)(4,5), and coefficient-norm gaps exclude Dirichlet products uniformly near certain integers. For each fixed degree bound, the extremum, divided by a common gamma factor, is locally the lower envelope of finitely many rational functions. Exact lattice enumeration identifies a nonproduct minimizer on an open interval containing 17/417/4 for every degree bound from 6161 to 8080.

Author comments: 24 pages. Includes exact-arithmetic programs and data.

A mix of human-written and AI-generated textHuman understanding: some partsFuchs extremal problemProuhet-Tarry-Escott problemexact lattice enumerationfractional energyinteger polynomials
Nov 05, 202624 pages
PDFView work

math.OA — Operator Algebras

Noncommutative von Neumann-Riesz and von Neumann-Riesz-Lorch Mean Ergodic Theorems

Contributed by K. MAHESH KRISHNA

We derive noncommutative von Neumann-Riesz and von Neumann-Riesz-Lorch mean ergodic theorems for adjointable contractions on a Hilbert C*-module. We crucially use a result obtained by Paschke [\textit{Trans. Amer. Math. Soc., 1973}]. We also note that the exact version of the noncommutative von Neumann–Riesz mean ergodic theorem fails.

Primarily human-written textHuman understanding: all partsHilbert C*-module.Mean Ergodic Theorem
Nov 05, 20267 pages
PDFView work

math.CA — Classical Analysis and ODEs

A sharp Brégman–Minc bound for permanents

Contributed by Suvrit Sra

We prove a sharp Brégman–Minc bound for permanents of nonnegative matrices that was conjectured by Samorodnitsky and Gurvits. Specifically, for ϕ(x)=Γ(1+1/x)−x\phi(x)=\Gamma(1+1/x)^{-x}, with ϕ(0)=0\phi(0)=0, applied entrywise, we show that every nonnegative row-stochastic square matrix AA satisfies per⁡ϕ[A]≤1\operatorname{per}\phi[A]\le1, which is the Brégman–Minc inequality when each row of AA is uniform on its support. The crux of our proof is a scalar inequality on the simplex, which we prove using a carefully chosen yet elementary integral representation. We note brief applications to the entropy of a random permutation and to sharp bounds for rectangular permanents and matchings.

A mix of human-written and AI-generated textHuman understanding: all partsBrégman-Minc inequalityGamma functionOrlicz normentropy boundperfect matchingspermanent
Nov 02, 202612 pages
PDFView work

math.CO — Combinatorics

On majorization inequalities for normalized Jack and Macdonald polynomials

Contributed by Suvrit Sra

We study the inequality Pλ(x;q,t)/Pλ(1n;q,t)≥Pμ(x;q,t)/Pμ(1n;q,t)P_\lambda(x;q,t)/P_\lambda(1^n;q,t)\geq P_\mu(x;q,t)/P_\mu(1^n;q,t) for all x∈R>0nx\in\mathbb{R}_{>0}^n whenever the partition λ\lambda majorizes μ\mu; Sra suggested it in 2015, and Chen, Khare and Sahi stated it as a conjecture in 2025. We prove the Jack case for every nn from Sun's positive Gelfand–Tsetlin integral and the Dixon–Anderson recursion. For Macdonald polynomials we prove the case n=2n=2, the covers (d)⪰(d−1,1)(d)\succeq(d-1,1) for every nn when t≤qt\leq q, and, by exact certificates, the case n=3n=3 with ∣λ∣≤8|\lambda|\leq 8. The HCIZ mechanism behind the Jack proof has no direct finite-qq analogue: at two explicit pairs (q,t)(q,t), no positive representation of the normalized ratio has a kernel multiplicative in λ\lambda, and normalizing at the principal specialization tδt^\delta instead fails the inequality.

A mix of human-written and AI-generated textHuman understanding: all partsDixon-Anderson integralHarish-Chandra-Itzykson-Zuber integralHeckman-Opdam hypergeometric functionJack polynomialsMacdonald polynomialsmajorization
Nov 02, 202620 pages
PDFView work

math.CA — Classical Analysis and ODEs

Sharp order-four sign regularity of a Jacobi theta kernel

Contributed by Suvrit Sra

We prove that the Hankel kernel Φ(x+y)\Phi(\sqrt{x+y}), where Φ\Phi is the Jacobi theta kernel whose cosine transform is the Riemann Ξ\Xi-function, is strictly reverse-regular through order four. The order is sharp: an interval enclosure of the fifth Hankel–Wronskian at t=10−2t=10^{-2} shows failure at order five. The third-order condition is Csordas's conjecture that s′2−ss′′s'^2-ss'' is strictly log-concave for s(t)=Φ(t)s(t)=\Phi(\sqrt t). The proof reduces the kernel minors to Wronskian signs and establishes the signs by exact polynomial estimates for t≥1t\ge1 and interval arithmetic on [0,1][0,1]. The fourth-order sign also yields three positive iterates of s↦s′2−ss′′s\mapsto s'^2-ss'', the triple Turán inequalities for the normalized Taylor coefficients of Ξ\Xi, and quartic integral inequalities for Ξ\Xi.

A mix of human-written and AI-generated textHuman understanding: some partsCsordas-VargaJacobi theta functionRiemann Xisign regularitytotal positivity
Nov 02, 202611 pages
PDFView work

math.CA — Classical Analysis and ODEs

Monotonicity of Turán-ratios of symmetric polynomials

Contributed by Suvrit Sra

We study the Turán-ratio Sλ,i(x)2/(Sλ,i−1(x)Sλ,i+1(x))S_{\lambda,i}(x)^2/(S_{\lambda,i-1}(x)S_{\lambda,i+1}(x)), where Sλ,i(x):=sλ(1[n−i],x[i])S_{\lambda,i}(x):=s_\lambda(1^{[n-i]},x^{[i]}), and sλs_\lambda is the Schur polynomial in nn variables (indexed by partition λ\lambda) with ii arguments equal to xx and n−in-i of them equal to 11. Specifically, we prove that this Turán-ratio is strictly increasing for x>1x>1 and 1≤i<n1\le i<n (unless all nn padded parts of λ\lambda are equal, then it is identically one). For one-row shapes, our result answers a question of Ait-Haddou about complete homogeneous symmetric polynomials. For this case, we also offer a second proof through the zeros of Meixner polynomials that gives an explicit positive formula for the logarithmic derivative. We conclude with a Turán-ratio conjecture for Macdonald polynomials.

A mix of human-written and AI-generated textHuman understanding: all partsMeixner polynomialsSchur polynomialTuran ratiohomogeneous symmetric polynomialmonotonicity
Nov 02, 202610 pages
PDFView work

math.MG — Metric Geometry

Analytic symmetric floating bodies

Contributed by Liam Price, Tom de Groot

In every dimension d≥3d\ge3, we construct nonspherical, origin-symmetric, strictly convex bodies of revolution with real-analytic boundary that float in equilibrium in every orientation. Their densities tend to the unit-ball cap fraction at height (d+4)−1/2(d+4)^{-1/2}, where we prove that a degree-four spherical resonance is isolated. More generally, our construction applies at isolated even-degree resonances whose waterline angle is an irrational multiple of π\pi. Varying the density gives formal deformations. To obtain actual bodies, we use a finite-order diagonal reduction to establish inverse estimates away from small divisors. Newton iteration then corrects fixed-order truncations on closed parameter sets of asymptotically full measure.

A mix of human-written and AI-generated textHuman understanding: some partsUlam's floating body problembodies of revolutioncentral symmetryconvex geometryfloating bodiessmall divisors
Oct 29, 202611 pages
PDFView work

math.CA — Classical Analysis and ODEs

A Proof of McLeod's 1959 Conjecture on Complete Homogeneous Symmetric Ratios

Contributed by Suvrit Sra

We prove McLeod's (1959) conjecture that (hℓ+r/hℓ)1/r(h_{\ell+r}/h_\ell)^{1/r} is subadditive for all ℓ≥0\ell\ge0 and r≥1r\ge1, where hkh_k is the complete homogeneous symmetric polynomial of degree kk (J. B. McLeod, "On four inequalities in symmetric functions", Proc. Edinburgh Math. Soc., 1959). We first prove that the ratio hk/hk−1h_k/h_{k-1} is convex, and our proof takes an unexpected detour through queuing theory. The geometric mean of rr consecutive such ratios equals McLeod's conjectured function, but geometric means of convex functions need not be convex. Our second and decisive step is a tensorization trick that couples neighboring ratios tightly enough to make their geometric mean convex.

A mix of human-written and AI-generated textHuman understanding: all partsMcLeod inequalityclosed queuing networkcomplete homogeneous symmetric polynomialconvexitydiscrete Poincare inequality
Oct 29, 202611 pages
PDFView work

math.MP — Mathematical Physics

Stability and Convergence of a Regularized Immersed Boundary Method under Dynamic Cartesian Refinement. Part III: Fluid-Driven Rigid-Body Motion

Contributed by Sida He

We study a conforming regularized immersed boundary discretization of the two-dimensional Eulerian Stokes–Newton system for one freely moving rigid body. Regularized interior moments complete the surface constraints used for prescribed motion. Positive excess mass and inertia define a fixed fluid–body kinetic inner product. A skew inertial correction is derived from the fictitious rigid interior; it has zero power but is necessary for the physical translational momentum equation. The method advances the body configuration with the preceding computed rigid velocity and then solves a linear joint fluid–body step on a dynamically enriched Cartesian space. Exact orthogonal transfer gives an energy identity independent of the number of mesh changes. Interior and surface moment defects control the discrepancy between the discrete background energy and physical kinetic energy. A volume-preserving geometry comparison and a moving coarse recovery family yield conditional joint convergence of the fluid velocity, rigid velocity, and body configuration on an interval with positive wall clearance. The error bound distinguishes the energy norm after geometry alignment from the generally weaker estimate at the same Eulerian points. The analysis assumes exact integration and explicit strong-solution regularity; it does not cover arbitrary density ratios or collisions. Manufactured coupled computations, independent residual checks, and a Lean algebraic companion document the numerical and formal verification scope.

Primarily AI-generated textHuman understanding: no parts
Oct 29, 202631 pages
PDFView work

math.CA — Classical Analysis and ODEs

On some positivity properties of the Riemann Ξ\Xi function

Contributed by Suvrit Sra

We prove strict log-concavity of the positive functions Θ\Theta and Λ\Lambda with one-sided and bilateral Laplace transforms 1/ξ(12+s)1/\xi(\tfrac12+\sqrt s) and 1/Ξ1/\Xi, respectively, where Ξ(z)=ξ(12+iz)\Xi(z)=\xi(\tfrac12+iz). For either function, log-concavity is the Pólya frequency property of order two (PF2_2). Without assuming RH, but using known zero verification through height 3⋅10123\cdot10^{12}, we further prove that Λ\Lambda is a PF function of order ten (PF10_{10}). We also prove local PF positivity for Θ\Theta: for each fixed order, the ordered minors of Θ(x−y)\Theta(x-y) are positive when all differences xi−yjx_i-y_j are sufficiently small and positive. Additionally, we prove the generalized Laguerre inequalities: if RH holds up to height T>1/2T>1/2, then Ln[Ξ](x)≥0L_n[\Xi](x)\ge0 for every n≥0n\ge0 and ∣x∣≤T−1/2|x|\le T-1/2; the case n=1n=1 is due to Csordas, Ruttan and Varga (1991).

A mix of human-written and AI-generated textHuman understanding: all partsPolya frequencyRiemann Xicomplete monotonicitygeneralized Laguerrelog-concavity
Oct 27, 202625 pages
PDFView work

math.PR — Probability

Explicit onsets, rates and the tail of the collision constant for heat-evolved Weyl polynomials

Contributed by Bingo Baggins

Let hkh_k be the orthonormal Hermite polynomials for the standard Gaussian weight, and let a(w)=∑j≥0ajwja(w)=\sum_{j\ge0}a_jw^j be a real power series with radius of convergence greater than 11, a(0)≠0a(0)\ne0, no zeros on the unit circle and only simple zeros in the unit disk. For all large nn the polynomial ∑j=0najhn−j\sum_{j=0}^{n}a_jh_{n-j} has exactly as many nonreal zeros as aa has in the disk, but the known proof gives the onset by compactness. We make it explicit: if aa has no zeros in {1−d≤∣w∣≤1}\{1-d\le|w|\le1\}, with dd below an explicit threshold, the count is exact as soon as nn exceeds a polynomial in 1/d1/d and in the inverses of ∣a(0)∣|a(0)|, min⁡∣w∣=1∣a∣\min_{|w|=1}|a|, min⁡∣w∣=1−d∣a∣\min_{|w|=1-d}|a| and min⁡[−1+d,1−d]max⁡(∣a∣,∣a′∣)\min_{[-1+d,1-d]}\max(|a|,|a'|); no separation of the nonreal zeros of aa is needed. By an exact identity this applies to the random Weyl polynomials GnG_n with independent standard Gaussian coefficients under the backward heat flow Gn,t=exp⁡(−t2n∂z2)GnG_{n,t}=\exp(-\frac t{2n}\partial_z^2)G_n, whose real-rooting time converges in distribution to T∗=R∗−2T_*=R_*^{-2}, where R∗R_* is the smallest modulus of a nonreal zero of the Gaussian power series q(w)=∑jηjwjq(w)=\sum_j\eta_jw^j. We show that the convergence holds with the rate n−αn^{-\alpha} on [1+ε,∞)[1+\varepsilon,\infty) for every α<350\alpha<\frac3{50}, an exponent that does not depend on ε\varepsilon; the dependence on ε\varepsilon is removed by a super-exponential tail for the number of zeros of qq in a disk. Under a coupling of the degrees that shares the top coefficients, the real-rooting time Λn\Lambda_n satisfies ∣Λn−T∗∣≤K/n|\Lambda_n-T_*|\le K/n for n≥n0n\ge n_0, with KK and n0n_0 depending on qq. We bound KK and n0n_0 by polynomials in condition parameters of qq, with absolute degrees and, when T∗≥1+εT_*\ge1+\varepsilon, coefficients polynomial in 1/ε1/\varepsilon. For the Gaussian power series this gives, on the event {T∗≥1+ε}\{T_*\ge1+\varepsilon\}, a power tail with exponent 1/9001/900 for the largest scaled displacement DD of the final collision of zeros, and without restriction the tail bound exp⁡(−c(log⁡x/log⁡log⁡x)1/2)\exp(-c(\log x/\log\log x)^{1/2}); the inputs include closed forms of the two-point correlation functions of the zeros of qq.

Primarily AI-generated textHuman understanding: no partsHermite polynomialsWeyl polynomialscollision of zeroscorrelation functions of zerosexplicit onsetheat flowlinear combinations of orthogonal polynomialsnonreal zerosrandom power seriesrate of convergence
Oct 23, 202625 pages
PDFView work

math.PR — Probability

The Real-Rooting Time Of Heat-Evolved Random Polynomials

Contributed by Bingo Baggins

Let Gn,t=exp⁡(−t2n∂z2)GnG_{n,t}=\exp(-\frac{t}{2n}\partial_z^2)G_n be a random Weyl polynomial of degree nn under the backward heat flow, with independent coefficients of a law that is not a point mass and has finite variance. Hall, Ho, Jalowy and Kabluchko showed that the empirical zero distribution collapses onto the real line at t=1t=1. We show that the first time at which all zeros of Gn,tG_{n,t} are real, a finite-degree analogue of the de Bruijn--Newman constant, converges in distribution to T∗=R∗−2T_*=R_*^{-2}, where R∗R_* is the smallest modulus of a nonreal zero of the random power series ∑jηjwj\sum_j\eta_jw^j with coefficients of the same law; the convergence is almost sure under a coupling of the degrees that shares the top coefficients, whereas under the standard coupling the set of limit points of the real-rooting time is almost surely [1,∞][1,\infty]. The proof rests on an exact count of the nonreal zeros of analytic combinations ∑j≤najhn−j\sum_{j\le n}a_jh_{n-j} of orthonormal Hermite polynomials: if the real power series aa has radius of convergence greater than 11, no zeros on the unit circle and simple zeros in the unit disk, then for all large nn the combination has exactly as many nonreal zeros as aa has in the disk. Its method expresses the polynomial and its derivative in the bulk through a 2×22\times2 matrix applied to (hn,hn−1)(h_n,h_{n-1}), built from only O(log⁡n)O(\log n) steps of the backward three-term recurrence, with the remaining terms controlled by a Christoffel--Darboux bound. For Gaussian coefficients the law of T∗T_* is a Fredholm determinant, P(T∗>t)∼43πt−3/2\mathbb{P}(T_*>t)\sim\frac4{3\pi}t^{-3/2} as t→∞t\to\infty, and (t−1)log⁡P(T∗≤t)→−π2/12(t-1)\log\mathbb{P}(T_*\le t)\to-\pi^2/12 as t↓1t\downarrow1, half of the constant for complex coefficients. At the scale 1/n1/n the last pair of nonreal zeros collides inside the real bulk, at relative position cos⁡θ∗\cos\theta_*, where R∗e±iθ∗R_*e^{\pm i\theta_*} are the nonreal zeros of minimal modulus, and the real-rooting time is within O(1/n)O(1/n) of T∗T_*. In a window of size 1/n1/n the polynomial is, up to a positive factor and O(1/n)O(1/n), the model ζcos⁡(ζ+c)+λsin⁡(ζ+c)\zeta\cos(\zeta+c)+\lambda\sin(\zeta+c), whose threshold for real-rootedness is given by Kepler's equation; the phase cc rotates with nn, so n(Λn−T∗)n(\Lambda_n-T_*) oscillates over an explicit interval and has an explicit limit law jointly with T∗T_*.

Primarily AI-generated textHuman understanding: no partsFredholm determinantsHermite polynomialsPfaffian point processesWeyl polynomialscollision of zerosde Bruijn-Newman constantheat flowlinear combinations of orthogonal polynomialsrandom power seriesreal zeros
Oct 22, 202667 pages
PDFView work

math.CA — Classical Analysis and ODEs

Image Reconstruction from Projections using Fourier Slice Theorem

Contributed by Rajesh Dachiraju

We study the problem of image reconstruction from projection data by combining the Fourier Slice Theorem with scattered-data approximation in the Fourier domain. The unknown image is assumed to belong to the space of functions of bounded variation (BV), allowing discontinuities that naturally arise in practical tomography. In contrast to conventional band-limited formulations, no assumption is imposed that the image itself is band-limited. Instead, the finite bandwidth is attributed to the image acquisition system through the detector response, finite sampling resolution, and associated measurement process. Consequently, the measured Radon projections contain only a finite range of spatial frequencies, and the reconstruction objective is the recovery of the instrument-limited image determined by the measurable Fourier bandwidth. To exploit the structure of the Fourier Slice Theorem, we introduce a symmetric embedding of the image on the torus together with the corresponding symmetrization of the Radon data. The resulting Fourier transform becomes real-valued and even, allowing the Fourier-transformed projection data to be interpreted as real-valued scattered samples of the two-dimensional Fourier transform on a fixed bounded frequency domain. This reformulates image reconstruction as a scattered-data interpolation problem in the Fourier domain. The interpolation problem is analyzed using the recently developed approximation theory for multivariate BV functions from scattered data. The resulting convergence error is expressed in terms of the total reconstruction error separating into an instrument error, determined solely by the finite bandwidth of the acquisition system, and a reconstruction error arising from interpolation of the measured Fourier data. The proposed framework provides a mathematically rigorous and physically realistic formulation of Fourier-slice tomography in which the limitations of the imaging hardware are distinguished from the accuracy of the reconstruction algorithm. Numerical experiments demonstrate the applicability of the method to image reconstruction from limited projection data and validate the predicted convergence behaviour.

Primarily human-written textHuman understanding: all parts
Oct 20, 202615 pages
PDFView work

math.NT — Number Theory

The Pólya–Vinogradov inequality with log log q for every character

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

Let χ\chi be a primitive Dirichlet character modulo q≥3q\ge3 and let M(χ)M(\chi) be the largest modulus of a partial sum ∑n≤xχ(n)\sum_{n\le x}\chi(n). The P\'olya--Vinogradov inequality bounds M(χ)M(\chi) by a constant times qlog⁡q\sqrt q\log q. Paley showed that qlog⁡log⁡q\sqrt q\log\log q is the most that can be hoped for, and Montgomery and Vaughan proved that this is the truth if the generalised Riemann hypothesis holds. Without any hypothesis we prove that M(χ)≤Cqlog⁡log⁡qM(\chi)\le C\sqrt q\log\log q for every primitive character χ\chi to every modulus q≥3q\ge3, with an absolute constant CC, and that ∣L′/L(1,χ)∣≤Clog⁡log⁡q|L'/L(1,\chi)|\le C\log\log q for every nonprincipal character. We also prove, from the elementary bounds of Chebyshev alone, that for every ε>0\varepsilon>0 there is a constant CεC_\varepsilon such that at most qεq^{\varepsilon} of the primitive characters modulo qq have M(χ)>Cεqlog⁡log⁡qM(\chi)>C_\varepsilon\sqrt q\log\log q, and at most qεq^{\varepsilon} of the nonprincipal characters have ∣L′/L(1,χ)∣>Cεlog⁡log⁡q|L'/L(1,\chi)|>C_\varepsilon\log\log q. The proof has two parts. The first is a transfer theorem for a single character: if θ<1\theta<1 is fixed and the LL-functions of the twists χψ\chi\psi of χ\chi by the characters ψ\psi of the moduli up to (log⁡q)16(\log q)^{16} have no zero in the rectangle ℜs>θ\Re s>\theta, ∣ℑs∣≤5q2|\Im s|\le5q^2, then M(χ)≤Cθqlog⁡log⁡qM(\chi)\le C_\theta\sqrt q\log\log q. It is proved by a contour shift for Riesz means of prime sums, a dissection of the circle into major and minor arcs, and a weak form of the Montgomery--Vaughan bound for exponential sums with multiplicative coefficients, which we prove with Selberg's sieve as the only arithmetic input. The second part counts the characters that fail the hypothesis of the transfer theorem by a zero-density theorem in the manner of Ingham and Montgomery, which bounds the number of zeros of all LL-functions to a modulus in such a rectangle by a power of the modulus that tends to zero as θ\theta tends to one. The same transfer theorem shows that a zero-free half-plane ℜs>θ\Re s>\theta for all Dirichlet LL-functions gives the bound for every character, and such a half-plane exists: OpenAI has proved that every Dirichlet LL-function, and every finite-order Hecke LL-function over Q(−3)\mathbb Q(\sqrt{-3}), has no zero with ℜs>11/12\Re s>11/12, by a mean square of twisted M\"obius sums over the Eisenstein integers, two Poisson summations, the transformation of Kubota's cubic theta function and the quadratic large sieve. Their proof is reproduced in full in a second appendix, with credit to them, so that the paper is complete in itself: the zero-density theorem is proved in the first appendix with explicit constants, and every statement of the paper is proved in the text.

A mix of human-written and AI-generated textHuman understanding: some partsEuler--Kronecker constantsP\'olya--Vinogradov inequalitySelberg sievecharacter sumszero-free regions
Oct 16, 202651 pages
PDFView work

math.FA — Functional Analysis

Sequential Games

Contributed by Rajesh Dachiraju

We formulate sequential games in which players take a sequence of decisions in each turn, and players may randomize over HMMs. Payoffs are assumed to be BV for these games. We prove an existence theorem for the Nash equilibrium.

A mix of human-written and AI-generated textHuman understanding: some parts
Oct 15, 202610 pages
PDFView work

math.CA — Classical Analysis and ODEs

Arithmetic progressions with prescribed lp gaps

Contributed by Vjekoslav Kovač

For every n≥3n\ge3 and p∈[1,∞)∖{1,2,…,n−1}p\in[1,\infty)\setminus\{1,2,\ldots,n-1\}, we prove that every measurable subset of Rd\mathbf{R}^d of positive upper Banach density, with d≥2n−2+1d\ge2^{n-2}+1, contains an nn-term arithmetic progression with every sufficiently large prescribed ℓp\ell^p gap.

Primarily AI-generated textHuman understanding: some partsEuclidean Ramsey theorydensity theoremmultilinear estimateoscillatory integralsingular integral
Oct 10, 202623 pages
PDFView work

math.CA — Classical Analysis and ODEs

Superexponentially decaying sequences in the Erdos similarity problem

Contributed by Vjekoslav Kovač

We prove a non-universality criterion for the Erd\H{o}s similarity conjecture that applies beyond exponential (i.e., geometric) decay. In particular, it covers decreasing positive null sequences satisfying log⁡(1/an)=o(nlog⁡log⁡n)\log(1/a_n)=o(n\log\log n) and log⁡(an/an+1)≥e−nα\log(a_n/a_{n+1})\ge e^{-n^\alpha} eventually for some 0<α<10<\alpha<1.

Primarily AI-generated textHuman understanding: some partsLebesgue measureconfigurationmeasure theory
Oct 10, 20268 pages
PDFView work

math.AP — Analysis of PDEs

Phase retrieval for stationary Schrödinger evolutions

Contributed by Ben Pineau, João Pedro Ramos, Mitchell A. Taylor

We prove three phase-retrieval results for stationary one-dimensional Schr\"odinger evolutions. Masuda's unique-continuation theorem yields phase retrieval for finite-energy solutions and a broad class of semibounded potentials which may grow at infinity. For real potentials in the Faddeev class L11(R)L^1_1(\mathbb R), measurements on all of spacetime determine arbitrary L2L^2 initial data. If the potential is smooth and compactly supported to the left of a point, measurements on the exterior half-line to its right suffice.

Primarily AI-generated textHuman understanding: all partsPhase retrievalSchrödinger equationUnique continuation
Oct 07, 202628 pages
PDFView work

math.NT — Number Theory

Hilbert-type inequality with primes

Contributed by Kannan Soundararajan

This note answers a problem posed in Montgomery's CBMS book. The proof was found by ChatGPT 6, and written up by the author.

Primarily human-written textHuman understanding: all partsCollar-Stein LemmaHilbert's inequalitySieves
Sep 28, 20266 pages
PDFView work