Browse

Mathematical Software

cs.MS — Mathematical Software

cs.MS RSS feed

Works in cs.MS

13 works

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.DG — Differential Geometry

An unconditional estimate and the structure of the Bäcklund orbit

Contributed by Anton Kalmykov, Alexander Timmermans

Let ff be an arbitrary C∞C^\infty solution of the sine-Gordon equation fxy=sin⁡ff_{xy}=\sin f in the square W=[−L,L]2W=[-L,L]^2, and let ωn\omega_n be obtained by nn successive B\"acklund transformations with arbitrary real parameters a1,…,an>0a_1,\dots,a_n>0 and arbitrary normalization constants cjc_j. For a solution ω\omega let r(ω)r(\omega) be the associated smooth map of a surface of curvature K=−1K=-1 (Chebyshev net, common initial frame at the origin). We prove the unconditional estimate ∥r(ωn)−r((−1)nf)∥L∞(W)≤Kn∑j=1n1/aj\|r(\omega_n)-r((-1)^n f)\|_{L^\infty(W)}\le K_n\sum_{j=1}^n 1/a_j, Kn=3L2+(1+L)π(2T∗+π)3n−1K_n=3L^2+(1+L)\pi(2T_*+\pi)3^{n-1}, T∗=sup⁡∣x∣≤L∫−LL∣fy∣ dyT_*=\sup_{|x|\le L}\int_{-L}^{L}|f_y|\,dy, with no restrictions on the aja_j, their ratios, the cjc_j, or LL. The proof reduces the problem to a cascade of forced pendulum equations, controlled by an integral Lyapunov estimate and by cumulative estimates for the orthogonal Gauss-Weingarten propagator. For the Amsler seed f=Y(xy)f=Y(xy) we show T∗≤2L2T_*\le 2L^2, which gives an explicit constant; the order 1/a1/a is sharp. We also study the dependence on the data: smoothness along finite-dimensional families, continuity on the Fr\'echet data space, convergence of the immersions in C0C^0 and W1,pW^{1,p} although the solutions ωn\omega_n themselves need not converge, partial limits along arbitrary index sets for aj→∞a_j\to\infty and for aj→0a_j\to0, and a two-chamber structure of the orbit under B\"acklund chains.

Author comments: The interactive demonstration is suppelmetary materials

Primarily human-written textHuman understanding: all partsAmsler surfacesBacklund transformationBianchi permutability theoremChebyshev netssine-Gordon equationsurfaces of constant negative curvature
Nov 15, 202646 pages
PDFView work

math.NT — Number Theory

Verification of the Markov Uniqueness Conjecture for the First One Trillion Markov Values: Meridians on the Markov Surface and Farey Addresses

Contributed by Elleard Felix Webster Heffern

The Markov unicity problem asks whether the largest entry of a positive integer solution determines the other two. We organize the triples into families called Meridians, with compact addresses and explicit evaluation rules. The construction starts with catenary profiles: a fixed host sets the curve, and two heights one unit apart solve the Markov equation with that host. Selected positions give integer triples. Reversing geometric descent gives an exact indexing of these triples. Remainder patterns, growth bounds, corridor paths, and Fibonacci-matrix and snake-graph arguments then restrict possible collisions. The Meridian description of starting scales and logarithmic spacing guided the organization of a large verification into magnitude bands. The implementation uses Farey addresses and certified matrix bounds to select each band; its correctness does not require the Meridian collision theorems. Production finished on 10 November 2026 at 03:54:13 UTC (9 November, 21:54:13 CST). The combined computation compared 1,101,388,071,945 configurations and certified uniqueness of the first one trillion Markov values in numerical order. The trillionth value has 1,021,609 decimal digits. All 12 repeated 64-bit residue groups were resolved by exact arithmetic, with no equal maxima. On eight workers, retained active band processing took 23 h 57 min 23.146 s, including the inherited 500-billion certificate; the maximum recorded temporary key-file footprint was 1,065,664,392 bytes (0.992 GiB). This elapsed processing time is distinct from summed CPU time and the calendar span. Both final replays passed. A separate computer-checked certificate covers all 5,067,077 Meridians of degree at most 10,000, at every integer phase. The general unicity problem remains open.

Author comments: Version 22 (12 November 2026), 44 pages: revised title and abstract, including the 1,021,609-digit trillionth value; added Arthur Baragar's 1996 benchmark (M < 10^140). The proofs, figures and verification evidence are unchanged. Chronology (distinct announcements and deposits): 21 October 2026, 15:18:25 UTC: X announcement of an earlier search exceeding one billion values: https://x.com/webystar/status/2112926487091282350 23 October 2026, 14:54:57.771 UTC: LinkedIn announcement of the earlier 9.3-billion search in 24 minutes: https://www.linkedin.com/posts/elleard-felix-webster-heffern-joseph-by-confirmation-2953a3104_markovnumbers-activity-7519411048115003392-4NaJ 2 November 2026: 50-billion verification and degree-10,000 computational supplements: https://zenodo.org/records/23874075 9 November 2026: selected full decimal expansions first deposited: https://zenodo.org/records/24093257 10 November 2026: v21 trillion-verification deposit (publication-date field: 9 November): https://zenodo.org/records/24096109 12 November 2026: corrected v22 manuscript; Zenodo DOI reserved (deposit pending): https://doi.org/10.5281/zenodo.24167894 12 November 2026: ResearchGate full-text mirroring began: https://www.researchgate.net/publication/417066856_Meridians_on_the_Markov_Surface_Growth_Structure_and_Verification_of_One_Trillion_Markov_Values_Using_Farey_Addresses The earlier X and LinkedIn announcements are not announcements of the trillion result. The source releases preserve the original verification timestamps and separate software licenses. The general unicity conjecture remains open.

A mix of human-written and AI-generated textHuman understanding: all partsFarey fractionsFrobenius conjectureMarkoff numbersMarkov numbersMarkov treeMarkov uniqueness conjectureMeridianscertified computationcomputational number theorysnake graphs
Nov 13, 202644 pages
PDFView work

cs.LO — Logic in Computer Science

Formal Verification of a Computer-Assisted Proof in Celestial Mechanics

Contributed by Tejasvi Singh Tomar

Albouy, Fu and Sun conjectured in 2008 that four positive masses admit, for each cyclic order of the bodies, exactly one convex central configuration up to similarity; the question is Problem 10 of a 2012 list of open problems on the nn-body problem. We recently proved the conjecture by reducing it to an inequality for a trace at the real zeros of an equation in four variables; a branch and bound that starts from a grid of 136,448 boxes establishes the inequality. In this paper we describe a formalization of the whole proof in Lean 4 and Mathlib in which Lean's kernel checks the computation, using decide +kernel, so that no compiler has to be trusted. Our checker stores an interval as two natural numbers in a biased fixed-point format. The kernel can then hand all the arithmetic to GMP. Functions are enclosed over boxes by first-order slopes. An unverified search records the decisions for each box in one natural number, and the checker replays them. We write each formula once over a type class; evaluating it at a type that pairs a real number with an interval then proves the enclosure correct. Checking the 3418 certificate theorems takes 7.6 hours of processor time, and the independent type checker nanoda accepts the proof. A version rebuilt on one eighth of the boxes passed three type checkers in 2.9 hours on a public registry of formal proofs.

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

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

cs.LO — Logic in Computer Science

Re-proving native_decide facts in Lean's kernel: a study of 16 public packages and a converter

Contributed by Tejasvi Singh Tomar

Lean's native_decide proves a decidable proposition by running compiled code and records the result as an axiom. Mathlib forbids such axioms, and lake check and Comparator in Lean 4.35 reject them, as do the independent proof checkers. NativeTrust re-proves the recorded facts in Lean's kernel, with only the standard axioms and without editing the projects that contain them. Where a definition blocks kernel evaluation and NativeTrust has a version proved equal to it (for example, a fuel-indexed form of well-founded recursion), the converter evaluates a copy that uses that version. It then proves the copy equal to the original, usually by congruence. With its default settings it converts 98.2% of 52,821 native facts in 16 public packages. The three largest packages hold 94% of these facts; outside them it converts 68.5%. Nearly every converted fact needed nothing beyond plain kernel evaluation. Two tools remove the native axioms that the kernel can prove within a budget: a single import that makes each call of the tactic try the kernel first, and a source rewriter.

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

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

math.NT — Number Theory

The classic enumeration of genera of even definite lattices

Contributed by Mathieu Dutour Sikiric

We revisit the enumeration of a genus of even positive definite lattices by Kneser neighbours, certified by the mass. We work at primes dividing the determinant, where the projective spaces are smallest, schedule the exploration of the neighbour graph by a random walk and by orders based on a Hecke bookkeeping, and compute canonical forms through the Weyl chamber of the root system. Genera of rank up to 19 with up to 40,617 classes are enumerated in minutes.

Author comments: 22 pages. The algorithms are implemented in the program GENUS_Enumerate of polyhedral_common, https://github.com/MathieuDutSik/polyhedral_common

A mix of human-written and AI-generated textHuman understanding: all partsHecke operatorsKneser neighbourscanonical formseven latticesgenus enumeration
Nov 12, 202622 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.CO — Combinatorics

Kernel Dimension of the Z/2 Connection Laplacian on a Finite Simple Graph (A Formalisation in Lean 4 / Mathlib v4.11.0)

Contributed by Jesus Vilela Jato

We present a Lean 4/Mathlib v4.11.0 formalization of the kernel-dimension theory of the Z/2\mathbb{Z}/2 connection Laplacian on finite simple graphs equipped with designated wrap edges. Each edge carries either the identity or the coordinate-swap matrix. A Hadamard–Kronecker change of basis decomposes the resulting rank-two connection Laplacian into the ordinary and signed graph Laplacians. An analogous splitting holds for the scalar Laplacian of the associated two-sheeted cover. A connected component is balanced precisely when its covering preimage has two connected components, equivalently when its sign holonomy is trivial along every closed walk. Consequently, the nullity of the signed Laplacian equals the number of balanced connected components, while the nullity of the full connection Laplacian equals the number of connected components plus the number of balanced components. For the flat connection, the nullity is twice the number of connected components. We also formalize exact characteristic polynomials and eigenvalue multisets, including multiplicities, for explicit ordinary and one-wrap signed cycle matrices for n≥3n \geq 3. Transfer to general connection-graph encodings remains conditional on specified matrix-reindexing identities. The contribution is a machine-checked formalization, exposition, and documented verification of results rooted in classical signed-graph spectral theory, rather than a claim of priority for those identities. The accompanying repository preserves proof artifacts, computational cross-checks, historical verification evidence, and documented corrections.

Primarily AI-generated textHuman understanding: some partsAI-assisted mathematicsLean 4connection Laplacianformal verificationgraph coverssigned graphsspectral graph theory
Nov 04, 202618 pages
PDFView work

cs.MS — Mathematical Software

Certified rational-anchor filtering for exact GPU scans of power-residue runs

Contributed by Brice Pouly

We study exact longest monochromatic runs of power-residue colourings, including neutral prefixes and least canonical witnesses. A certified rational cover represents every relevant interval inside a short signed character table. A reflection-compatible schedule retains an anchor; conservative filters reject only known contradictions, bilateral completion recovers the full run, and tie-preserving reduction selects its least witness. We prove this exact-success contract and describe its CUDA realization with separate arithmetic domains below 2322^{32} and 2332^{33}. On one RTX 5090, two reserved cohorts give ratios 24.0024.00 and 10.9510.95 of sums of hot per-prime medians against the identified historical dense engine. A separate batch study gives throughput factors 1.231.23-2.582.58 against an already optimized reference. The experiments have different timing boundaries and their factors are reported separately. Short-table multiplicative extraction has close algorithmic antecedents in cryptanalysis; our contribution is its certified organization for exhaustive maxima and witnesses and its measured implementation. Square-root-sized cover parameters do not give a general O(p)O(\sqrt p) running-time bound.

Primarily AI-generated textHuman understanding: no partsCUDANVIDIA RTX 5090SM120certified algorithmsexact GPU scansmultiplicative characterspower-residue runsrational-anchor filtering
Oct 20, 202621 pages
PDFView work

math.CT — Category Theory

The Grothendieck construction between the telescope monad and contextads

Contributed by Kotaro Kamiya

A telescope is a list of stages in which each stage is a family indexed over the Grothendieck construction of the previous ones. The telescope monad stacks stages as the free-monoid 2-monad on spans, whereas a contextad collapses two stages into one by a dependent sum. This paper derives both from the span of single stages, and thereby explains why the strict algebras of the telescope monad are contextads. The link is the Grothendieck extension of a span. Because it is monoidal and preserves coproducts, it turns the telescopes into the free monad on the extension of the span of stages and the stage contextad into the Grothendieck monad, whose Kleisli arrows are the contextful arrows. The main theorem identifies the stage contextad with the pseudo-algebra of the telescope monad transported from the display contextad. Its structure map is the dependent sum, which the extension turns into the iterated multiplication of the Grothendieck monad.

A mix of human-written and AI-generated textHuman understanding: some partsGrothendieck constructioncomprehension categorycontextaddependent sumtelescope
Oct 17, 202625 pages
PDFView work

cs.LO — Logic in Computer Science

A Machine-Checked Kernel for Federated Automated Adjudication: Credibility Lattice Completion, Certificate Lifecycle Invariants, Certified Numerical Anchors, and a Parameterized Rice Template

Contributed by Chepin Zhang

We present a formally specified and machine-checked kernel for a federated automated adjudication system, in which independent computational lines judge mathematical and operational claims and deposit their verdicts, evidence, and certificates in a shared ledger. The kernel comprises five components. (i) A three-rung, three-track credibility lattice obtained as a completion of a legacy five-element poset: the completion is justified by an exhaustive enumeration over all 11^{3}=1331 ordered triples and is fully re-formalized in Lean 4, where the equational lattice laws, the order axioms, and the extremality properties of join and meet are all proved by the decide procedure over the finite carrier. (ii) A five-state certificate lifecycle machine with nine legal transitions and machine-checked invariants, likewise re-formalized in Lean 4; the formalization caught a specification flaw in one invariant (the originally stated grant-gating condition is false), and we report the corrected, machine-proved form. (iii) Certified numerical anchors: uniqueness of the gauged fixed point of circulant entropic-optimal-transport (Sinkhorn) systems, established by a Krawczyk interval operator with outward rounding across a six-instance family (k in {6,10 }, varepsilon in {1,1/2,1/5 }, later extended to ten instances), together with a second anchor family of five auction-algorithm assignment instances certified by interval dual brackets. We state plainly that the certification of these numerical anchors is carried by the Python interval-arithmetic layer; the attempted port to the Lean 4 interval library leancert is blocked by structural capability boundaries of that library (absence of the logarithm from its supported expression grammar and infeasibility of its determinant computation at the required dimensions), and the Lean files are formal statements, not machine-verified certificates. (iv) A parameterized Lean 4 template for Rice-type undecidability, consisting of a bridge theorem, an extensionality lemma, an instantiation generator, and discharged instances of increasing difficulty. (v) A minimal trusted computing base result: the soundness of an interval certificate checker (accept implies correctness), itself machine-proved in Lean 4. All Lean artifacts were verified on cloud infrastructure (Axiom Axle, environment lean-4.28.0) under the strict verify_proof channel, with axiom audits restricted to propext, Classical.choice, and Quot.sound, and no sorryAx. Empirical fuzzing over three certificate families observed zero false accepts; we report rule-of-three 95% upper bounds on the false-accept rate and explicitly do not claim a guarantee.

Primarily AI-generated textHuman understanding: some partsLean 4Rice theoremfederated adjudicationformal verificationinterval arithmeticmachine-checked certificates
Oct 11, 202616 pages
PDFView work

math.LO — Logic

Finite Nash Equilibria and Dependent Mixed Strategies in Lean

Contributed by Arthur, David Barros Hulak, Ruy J. G. B. de Queiroz

We present two complementary Lean 4 developments of finite Nash equilibrium. The pure-game layer uses player-specific legal action sets, distinguishes one-way generalized ordinal potentials from bidirectional ordinal potentials, and proves potential-maximizer certificates, a local-maximum characterization, absence of strict-improvement cycles, and weak acyclicity. The mixed-game layers use either a common finite action type or a dependent finite action type for each player. They prove payoff equalization on equilibrium supports, Dirac payoff identities, continuity of the normalized payoff-excess map, and mixed equilibrium existence. We explain the finite-sum and sum-of-squares arguments and the reindexing bridge to an attributed, proved product-of-simplices Brouwer theorem. An additional legal-subtype interface is separated from the declarations selected by the registry comparator. The account is tied to two immutable source snapshots and dated verification records. It documents established mathematics and its formal interfaces, without claiming a new equilibrium theorem or formalization priority.

Primarily AI-generated textHuman understanding: some partsBrouwer fixed pointLean 4MathlibNash equilibriumdependent action typesmixed strategiespotential games
Oct 01, 20268 pages
PDFView work

math.OC — Optimization and Control

A Lean Formalization of Finite Zero Sum Minimax via Sion's Theorem

Contributed by Arthur, David Barros Hulak, Ruy J. G. B. de Queiroz

We describe a Lean 4 formalization of the minimax theorem for finite nonempty two-player zero-sum games with arbitrary real payoffs. Mixed strategies are probability vectors, and the two game values are defined using real indexed suprema and infima. An explicit payoff bound supplies the boundedness obligations required by these conditional extrema. The reverse minimax inequality follows by applying Mathlib's proved Sion saddle-point theorem to compact convex coordinate simplices, with the minimizing player placed in its first argument. We explain the representation bridge, the proof obligations, and the passage from a saddle point to equality. The accompanying version-pinned artifact separates a reusable library from a statement-only challenge and its proved solution. This is an exposition of a finite-game specialization of existing formal analysis, with no claim of a new mathematical proof or formalization priority.

Primarily AI-generated textHuman understanding: some partsLeanSion's theoremformalizationminimax theoremzero-sum games
Sep 30, 20267 pages
PDFView work