# Mathematics

Mathematics is a discipline whose discrete methods are used in computer science.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## A Little Advice Suffices: Diffie-Hellman Is as Hard as Discrete Logarithm

DevFeed: [A Little Advice Suffices: Diffie-Hellman Is as Hard as Discrete Logarithm](<https://devfeed.tech/articles/a-little-advice-suffices-diffie-hellman-is-as-hard-as-discrete-logarithm-141484.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.22290>)

Author: Yuwen Zhou

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [primes](<https://devfeed.tech/topics/primes.md>), [polynomials](<https://devfeed.tech/topics/polynomials.md>)

Tags: [advice](<https://devfeed.tech/tags/advice.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [diffie-hellman](<https://devfeed.tech/tags/diffie-hellman.md>), [discrete-logarithm](<https://devfeed.tech/tags/discrete-logarithm.md>), [math-nt](<https://devfeed.tech/tags/math-nt.md>), [number-theory](<https://devfeed.tech/tags/number-theory.md>)

### AI overview

The paper removes a 30-year smoothness assumption from a reduction showing that, with advice, computing Diffie-Hellman keys is as hard as computing discrete logarithms. For every prime p, an O(log p)-bit advice string depending only on p lets a Diffie-Hellman oracle compute discrete logarithms in every group of order p in polynomial time. The key input is a proof that every interval [x, x+x^θ], for θ>17/30, contains the expected number of integers smooth with bound (log x)^K, derived from a known zero-free half-plane for the Riemann zeta function. Orders of genus-2 Jacobians provide the auxiliary group. The same result removes the smoothness assumption in two related results and makes Wolf's characterization unconditional: generic equivalence holds exactly when the group order has no large repeated prime factor.

### Source excerpt

arXiv:2611.22290v1 Announce Type: cross Abstract: Is computing a Diffie-Hellman key as hard as computing a discrete logarithm? Maurer showed that it is, given a few bits of advice, provided that short intervals contain enough integers with only small prime factors; that proviso has stood for thirty years. We remove it. For every prime $p$ there is an advice string of $O(\log p)$ bits, depending only on $p$, with which discrete logarithms in every group of order $p$ are computed in polynomial time from a Diffie-Hellman oracle. The reduction is the classical one; what was missing was a proof that short intervals contain polylogarithmically smooth integers. We show that a zero-free half-plane for the Riemann zeta function, which is now known, gives the expected number of $(\log x)^K$-smooth integers in every interval $[x,x+x^\theta]$ with $\theta>17/30$. With smoothness this small the saddle point of the counting integral lies just to the left of the line $\mathrm{Re}\,s=1$, and a zero-free strip of any fixed width absorbs the shift once $K$ is large. Genus-2 Jacobians, whose orders fill such intervals, then turn one of these integers into the order of an auxiliary group. The same input removes the smoothness assumption from Maurer and Raub's impossibility of field-homomorphic one-way permutations and from the yes/no-query reduction of Koblitz, Menezes and Shparlinski. It also makes Wolf's characterisation unconditional: discrete logarithm and Diffie-Hellman are generically equivalent exactly when the group order has no large repeated prime factor.

## Func-JEPA: Learning a Sobolev Space of Functions as Latent Vectors

DevFeed: [Func-JEPA: Learning a Sobolev Space of Functions as Latent Vectors](<https://devfeed.tech/articles/func-jepa-learning-a-sobolev-space-of-functions-as-latent-vectors-137459.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19542>)

Author: Alejandro Moreno Arcas

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Representation learning](<https://devfeed.tech/topics/representation-learning.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>)

Tags: [architecture](<https://devfeed.tech/tags/architecture.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [composition](<https://devfeed.tech/tags/composition.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-na](<https://devfeed.tech/tags/cs-na.md>), [decoding](<https://devfeed.tech/tags/decoding.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [embedding](<https://devfeed.tech/tags/embedding.md>), [function](<https://devfeed.tech/tags/function.md>), [integration](<https://devfeed.tech/tags/integration.md>), [learning](<https://devfeed.tech/tags/learning.md>), [lightweight](<https://devfeed.tech/tags/lightweight.md>), [math-na](<https://devfeed.tech/tags/math-na.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [model](<https://devfeed.tech/tags/model.md>), [modules](<https://devfeed.tech/tags/modules.md>), [neural](<https://devfeed.tech/tags/neural.md>), [operator](<https://devfeed.tech/tags/operator.md>), [pretraining](<https://devfeed.tech/tags/pretraining.md>), [regression](<https://devfeed.tech/tags/regression.md>), [space](<https://devfeed.tech/tags/space.md>), [symbolic-regression](<https://devfeed.tech/tags/symbolic-regression.md>), [vectors](<https://devfeed.tech/tags/vectors.md>)

### AI overview

Func-JEPA (f-JEPA) pretrains a shared encoder on symbolic mathematical functions, with a latent space designed to imitate the Sobolev space H¹: latent norms are computed exactly from functions, while directions are learned to reflect Sobolev angles and differentiation acts as a learned latent operator. The frozen encoder is reused with lightweight modules for decoding, composition, integration, and regression from samples. In evaluations within and beyond the pretraining distribution, f-JEPA recovered exact formulas from noisy samples more often than the compared symbolic-regression methods. Computer algebra and task-specific models nevertheless remained stronger on standard integration and differential-equation benchmarks.

### Source excerpt

arXiv:2611.19542v1 Announce Type: cross Abstract: Pretraining an encoder once and reusing it across tasks is a widespread approach in vision and language. However, neural symbolic mathematics still trains a dedicated sequence-to-sequence model for each task, so that no representation of a function is shared. In this work, we propose the Function Joint-Embedding Predictive Architecture (Func-JEPA, abbreviated f-JEPA): an encoder of mathematical functions, pretrained on their symbolic form, whose latent space imitates the Sobolev space H^1 and in which differentiation is a learned latent operator. The norm of a latent is computed exactly from the function, whereas its direction is learned to match Sobolev angles. The frozen encoder is then reused by lightweight modules for decoding, composition, integration, and regression from samples. The representation and four downstream tasks are evaluated within and outside the pretraining distribution. f-JEPA recovers exact formulas from noisy samples more often than the compared symbolic-regression methods, whereas computer algebra and task-specific models remain stronger on standard integration and differential-equation benchmarks.

## Beyond Bounded Variance: Variance-Reduced Normalized Methods for Nonconvex Optimization under Blum-Gladyshev Noise

DevFeed: [Beyond Bounded Variance: Variance-Reduced Normalized Methods for Nonconvex Optimization under Blum-Gladyshev Noise](<https://devfeed.tech/articles/beyond-bounded-variance-variance-reduced-normalized-methods-for-nonconvex-optimization-under-blum-gladyshev-noise-132787.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2605.15314>)

Author: Antesh Upadhyay, Arda Fazla, Abolfazl Hashemi

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>)

Tags: [complexity](<https://devfeed.tech/tags/complexity.md>), [convergence](<https://devfeed.tech/tags/convergence.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [math-oc](<https://devfeed.tech/tags/math-oc.md>), [momentum](<https://devfeed.tech/tags/momentum.md>), [noise](<https://devfeed.tech/tags/noise.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [variance](<https://devfeed.tech/tags/variance.md>)

### AI overview

The paper studies nonconvex stochastic optimization when gradient variance may grow quadratically with distance from initialization, as allowed by the Blum-Gladyshev (BG-0) noise model. It proves that normalized momentum, using one stochastic gradient per iteration, reaches an ε-stationary point with optimal O(ε⁻⁶) complexity. Under mean-square smoothness, variance-reduced normalized STORM achieves minimax optimal O(ε⁻⁴) complexity. The analysis also extends to symmetric generalized smoothness, where local curvature can scale with gradient norm. The authors report these as the first convergence guarantees for normalized methods under BG-0 noise without bounded domains.

### Source excerpt

arXiv:2605.15314v2 Announce Type: replace Abstract: Stochastic optimization theory often assumes that gradient noise has uniformly bounded variance. However, this assumption can be inadequate even in simple settings; e.g., it does not hold for linear least squares regression. The Blum-Gladyshev ($\mathsf{BG}$-0) noise model instead allows the stochastic gradient variance to grow quadratically with the distance from the initialization and has recently been identified as the weakest known viable variance assumption. We study nonconvex stochastic optimization under $\mathsf{BG}$-0 noise and prove that normalized momentum converges with one stochastic gradient per iteration, reaching an $\varepsilon$-stationary point with the optimal $O(\varepsilon^{-6})$ complexity. We then show that, under mean-square smoothness, a variance-reduced normalized STORM method achieves the minimax optimal complexity of $O(\varepsilon^{-4})$. We further extend our analysis to the symmetric generalized smoothness framework, which captures objectives whose local curvature can scale with the gradient norm. To our knowledge, these are the first convergence guarantees for normalized methods in nonconvex stochastic optimization under $\mathsf{BG}$-0 noise without bounded domains.

## Accurate Predictions in Education with Discrete Variational Inference

DevFeed: [Accurate Predictions in Education with Discrete Variational Inference](<https://devfeed.tech/articles/accurate-predictions-in-education-with-discrete-variational-inference-128072.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2509.23484>)

Author: Tom Quilter (University of Manchester), Anastasia Ilick (Google DeepMind), Karen Poon (MathWorks), Richard Turner (University of Cambridge)

Published: 2026-11-11T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [VAE](<https://devfeed.tech/topics/vae.md>), [Inference](<https://devfeed.tech/topics/inference.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [ai](<https://devfeed.tech/tags/ai.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [education](<https://devfeed.tech/tags/education.md>), [inference](<https://devfeed.tech/tags/inference.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [matrix](<https://devfeed.tech/tags/matrix.md>), [modelling](<https://devfeed.tech/tags/modelling.md>), [models](<https://devfeed.tech/tags/models.md>), [novel](<https://devfeed.tech/tags/novel.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [theory](<https://devfeed.tech/tags/theory.md>)

### AI overview

The paper targets prediction of whether students will answer formal mathematics questions correctly, especially when training data are sparse. It reports an open dataset of professionally marked exam responses and an Item Response Theory framework with accuracy above 80%. Collaborative filtering with topic-level skill profiles found that a single latent ability parameter was sufficient for maximum predictive accuracy. The authors' discrete variational inference framework achieved their best results in low-data settings and outperformed the classical IRT and matrix factorization baselines they evaluated. The supplied text is an abstract, so it does not provide further methodological detail.

### Source excerpt

arXiv:2509.23484v3 Announce Type: replace Abstract: One of the largest drivers of social inequality is unequal access to personal tutoring, with wealthier individuals able to afford it, while the majority cannot. Affordable, effective AI tutors offer a scalable solution. We focus on adaptive learning, predicting whether a student will answer a question correctly, a key component of any effective tutoring system. Yet many platforms struggle to achieve high prediction accuracy, especially in data-sparse settings. To address this, we release the largest open dataset of professionally marked formal mathematics exam responses to date. We introduce a probabilistic modelling framework rooted in Item Response Theory (IRT) that achieves over 80 percent accuracy, setting a new benchmark for mathematics prediction accuracy of formal exam papers. Extending this, our collaborative filtering models incorporate topic-level skill profiles, but reveal a surprising and educationally significant finding, a single latent ability parameter alone is needed to achieve the maximum predictive accuracy. Our main contribution though is deriving and implementing a novel discrete variational inference framework, achieving our highest prediction accuracy in low-data settings and outperforming all classical IRT and matrix factorisation baselines.

## Axiom Math wants to keep AI slop out of mathematics

DevFeed: [Axiom Math wants to keep AI slop out of mathematics](<https://devfeed.tech/articles/axiom-math-wants-to-keep-ai-slop-out-of-mathematics-119227.md>)

Original publisher: [Read original article](<https://techcrunch.com/2026/11/05/axiom-math-wants-to-keep-ai-slop-out-of-mathematics/>)

Author: Aditya Mehta

Published: 2026-11-05T16:16:45Z

Content type: news

Language: en

Sources: [TechCrunch | AI News & Artificial Intelligence](<https://devfeed.tech/sources/techcrunch-ai-news-artificial-intelligence.md>)

Topics: [Lean](<https://devfeed.tech/topics/lean.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [Automated reasoning](<https://devfeed.tech/topics/automated-reasoning.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [ai-slop](<https://devfeed.tech/tags/ai-slop.md>), [algebraic-geometry](<https://devfeed.tech/tags/algebraic-geometry.md>), [axiom](<https://devfeed.tech/tags/axiom.md>), [formal-verification](<https://devfeed.tech/tags/formal-verification.md>), [formalized](<https://devfeed.tech/tags/formalized.md>), [libraries](<https://devfeed.tech/tags/libraries.md>), [math](<https://devfeed.tech/tags/math.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [slop](<https://devfeed.tech/tags/slop.md>), [startups](<https://devfeed.tech/tags/startups.md>), [tc](<https://devfeed.tech/tags/tc.md>), [verification](<https://devfeed.tech/tags/verification.md>)

### AI overview

Axiom Math says its agents formally verified the Stacks Project, translating about 7,654 pages into roughly 16 million lines of Lean code checked line by line by a proof assistant. Because the project's theorems and definitions depend on one another, the team had to preserve those connections. It organized agents with a loose hierarchy so they could identify tasks and work in parallel, and trained in-house models for mathematics. The verified library adds a foundation in algebraic geometry for researchers using Lean; Axiom argues that checked results can serve as reusable building blocks for future proofs and, eventually, software and scientific work. The article reports the company's claims and ambitions, not an independent assessment of the formalization or its broader applications.

### Source excerpt

As AI floods math with unchecked proofs, Axiom Math is betting on verification. The startup's AI agents just formally verified the Stacks Project, one of the field's biggest libraries.

## How I Used a Stock Market Theory to Predict Cellular Network Behavior

DevFeed: [How I Used a Stock Market Theory to Predict Cellular Network Behavior](<https://devfeed.tech/articles/how-i-used-a-stock-market-theory-to-predict-cellular-network-behavior-114858.md>)

Original publisher: [Read original article](<https://hackernoon.com/i-used-a-stock-market-theory-to-predict-cellular-network-behavior?source=rss>)

Author: Mithra K

Published: 2026-11-03T15:10:07Z

Content type: opinion

Language: en

Sources: [HackerNoon](<https://devfeed.tech/sources/hackernoon.md>)

Topics: [networking news](<https://devfeed.tech/topics/networking-news.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>)

Tags: [2016](<https://devfeed.tech/tags/2016.md>), [5g](<https://devfeed.tech/tags/5g.md>), [ai](<https://devfeed.tech/tags/ai.md>), [behavior](<https://devfeed.tech/tags/behavior.md>), [cellular](<https://devfeed.tech/tags/cellular.md>), [cellular-networks](<https://devfeed.tech/tags/cellular-networks.md>), [experiment](<https://devfeed.tech/tags/experiment.md>), [hackernoon-top-story](<https://devfeed.tech/tags/hackernoon-top-story.md>), [handoff-prediction](<https://devfeed.tech/tags/handoff-prediction.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [network](<https://devfeed.tech/tags/network.md>), [network-optimization](<https://devfeed.tech/tags/network-optimization.md>), [signal-processing](<https://devfeed.tech/tags/signal-processing.md>), [stock](<https://devfeed.tech/tags/stock.md>), [stock-market](<https://devfeed.tech/tags/stock-market.md>), [telecommunications](<https://devfeed.tech/tags/telecommunications.md>), [what-is-elliott-wave-principle](<https://devfeed.tech/tags/what-is-elliott-wave-principle.md>), [wireless](<https://devfeed.tech/tags/wireless.md>), [wireless-communication-systems](<https://devfeed.tech/tags/wireless-communication-systems.md>)

### AI overview

The paper applied Elliott wave pattern analysis to cellular network traffic to anticipate handoffs, treating crowd-driven surges in boundary crossings as structured time series. The author reports that the approach produced useful predictions alongside established methods and captured dynamics missed by signal-threshold methods in bursty, crowd-driven scenarios. It did not outperform conventional methods on every metric, and the excerpt gives no quantitative results. Published in 2016 after peer review, the study required formalizing pattern extraction and testing it against real traffic. The author's broader advice is to read beyond one's field, while grounding cross-disciplinary ideas in rigorous testing.

### Source excerpt

A wireless researcher applies Elliott wave mathematics -- born in stock markets -- to predict cellular handoffs, and shares what the experiment revealed.

## Can LLMs Reliably Grade Olympiad Proofs? A Study of Mathematical Verification with LLMs

DevFeed: [Can LLMs Reliably Grade Olympiad Proofs? A Study of Mathematical Verification with LLMs](<https://devfeed.tech/articles/can-llms-reliably-grade-olympiad-proofs-a-study-of-mathematical-verification-with-llms-103186.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.36767>)

Author: Azim Ospanov, Zijin Feng, Ding Ding, Chengwu Liu, Haoli Bai, Jiacheng Sun, Lifeng Shang, Farzan Farnia

Published: 2026-10-28T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [llm-reasoning](<https://devfeed.tech/topics/llm-reasoning.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>)

Tags: [bandit](<https://devfeed.tech/tags/bandit.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [llms](<https://devfeed.tech/tags/llms.md>), [multi-armed-bandit](<https://devfeed.tech/tags/multi-armed-bandit.md>), [proofs](<https://devfeed.tech/tags/proofs.md>), [study](<https://devfeed.tech/tags/study.md>), [trojan](<https://devfeed.tech/tags/trojan.md>), [verification](<https://devfeed.tech/tags/verification.md>)

### AI overview

The study finds that current LLMs still have substantial room to improve at grading Olympiad proofs. It introduces an expert-graded dataset of USAMO 2025 candidate solutions and evaluates 20 models across seven metrics, two prompt styles, three inference methods, and three prompt templates. The authors also propose TROJAN, an iterative self-critique pipeline for generating adversarial proofs, and MABGrader, which treats grading as selecting among discrete scores. MABGrader outperforms ProofGrader by 26.4% in Quadratic Weighted Kappa and reduces grading error by 14%. These findings are based on the abstract; it does not provide further methodological or result details.

### Source excerpt

arXiv:2610.36767v1 Announce Type: new Abstract: Large Language Models (LLMs) have made remarkable progress on solving competition-level mathematics, yet their ability to verify natural-language mathematical proofs remains relatively underexplored. This gap is especially pronounced for Olympiad-level proofs, which require meticulous assessment of each claim in a long reasoning chain. Current proof verification thus primarily relies on expert inspection, which is costly to scale. In this paper, we present a systematic study of LLM-based verification in this setting. Specifically, we introduce a human-curated dataset of USAMO 2025 candidate solutions with expert grading, and conduct a broad evaluation of existing LLM verifiers across frontier models. We also propose TROJAN, an iterative self-critique pipeline for generating high-fidelity adversarial proofs at scale. Our comprehensive evaluation covers 20 models spanning seven metrics, two prompt styles, three inference methods, and three prompt templates, showing that state-of-the-art models still leave considerable room for improvement. To narrow this gap, we propose MABGrader, a Multi-Armed Bandit framework that reframes grading as arm selection over the discrete score space. MABGrader outperforms the SOTA ProofGrader by 26.4% in Quadratic Weighted Kappa and reduces grading error by 14%. Code and dataset are available at https://github.com/aziksh-ospanov/TROJAN.

## Bounds on polynomial approximations of the discrete logarithm function

DevFeed: [Bounds on polynomial approximations of the discrete logarithm function](<https://devfeed.tech/articles/bounds-on-polynomial-approximations-of-the-discrete-logarithm-function-101398.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.33452>)

Author: Swastik Kopparty, Rishabh Kothary, Ashutosh Shankar

Published: 2026-10-27T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [computational complexity](<https://devfeed.tech/topics/computational-complexity.md>), [polynomials](<https://devfeed.tech/topics/polynomials.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>)

Tags: [additive-combinatorics](<https://devfeed.tech/tags/additive-combinatorics.md>), [cs-cc](<https://devfeed.tech/tags/cs-cc.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [decoding](<https://devfeed.tech/tags/decoding.md>), [discrete-logarithm](<https://devfeed.tech/tags/discrete-logarithm.md>), [error-correcting-codes](<https://devfeed.tech/tags/error-correcting-codes.md>), [polynomials](<https://devfeed.tech/tags/polynomials.md>)

### AI overview

The paper sharpens bounds on polynomial agreement with the discrete logarithm over \(\mathbb{F}_p\). For univariate polynomials of degree at most \(D\), it replaces the Coppersmith-Shparlinski bound \(\sqrt{2Dp}\) with \((1+o(1))\sqrt{Dp}\), retaining nontrivial bounds even when \(D>p/2\). The authors identify this as the Johnson bound and use a connection to list decoding alongside combinatorial arguments. For linear polynomials, they further reduce the bound from order \(\sqrt p\) to \(O(p^{2/5})\), using the sum-product phenomenon. They also improve bounds for bivariate polynomials vanishing on points \((x,\mathrm{dlog}(x))\), with results approaching the analogous Johnson bound.

### Source excerpt

arXiv:2610.33452v1 Announce Type: cross Abstract: We revisit a classical result of Coppersmith and Shparlinski showing bounds on how well polynomials can approximate the discrete log function. They showed that for any univariate polynomial $f(X) \in \mathbb{F}_p[X]$ with $deg(f) \leq D$, we have: $$ |\{ x \in \mathbb{F}_p^\times \mid f(x) = dlog(x) \}| \leq \sqrt{2 D p}.$$ We show two improvements: (1) For all $D$, we improve the upper bound above to $(1+o(1)) \cdot \sqrt{Dp}$. In particular, we give nontrivial upper bounds on the approximation even for $D > p/2$. This new upper bound is the Johnson bound from the theory of list-decoding of error-correcting codes, and in fact our proof uses a connection to that problem, as well as other combinatorial ideas. (2) For $D = 1$, where both the above bounds are $O(\sqrt{p})$, we give an asymptotically improved upper bound of $O(p^{2/5})$. This is based on the sum-product phenomenon of additive combinatorics. We also improve the [CS00] bounds on the number of points of the form $(x, dlog(x)) \in \mathbb{F}_p^2$ that any bivariate polynomial $Q(X,Y) \in \mathbb{F}_p[X,Y]$ with $deg(Q) \leq D$ can vanish on, with our new bounds approaching the analogue of the Johnson bound for this problem.

## Trajectory Matching: Discrete Flow Matching with Structured Actions

DevFeed: [Trajectory Matching: Discrete Flow Matching with Structured Actions](<https://devfeed.tech/articles/trajectory-matching-discrete-flow-matching-with-structured-actions-99636.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.32602>)

Author: Niklas Kemper, Marten Lienen, David L\\"udke, Stephan G\\"unnemann

Published: 2026-10-26T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>)

Tags: [actions](<https://devfeed.tech/tags/actions.md>), [complex](<https://devfeed.tech/tags/complex.md>), [component](<https://devfeed.tech/tags/component.md>), [components](<https://devfeed.tech/tags/components.md>), [conditional](<https://devfeed.tech/tags/conditional.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [design](<https://devfeed.tech/tags/design.md>), [edge](<https://devfeed.tech/tags/edge.md>), [extension](<https://devfeed.tech/tags/extension.md>), [flow-matching](<https://devfeed.tech/tags/flow-matching.md>), [fragment](<https://devfeed.tech/tags/fragment.md>), [generation](<https://devfeed.tech/tags/generation.md>), [graph](<https://devfeed.tech/tags/graph.md>), [growth](<https://devfeed.tech/tags/growth.md>), [hierarchy](<https://devfeed.tech/tags/hierarchy.md>), [incident](<https://devfeed.tech/tags/incident.md>), [independent](<https://devfeed.tech/tags/independent.md>), [linking](<https://devfeed.tech/tags/linking.md>), [modeling](<https://devfeed.tech/tags/modeling.md>), [multiple](<https://devfeed.tech/tags/multiple.md>), [structured](<https://devfeed.tech/tags/structured.md>)

### AI overview

Trajectory matching addresses a limitation of discrete flow matching (DFM), where endpoint conditioning leaves the intermediate action sequence unspecified and makes complex, non-factorizable actions difficult to model. It conditions the flow on a full action sequence, enabling simulation-free training targets for actions that change state size, affect multiple components, or depend on earlier actions. The authors prove the objective recovers the marginal flow and strictly subsumes factorized DFM. On tree and molecular graph generation, domain-aligned actions matched or surpassed factorized DFM baselines; reported MOSES validity rose from 92.8% to 99.2%. The method also transferred without retraining to substructure extension and linking.

### Source excerpt

arXiv:2610.32602v1 Announce Type: new Abstract: The natural units of structured discrete generation are often not independent single-component edits but richer actions: attaching a fragment to a molecule, inserting a node together with an incident edge, or growing a hierarchy by adding a child. Yet most existing discrete flow matching methods (DFM) are restricted to independent component-wise edits over fixed-size states. This restriction stems from endpoint conditioning: endpoints fix the source and target during training but not the action sequence between them, making tractable conditional rates hard to define for complex actions that cannot be factorized component-wise. We propose trajectory matching, which conditions the flow on a full sequence of actions connecting the endpoints. This yields principled, simulation-free training targets for user-defined action spaces, including actions that change state size, modify multiple components, or depend on earlier actions. We prove that the resulting objective recovers the marginal flow and that trajectory matching strictly subsumes factorized DFM, while additionally capturing actions with prerequisite structure such as hierarchy growth or fragment-based molecule generation. Empirically, on tree and molecular graph generation, trajectory matching with domain-aligned actions matches or surpasses factorized DFM baselines (lifting MOSES validity from 92.8% to 99.2%) and transfers without retraining to substructure extension and linking. Trajectory matching enlarges the design space of discrete flow matching by turning the action vocabulary into a modeling choice. An interactive explanation of trajectory matching is available at https://niklaskemper.com/blog/trajectory-matching/.

## Solving a 31-year-old grand challenge in mathematics - the KLS conjecture

DevFeed: [Solving a 31-year-old grand challenge in mathematics - the KLS conjecture](<https://devfeed.tech/articles/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture-92996.md>)

Original publisher: [Read original article](<https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/>)

Author: Xinzhi Zhang

Published: 2026-10-21T16:00:00Z

Content type: news

Language: en

Sources: [Microsoft Research](<https://devfeed.tech/sources/microsoft-research.md>)

Topics: [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>), [Parallel reasoning](<https://devfeed.tech/topics/parallel-reasoning.md>), [Automated reasoning](<https://devfeed.tech/topics/automated-reasoning.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [agent](<https://devfeed.tech/tags/agent.md>), [agentic](<https://devfeed.tech/tags/agentic.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [ai-collaboration](<https://devfeed.tech/tags/ai-collaboration.md>), [ai-models](<https://devfeed.tech/tags/ai-models.md>), [ai-systems](<https://devfeed.tech/tags/ai-systems.md>), [ai-tools](<https://devfeed.tech/tags/ai-tools.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [breakthrough](<https://devfeed.tech/tags/breakthrough.md>), [central](<https://devfeed.tech/tags/central.md>), [computing](<https://devfeed.tech/tags/computing.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [research](<https://devfeed.tech/tags/research.md>), [research-blog](<https://devfeed.tech/tags/research-blog.md>), [science](<https://devfeed.tech/tags/science.md>), [spaces](<https://devfeed.tech/tags/spaces.md>), [theoretical](<https://devfeed.tech/tags/theoretical.md>)

### AI overview

The authors report proving the Kannan-Lovász-Simonovits conjecture, showing that for log-concave distributions the best flat cut captures the narrowest bottleneck within a universal constant, independent of dimension. Their proof repeatedly applies a recursive refinement and shows that the errors remain bounded. AI agents explored more than 100 candidate approaches and helped with derivations and checks; researchers selected the promising ideas and built and verified the proof. Unguided attempts with leading models, using roughly the same total token budget, did not solve the problem. The text reports parallel independent proofs and a Lean 4 formalization as additional validation, and says the authors plan to release a streamlined proof after final review.

### Source excerpt

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan-Lovász-Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional [...] The post Solving a 31-year-old grand challenge in mathematics - the KLS conjecture appeared first on Microsoft Research.

## Sharing AI progress in mathematics

DevFeed: [Sharing AI progress in mathematics](<https://devfeed.tech/articles/sharing-ai-progress-in-mathematics-66368.md>)

Original publisher: [Read original article](<https://openai.com/index/sharing-ai-progress-in-mathematics>)

Published: 2026-10-06T12:00:00Z

Content type: release

Language: en

Sources: [OpenAI News](<https://devfeed.tech/sources/openai-news.md>)

Topics: [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Lean](<https://devfeed.tech/topics/lean.md>), [Frontier AI](<https://devfeed.tech/topics/frontier-ai.md>)

Tags: [research](<https://devfeed.tech/tags/research.md>)

### AI overview

OpenAI says it is sharing mathematical results from an internal frontier model to help researchers examine and build on them. The GitHub repository includes Lean formalizations for many proofs, with more to come, plus reasoning summaries, estimates of compute use, and statistics on attempted problems; the average result used compute equivalent to about three hours of ChatGPT Pro thinking. The post says the release follows advice from an independent IAS advisory group and includes protocols for paper revisions and citations, while OpenAI explores community-hosted alternatives. It also announces a $5 million Simons Foundation initiative for workshops, conferences, and programs, alongside model and computing access for supported researchers. OpenAI says it will continue improving presentation and disclosure practices and is working toward responsibly releasing the model.

### Source excerpt

OpenAI publishes new results on open problems in mathematics from an internal frontier model and shares Lean proof formalizations and research details on GitHub.

## Graph Theory for Visual Learners: Video Teaser and Course Topics

DevFeed: [Graph Theory for Visual Learners: Video Teaser and Course Topics](<https://devfeed.tech/articles/this-week-at-the-palindrome-59759.md>)

Original publisher: [Read original article](<https://thepalindrome.org/p/this-week-at-the-palindrome-5f0>)

Author: Tivadar Danka

Published: 2026-09-25T09:13:01Z

Content type: article

Language: en

Sources: [The Palindrome](<https://devfeed.tech/sources/the-palindrome.md>)

Topics: [Graphs](<https://devfeed.tech/topics/graphs.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [animations](<https://devfeed.tech/topics/animations.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>)

Tags: [animation](<https://devfeed.tech/tags/animation.md>), [breadth-first-search](<https://devfeed.tech/tags/breadth-first-search.md>), [connectivity](<https://devfeed.tech/tags/connectivity.md>), [depth-first-search](<https://devfeed.tech/tags/depth-first-search.md>), [educational](<https://devfeed.tech/tags/educational.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graph-theory](<https://devfeed.tech/tags/graph-theory.md>), [hamiltonian](<https://devfeed.tech/tags/hamiltonian.md>), [visualization](<https://devfeed.tech/tags/visualization.md>)

### AI overview

The Palindrome previews an upcoming Graph Theory for Visual Learners video, describing its visualizations, custom animation engine, and planned coverage of graph modeling, definitions, connectivity, and graph-search algorithms.

### Source excerpt

Teaser: Graph Theory for Visual Learners

## How I Vibed a Proof of Conway's Conjecture

DevFeed: [How I Vibed a Proof of Conway's Conjecture](<https://devfeed.tech/articles/how-i-vibed-a-proof-of-conway-s-conjecture-55068.md>)

Original publisher: [Read original article](<https://overreacted.io/how-i-vibed-a-proof-of-conways-conjecture/>)

Published: 2026-09-18T00:00:00Z

Content type: article

Language: en

Sources: [Dan Abramov](<https://devfeed.tech/sources/dan-abramov.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Lean](<https://devfeed.tech/topics/lean.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [Claude](<https://devfeed.tech/topics/claude.md>), [Frontier Model](<https://devfeed.tech/topics/frontier-model.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [claude](<https://devfeed.tech/tags/claude.md>), [frontier-model](<https://devfeed.tech/tags/frontier-model.md>), [math](<https://devfeed.tech/tags/math.md>)

### AI overview

An amateur mathematician describes using Claude and Lean to develop a mechanically checked proof of Conway's refinement conjecture involving surreal numbers. The proof has not been independently verified, and the author invites refutation.

### Source excerpt

You can just prove things, apparently.

## Fun with slope fields, css and react

DevFeed: [Fun with slope fields, css and react](<https://devfeed.tech/articles/fun-with-slope-fields-css-and-react-27377.md>)

Original publisher: [Read original article](<http://engineering.khanacademy.org/posts/fun-with-slopfields.htm>)

Author: Khan Academy

Published: 2015-08-05T22:00:00Z

Content type: article

Language: en

Sources: [Khan Academy](<https://devfeed.tech/sources/khan-academy.md>)

Topics: [React](<https://devfeed.tech/topics/react.md>), [CSS](<https://devfeed.tech/topics/css.md>), [web animation](<https://devfeed.tech/topics/web-animation.md>), [Web Development](<https://devfeed.tech/topics/web-development.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [User Experience](<https://devfeed.tech/topics/user-experience.md>)

Tags: [css](<https://devfeed.tech/tags/css.md>), [design](<https://devfeed.tech/tags/design.md>), [engineering](<https://devfeed.tech/tags/engineering.md>), [news](<https://devfeed.tech/tags/news.md>), [react](<https://devfeed.tech/tags/react.md>)

### AI overview

With only three days to build a celebratory LearnStorm notification for invited students, Marcos Ojeda reused the contest's slope field identity and made it feel animated without large GIF or video assets. After exploring slope fields through differential equations, he used the equation y' = x + y to create a rotating dart pattern. Each dart shares one CSS animation that rotates 2π; a computed animation delay based on its grid coordinates staggers the darts. A small React component generates the grid and per-dart styles, replacing an initial, unwieldy array of precomputed offsets. The banner sits above the animation, which gradually settles into the pattern. The author's takeaway is that early prototyping and parameterization can reveal ways to create procedural animation despite CSS constraints; the same approach could also be implemented with D3, jQuery, or Handlebars.

### Source excerpt

By Marcos Ojeda A while ago, we needed to send out a notification to all our LearnStorm winners ... Read more

## iGaming Fraud Prevention: Key Strategies to Implement

DevFeed: [iGaming Fraud Prevention: Key Strategies to Implement](<https://devfeed.tech/articles/igaming-fraud-prevention-key-strategies-to-implement-20431.md>)

Original publisher: [Read original article](<https://sift.com/blog/implement-igaming-fraud-prevention/>)

Author: Ben Price

Published: 2026-09-14T21:00:00Z

Content type: article

Language: en

Sources: [Sift Science](<https://devfeed.tech/sources/sift-science.md>)

Topics: [Security, Privacy and Abuse Prevention](<https://devfeed.tech/topics/security-privacy-and-abuse-prevention.md>), [Exploit](<https://devfeed.tech/topics/exploit.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>)

Tags: [2025](<https://devfeed.tech/tags/2025.md>), [2026](<https://devfeed.tech/tags/2026.md>), [acquisition](<https://devfeed.tech/tags/acquisition.md>), [bonus-abuse](<https://devfeed.tech/tags/bonus-abuse.md>), [customer](<https://devfeed.tech/tags/customer.md>), [fraud-prevention](<https://devfeed.tech/tags/fraud-prevention.md>), [gaming-fraud](<https://devfeed.tech/tags/gaming-fraud.md>), [igaming](<https://devfeed.tech/tags/igaming.md>), [igaming-fraud](<https://devfeed.tech/tags/igaming-fraud.md>), [igaming-fraud-prevention](<https://devfeed.tech/tags/igaming-fraud-prevention.md>), [industrial](<https://devfeed.tech/tags/industrial.md>), [marketing](<https://devfeed.tech/tags/marketing.md>), [multi-account-abuse](<https://devfeed.tech/tags/multi-account-abuse.md>), [multi-accounting-detection](<https://devfeed.tech/tags/multi-accounting-detection.md>), [multi-accounting-fraud](<https://devfeed.tech/tags/multi-accounting-fraud.md>), [network](<https://devfeed.tech/tags/network.md>), [prevent-fraud](<https://devfeed.tech/tags/prevent-fraud.md>), [revenue](<https://devfeed.tech/tags/revenue.md>), [synthetic](<https://devfeed.tech/tags/synthetic.md>), [time](<https://devfeed.tech/tags/time.md>), [trust-and-safety](<https://devfeed.tech/tags/trust-and-safety.md>), [verification](<https://devfeed.tech/tags/verification.md>), [volume](<https://devfeed.tech/tags/volume.md>)

### AI overview

This article explains how bonus abuse and multi-accounting have become major sources of iGaming fraud. It describes fraudsters exploiting promotional offers through repeated registrations, synthetic identities, stolen credentials, device farms, residential proxies, and synthetic documents, and argues that operators should justify prevention spending by measuring protected revenue.

### Source excerpt

While every operator budgets for promotions as a customer acquisition cost, very few budget for the version of that cost that never converts into a real player. Bonus abuse and multi-accounting now account for the single largest fraud category in iGaming, making up 64% of fraud according to a recent study. But unlike chargebacks or [...] The post iGaming Fraud Prevention: Key Strategies to Implement appeared first on Sift.

## AI is breaking our proxies for expertise

DevFeed: [AI is breaking our proxies for expertise](<https://devfeed.tech/articles/ai-is-breaking-our-proxies-for-expertise-54681.md>)

Original publisher: [Read original article](<https://seangoedecke.com/ai-is-breaking-our-proxies-for-expertise/>)

Published: 2026-09-13T00:00:00Z

Content type: opinion

Language: en

Sources: [Sean Goedecke](<https://devfeed.tech/sources/seangoedecke-com-rss-feed.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>)

### AI overview

The article examines how AI's success in solving prestigious mathematical problems may disrupt traditional proxies for expertise. It distinguishes puzzle-solving from idea-generating mathematics and argues that this distinction can clarify AI's effects on other fields.

### Source excerpt

Mathematicians are broadly not anti-AI. They're more culturally open to using AI as a tool than, say, artists or writers1. However, now that more and more genuinely prestigious problems have fallen to AI, that might be changing. Almost five thousand mathematicians (including twenty-five Fields medalists) have signed a declaration called A Severe Misalignment of AI in Mathematics. The core argument goes something like this: In recent months, the success of AI in solving major mathematical problems has made headlines even outside mathematical circles. But solving problems is only a tool and proxy for achieving the primary goal of conceptual understanding and insight. Forgetting this in the world of AI may turn the tool against the primary goal. Indeed, the mass production at faster and faster pace of "true/false" statements could destroy fertile ground instead of breathing life into new ideas. A lot of people online have interpreted this as the expected complaint from any field that gets automated: translators did it, artists and programmers have been doing it, and now it's the turn of the mathematicians. I think this is too dismissive. Understanding the concrete problem mathematicians are upset about can help us better understand the impact of AI on our own fields, and what we'll have to do about it. Puzzle-solving and idea-generating There are two types of mathematics. Most people are familiar with the first, which we might call "puzzle-solving": you take a problem and try to find a solution to it. When you're a student, these problems are typically easy, like simplifying some algebraic expression. When you're a researcher, these problems can be nearly impossible, like proving Fermat's Last Theorem. Puzzle-solving is easy to understand but hard to do, which makes it impressive to non-mathematicians, which makes it highly prestigious. In other words, puzzle-solving is legible. The second type of mathematics is "idea-generating": coming up with new ways of thinking ab

## The Palindrome Announces a Graph Theory for Visual Learners Video Course

DevFeed: [The Palindrome Announces a Graph Theory for Visual Learners Video Course](<https://devfeed.tech/articles/you-asked-for-graph-theory-i-m-going-all-in-38820.md>)

Original publisher: [Read original article](<https://thepalindrome.org/p/you-asked-for-graph-theory-im-going>)

Author: Tivadar Danka

Published: 2026-09-12T08:47:28Z

Content type: opinion

Language: en

Sources: [The Palindrome](<https://devfeed.tech/sources/the-palindrome.md>)

Topics: [Graphs](<https://devfeed.tech/topics/graphs.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>)

Tags: [graph](<https://devfeed.tech/tags/graph.md>), [graph-theory](<https://devfeed.tech/tags/graph-theory.md>), [subscriber](<https://devfeed.tech/tags/subscriber.md>), [video](<https://devfeed.tech/tags/video.md>)

### AI overview

The Palindrome announces a planned comprehensive graph theory video course called "Graph Theory for Visual Learners" and launches a support campaign for paid subscribers and founding members. The project will use custom animations and include an upcoming video release.

### Source excerpt

I'm creating The Palindrome's most ambitious video yet. Become a paid subscriber and be part of it.

## AI and the Future of Mathematical Research

DevFeed: [AI and the Future of Mathematical Research](<https://devfeed.tech/articles/the-four-colour-theorem-was-only-the-start-29430.md>)

Original publisher: [Read original article](<https://lemire.me/blog/2026/09/11/the-four-colour-theorem-was-only-the-start/>)

Author: Daniel Lemire

Published: 2026-09-11T19:53:31Z

Content type: opinion

Language: en

Sources: [Daniel Lemire](<https://devfeed.tech/sources/daniel-lemire.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [OpenAI](<https://devfeed.tech/topics/openai.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [math](<https://devfeed.tech/tags/math.md>), [openai](<https://devfeed.tech/tags/openai.md>)

### AI overview

An opinion piece considers mathematicians' concerns that AI-driven advances could affect mathematical training, understanding, attribution, and the role of human researchers. The author argues that mathematics may continue in a different form rather than disappear.

### Source excerpt

Mathematicians are unhappy about OpenAI. Several influential mathematicians wrote an open letter. The gist of their argument is that they form a community that trains young people. When AI started producing breakthroughs on hard mathematical problems, I asked what a very smart 17-year-old would feel. Do you still choose a math major and train yourself ... Continue reading The four-colour theorem was only the start

## MSVC C++23: constexpr cmath with LLVM Libc

DevFeed: [MSVC C++23: constexpr cmath with LLVM Libc](<https://devfeed.tech/articles/msvc-c-23-constexpr-cmath-with-llvm-libc-2960.md>)

Original publisher: [Read original article](<https://devblogs.microsoft.com/cppblog/msvc-c23-constexpr-cmath-with-llvm-libc/>)

Author: Cody Miller

Published: 2026-09-10T21:19:59Z

Content type: article

Language: en

Sources: [C++ Team Blog](<https://devfeed.tech/sources/c-team-blog.md>)

Topics: [MSVC](<https://devfeed.tech/topics/msvc.md>), [C++](<https://devfeed.tech/topics/c-plus-plus.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>)

Tags: [c-plus-plus](<https://devfeed.tech/tags/c-plus-plus.md>), [feature](<https://devfeed.tech/tags/feature.md>), [llvm](<https://devfeed.tech/tags/llvm.md>), [math](<https://devfeed.tech/tags/math.md>), [msvc](<https://devfeed.tech/tags/msvc.md>), [os](<https://devfeed.tech/tags/os.md>), [performance](<https://devfeed.tech/tags/performance.md>), [tools](<https://devfeed.tech/tags/tools.md>), [visual-studio](<https://devfeed.tech/tags/visual-studio.md>)

### AI overview

MSVC is preparing an experimental C++23 implementation of compile-time-evaluable standard math functions, powered by a new math library. The article explains the existing UCRT math-function arrangement and concerns about accuracy, compatibility, performance, and OS-dependent behavior.

### Source excerpt

Proposal P0533R9 made numerous math functions in the standard library compile-time evaluable in C++23. Implementing the feature required a good bit of time and effort, but MSVC is preparing its experimental implementation for the 14.52 build tools (compiler version 19.52)! We are still refining the feature, so expect the dust to settle only when this [...] The post MSVC C++23: constexpr cmath with LLVM Libc appeared first on C++ Team Blog.

## OpenAI claims its AI system generated a formally verified proof about the Navier-Stokes problem

DevFeed: [OpenAI claims its AI system generated a formally verified proof about the Navier-Stokes problem](<https://devfeed.tech/articles/explained-with-graphics-the-epic-math-problem-openai-claims-to-have-solved-56462.md>)

Original publisher: [Read original article](<https://indianexpress.com/article/technology/artificial-intelligence/openai-ai-solves-navier-stokes-problem-10869826/>)

Author: Tech Desk

Published: 2026-09-09T08:33:14Z

Content type: news

Language: en

Sources: [Technology | The Indian Express](<https://devfeed.tech/sources/technology-the-indian-express.md>)

Topics: [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [OpenAI](<https://devfeed.tech/topics/openai.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [AI Research](<https://devfeed.tech/topics/ai-research.md>), [Lean](<https://devfeed.tech/topics/lean.md>)

Tags: [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-generated-proof](<https://devfeed.tech/tags/ai-generated-proof.md>), [ai-mathematics](<https://devfeed.tech/tags/ai-mathematics.md>), [ai-model](<https://devfeed.tech/tags/ai-model.md>), [ai-solves-math-problem](<https://devfeed.tech/tags/ai-solves-math-problem.md>), [ai-solves-navier-stokes-problem](<https://devfeed.tech/tags/ai-solves-navier-stokes-problem.md>), [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [clay-mathematics-institute](<https://devfeed.tech/tags/clay-mathematics-institute.md>), [fluid-dynamics](<https://devfeed.tech/tags/fluid-dynamics.md>), [lean](<https://devfeed.tech/tags/lean.md>), [math](<https://devfeed.tech/tags/math.md>), [mathematical-breakthrough](<https://devfeed.tech/tags/mathematical-breakthrough.md>), [mathematical-proof](<https://devfeed.tech/tags/mathematical-proof.md>), [millennium-prize-problems](<https://devfeed.tech/tags/millennium-prize-problems.md>), [navier-stokes-equations](<https://devfeed.tech/tags/navier-stokes-equations.md>), [navier-stokes-problem](<https://devfeed.tech/tags/navier-stokes-problem.md>), [navier-stokes-solution](<https://devfeed.tech/tags/navier-stokes-solution.md>), [openai](<https://devfeed.tech/tags/openai.md>), [openai-ai-breakthrough](<https://devfeed.tech/tags/openai-ai-breakthrough.md>), [openai-navier-stokes](<https://devfeed.tech/tags/openai-navier-stokes.md>), [openai-navier-stokes-problem](<https://devfeed.tech/tags/openai-navier-stokes-problem.md>), [technology](<https://devfeed.tech/tags/technology.md>), [technology-artificial-intelligence](<https://devfeed.tech/tags/technology-artificial-intelligence.md>)

### AI overview

OpenAI claims that an internal AI system generated a proof concerning the Navier-Stokes existence and smoothness problem, a long-standing Millennium Prize mathematics problem. The article says the proof was formally verified with Lean and involved thousands of AI agents.

### Source excerpt

OpenAI said its AI system had solved the 90-year-old Navier-Stokes problem - one of mathematics' most challenging unanswered questions.

## Quoting Terence Tao

DevFeed: [Quoting Terence Tao](<https://devfeed.tech/articles/quoting-terence-tao-31186.md>)

Original publisher: [Read original article](<https://simonwillison.net/2026/Sep/9/terence-tao/>)

Author: Simon Willison

Published: 2026-09-09T00:20:17Z

Content type: opinion

Language: en

Sources: [Simon Willison's Weblog](<https://devfeed.tech/sources/simon-willison-s-weblog.md>)

Topics: [ai-ethics](<https://devfeed.tech/topics/ai-ethics.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ai-2-236](<https://devfeed.tech/tags/ai-2-236.md>), [ai-ethics](<https://devfeed.tech/tags/ai-ethics.md>), [ai-ethics-343](<https://devfeed.tech/tags/ai-ethics-343.md>), [ethics](<https://devfeed.tech/tags/ethics.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [mathematics-22](<https://devfeed.tech/tags/mathematics-22.md>)

### AI overview

The article quotes Terence Tao on the risk that AI-powered efforts could rapidly exhaust promising open mathematical problems after even rumors of active research become public. It argues that these incentives may discourage researchers from sharing directions openly, potentially harming long-standing traditions of open science and the future of the field.

### Source excerpt

I wrote recently about how the collection of good, fruitful open problems is now being mined in a non-renewable fashion, leading to the potential scenario of these problems becoming scarce. [...] We have now seen that even the rumor of someone working on a problem can trigger a massive amount of AI-powered effort to flatten it before the original research project has time to reach its full potential. The incentives may now be pointing in the direction of no longer sharing any promising research directions with the broader community, which would reverse centuries of traditions of open science and do serious long-term damage to the future of the field. -- Terence Tao Tags: ai-ethics, mathematics, ai

## Some thoughts on the Navier-Stokes Millennium Prize Problem

DevFeed: [Some thoughts on the Navier-Stokes Millennium Prize Problem](<https://devfeed.tech/articles/some-thoughts-on-the-navier-stokes-millennium-prize-problem-30512.md>)

Original publisher: [Read original article](<https://simonwillison.net/2026/Sep/8/on-navier-stokes/>)

Author: Simon Willison

Published: 2026-09-08T23:55:12Z

Content type: opinion

Language: en

Sources: [Simon Willison](<https://devfeed.tech/sources/simon-willison.md>), [Simon Willison's Weblog](<https://devfeed.tech/sources/simon-willison-s-weblog.md>)

Topics: [OpenAI](<https://devfeed.tech/topics/openai.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [Claude](<https://devfeed.tech/topics/claude.md>), [codex](<https://devfeed.tech/topics/codex.md>), [Math and Logic](<https://devfeed.tech/topics/math-and-logic.md>), [Lean](<https://devfeed.tech/topics/lean.md>)

Tags: [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-2-235](<https://devfeed.tech/tags/ai-2-235.md>), [ai-ethics](<https://devfeed.tech/tags/ai-ethics.md>), [ai-ethics-342](<https://devfeed.tech/tags/ai-ethics-342.md>), [claude](<https://devfeed.tech/tags/claude.md>), [codex](<https://devfeed.tech/tags/codex.md>), [generative-ai](<https://devfeed.tech/tags/generative-ai.md>), [generative-ai-1-981](<https://devfeed.tech/tags/generative-ai-1-981.md>), [llms](<https://devfeed.tech/tags/llms.md>), [llms-1-947](<https://devfeed.tech/tags/llms-1-947.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [mathematics-22](<https://devfeed.tech/tags/mathematics-22.md>), [openai](<https://devfeed.tech/tags/openai.md>), [openai-463](<https://devfeed.tech/tags/openai-463.md>), [paper](<https://devfeed.tech/tags/paper.md>), [training-data](<https://devfeed.tech/tags/training-data.md>), [training-data-68](<https://devfeed.tech/tags/training-data-68.md>)

### AI overview

This commentary examines OpenAI's reported resolution of the Navier-Stokes existence and smoothness problem with an unreleased model, alongside accusations that the effort may have drawn on information from related work by mathematicians using Claude and Codex. It also describes questions about timing, data access, authorship, and OpenAI's subsequent use of agents and Lean formalization.

### Source excerpt

On the Navier-Stokes Millennium Prize Problem introduces an impressive result from OpenAI, who used an unreleased model to produce a resolution to the Navier-Stokes existence and smoothness problem, one of the seven Millennium Prize Problems that have been subject to a $1,000,000 prize since May 24th, 2000. The discovery is somewhat overshadowed by accusations of skulduggery from Tristan Buckmaster, an NYU mathematics professor who was collaborating on related problems with Levent Alpöge, an accomplished mathematician who currently works for Anthropic. Tristan's complaint accompanied a hastily published version of their own results. Here's the PDF describing what happened. The very short version is that Tristan and Levent worked on the problem for almost a year, making extensive use of Claude and Codex (mainly GPT-5.6 Sol), then had a breakthrough on August 15th. The mathematical rumour mill kicked into gear and Tristan and Levent heard that OpenAI had heard that Anthropic had resolved "a major open problem", so they reached out and learned that OpenAI had a team working on a related problem, with a similar approach. Quoting Tristan: I asked when the first prompt had been sent by them. This question was not answered directly by OpenAI for some time. Eventually it was agreed that it had been sent in the past few days, after information about our work had reached OpenAI. I asked whether the model had been trained on, or had access to, our sessions in Codex, into which we had been putting all our drafts for the whole of this project. I was told the model did not look up user data. I asked again, about training, and I did not get an answer. It gets more complicated from there. The OpenAI team offered to wait for Tristan to publish, or to have him author a paper about their result, but were clear that Levent would not be invited as a co-author due to OpenAI's competitive relationship with his employer. Here's how OpenAI described their work: On Tuesday, September 1, we h

## How developers can Build a Fixed-Share Inheritance Distribution Calculator

DevFeed: [How developers can Build a Fixed-Share Inheritance Distribution Calculator](<https://devfeed.tech/articles/how-developers-can-build-a-fixed-share-inheritance-distribution-calculator-50842.md>)

Original publisher: [Read original article](<https://www.sitepoint.com/how-developers-can-build-a-fixed-share-inheritance-distribution-calculator/>)

Author: SitePoint Team

Published: 2026-09-08T06:16:33Z

Content type: tutorial

Language: en

Sources: [SitePoint](<https://devfeed.tech/sources/sitepoint.md>)

Topics: [Code](<https://devfeed.tech/topics/code.md>), [Programming](<https://devfeed.tech/topics/programming.md>), [Python](<https://devfeed.tech/topics/python.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [conditionals](<https://devfeed.tech/topics/conditionals.md>), [function](<https://devfeed.tech/topics/function.md>)

Tags: [arithmetic](<https://devfeed.tech/tags/arithmetic.md>), [code](<https://devfeed.tech/tags/code.md>), [conditionals](<https://devfeed.tech/tags/conditionals.md>), [developers](<https://devfeed.tech/tags/developers.md>), [programming](<https://devfeed.tech/tags/programming.md>), [python](<https://devfeed.tech/tags/python.md>)

### AI overview

A technical walkthrough of building a fixed-share inheritance distribution rules engine in Python. It models heirs, conditional blocking rules, exact fractional shares, and proportional reconciliation, using the Islamic Faraid system as a worked example while noting that the demonstration is not legal or religious guidance.

### Source excerpt

null Continue reading How developers can Build a Fixed-Share Inheritance Distribution Calculator on SitePoint.

## OpenAI's Claimed Navier-Stokes Result Covered Alternatives Fefferman Included in the Official Problem

DevFeed: [OpenAI's Claimed Navier-Stokes Result Covered Alternatives Fefferman Included in the Official Problem](<https://devfeed.tech/articles/one-of-the-following-four-statements-40148.md>)

Original publisher: [Read original article](<https://korbonits.com/blog/2026-09-08-one-of-the-following-four-statements/>)

Published: 2026-09-08T00:00:00Z

Content type: opinion

Language: en

Sources: [Alex Korbonits](<https://devfeed.tech/sources/alex-korbonits.md>)

Topics: [OpenAI](<https://devfeed.tech/topics/openai.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [Math and Logic](<https://devfeed.tech/topics/math-and-logic.md>)

Tags: [mathematics](<https://devfeed.tech/tags/mathematics.md>), [openai](<https://devfeed.tech/tags/openai.md>), [statement](<https://devfeed.tech/tags/statement.md>)

### AI overview

The article argues that OpenAI did not prove the standard Navier-Stokes existence and smoothness problem, but did prove alternatives (C) and (D) included in Charles Fefferman's official 2000 problem statement. It distinguishes that result from the unresolved alternatives (A) and (B), which concern existence and smoothness on ℝ³ and the torus with zero force.

### Source excerpt

OpenAI did not prove Navier-Stokes, and it also did not solve the wrong problem. It proved alternatives (C) and (D), which Fefferman put in the official statement on purpose in 2000, using theorem statements DeepMind had already written.

[Next page](<https://devfeed.tech/topics/mathematics.md?cursor=WyIyMDI2LTA5LTA4VDAwOjAwOjAwKzAwOjAwIiwgImVkYTE3ZTI0LTcxNjQtNDcxNy1hNGE5LWMxNzZiMmRiY2U4MiJd>)