Browse

All works

Browse the Hexagon catalog.

Newest works

1375 works

math.CO — Combinatorics

Monotone classes of bounded game chromatic number have bounded arboricity

Contributed by Peter Graham

In the coloring game on a finite graph, Alice and Bob alternately color uncolored vertices with one of kk colors so that adjacent vertices get different colors. Alice moves first and wins if every vertex gets colored; Bob wins if some uncolored vertex sees all kk colors among its neighbors. The game chromatic number of a graph is the least kk for which Alice can force a win. We prove that for every KK there is dd such that every graph of average degree at least dd has a subgraph on which Bob wins the kk-color game for every k≤Kk\le K. Consequently, if a class of graphs is closed under taking subgraphs and its game chromatic numbers are bounded, then the edges of each of its graphs can be partitioned into a bounded number of forests, that is, the class has bounded arboricity. This answers Zhu's Question 3 (1999) in the affirmative. The proof combines the theorem of Kühn and Osthus that every graph of large enough average degree contains a subgraph of large average degree with no 4-cycle, with a strategy for Bob that adapts the weighting argument behind Beck's criterion for positional games: Bob uses weights to keep some uncolored vertex that can still be blocked from every color. The rest of the proof is checked in Lean, with the theorem of Kühn and Osthus as an explicit hypothesis. This work has not yet been reviewed by experts. The proofs, the Lean formalization and the text were produced by AI models, working under the author's direction.

Author comments: Zenodo archive: https://doi.org/10.5281/zenodo.24376623. The paper text is deposited under CC BY 4.0; the Lean code stays Apache-2.0 in its published repository. Lean 4 development, in its folder lean: https://github.com/6/clank-lab/tree/game-chromatic-arboricity-v1/results/game-chromatic-arboricity

Primarily AI-generated textHuman understanding: some partsarboricitygame chromatic numbergraph coloring gamemonotone graph class
Nov 21, 202610 pages
PDFView work

math.CO — Combinatorics

The Turán density of the tight five-cycle

Contributed by Peter Graham

The tight five-cycle is the three-uniform hypergraph whose edges are the five cyclically consecutive triples on five distinct vertices. We prove that its Turán density is 23−32\sqrt3-3. This answers the conjecture usually attributed to Mubayi and Rödl, explicitly stated by Mubayi, Pikhurko and Sudakov. Mubayi and Rödl's recursive construction gives the lower bound. The upper bound follows the reduction of Bodnár, León, Liu and Pikhurko, whose theorem concerns forbidding both the tight four-cycle and the tight five-cycle, or a tight cycle of length at least seven not divisible by three. We establish the two estimates needed for the five-cycle alone by exact rational certificates, using weighted link inequalities to include configurations containing a complete four-vertex hypergraph. We give the finite counting argument that turns the certificates into these estimates and then into the density bound. The whole proof, including this counting argument, is checked in Lean; its finite computations run as compiled code, so the check trusts Lean's compiler as well as its kernel. This work has not yet been reviewed by experts. The proofs, the Lean formalization and the text were produced by AI models, working under the author's direction.

Author comments: Zenodo archive: https://doi.org/10.5281/zenodo.23743819. The Lean 4 development (folder lean) and the certificate checkers (folder checks) are in the Zenodo archive. Compiled checks the proof relies on: the Lean theorem TightCycleC5.Bridge.mubayi_rodl_checked states, from the definitions, that ex(n, C5)/binom(n,3) tends to 2*sqrt(3)-3 for the tight five-cycle C5. Besides the standard axioms propext, Classical.choice and Quot.sound, it depends on exactly 692 named native_decide facts, evaluated by compiled code, so the check trusts Lean's compiler and runtime as well as its kernel. These facts check finite arithmetic (53 groups of uncolored and 634 colored arithmetic checks), one multiplier quotation identity, two sparse coefficient comparisons and two rational Gram identities; the class covers, arithmetic-range coverage and the other positive-semidefinite matrices (six uncolored, 36 colored) have kernel proofs. Separately, exact-integer Python and C++ checkers (checks/p32 and checks/p33, run by checks/quickcheck.py) re-check the rational certificates behind the paper's two partition estimates, including positivity and class coverage, and reject planted corruptions. checks/FORMALIZATION.md states the trust boundary. License: the paper text is deposited here under CC BY 4.0; the published code, Lean development and data stay under Apache-2.0 in their repository and Zenodo records.

Primarily AI-generated textHuman understanding: some partsLeanTurán densityflag algebrashypergraphtight cycle
Nov 21, 20269 pages
PDFView work

math.AP — Analysis of PDEs

Density of blow-up data and regularity at the blow-up time for the three-dimensional Euler equations

Contributed by Manvir Jaswal

Alpöge, Buckmaster and Coiculescu have constructed smooth odd initial data on T3\mathbb T^3 whose solutions of the incompressible Euler equations blow up in finite time. Running their construction without oddness, with the singularity carried by a fluid particle, we show that data whose solutions blow up in arbitrarily short time are dense among smooth divergence-free fields in L∞L^\infty, H1H^1 and CαC^\alpha, 0<α<5/60<\alpha<5/6. The same holds inside classes of fields invariant under a finite group of isometries of T3\mathbb T^3, such as the Taylor–Green and Kida classes, with blow-up at the same time along a whole orbit. The Euler equations are not well posed in these topologies, and the result says nothing about instability in C1,αC^{1,\alpha} or in HsH^s, s>5/2s>5/2. For both our solutions and those of Alpöge, Buckmaster and Coiculescu, the velocity stays continuous up to the blow-up time TT in H1H^1 and in CαC^\alpha for every 0<α<5/60<\alpha<5/6, so the enstrophy converges, while u(T)∉C5/6u(T)\notin C^{5/6}, curl⁡u(T)\operatorname{curl}u(T) lies in no LpL^p with p>2p>2, and the vorticity on the particle grows faster than (T−t)−2(T-t)^{-2}.

Primarily AI-generated textHuman understanding: no partsHölder spacesTaylor–Green symmetryfinite-time blow-upincompressible Euler equationssingularity formation
Nov 21, 202619 pages
PDFView work

math.NT — Number Theory

Completeness of two floor-doubling sequences

Contributed by Jensen Kohlmeyer, Liam Kruer

We prove that, whenever α,β>0\alpha,\beta>0 and α/β\alpha/\beta is irrational, every sufficiently large integer is a sum of distinct indexed terms of the two sequences (⌊2nα⌋)n≥0(\lfloor 2^n\alpha\rfloor)_{n\ge0} and (⌊2nβ⌋)n≥0(\lfloor 2^n\beta\rfloor)_{n\ge0}. This answers the doubling case of Erdős problem 354 affirmatively. Missing sums induce a nonproduct invariant coupling of symbolic tower systems. Two binary carry estimates force incompatible conclusions about digit transport and zero runs. The linked Lean proof checks the original indexed-sum formulation.

Author comments: Joint base-two manuscript accompanying Justin Sun Prize submission JSP-000294. Pinned Lean sources and verification: https://github.com/JENW1N/complete-math-solutions/tree/af9feb6c310f5cea035e4ec34400c43fec01817e/proofs/erdos354

Primarily AI-generated textHuman understanding: no partsbinary carriescomplete sequencessubset sumssymbolic dynamics
Nov 21, 202613 pages
PDFView work

math.NT — Number Theory

Small maximal integer Sidon sets by finite phase colorings

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Every sufficiently large integer interval {1,…,N}\{1,\ldots,N\} contains an inclusion-maximal Sidon set of size O(N1/3)O(N^{1/3}). A quadratic seed supplies exact integer differences, and a periodically labeled family of anchors covers each relevant local window. Finite-dimensional bounds for affine sign patterns give a fixed alphabet of translates and a common periodic word. Two separated alphabets give Sidon, sum-free tags for all primes. The seed blocks every point outside two intervals of length O(p2)O(p^2) and the multiples of pp, with p≍N1/3p\asymp N^{1/3}. A maximal completion adds only O(p)O(p) elements. The linked Lean verification covers the original upper-bound target.

Author comments: TeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000154. Pinned paper, Lean bridge and audit are listed at https://github.com/TheJustinSunPrize/awards/pull/5531

Primarily AI-generated textHuman understanding: no partsadditive combinatoricsfinite phase coloringmaximal Sidon sets
Nov 21, 202610 pages
PDFView work

math.CO — Combinatorics

Subexponential bounds for distinct-distance subsets

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let fd(n)f_d(n) be the least mm such that every set of mm points in Rd\mathbb R^d contains nn points whose pairwise distances are all distinct. For every fixed n≥3n\ge3 we prove fd(n)≤2Cndlog⁡2(d+2)f_d(n)\le2^{C_n\sqrt d\log_2(d+2)}, which answers the subexponential-growth question in Erdős problem 1088. A rank–rectangle theorem gives a large rectangle on which a single row or column function describes the entries of a matrix covered by finitely many such functions. The proof uses hyperplane rounding and rank bounds. A geometric induction and successive halving of the affine dimension give the estimate. The pinned Lean source verifies the original subexponential target. The written manuscript supplies the sharper dependence on the number of types and retains its draft status.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000905. Pinned TeX, formal source, and build records are listed at https://github.com/TheJustinSunPrize/awards/pull/5557

Primarily AI-generated textHuman understanding: no partsEuclidean geometrydistinct distanceslow-rank matricesrainbow subsets
Nov 21, 202633 pages
PDFView work

math.NT — Number Theory

The three parts of Erdős Problem 12: counting functions and reciprocal sums

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We give a unified account of the three numbered questions in Erdős Problem 12 for sets in which no element divides the sum of two distinct larger elements. The positive answer to the square-root counting question and the negative answer to a universal power-saving bound are prior AlphaProof Nexus results of Google DeepMind, presented here with attribution. For the reciprocal-sum question, the new argument proves that one absolute constant bounds the reciprocal sum for every such set, finite or infinite. It combines a restriction estimate for sifted integers, congruence restrictions on prime fibres, and a predictable sum over random prime-factor prefixes. A companion Lean development checks the three original questions and the uniform reciprocal bound.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000051. Pinned original sources, contribution credits and the verification report are listed at https://github.com/TheJustinSunPrize/awards/pull/5537

Primarily AI-generated textHuman understanding: no partsdivisibilityprimitive setsreciprocal sumssifted integers
Nov 21, 202616 pages
PDFView work

math.NT — Number Theory

Infinitely many decreases in the thresholds for sums of distinct powers

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let TkT_k be the least integer such that every integer at least TkT_k is a sum of distinct positive kkth powers. We prove Tk>Tk+1T_k>T_{k+1} for infinitely many kk. An upper estimate on degrees in every sufficiently large dyadic interval follows from cyclotomic recurrences, exact reduction of rational Fourier phases, and collision estimates for subset sums modulo reserved powers. A lower estimate on infinitely many other degrees follows from the shifted-prime divisor bound of Fan and Pollack. Comparing the two estimates rules out eventual monotonicity.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000287. Pinned manuscript, formal statement and independent checker records are listed at https://github.com/TheJustinSunPrize/awards/pull/5556

Primarily AI-generated textHuman understanding: no partscyclotomic recurrencesdistinct powersfinite differencessubset sums
Nov 21, 202614 pages
PDFView work

math.CO — Combinatorics

A counterexample to Erdős problem 108 via arc graphs

Contributed by Jensen Kohlmeyer, Liam Kruer

For every positive integer MM, we construct a finite triangle-free graph GG of chromatic number at least MM in which every ordinary four-cycle-free subgraph is 6-colorable. Consequently, no chromatic threshold forces a subgraph of girth at least five and chromatic number at least seven, which gives a negative answer to Erdős problem 108. The proof uses a multipartite random graph of bounded acyclic outdegree in which every subgraph under a prescribed degree cap is 4-colorable. An arc-graph construction raises the host chromatic number while partitioning each four-cycle-free subgraph into a part controlled by the degree cap and a forest. The linked Lean verification covers the original negative answer. The written proof includes the triangle-free strengthening.

Author comments: TeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000120. Pinned original manuscript, formal source and verification records are listed at https://github.com/TheJustinSunPrize/awards/pull/4903

Primarily AI-generated textHuman understanding: no partsChromatic numberarc graphsgirth
Nov 21, 20267 pages
PDFView work

math.CO — Combinatorics

Size Ramsey numbers at high average degree

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We prove that there is a function ff with f(C)/C→∞f(C)/C\to\infty such that every finite simple graph GG of positive order with e(G)≥Cv(G)e(G)\ge C v(G) satisfies R^(G)>f(C)e(G)\widehat{R}(G)>f(C)e(G) for all sufficiently large CC. The estimate is uniform in the order, number of components, and component multiplicities of the target. The proof combines an entropy estimate for connected component types with adaptive sampling and sparse marks on intersections of host neighborhoods. Separate arguments handle targets with a narrow degree range and strongly unbalanced incidence targets. Dyadic degree reductions assemble the estimates without a loss depending on the number of degree scales.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000756. Pinned manuscript, formal source, and verification records are listed at https://github.com/TheJustinSunPrize/awards/pull/5536

Primarily AI-generated textHuman understanding: no partsLovász local lemmagraph densitysize Ramsey number
Nov 21, 202627 pages
PDFView work

math.NT — Number Theory

A uniform square-root lower bound for non-unique sums and a resolution of Erdős problem 14

Contributed by Liam Kruer, Jensen Kohlmeyer

For A⊆N0A\subseteq\mathbb{N}_0, let EA(N)E_A(N) count the positive integers at most NN without exactly one unordered representation as a sum of two elements of AA, allowing equal summands. We prove EA(N)>N/12000E_A(N)>\sqrt{N}/12000 for every integer N≥2⋅1024N\ge 2\cdot 10^{24}. Part I of Erdős problem 14 holds with exponent 1/21/2, and the existence assertion in part II is false. The common finite estimate is EA(2T4)>T2/1000−1E_A(2T^4)>T^2/1000-1 for every integer T≥106T\ge 10^6. The proof combines a triple-sum moment identity, pair counting in an arithmetic progression, and incompatible bounds for a finite generating polynomial.

Author comments: TeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000052. Pinned Lean source and verification records are listed at https://github.com/TheJustinSunPrize/awards/pull/4902

Primarily AI-generated textHuman understanding: no partsadditive representation functionsexceptional setsunique sums
Nov 21, 20268 pages
PDFView work

math.DS — Dynamical Systems

Centered Cocircular Central Configurations for Homogeneous and Logarithmic Potentials

Contributed by Chih-Yao Wu

We classify central configurations of positive masses on a circle centered at their center of mass. For every number of bodies and every potential r−αr^{-\alpha} with α>0\alpha>0, the only such configurations are equal-mass regular polygons. The same conclusion holds for the logarithmic potential. The proof first separates the equality of the masses from the angular geometry. Comparisons obtained from the force equations then reduce mass equality to inequalities for positive kernels and finite probability laws. Different exponent ranges share these comparisons, while requiring different estimates to complete the argument.

Author comments: 94 pages. Extends the Newtonian classification in hexagon:2610.00526 to every positive homogeneity exponent, with the logarithmic endpoint included. The manuscript gives a self-contained proof. Companion Lean development, with build instructions and verification scope: https://github.com/andersonwu2000/Asterism-formalizations/tree/acs12-2026-11-20/projects/acs12

Primarily AI-generated textHuman understanding: no partscelestial mechanicscentered cocircular configurationscentral configurationshomogeneous potentialslogarithmic potentialrigidity
Nov 21, 202694 pages
PDFView work

math.CV — Complex Variables

Cofinite derivative zeros at the order-one threshold

Contributed by Jensen Kohlmeyer, Liam Kruer

We give a complete probabilistic construction of a transcendental entire function for which every nonempty open set contains a zero of every sufficiently high derivative. The construction has log⁡M(r)=O(rlog⁡rlog⁡log⁡r)\log M(r)=O(r\log r\log\log r), hence order exactly one and infinite exponential type. No transcendental entire function of finite exponential type can have this zero property. We also establish a local limiting zero-counting measure for the constructed derivatives. The original existence assertion has prior solution claims, including Eric Hou's preprint. The order-one construction and growth obstruction are the proposed strengthening.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000752. Pinned source: https://github.com/JENW1N/cofinite-derivative-zeros-order-one/tree/2345abdb900662ac832aa8f5d206a3950c7b55dd

Primarily AI-generated textHuman understanding: no partsderivative zerosentire functionsorder and exponential type
Nov 21, 20268 pages
PDFView work

math.NT — Number Theory

Balanced additive complements with bounded representation functions

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We construct infinite sets A={a1<a2<⋯ }A=\{a_1<a_2<\cdots\} and B={b1<b2<⋯ }B=\{b_1<b_2<\cdots\} of positive integers such that ∣ai−bi∣≤5bi|a_i-b_i|\leq5\sqrt{b_i} for every ii, every integer at least 1638416384 belongs to A+BA+B, and the number of ordered representations of any integer as a+ba+b with a∈Aa\in A and b∈Bb\in B is at most 4700547005. In particular, ai/bi→1a_i/b_i\to1, giving a negative answer to a conjecture of Erdős and Sárközy. The construction uses two nested prime-power scales, a uniform residue bound, and a local cardinality matching.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000950. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos-1145/tree/9caddccde51364623c3c985c9fddd0b52a023e6b

Primarily AI-generated textHuman understanding: no partsadditive basesadditive complementsrepresentation functions
Nov 21, 20267 pages
PDFView work

math.CA — Classical Analysis and ODEs

An exact algebraic construction for Erdős's interpolation minimum

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

For distinct nodes in [−1,1][-1,1], consider the integral of the sum of the squares of their Lagrange cardinal polynomials. We give a finite algebraic construction of its minimum for every positive number of nodes. For n≥2n\geq2, put k=n−1k=n-1 and d=2n(n−1)d=2n(n-1). A rational symmetric polynomial matrix of order (d+1)k(d+1)^k determines a nonzero rational polynomial of degree at most kd(d+1)kkd(d+1)^k. The minimum is a specified real root of this polynomial. Its index is obtained from signatures at rational sample points. All steps of the value rule use rational polynomial arithmetic, univariate real root isolation, and rational symmetric elimination.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000938. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos-1131-exact-minimum/tree/85bd4c4dc7c99de780b7fc7e4a657d0e2b60c473

Primarily AI-generated textHuman understanding: no partsHermite matricesLagrange interpolationreal roots
Nov 21, 20269 pages
PDFView work

math.CO — Combinatorics

A counterexample to Erdős problem 1068

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We construct in ZFC a simple graph on 2ℵ02^{\aleph_0} vertices with chromatic number ℵ1\aleph_1 such that every infinite induced subgraph is disconnected by deleting finitely many vertices. Consequently, the graph contains no infinitely vertex-connected subgraph, giving a negative answer to the unrestricted formulation of Erdős problem 1068. The construction uses independent vertex sets indexed by a tree of countable sequences. Stabilization of the colors occurring above a node and a recursive choice of a vertex rule out countable colorings. Finite initial histories determine finite separators, which exclude all infinite candidates for the required connectivity.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000887. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos1068-jsp-submission/tree/77b2ad088652305b96ae794a0fa29dbecad05fdf

Primarily AI-generated textHuman understanding: no partsChromatic numberinfinite graphsvertex connectivity
Nov 21, 20265 pages
PDFView work

math.NT — Number Theory

Erdős 1057 / JSP-000877: mathematical account of the submitted proof

Contributed by Jensen Kohlmeyer, Liam Kruer, Will Howe, Grant Huffman

Let C(x)C(x) count the Carmichael numbers at most xx. This account describes the submitted Lean proof of lim⁡x→∞log⁡C(x)/log⁡x=1\lim_{x\to\infty}\log C(x)/\log x=1. It identifies the analytic input from Dirichlet LL-functions, the construction of smooth shifted primes, and the transfer from those primes to sufficiently many Carmichael numbers for every large bound. It links the complete modular and standalone formal proofs and distinguishes their verified exponent-one endpoint from the stronger claims considered in the historical candidate.

Author comments: TeX edition of the mathematical account accompanying Justin Sun Prize submission JSP-000877. Pinned source and Lean proof materials: https://github.com/JENW1N/erdos1057-lean/tree/fd7bc2cac0e0518406be9eb6f07b29cb5239b0e3

Primarily AI-generated textHuman understanding: no partsCarmichael numbersLeanshifted primes
Nov 21, 20264 pages
PDFView work

math.NT — Number Theory

The sharp asymptotic for distinct multiples in an interval: a Lean formalization

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let f(n)f(n) be the least nonnegative integer hh for which the open interval (n,n+h)(n,n+h) contains distinct integers a1,…,ana_1,\ldots,a_n satisfying i∣aii\mid a_i. We give a complete Lean 4 formalization of f(n)∼(2/e)nlog⁡nf(n)\sim (\sqrt{2}/e)n\sqrt{\log n}. The formula was previously announced by David Turturean. The lower bound uses completely multiplicative weights, an exact convolution over powers of 22 and 33, and two inverse-exponential profiles. The upper bound constructs fractional matching weights from finite histograms of prime valuations. Explicit oscillation and stability estimates transfer the continuous transport identities to the integer divisibility graph.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000579. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos710-lean/tree/ee0440a8f58b07bcdc89c8b12606052cb84aac91

Primarily AI-generated textHuman understanding: no partsdistinct multiplesdivisibility matchingformal verification
Nov 21, 202611 pages
PDFView work

math.NT — Number Theory

The sharp deficit in primitive signed reciprocal relations

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let c(N)c(N) be the largest cardinality of a subset of {1,…,N}\{1,\ldots,N\} admitting a signed reciprocal sum equal to zero with no nonempty proper zero subsum under the same signs. We prove N−c(N)∼e−γNlog⁡log⁡log⁡N/log⁡log⁡NN-c(N)\sim e^{-\gamma}N\log\log\log N/\log\log N, where γ\gamma is Euler's constant. The construction joins divisor blocks along a path of primes and completes their reciprocal sum while avoiding those primes. For the converse, we prove a sharp harmonic bound for sets whose reciprocals have no nonempty zero subsum modulo an arbitrary integer. Exact rational representation in a dense sign class then turns this modular bound into a lower bound for the omitted denominators.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000265. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos319-sharp-deficit/tree/43f24b821a8cb8052707fcadc9adcc2cd1678c13

Primarily AI-generated textHuman understanding: no partsegyptian fractionsprimitive relationsreciprocal sums
Nov 21, 202615 pages
PDFView work

math.NT — Number Theory

An Explicit Removal Estimate for Reciprocal-Sum-Free Sets

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let f(N)f(N) be the largest cardinality of a subset of {1,…,N}\{1,\ldots,N\} containing no three distinct elements with 1/a=1/b+1/c1/a=1/b+1/c. We give an explicit uniform removal estimate for finite-prime relaxations of this problem. Together with the smooth-number decomposition, the estimate yields f(N)=CN+o(N)f(N)=CN+o(N) and an effective description of CC by finite optimization problems. If UVU_V is the limiting density obtained by retaining triples with smooth primitive coordinates over the primes at most 2V2V, then 0≤UV−C≤(1023+561000)(log⁡V)−1/1400\le U_V-C\le (10^{23}+561000)(\log V)^{-1/140} for V≥4V\ge4. The proof uses elementary prime estimates, a finite quadratic sieve, and a dyadic decomposition indexed by the larger primitive parameter. We also give rational enclosures of arbitrary prescribed width and an explicit modulus of convergence for f(N)/Nf(N)/N. The finite-prime framework and the underlying sieve are due to the earlier density-limit argument. The emphasis here is the uniform quantitative estimate.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000254. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos302-jsp-submission/tree/1af724ea53a44310c5386062baa22849e6eddafd

Primarily AI-generated textHuman understanding: no partsextremal setssieve methodsunit fractions
Nov 21, 202612 pages
PDFView work

math.CO — Combinatorics

Four-cycles one edge above the extremal threshold

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let h(n)h(n) be the minimum number of four-cycles in an nn-vertex graph with ex⁡(n,C4)+1\operatorname{ex}(n,C_4)+1 edges. We prove that h(nj)=o(nj)h(n_j)=o(\sqrt{n_j}) for a sequence nj=qj2+qj+2n_j=q_j^2+q_j+2, where the qjq_j are powers of four tending to infinity. Consequently, no positive constant gives a universal square-root lower bound one edge above the extremal number. The proof combines a polarity-graph construction with a structural analysis of extremal graphs. Signed deficiencies and a secondary degree-and-triangle minimization produce an open packing of size qq. Completing its adjacency matrix reduces the argument to a trace inequality for a symmetric binary matrix whose residual graph is a union of cycles.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000079. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos60-jsp-submission/tree/62aa60b23089cbd4729f1fc4cc850620228c9038

Primarily AI-generated textHuman understanding: no partsfour-cyclespolarity graphssupersaturation
Nov 21, 202615 pages
PDFView work

math.CV — Complex Variables

The (3,4,∞)(3,4,\infty) family of complex six-spheres. V. Complex fourfolds from the family

Contributed by Floris Alderliefste

We construct compact complex fourfolds diffeomorphic, with their complex orientation, to 3HP2#(−HP2)3\mathbb{HP}^2\#(-\mathbb{HP}^2). They form a family of complex three-tori over P1\mathbb P^1 with monodromy in GL6(Z)GL_6(\mathbb Z): two multiple fibres, of multiplicities five and four, and one Kuhn cusp. Its periods come from the exterior square of the genus-two pencil y2=x5+λ3x+λ4y^2=x^5+\lambda^3x+\lambda^4. The family is parametrized exactly by the half-plane Im⁡ξ>c∗\operatorname{Im}\xi>c_*, where c∗≈1.09454c_*\approx1.09454 is minus the minimum of an explicit real-analytic period function. We compute the Hodge numbers, the tangent cohomology (the Kuranishi germ is smooth of dimension one) and the automorphism group C×Z/2\mathbb C\times\mathbb Z/2, and we show that the family extends analytically across no boundary point of its parameter domain. We also construct a compact complex fourfold outside Fujiki's class C\mathcal C as a small crepant resolution of a Weierstrass model, bimeromorphic to the fibre product of a complex six-sphere with an elliptic surface; give an effective classification of the integral monodromy data of this kind that yield three-connected eight-manifolds, all of which are diffeomorphic to 3HP2#(−HP2)3\mathbb{HP}^2\#(-\mathbb{HP}^2); and describe shifted fibre products of complex dimension five.

Author comments: Version 2. Two statements in the introduction are corrected to match their proofs: under the rank-six theorem, each order-two suspension class from the order-four filling transgresses to the global coinvariant (version 1 gave the direction the other way round); and the resolved fourfold is a small crepant resolution of a Weierstrass model, bimeromorphic to the fibre product (version 1 called it a resolution of the fibre product). The statement of Theorem E is made more precise. The rest is streamlining: duplicate proofs merged, equations numbered by section, the main theorems reordered (the resolved fibre product, Theorem A in version 1, is now Theorem F), and the programs collected in one table. Paper V of the five-paper series "The (3,4,∞) family of complex six-spheres". The main result constructs compact complex fourfolds diffeomorphic, with their complex orientation, to 3HP²#(−HP²). The series begins with the complex six-spheres of Claude and L. Alpöge (https://alpo.ge/s6.pdf). Principal related inputs used here are Engel’s elliptic-surface construction (arXiv:2609.38442v1), the weighted-base and direct-image method of Du, Guo, Kusakabe and Xie (arXiv:2610.00250v1), Yang’s toroidal fillings (arXiv:2609.29666v1), the smooth classification of Conway, Crowley, Powell and Sixt (doi:10.1017/S1446788722000167), and Kramer–Stolz sphere absorption. Historical source editions, programs, outputs and check records are at https://github.com/KokunoYumeto/s6-complex-structure-workbench/tree/83d76022bcd442278b760db9ff438afceed6c6ea. The records and programs of this revision are at https://github.com/KokunoYumeto/s6-complex-structure-workbench/tree/af034f283649c6d4b0c6869bfe1e1fcd50346e85/pro_returns/S6_SERIES_PUBLISH_checkpoint_04_20261121T0142Z.

Primarily AI-generated textHuman understanding: no partsAI-generated mathematicsKuranishi familyOka theorycompact complex fourfoldscomplex structuresnon-Kähler manifoldsquaternionic projective planesix-spheretorus fibrationsvariation of Hodge structure
Nov 20, 2026177 pages
PDFView work

math.NT — Number Theory

Infinitely many exceptions to a prime-square representation problem of Erdős

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We prove that infinitely many positive integers have no representation n=ap2+bn=ap^2+b with pp prime, a≥1a\geq1, and 0≤b<p0\leq b<p. More precisely, the number of such integers in (X,2X](X,2X] is of order X/log⁡XX/\log X. The lower bound combines a positive-proportion avoidance estimate for large primes with first- and second-moment estimates for a short average of the small-prime sieve. A separated-frequency argument permits the large primes to be added in finitely many blocks. The small-prime moments have quadratic loss in the cutoff exponent, and a boundary estimate makes the large-prime avoidance stable under the averaging shifts.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000549. Pinned manuscript and Lean proof materials: https://github.com/Ghuffy1/erdos676/tree/3cc60a9fa3b811c10732dcc435f7fe21e0d54cab

Primarily AI-generated textHuman understanding: no partsexceptional setsprime-square residuessieve methods
Nov 20, 20269 pages
PDFView work

math.CO — Combinatorics

A counterexample to the Erdős triangle–four-cycle asymptotic

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We construct an infinite family of finite simple graphs containing neither a triangle nor a four-cycle. Their edge counts exceed the conjectured leading asymptotic in Erdős Problem 573 by a fixed positive factor. For every positive integer hh, put q=659hq=659^h. The graph GqG_q has nq=(1307/659)q2−qn_q=(1307/659)q^2-q and eq=(428875/6592)q3−(658/659)q2e_q=(428875/659^2)q^3-(658/659)q^2. Its limiting ratio to (nq/2)3/2(n_q/2)^{3/2} is 1.0000452143352195…1.0000452143352195\ldots. The construction joins 47 affine three-part pieces along a common root part. A multiplicative partition of reciprocal field labels excludes four-cycles across the pieces, and an additive restriction retains enough internal edges while excluding triangles.

Author comments: TeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000463. Pinned manuscript and Lean proof materials: https://github.com/Ghuffy1/erdos-573/tree/75b87c642d5800f5ce45564236ecf065820c9eb1

Primarily AI-generated textHuman understanding: no partsextremal graph theoryfinite fieldsgirth five
Nov 20, 20265 pages
PDFView work

math.NT — Number Theory

Harmonic dyadic shifts and short sums of factorial divisors

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let h(N)h(N) be the maximum, over 1≤R≤N1\le R\le N, of the least number of distinct positive divisors of a practical integer NN whose sum is RR. We prove h(n!)=O((log⁡n)9)h(n!)=O((\log n)^9). The main ingredient is a finite entropy lemma. A law modulo 2k2^k with entropy at least gLlog⁡2gL\log 2 in every LL-bit lower prefix becomes supported on more than half the group after O(g−2(log⁡k)2)O(g^{-2}(\log k)^2) independent copies, each multiplied by an independently chosen power of two. The shift distribution is harmonic. A divisor-digit construction supplies g≍1/log⁡kg\asymp1/\log k at linear factorial index. Positive quotient recursion, binary carrying, and a factorial radix then give the stated bound.

Author comments: TeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000055. Pinned manuscript and Lean proof materials: https://github.com/Ghuffy1/erdos18-harmonic-shifts/tree/4b2ed2d07693602fa3b87fb5aa72fe16933f98af

Primarily AI-generated textHuman understanding: no partsShannon entropyadditive basesfactorial divisors
Nov 20, 202610 pages
PDFView work

math.NT — Number Theory

A divisor-closed criterion for Behrend sequences

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We give a necessary and sufficient condition for a set of positive integers to be a Behrend sequence. The condition quantifies over sequences of finite divisor-closed sets supported on consecutive prime blocks. For each element at one level, its permitted extensions at the next level retain a prescribed reciprocal mass. We prove that the set of multiples of AA has natural density one if and only if AA meets every such family. The proof combines the classical Davenport–Erdős finite-approximation theorem with a finite pruning argument for independent geometric prime valuations.

Author comments: The pinned manuscript and Lean formalization accompany Justin Sun Prize submission JSP-000563. Proof repository and verification records: https://github.com/Ghuffy1/erdos691

Primarily AI-generated textHuman understanding: no parts
Nov 20, 20266 pages
PDFView work

math.CO — Combinatorics

A ZFC counterexample to Taylor's conjecture on finite subgraphs

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We construct, in ZFC, a graph GG of chromatic number ℵ1\aleph_1 such that every graph whose finite ordinary subgraphs embed into GG has chromatic number at most 2ℵ02^{\aleph_0}. Taking the target chromatic number to be (2ℵ0)+(2^{\aleph_0})^+ gives a negative answer to Taylor's conjecture on finite subgraphs. The construction uses hereditarily countable vertex data, finite coordinate inequalities, and a countable-closure reflection argument. A compactness argument transfers the resulting finite coloring properties to the entire finite age of GG.

Author comments: The pinned manuscript and Lean formalization accompany Justin Sun Prize submission JSP-000604. Proof repository and verification records: https://github.com/Ghuffy1/erdos736-jsp

Primarily AI-generated textHuman understanding: no parts
Nov 20, 20267 pages
PDFView work

math.PR — Probability

Planar rotators with Hadamard couplings

Contributed by Teo Banica

A complex Hadamard matrix HH of order NN can be read as a magnetic flux pattern on an array of 2N2N crossed superconducting wires, coupled by Josephson junctions, the Fourier matrix corresponding to the uniform field of Chandra, Ioffe and Sherrington. The glow of HH, the law of ⟨Hb,a⟩\langle Hb,a\rangle for random phase vectors a,ba,b, determines the energy distribution of this system of planar rotators by real projection. We prove moment polynomiality for elementary abelian Fourier matrices, including Walsh matrices, and compute the moments through order 12 for all complex Hadamard matrices, in terms of flux harmonics. The leading high-temperature expansion of the pressure has universal Catalan coefficients, as for Haar unitary couplings. The ground states correspond to bistochastic forms with positive line sums, and we compute the edge asymptotics for W2,W4W_2,W_4. With Villain bonds between neighboring wires and the junction coupling switched off, the Fourier 4th moment crosses over at correlation length N\sqrt N.

Primarily AI-generated textHuman understanding: some partsHadamard matrixPlanar rotator
Nov 20, 202648 pages
PDFView work

math.CA — Classical Analysis and ODEs

Half-line density and the structure of crystalline measures

Contributed by Jamie Martin

Let µ be a crystalline measure on the real line. Both µand its Fourier transform are locally finite sums of point masses. We prove that µ is a finite sum of translated and modulated lattice Dirac combs if and only if its support and its spectrum each have finite lower linear density on at least one half-line. The two half-lines and the sequences of radii may be chosen independently. If the support of a nonzero measure has lower half-line density d<∞, then d is the infimum of the frequency widths of the nonzero exponential polynomials vanishing on the support. In particular, the number of atoms per unit interval is uniformly bounded. If µ is not a generalized Dirac comb, its spectrum contains at least (1/(2d2)−o(1))T2 points in every interval of length T, uniformly in the position of the interval as T →∞. The proof combines a spectral gap theorem with a finite difference equation for the spectral masses. For a prescribed set Λ of lower density d<∞on one half-line, we describe the space of measures with support and spectrum in Λ and prove the sharp upper bound ⌊d2⌋for its dimension.

Author comments: Updating with additional appendix resolving open question from Lev Olevski, and with a provenance note on the very recent Alon Kummer paper.

Primarily AI-generated textHuman understanding: no parts
Nov 20, 202614 pages
PDFView work

math.NT — Number Theory

On several conjectures concerning p-adic continued fractions

Contributed by Tomislav Pejkovic

Let pp be an odd prime and let h≥2h\ge2 be even. If (p,h)≠(3,2)(p,h)\ne(3,2), infinitely many real and infinitely many imaginary quadratic fields have the form Q(D)\mathbb Q(\sqrt D), where DD is an integer whose pp-adic square roots have least period hh under Browkin's second algorithm. For (p,h)=(3,2)(p,h)=(3,2), we give two radicands and bound all such radicands in terms of their preperiods. We prove eventual periodicity for quadratic inputs to the fourth algorithm of Wang and Deng at p=5p=5 and to Yasutomi's simultaneous algorithm for real quadratic fields at p=3p=3. The real approximation error after nn digits is O(n−3)O(n^{-3}) for Ruban's expansion of a quadratic irrational and for Schneider's expansion of a quadratic pp-adic unit. For both Browkin algorithms and the alternating algorithm of Murru and Romeo, we determine the real and pp-adic approximation exponents in terms of the reduced denominator for Haar-almost every input. The real limit is transcendental and has finite irrationality exponent. In each cubic field embedded in Qp\mathbb Q_p, a suitable generator gives eventual periodicity for every basis 1,x,y1,x,y in a variant of the algorithm of Saito, Tamura and Yasutomi that computes the translation after inversion and row reduction. Computing the translation from the input gives nonperiodic expansions on a dense set of bases in every degree at least two. For the pp-adic Jacobi–Perron algorithm we construct pairs of Liouville numbers on a rational line with infinite expansions that are not eventually periodic. We also prove an irreducibility conjecture for a sequence of polynomials arising from a Pell equation.

Primarily AI-generated textHuman understanding: some partsJacobi–Perron algorithmQuadratic irrationalsp-adic continued fractionsperiodicityreal convergence
Nov 20, 202645 pages
PDFView work

math.NT — Number Theory

Mixed character moments and a zero-free half-plane for unitary Hecke L-functions

Contributed by Baiying Liu

We prove that for every number field K and every continuous unitary Hecke character ω, the function LK (s,ω) has no zeros in Re s>θ_G, where .8733326374459049352 <θ_G <.8733326374459051924. The same bound holds for Artin L-functions and for L-functions of finite-dimensional continuous unitary Weil representations. We estimate a mixed moment of two ordinary character sums with unequal lengths. Asecond Poisson summation in a signed correlation reduces the estimate to moments at a combined sextic character parameter. A differential equation describes the limiting range of the mixed moment and gives the optimal threshold within the specified reflected numerator comparison. We also determine the optimal saving for a centered cube-free sum in terms of the poles of a quotient of Hecke L-functions.

A mix of human-written and AI-generated textHuman understanding: some partsRiemann Zeta Functionquasi Riemann Hypothesis
Nov 20, 202668 pages
PDFView work

math.CO — Combinatorics

A counterexample to the cocircuit diameter conjecture

Contributed by Peter Graham

A rationally realizable uniform rank-41 oriented matroid on 80 elements has cocircuit-graph diameter at least 42>41=n−r+242>41=n-r+2, refuting the general cocircuit diameter conjecture. We build on the rank-21 example of Adler, De Loera, Klee and Zhang, the non-Hirsch polytope of Matschke, Santos and Weibel, Santos's product construction, and the source certification of Allamigeon, Canu and Strub. A count of negative coordinates confines every potentially shorter walk to two affine sections; projection to the product factors then gives the lower bound. Two rational perturbations make the resulting oriented matroid uniform. Lean 4 separately verifies the matrix existence and walk lower bound for a different realizing matrix; the printed perturbations are proved here, not checked in Lean. This work has not yet been reviewed by experts. The proofs, the Lean formalization, the certificate checkers and the text were produced by AI models, working under the author's direction.

Author comments: Zenodo archive: https://doi.org/10.5281/zenodo.23765669. Lean 4 development, in its folder lean: https://github.com/6/clank-lab/tree/cocircuit-diameter-counterexample-v1/results/cocircuit-diameter-counterexample . What Lean checks (Lean 4.19.0 with a pinned Mathlib; axioms propext, Classical.choice and Quot.sound only): the theorem ADKZPricing.Generated.source_frozen_endpoint, that some rational 80x41 matrix with every 41-row minor nonzero has two real signed cocircuits, with complementary 40-element zero sets and positive entries elsewhere, that no walk of at most 41 edges joins in the full cocircuit graph (all signed cocircuits as vertices). Seven Lean theorems show that its cocircuit, adjacency and walk definitions agree with those of Section 1. Lean also checks the source matrix M_0's vertex and edge certificate and the bound d_P(u,v) >= 21. What Lean leaves outside: (1) the passage from the sign covectors of a real matrix to the realizable oriented matroid of Theorem 1, the standard interpretation; (2) the matrix of Section 3: Lean's matrix is given only existentially, from its own positive functional and perturbations, and is not identified with the printed one, whose Vandermonde perturbations are proved only in the text; (3) the printed positive functional of Appendix A, proved in the text and checked by an exact Python checker; (4) the upper bounds d_P(u,v) = 21 (exact Python checkers) and 42 (Remark 8, written). The full Lean build needs about 88 GiB of memory and half a day. License: the paper text is deposited here under CC BY 4.0; the Lean development and the checkers stay under Apache-2.0 in the published repository.

Primarily AI-generated textHuman understanding: some partscocircuit graphdiameteroriented matroiduniform perturbation
Nov 20, 202611 pages
PDFView work

math.GN — General Topology

Common Periodic Points of Commuting Interval Maps

Contributed by Luke Hammer

We construct pairs of commuting continuous self-maps of the compact interval with disjoint periodic-point sets. More precisely, every finite union of sets of positive multiples, including the empty union, is the set of integers n for which two commuting nth iterates have a common fixed point. In the other direction, we show that if either generator has zero topological entropy, the generators act as mutually inverse cyclic permutations on a common finite orbit. We also establish a common fixed-point theorem for two commuting maps that are each monotone on a finite partition, with constant pieces allowed.

Primarily AI-generated textHuman understanding: no partsInterval dynamics
Nov 20, 202619 pages
PDFView work

math.NT — Number Theory

A Polynomial Kontsevich–Zagier Theorem for Compact Exponential Periods on the Affine Line

Contributed by Christopher D. Long, Antoine-Auguste Le Blanc

Let q,r∈Q‾[x]q,r\in\overline{\mathbb{Q}}[x], let Δ\Delta be a finite degree-zero zero-cycle on A1(Q‾)\mathbb{A}^1(\overline{\mathbb{Q}}) with coefficients in Q‾\overline{\mathbb{Q}}, and let Γ\Gamma be any finite piecewise C1C^1 one-chain in C\mathbb{C} with ∂Γ=Δ\partial\Gamma=\Delta. We consider compact exponential periods \[ \int_\Gamma r(x)e^{q(x)}\,dx \] and the zero-dimensional exponential periods eλe^\lambda, λ∈Q‾\lambda\in\overline{\mathbb{Q}}. The companion linear theorem identifies every numerical linear relation among these periods with a formal consequence of bilinearity, functoriality, and twisted Stokes. We prove the corresponding polynomial theorem for the commutative algebra generated by the same periods. Every polynomial numerical relation is generated by the companion linear relations, multiplication, and the identities \[ e^0=1,\qquad e^\lambda e^\mu=e^{\lambda+\mu},\qquad e^\lambda\int_\Gamma r e^q\,dx =\int_\Gamma r e^{q+\lambda}\,dx. \] Equivalently, the period map is injective on the tensor-generated formal algebra of compact exponential periods on the affine line. The new input is a uniform description of the functional polynomial-relation ideal. After adjoining the finitely many exponential functions coming from endpoint values and constant shifts, the affine Picard–Vessiot group of the inhomogeneous moment system has a vector translation kernel and reductive homogeneous quotient. Horizontal projectors are Laurent polynomials in the adjoined exponentials. An explicit gauge built from the spectral projectors of the constant connection matrix separates the coordinates already in the base ring from a full translation block, and the latter coordinates are algebraically independent. Hence the complete functional relation ideal is generated by affine-linear relations. Beukers' lifting theorem transfers this statement to values, and the companion linear Kontsevich–Zagier theorem makes every specialized generator formal.

Author comments: Paper III of the Exponential Integral Theorem series. Source and audit records: https://github.com/long-mathematics/exponential-integral-theorem/tree/92db79eedeb064694ff20e9201d73fc2bc0857f4

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 20, 202613 pages
PDFView work

math.NT — Number Theory

A Linear Kontsevich–Zagier Theorem for Compact Exponential Periods on the Affine Line

Contributed by Christopher D. Long, Antoine-Auguste Le Blanc

Let q,r∈Q‾[x]q,r\in\overline{\mathbb{Q}}[x], let Δ=∑αdα[α]\Delta=\sum_\alpha d_\alpha[\alpha] be a finite degree-zero zero-cycle on A1(Q‾)\mathbb{A}^1(\overline{\mathbb{Q}}) with coefficients in Q‾\overline{\mathbb{Q}}, and let Γ\Gamma be any finite piecewise C1C^1 one-chain in C\mathbb{C} with ∂Γ=Δ\partial\Gamma=\Delta. We consider \[ I_{q,r,\Delta}(z)=\int_\Gamma r(x)e^{zq(x)}\,dx \] and the compact exponential period Iq,r,Δ(1)I_{q,r,\Delta}(1). We define the formal exponential-period space on smooth affine curves using bilinearity, functoriality, and twisted Stokes, and consider the subspace generated by the affine-line periods above and by the zero-dimensional exponential periods eβe^\beta, β∈Q‾\beta\in\overline{\mathbb{Q}}. We prove that the period map is injective on this subspace. Equivalently, every Q‾\overline{\mathbb{Q}}-linear numerical relation among these compact exponential periods is generated by the standard Kontsevich–Zagier operations. The proof first reduces every polynomial differential uniquely modulo R↦R′+q′RR\mapsto R'+q'R. Direct sums of the moment systems from the companion paper Algebraic Exponential Integrals are then used to lift a numerical relation by Beukers' theorem. A direct-sum residue argument makes the resulting relation submodule constant and forces an exponential-polynomial identity. A common finite tree and a Cauchy transform show that its combined inverse-branch densities vanish edge by edge. Finally, a simultaneous finite Galois cover realizes every such functional relation by functoriality in the formal period space.

Author comments: Paper II of the Exponential Integral Theorem series. Source and audit records: https://github.com/long-mathematics/exponential-integral-theorem/tree/92db79eedeb064694ff20e9201d73fc2bc0857f4

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

math.NT — Number Theory

Algebraic Exponential Integrals: Transcendence and Linear Relations

Contributed by Christopher D. Long, Antoine-Auguste Le Blanc

Let q∈Q‾[x]q\in\overline{\mathbb{Q}}[x] be nonconstant, and let Δ=∑αdα[α]\Delta=\sum_\alpha d_\alpha[\alpha] be a finite degree-zero zero-cycle on A1(Q‾)\mathbb{A}^1(\overline{\mathbb{Q}}) with coefficients in Q‾\overline{\mathbb{Q}}. If Γ\Gamma is any finite piecewise C1C^1 one-chain in C\mathbb{C} with ∂Γ=Δ\partial\Gamma=\Delta, put \[ I_{q,\Delta}(z)=\int_\Gamma e^{zq(x)}\,dx. \] We prove that every nonzero function Iq,ΔI_{q,\Delta} is a purely transcendental EE-function: for every ξ∈Q‾×\xi\in\overline{\mathbb{Q}}^\times, Iq,Δ(ξ)I_{q,\Delta}(\xi) is transcendental. Equivalently, \[ I_{q,\Delta}(1)\in\overline{\mathbb{Q}} \quad\Longleftrightarrow\quad I_{q,\Delta}\equiv0. \] In particular, ∫ABeq(x)dx\int_A^B e^{q(x)}dx is transcendental for every pair of distinct algebraic endpoints. For a fixed polynomial qq, we also determine all Q‾\overline{\mathbb{Q}}-linear relations among finite families of these values: they are exactly the specializations of constant-coefficient functional relations, and the latter are characterized by vanishing of explicit inverse-branch densities on a finite tree in the target of qq. The proof combines Beukers' lifting theorem with a homogeneous moment connection. A Fourier–Laplace description proves semisimplicity, while an explicit residue calculation shows that every rational horizontal endomorphism is constant. An algebraic value therefore forces an exponential-polynomial identity. Constant-coefficient annihilation and a Cauchy-transform argument then force the original exponential period function to vanish identically.

Author comments: Paper I of the Exponential Integral Theorem series. Source and audit records: https://github.com/long-mathematics/exponential-integral-theorem/tree/92db79eedeb064694ff20e9201d73fc2bc0857f4

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

math.PR — Probability

On the Monotonicity of the Speed of Biased Random Walks on GW Trees

Contributed by Heng Ma

On a Galton--Watson tree without leaves, the λ\lambda-biased random walk (Xn)(X_n) chooses its next step with weight λ>0\lambda>0 for the parent and weight one for each child. When λ\lambda strictly less than the mean offspring mm, the walk is transient, with a positive speed v(λ):=lim⁡n→∞∣Xn∣/n.v(\lambda): =\lim_{n\to\infty}|X_n|/n. We study the monotonicity of v(⋅)v(\cdot), and prove that: \begin{itemize} \item If the GW tree has at least two children, then v(⋅)v(\cdot) is decreasing on (0,m)(0,m); \item v(⋅)v(\cdot) is decreasing on (0,1)∪(3+52,m)(0,1) \cup (\frac{3+\sqrt{5}}{2}, m). \end{itemize} We also sketch a computer-assisted proof of strict decrease on (0,m)(0,m) using exact checks of about 750,000750{,}000 rational coefficients. The full proof appears in the companion GitHub version~\cite{FullVersion}.

Primarily AI-generated textHuman understanding: some partsbiased random walkmonotonicityspeed
Nov 20, 202624 pages
PDFView work

math.AG — Algebraic Geometry

The maximum likelihood degree of no-three-way interaction models

Contributed by Shankar Sivarajan

We prove that for all I,J,K≥2I,J,K\ge2 the maximum likelihood degree of the no-three-way interaction model of I×J×KI\times J\times K contingency tables is \[ (-1)^{(I-1)(J-1)}\int\beta(M_A)^K\,d\chi(A), \] an integral with respect to the Euler characteristic over the I×JI\times J matrices AA with nonzero entries modulo row and column scaling, where β(MA)\beta(M_A) is the beta invariant of the matroid of the columns of $[\Id_I\mid A]$. By a theorem of Clarke, Ho\c{s}ten, Kushnerchuk, and Oldekop, β(MA)\beta(M_A) is the maximum likelihood degree of the independence model scaled by AA. Closed forms were previously known only when one variable is binary, and the formula recovers them. For fixed II and JJ the maximum likelihood degree is an exponential polynomial in KK; the coefficient of its largest base (I+J−2I−1)\binom{I+J-2}{I-1} is the maximum likelihood degree of the moduli space X(I,I+J)X(I,I+J) of points in linearly general position, which counts solutions to the generalized scattering equations of Cachazo, Early, Guevara, and Mizera. The same argument for a generically scaled model expresses the degree of MI,J,K\mathcal M_{I,J,K} as an Euler-characteristic integral of products of beta invariants. For 3×33\times3 matrices the integral reduces to counting strata of line arrangements, and the maximum likelihood degree of the 3×3×K3\times3\times K model is 26⋅6K−60⋅5K+36⋅4K+6⋅3K−9⋅2K+126\cdot6^K-60\cdot5^K+36\cdot4^K+6\cdot3^K-9\cdot2^K+1; in particular the 3×3×33\times3\times3 model has maximum likelihood degree 511511.

Primarily AI-generated textHuman understanding: some partsEuler characteristicalgebraic statisticsbeta invariantcontingency tablesline arrangementsmatroid stratificationmaximum likelihood degreeno-three-way interaction modelscattering equationstoric varieties
Nov 20, 202610 pages
PDFView work

math.AG — Algebraic Geometry

Two shapes of maximal degree 135 in the plane Jacobian problem: exclusion of the degree pairs (135,90) and (90,135) with corners (9,36) and (17/9,4)

Contributed by David Niedbala Giraudin

In the list of Guccione, Guccione, Horruitiner and Valqui of the possible shapes of a counterexample to the plane Jacobian conjecture with degrees at most 150, two shapes have starting corner (9,36) and final corner (17/9,4): the standard (3,2)-pairs of degrees (135,90) and the standard (2,3)-pairs of degrees (90,135). We show that no such pair exists, when it is normalised as in Corollary 5.21 of Guccione-Guccione-Valqui. The two sides of the Newton polygon are described by the results of Guccione-Guccione-Valqui. In suitable polynomial coordinates the pair is confined to an explicit finite system of polynomial equations. Its leading part is a pair of polynomials of degrees 12 and 8 in one variable with 3 p3 q2' - 2 p3' q2 constant, which is unique up to the symmetries of the system and has rational coefficients; the remaining equations are then solved by three steps of linear algebra over Q, and the 29 compatibility conditions, polynomials in five unknowns, generate the unit ideal. The computation is exact and is reproduced by an ancillary script (SymPy, and Singular for one Groebner basis). All statements are proved relative to the cited results. Nothing in this note has been checked by a third party.

Primarily AI-generated textHuman understanding: no partsJacobian conjectureKeller mapNewton polygonminimal counterexampleplane Jacobian conjectureregular corner
Nov 20, 20266 pages
PDFView work

math.PR — Probability

Extremizers of the expected missing mass under an entropy constraint

Contributed by Christopher D. Long

For a discrete probability distribution p=(pi)p=(p_i), the expected mass of symbols absent from tt independent samples is Φt(p)=∑ipi(1−pi)t\Phi_t(p)=\sum_i p_i(1-p_i)^t. For every positive integer tt and finite entropy budget h≥0h\ge0, we prove that every ℓ1\ell^1-local maximizer under H(p)≤hH(p)\le h has at most two distinct positive coordinate values, and all but at most one positive coordinate are equal. This holds on finite and countably infinite alphabets and improves the four-size bound of Berend, Kontorovich, and Zagdanski (2017). On a countably infinite alphabet, we give an exact finite classification of all global maximizers: a unique one-light or uniform candidate is compared with an explicitly bounded family of one-heavy candidates, whose masses are uniquely specified by entropy equations. The one-light or uniform candidate is uniquely optimal for t=1,2t=1,2. For fixed h>0h>0, the optimal value Bt(h)B_t(h) satisfies \[ \frac{h}{B_t(h)}=\log t+\log\log t+2 +O_h\!\left(\frac{\log\log t}{\log t}\right). \] Every optimizer is eventually one-heavy, with mt∼htm_t\sim ht equal light atoms of size qt∼1/(tlog⁡t)q_t\sim1/(t\log t). The two-size proof combines a three-coordinate entropy-curvature estimate with a finite coefficient comparison. Crossing theorems describe the winning intervals of the candidate distributions, and the classification gives exact extrema for singleton counts, discovery increments, and expected coverage.

Author comments: Lean 4 formalization, manuscript correspondence, and final audit: https://github.com/long-mathematics/entropy-constrained-missing-mass/tree/cfc6f0e70596b36c2309cccbb931a1c84f63ad7f

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

math.CO — Combinatorics

Boxes with cyclic tiling groups have one layer or size 2 × 2 × 4

Contributed by twinheterodox

Kuperberg asked how a box's dimensions determine its tiling group. We prove Conlon's conjecture that this group is cyclic exactly when one side has length one or the box has dimensions 2×2×42\times2\times4 in some order. For every box, we also show that the minimum number of generators of its tiling group equals the largest multiplicity of a cyclotomic factor of prime-power index in MacMahon's volume polynomial. This polynomial counts stacks by the number of cubes they contain. It also determines the Smith factors over Q[q,q−1]\mathbb{Q}[q,q^{-1}] of the box's weighted Carlitz matrix, which presents the tiling group at q=1q=1. Each cyclotomic factor of multiplicity ee occurs in exactly the last ee Smith factors, once in each.

Author comments: 13 pages, 5 figures. The source includes editable figures, six verification programs, and their reference results. The manuscript and code are available at https://github.com/twinheterodox/boxed-plane-partitions

Primarily AI-generated textHuman understanding: some partsCyclotomic PolynomialsKasteleyn cokernelsSmith normal formboxed plane partitionslozenge tilings
Nov 20, 202613 pages
PDFView work

math.CO — Combinatorics

Peaceable queens on boards of size 16 to 20

Contributed by Jason Davies

Let a(n)a(n) be the largest mm such that mm white and mm black queens can be placed on an n×nn\times n board with no queen attacking a queen of the other colour (OEIS A250000). The refereed literature and the OEIS gave a(n)a(n) for n≤15n\le15, and in 2026 Arevalo determined a(16)a(16), a(17)a(17) and a(18)a(18) in an unrefereed, AI-assisted computational note. We prove a(19)=52a(19)=52 and a(20)=58a(20)=58, which were open, and we confirm a(16)=37a(16)=37, a(17)=42a(17)=42 and a(18)=47a(18)=47 independently, with two separately written programs. In each case a(n)=⌊7n2/48⌋a(n)=\lfloor7n^2/48\rfloor, so the constructions that Ainley gave in 1977 are optimal on these boards. The proof is computer-assisted. As in earlier work, we label each of the 6n−26n-2 lines of the board white or black, which turns the problem into maximising the smaller of two cell counts. Our new ingredient is the bound: for fixed rows and columns we bound that quantity by Lagrangian duality, and each Lagrangian subproblem is a minimum cut on the 4n−24n-2 diagonals. With symmetry breaking, the search for n=20n=20 meets 5.7×10105.7\times10^{10} row/column labellings up to symmetry, and a single family of minimum cuts prunes every one of them. That search took 221.9 CPU hours, mostly on cloud machines. A second implementation repeats the whole search for every n≤18n\le18. Orbit counts by Burnside's lemma confirm that every search is complete, and exact LP certificates and SAT proofs checked by drat-trim give further checks. As side results we find 26 and 5 inequivalent optimal configurations for n=16n=16 and n=17n=17 (OEIS A260680), and we confirm by computation that the 20×2020\times20 and 22×2222\times22 tori admit 51 and 64 queens of each colour but not more (A279405), values that also follow from Harries's exact formula for even tori.

Primarily AI-generated textHuman understanding: no partsLagrangian dualityOEIS A250000chessboard problemscomputer-assisted proofminimum cutpeaceable queenssymmetry breaking
Nov 20, 202611 pages
PDFView work

math.CO — Combinatorics

The Heawood family is not the complete list of excluded minors for Colin de Verdière invariant at most 5

Contributed by Peter Graham

We show that two intrinsically knotted graphs G1G_1 and G2G_2 with 23 edges, on 11 and 12 vertices, have Colin de Verdière invariant μ=6\mu=6 and no minor in the Heawood family, the 78 graphs obtained from K7K_7 and K3,3,1,1K_{3,3,1,1} by ΔY\Delta Y- and YΔY\Delta-transformations. So the Heawood family is not the complete list of excluded minors for μ≤5\mu\le5, as van der Holst proposed; Mattman and Pavelescu stated this proposal as a conjecture and derived from it that G1G_1 and G2G_2 have μ=5\mu=5. More precisely, either the common minor HH of G1G_1 and G2G_2, a 4-regular graph with 11 vertices and 22 edges, is an excluded minor for μ≤5\mu\le5, or G1G_1 and G2G_2 both are. It follows that the following two conjectures of van der Holst cannot both hold: (a) a graph is 4-flat if and only if μ≤5\mu\le5; (b) the Heawood family is the complete list of excluded minors for 4-flat graphs. The lower bound μ≥6\mu\ge6 is proved by explicit matrices certified in interval and exact rational arithmetic, and the minor exclusion by exhaustive enumeration. This work has not yet been reviewed by experts. The proofs, the computer checks and the text were produced by AI models, working under the author's direction.

Author comments: Zenodo archive: https://doi.org/10.5281/zenodo.24128770. License: the paper text is deposited here under CC BY 4.0; the published code (checkers) and data stay under Apache-2.0 in their repository. Certificates and checkers, in its folders data and checks: https://github.com/6/clank-lab/tree/heawood-family-mu5-v1/results/heawood-family-mu5

Primarily AI-generated textHuman understanding: some parts4-flat graphsColin de Verdière invariantHeawood familyexcluded minorsintrinsically knotted graphs
Nov 20, 20268 pages
PDFView work

math.DS — Dynamical Systems

Complete periodicity of perpendicular billiards in rational triangles of prime denominator

Contributed by Joshua Boorstein

Let Δ\Delta be a triangle with angles πai/N\pi a_i/N, gcd⁡(a0,a1,a2)=1\gcd(a_0, a_1, a_2) = 1, and NN odd. The directions perpendicular to the sides of Δ\Delta form one orbit under the reflection group, and a companion note showed that this direction class is completely periodic whenever it has no swapped pair: two vertex-to-vertex billiard paths, each the reverse of the other, that meet no side at a right angle. Let pp be the number of swapped pairs. We prove that when NN is prime there are no swapped pairs, so the class is completely periodic and every regular orbit in it meets a side at a right angle. This answers the note's conjecture at prime NN and proves Boshernitzan's Conjecture 2.2(b) for every rational triangle with prime denominator placed with a side horizontal. The proof has two halves: a residue modulo 1−ζN1 - \zeta_N rules out paths between distinct vertices (at an odd prime power ℓk\ell^k it forces ℓ\ell to divide the third angle's numerator), and at prime NN, where the first homology is one-dimensional over Q(ζN)\mathbb{Q}(\zeta_N), a closed path is homologous to its mirror image, which an orientation-reversing involution forbids unless they coincide. At composite odd NN swapped pairs exist, but if no signed sum of their lengths vanishes, every regular orbit of the class still meets a side at a right angle; so p≤1p \leq 1 never breaks complete periodicity at odd NN, unlike at even NN. This criterion applies with pp unbounded: the triangles (3,6m+2,12m+4)(3, 6m + 2, 12m + 4) and (3,6m+1,12m+5)(3, 6m + 1, 12m + 5) have exactly p=mp = m, with independent lengths for all practical mm (computer-assisted). And it is sharp: on four explicit intervals of triangles a pair of mirror-image cylinders meets no side at a right angle (computer-assisted).

Author comments: First version. Builds on "Singular perpendicular orbits and complete periodicity in rational triangles" (hexagon:2611.00304). Code: https://doi.org/10.5281/zenodo.24251628

Primarily AI-generated textHuman understanding: some partsBoshernitzan conjecturecomplete periodicitycyclotomic fieldsperpendicular orbitsprime denominatorrational billiardsrational trianglessaddle connectionstranslation surfaces
Nov 20, 202626 pages
PDFView work

math-ph — Mathematical Physics

Semiclassical Asymptotics of Wigner 3j and 6j Symbols at Growing Rank: Phase Horizons and Turning Connections

Contributed by Antony Lewis

Wigner 3j and 6j symbols encode angular-momentum coupling and recoupling. Their large-spin asymptotics connect to tetrahedral geometry, three-dimensional quantum gravity and quantum topology. We study the intermediate regime in which the rank of a two-large/one-small 3j, one-small 6j, or one-small q-6j symbol grows with the large scale N. In Weyl-midpoint coordinates j+1/2, their exact rank recurrences belong to a common class of even centered Jacobi chains. For this class we identify a generic phase-coherence horizon at rank of order N^{2/3}, where the leading quadratic phase-defect coefficient chi is nonzero. On compact turning-free corridors, a Hamilton-Jacobi effective-angle pullback approximates the physical solution to O(N^{-2}) in natural gauge, uniformly from fixed rank to fixed positive rank ratio; a real discrete-flux amplitude improves the bound to O(N^{-3}) without a new phase correction. Bulk zeros are located to O(N^{-4}), with an O(N^{-3}) Bohr-Sommerfeld law. At simple rank turns with lattice-quantized action we obtain a physically normalized Airy connection; under a forbidden-side bound, its turning-layer bracket is Ai(t) + N^{-4/3} varpi Ai'(t) + O(N^{-2}). Exact hyperbolicity proves that bound for all three symbol families and extends the uniform Airy law through a fixed forbidden-side neighbourhood except for an O(N^{-1} log N) collar at the outer end of that neighbourhood. For 6j and q-6j the rank momentum is a Euclidean or hyperbolic tetrahedral dihedral angle, and the q-6j turning action obeys an exact Schlafli-type quantization identity.

Author comments: Sequel to Hexagon 2611.00533v1 (fixed-rank asymptotics). 90 pages, 1 figure. A companion technical supplement and the verification programs are in the GitHub repository cited in the paper.

Primarily AI-generated textHuman understanding: no partsAiry turning pointHahn polynomialsRacah polynomialsWigner 3j symbolsWigner 6j symbols
Nov 20, 202693 pages
PDFView work

math.AG — Algebraic Geometry

The degree pair (88,132) in the plane Jacobian problem: exclusion of the shape with starting corner (11,33) and final corner (19/4,8)

Contributed by David Niedbala Giraudin

In the list of Guccione, Guccione, Horruitiner and Valqui of the possible shapes of a counterexample to the plane Jacobian conjecture with degrees at most 150, exactly one shape has maximal degree 132, up to the exchange of the two polynomials: the standard (2,3)-pairs of degrees (88,132) with starting corner (11,33) and final corner (19/4,8). We show that no such pair exists, when it is normalised as in Corollary 5.21 of Guccione-Guccione-Valqui. The two sides of the Newton polygon are described by the results of Guccione-Guccione-Valqui. In suitable polynomial coordinates the pair is confined to an explicit finite system of polynomial equations. Its leading part has exactly two solutions, defined over Q(sqrt(-3)) and exchanged by its non-trivial automorphism; for each of them the system is solved order by order by linear algebra over that field, and the compatibility conditions of the first twelve orders, six polynomials in three unknowns, generate the unit ideal. The computation is exact and is reproduced by an ancillary script (SymPy, and Singular for three Groebner bases). All statements are proved relative to the cited results. Nothing in this note has been checked by a third party.

Primarily AI-generated textHuman understanding: no partsJacobian conjectureKeller mapNewton polygonminimal counterexampleplane Jacobian conjectureregular corner
Nov 20, 20266 pages
PDFView work

math.NT — Number Theory

Cases of the Agashe–Ribet–Stein Conjecture

Contributed by Hernandez Juan

We prove the Agashe–Ribet–Stein inequality for optimal elliptic curves over (\mathbb{Q}) at every prime (p\geq 5), at (p=3) when (v_3(N)\leq 4), and at (p=2) when (v_2(N)\leq 3), where (N) is the conductor.

Primarily AI-generated textHuman understanding: no parts
Nov 20, 2026103 pages
PDFView work

math-ph — Mathematical Physics

Quantum permutations and the Standard Model algebra

Contributed by Teo Banica

The finite part of the Standard Model, in the Chamseddine--Connes approach, has algebra AF=C⊕H⊕M3(C)A_F=\mathbb C\oplus\mathbb H\oplus M_3(\mathbb C), and its quantum isometry groups were computed by Bhowmick, D'Andrea and Dabrowski. We explain how the quantum automorphism group of the complex algebra BF=C⊕C⊕M2(C)⊕M3(C)B_F=\mathbb C\oplus\mathbb C\oplus M_2(\mathbb C)\oplus M_3(\mathbb C) generated by AFA_F, with its canonical trace, is a cocycle twist of the quantum permutation group S15+S_{15}^+, and how the color parts of the quantum isometry groups are twists of S9+S_9^+, and of a quantum group G3⊂S9+G_3\subset S_9^+ preserving an oriented area tensor on F32\mathbb F_3^2. We prove that G3G_3 is infinite, with classical version of order 216216, while the quantum symmetry group of the unoriented area tensor is classical, of order 432432. With the trace coming from the fermions, the coaction preserves the weak and color summands separately, and the quantum automorphism group becomes a twist of S4+ ∗^ S9+S_4^+\,\hat{*}\,S_9^+. We also discuss matrix models and maximality, the fermions and the Heisenberg group of order 2727, the untwisting of color, which leads to color Lie algebras in the sense of Rittenberg, Wyler and Scheunert, the spectral action, and the mixing matrices.

Primarily AI-generated textHuman understanding: some partsQuantum permutationStandard Model
Nov 20, 202638 pages
PDFView work

math.AC — Commutative Algebra

Vasconcelos' conjecture on the module of differentials

Contributed by Chung Pang Mok, Yiqi Xu

Let kk be a field and let SS be a local kk-algebra essentially of finite type whose module of Kähler differentials ΩS/k\Omega_{S/k} has finite projective dimension. A conjecture of Vasconcelos, in the form studied by Herzog and Briggs, asserts that SS is then a complete intersection when char⁡k=0\operatorname{char}k=0. We give a complete proof, in particular one independent of the Eisenbud--Mazur conjecture, that SS is a reduced complete intersection when char⁡k=0\operatorname{char}k=0, and, over an arbitrary field, when some minimal prime of SS is a generic point at which SS is a field separably generated over kk; in the latter case pd⁡SΩS/k≤1\operatorname{pd}_S\Omega_{S/k}\le1 and SS is essentially smooth at all of its generic points. In positive characteristic pp, Vasconcelos' conjecture for reduced algebras holds for every such algebra exactly when [k:kp]≤p[k:k^p]\le p.

A mix of human-written and AI-generated textHuman understanding: all partsKähler differentialschange of ringscomplete intersectionsconormal moduleimperfect fieldsprojective dimension
Nov 20, 202623 pages
PDFView work

math.CO — Combinatorics

The ordered 2x2 corner pattern: a removal exponent of at least 9/2, and other partial results

Contributed by David Niedbala Giraudin

Let P = [[1,0],[1,1]]. An ordered induced copy of P in a binary matrix is given by rows i<j and columns c<d with entries (1,0) in row i and (1,1) in row j. Whether P admits a polynomial removal lemma is, to our knowledge, open; it is the last open 2x2 case. This note does not settle it and records partial results. Main result: for every q >= 2 we construct a square binary matrix of side n = 6q^3, with exactly n/6 copies of P, each on a pair of adjacent rows, these pairs being disjoint, whose distance to P-freeness is exactly (n/6)^{4/3} + n/6 entry changes; consequently any removal exponent for P is at least 9/2. Further results: (1) if the columns are split into m consecutive intervals on each of which the matrix is P-free, and any two rows can be made P-free by deleting at most K columns, then the n x n matrix is within 6 m n^{3/2} sqrt(K) + 3mn entry changes of a P-free matrix; (2) two explicit families show that no bound of the form CK per row, or CKn in total, holds with an absolute constant, even for two intervals; (3) for matrices made of two interleaved "staircase" classes we give a repair with at most 4K changes per row; (4) the block-repair lemma used by Lupini for the 2x2 identity has no direct analogue for P; (5) for matrices in which every copy uses two adjacent rows, we give two safe repair moves and a matrix with a single copy at linear distance from P-freeness. Statements are labelled proved, computed or open. The results are established facts whose novelty has not been verified. The note was prepared with an AI model; the proofs were examined by independent AI reviews and by computation, and nothing has been checked by a third party.

Primarily AI-generated textHuman understanding: no partsedit distanceforbidden submatrixordered binary matricespolynomial removalproperty testingremoval lemma
Nov 20, 202611 pages
PDFView work