Tootfinder

@… TiL about the Petersen Graph, which is the exact combination of mathematics and pentagrams that I feel epitomises The Laundry Files.
https://en.wikipedia.org/wiki/Petersen

Petersen graph - Wikipedia

So now we know why there was a suspicious hole in the #39c3 Fahrplan
GPG 0-Day(s) - Spicy
https://gpg.fail
17:15 CET

Have you ever wondered to what extend LLMs are used to support writing of scientific publications? Here is a chart indicating the fraction of LLM-modified sentences in scientific publications over time.
c.f. Liang et al, Mapping the Increasing Use of LLMs in Scientific Papers (2024)
https://arxiv.org/html/2404.01268v1

Interesting corollary to the #Perseverance discovery in the Bright Angel formation on #Mars making headlines 1 1/2 months ago: at a public talk in Bochum as part of a mathematics outreach event - #Life Detection scale #MarsSampleReturnMission the rating could jump up to 5 or 6 after lab analysis.
Green also remarked that the sample tubes dropped by Percy are up for grabs for *any* spacefaring nation capable of doing a MSRM - including China though they don't plan to go after the Percy samples with their upcoming #Tianwen3 mission (https://en.wikipedia.org/wiki/Tianwen-3) as far as he has heard. And regardless of where they'll get their own samples they could advance the case for life, perhaps even extant, on Mars a lot - which Green feels has been all but made in the past decades of Mars research anyway. Oh, and he also thinks terraforming Mars is quite viable ...

We also wrote a "Snapshot of Modern Mathematics", a short article about the so-called "4-sample-theorem" for Maximum Likelihood Estimation in Gaussian Graphical Models.
We submitted it to MFO in Spring 2024 but sadly they have not yet dealt with it. We never put out a preprint, thinking this would have been a very short process. But it is not.
So here is the preprint now, exclusively posted on the Fediverse:
https://thomas-kahle.de/assets/pdf/mfo-mlt-preprint.pdf
@…: snapshots are in bad shape... 😞
2/2

⛐ Bridging Vision, Language, and Mathematics: Pictographic Character Reconstruction with Bézier Curves
#cs

Bridging Vision, Language, and Mathematics: Pictographic Character Reconstruction with Bézier Curves
While Vision-language Models (VLMs) have demonstrated strong semantic capabilities, their ability to interpret the underlying geometric structure of visual information is less explored. Pictographic characters, which combine visual form with symbolic structure, provide an ideal test case for this capability. We formulate this visual recognition challenge in the mathematical domain, where each character is represented by an executable program of geometric primitives. This is framed as a program …

#MathsMonday #Mathematics
This has been in my feed a couple of times, but with only 1 hashtag, total(!), so I'm mostly just boosting visibility (by adding more hashtags), but I will take the chance to say, yet again, no,

I think we can actually prove that this constraint is the *only* constraint that can preserve freedom:
1. There will exist actors in a system who will wish to take advantage of others. Evolution drives survival and one strategy for increasing survival in an altruistic society is to become a parasite.
2. Expecting exploitative dynamics, a system needs to have a set of rules to manage exploitation.
3. If the set of rules is static it will lack the requisite variety necessary to manage the infinite possible behavior of humans so the system will fail.
4. If the system is dynamic then it must have a rule set about how it's own rules are updated. This would make the system recursive, which makes the system at least as complex as mathematics. Any system at least as complex as mathematics is necessarily either incomplete or inconsistent (Gödel's incompleteness theorem). If the system is incomplete, then constraints can be evaded which then allow a malicious agent to seize control of the system and update the rules for their own benefit. If constraints are incomplete, then a malicious agent can take advantage of others within the system.
5. Therefore, no social system can possibly protect freedom unless there exists a single metasystemic constraint (that the system must be optional) allowing for the system to be abandoned when compromised.
Oh, you might say, but this just means you have to infinitely abandon systems. Sure, but there's an evolutionary advantage to cooperation so there's evolutionary pressure to *not* be a malicious actor. So a malicious actor being able to compromise the whole system is likely to be a much more rare event. Compromising a system is a lot of work, so the first thing a malicious actor would want to do is preserve that work. They would want to lock you in. The most important objective to a malicious actor compromising a system would be to violate that metasystemic constraint, or all of their work goes out the window when everyone leaves.
And now you understand why borders exist, why fascists are obsessed with maintaining categories like gender, race, ethnicity, etc. This is why even Democrats like Newsom are on board with putting houseless people in concentration camps. And this is why the most important thing anarchists promote is the ability to choose not to be part of any of that.

🇺🇦 #NowPlaying on KEXP's #AfternoonShow
Yasiin Bey:
🎵 Mathematics (clean)
#YasiinBey
https://truthhiphop.bandcamp.com/track/mos-def-aka-yasiin-bey-mathematics-truth-remix

The Ethical and Sustainable Concerns Triangle: A Framework for Navigating Discourses in Mathematics and Its Education
Dennis M\"uller, Maurice Chiodo, Michael Meyer
https://arxiv.org/abs/2510.11327

The Ethical and Sustainable Concerns Triangle: A Framework for Navigating Discourses in Mathematics and Its Education
The literature on ethics and sustainability in mathematics and its education is increasingly complex and fragmented, potentially leading to communication breakdowns between different scholarly traditions. To address this, the paper introduces the "Ethical and Sustainable Concerns Triangle," a framework that maps discourses based on their relative concern for three areas (represented as three vertices in the triangle): "Mathematics", "Community", and "Society/Planet". By integrating a systems th…

Ax-Prover: A Deep Reasoning Agentic Framework for Theorem Proving in Mathematics and Quantum Physics
Marco Del Tredici, Jacob McCarran, Benjamin Breen, Javier Aspuru Mijares, Weichen Winston Yin, Jacob M. Taylor, Frank Koppens, Dirk Englund
https://arxiv.org/abs/2510.12787

Ax-Prover: A Deep Reasoning Agentic Framework for Theorem Proving in Mathematics and Quantum Physics
We present Ax-Prover, a multi-agent system for automated theorem proving in Lean that can solve problems across diverse scientific domains and operate either autonomously or collaboratively with human experts. To achieve this, Ax-Prover approaches scientific problem solving through formal proof generation, a process that demands both creative reasoning and strict syntactic rigor. Ax-Prover meets this challenge by equipping Large Language Models (LLMs), which provide knowledge and reasoning, wit…

A Mathematics-Guided Approach to Floating-Point Error Detection
Youshuai Tan, Zhanwei Zhang, Zishuo Ding, Lianyu Zheng, Jinfu Chen, Weiyi Shang
https://arxiv.org/abs/2510.10081 …

A Mathematics-Guided Approach to Floating-Point Error Detection
Floating-point program errors can lead to severe consequences, particularly in critical domains such as military applications. Only a small subset of inputs may induce substantial floating-point errors, prompting researchers to develop methods for identifying these error-inducing inputs. Although existing approaches have achieved some success, they still suffer from two major limitations: (1) High computational cost: The evaluation of error magnitude for candidate inputs relies on high-precisio…

I find something profound in recursive descent parsing, both the idea of it and the coding of it. For me it's one of the more beautiful things in mathematics, let alone computing.

Verification and experimental validation of neutral atom beam source produced by L-PBF
Vineet Kumar (Charles University, Faculty of Mathematics and Physics, Dept. of Surface and Plasma Science, Prague 8, Czech Republic), Niklas V. Lausti (Charles University, Faculty of Mathematics and Physics, Dept. of Surface and Plasma Science, Prague 8, Czech Republic), Peter K\'u\v{s} (Charles University, Faculty of Mathematics and Physics, Dept. of Surface and Plasma Science, Prague 8, Czech R…

The mathematics behind making homing missiles hit their targets in an interesting way. This is the typical sci-fi anime effect called "Macross Missile Massacre" or - after its inventor Ichirō Itano - "Itano Circus". By @…

GAR: Generative Adversarial Reinforcement Learning for Formal Theorem Proving
Ruida Wang, Jiarui Yao, Rui Pan, Shizhe Diao, Tong Zhang
https://arxiv.org/abs/2510.11769 https://

GAR: Generative Adversarial Reinforcement Learning for Formal Theorem Proving
Solving math problems through verifiable languages such as Lean has significantly impacted both the mathematics and computer science communities. Current state-of-the-art models are often trained with expensive online Reinforcement Learning (RL) or expert iteration. However, these approaches rely on fixed problem sets, which causes inefficient training and limits the model to tackle complex problems. To overcome these limitations, we propose GAR: Generative Adversarial Reinforcement learning, a…

Can LLMs Write Mathematics Papers? A Case Study in Reservoir Computing
Allen G Hart
https://arxiv.org/abs/2509.26550 https://arxiv.org/pdf/2509.26550

Can LLMs Write Mathematics Papers? A Case Study in Reservoir Computing
As AI capabilities continue to grow exponentially on economically relevant human expert tasks, with task completion horizons doubling every 7 months according to the Model Evaluation and Threat Research (METR), we are interested in how this applies to the task of mathematics research. To explore this, we evaluated the capability of four frontier large language models (LLMs), ChatGPT 5, Claude 4.1 Opus, Gemini 2.5 Pro, and Grok 4, at the task of creating a mini-paper on reservoir computing. All …

BoN Appetit Team at LeWiDi-2025: Best-of-N Test-time Scaling Can Not Stomach Annotation Disagreements (Yet)
Tomas Ruiz, Siyao Peng, Barbara Plank, Carsten Schwemmer
https://arxiv.org/abs/2510.12516

BoN Appetit Team at LeWiDi-2025: Best-of-N Test-time Scaling Can Not Stomach Annotation Disagreements (Yet)
Test-time scaling is a family of techniques to improve LLM outputs at inference time by performing extra computation. To the best of our knowledge, test-time scaling has been limited to domains with verifiably correct answers, like mathematics and coding. We transfer test-time scaling to the LeWiDi-2025 tasks to evaluate annotation disagreements. We experiment with three test-time scaling methods: two benchmark algorithms (Model Averaging and Majority Voting), and a Best-of-N sampling method. T…

But what *IS* the Matrix?
Oh. okay. nevermind.

Crystal-Field--Driven Magnetoelectricity in the Triangular Quantum Magnet CeMgAl$_{11}$O$_{19}$
Sonu Kumar (Charles University, Faculty of Mathematics and Physics, Department of Condensed Matter Physics, Prague, Czech Republic, Adam Mickiewicz University, Faculty of Physics and Astronomy, Department of Experimental Physics of Condensed Phase, Pozna\'n, Poland), Ga\"el Bastien (Charles University, Faculty of Mathematics and Physics, Department of Condensed Matter Physics, Pragu…

Crystal-Field--Driven Magnetoelectricity in the Triangular Quantum Magnet CeMgAl$_{11}$O$_{19}$
We report dielectric and magnetoelectric studies of single-crystalline \ce{CeMgAl11O19}, a Kramers triangular magnet embedded in a polarizable hexaaluminate lattice. In zero magnetic field, the permittivity $\varepsilon'(T)$ follows the Barrett law of a quantum paraelectric down to 25 K, below which a broad minimum develops near 3 K without evidence of static ferroelectric or magnetic order. Application of magnetic fields up to \SI{9}{\tesla} shifts this minimum to higher temperatures and broad…

Replaced article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Tight Lower Bound for Multicolor Discrepancy
Pasin Manurangsi, Raghu Meka
https://

Ethical and sustainable mathematics is localised: why global paradigms fail and culturally-situated practices are essential
Dennis M\"uller, Maurice Chiodo
https://arxiv.org/abs/2510.05892

Ethical and sustainable mathematics is localised: why global paradigms fail and culturally-situated practices are essential
This paper identifies several different interconnected challenges preventing the move towards more ethical and sustainable mathematics education: the entrenched belief in mathematical neutrality, the difficulty of simultaneously reforming mathematics and its pedagogy, the gap between academic theory and classroom practice, and the need for epistemic decolonisation. In this context, we look at both bottom-up and top-down approaches, and argue that globalised frameworks such as the United Nations…

MatheMagic: Generating Dynamic Mathematics Benchmarks Robust to Memorization
Dayy\'an O'Brien, Barry Haddow, Emily Allaway, Pinzhen Chen
https://arxiv.org/abs/2510.05962

MatheMagic: Generating Dynamic Mathematics Benchmarks Robust to Memorization
Conducting contamination-free evaluation of mathematical capabilities can be difficult for two reasons: models may memorize a test set once it is made public, and current mathematical benchmarks are prone to overfitting due to having limited diversity of symbols and rules, coupled with closed-ended answers. This paper proposes a method to leverage these shortcomings as useful features to a construct dynamic, counterfactual benchmark, which can be used to both reveal overfitting and measure true…

MM-HELIX: Boosting Multimodal Long-Chain Reflective Reasoning with Holistic Platform and Adaptive Hybrid Policy Optimization
Xiangyu Zhao, Junming Lin, Tianhao Liang, Yifan Zhou, Wenhao Chai, Yuzhe Gu, Weiyun Wang, Kai Chen, Gen Luo, Wenwei Zhang, Junchi Yan, Hua Yang, Haodong Duan, Xue Yang
https://arxiv.org/abs/2510.08540

MM-HELIX: Boosting Multimodal Long-Chain Reflective Reasoning with Holistic Platform and Adaptive Hybrid Policy Optimization
While current Multimodal Large Language Models (MLLMs) have demonstrated proficiency in reasoning tasks such as mathematics and logic, their capacity for long-chain reflective reasoning, a prerequisite for solving complex real-world problems, remains largely underexplored. In this work, we first conduct an extensive empirical investigation to evaluate this capability. Leveraging a carefully designed data synthesis engine, we construct MM-HELIX, a multimodal benchmark consisting 1,260 samples of…

Blocked by yet another dude I proved wrong with #Mathematics 🙄 and a self-proclaimed "Mathematician" no less. It's incredible how people can't deal with finding out they were wrong... just learn from it and move on, seriously. It's not that hard!
BTW here is the proof he couldn't handle

Heuristic Bundle Upper Bound Based Polyhedral Bundle Method for Semidefinite Programming
Zilong Cui, Ran Gu
https://arxiv.org/abs/2510.12374 https://arxiv.…

Heuristic Bundle Upper Bound Based Polyhedral Bundle Method for Semidefinite Programming
Semidefinite programming (SDP) is a fundamental class of convex optimization problems with diverse applications in mathematics, engineering, machine learning, and related disciplines. This paper investigates the application of the polyhedral bundle method to standard SDPs. The basic idea of this method is to approximate semidefinite constraints using linear constraints, and thereby transform the SDP problem into a series of quadratic programming subproblems. However, the number of linear constr…

Bringing Algebraic Hierarchical Decompositions to Concatenative Functional Languages
Attila Egri-Nagy
https://arxiv.org/abs/2510.12481 https://arxiv.org/pd…

Bringing Algebraic Hierarchical Decompositions to Concatenative Functional Languages
Programming languages tend to evolve over time to use more and more concepts from theoretical computer science. Still, there is a gap between programming and pure mathematics. Not all theoretical results have realized their promising applications. The algebraic decomposition of finite state automata (Krohn-Rhodes Theory) constructs an emulating hierarchical structure from simpler components for any computing device. These decompositions provide ways to understand and control computational proce…

Appell Functions for General Lattices
Aradhita Chattopadhyaya, Jan Manschot
https://arxiv.org/abs/2510.10204 https://arxiv.org/pdf/2510.10204

Appell Functions for General Lattices
We study Appell functions associated to an arbitrary positive definite lattice $Λ$ and a choice of $M\leq {\rm dim}(Λ)$ linearly independent vectors $d_r\in Λ$, $r=1,\dots,M$. These functions are instances of multi-variable quasi-elliptic functions, and specific examples have appeared at various places in mathematics and theoretical physics. For example, if $Λ$ is chosen to be one-dimensional, these functions reduce to the classical Appell function, which is a prominent example in the theor…

Replaced article(s) found for math.GM. https://arxiv.org/list/math.GM/new
[1/1]:
- On the Irreducibility of the Cuboid Polynomial $P_{a,u}(t)$
Valery Asiryan
ht…

Self-concordant Schr\"odinger operators: spectral gaps and optimization without condition numbers
Sander Gribling, Simon Apers, Harold Nieuwboer, Michael Walter
https://arxiv.org/abs/2510.06115

Self-concordant Schrödinger operators: spectral gaps and optimization without condition numbers
Spectral gaps play a fundamental role in many areas of mathematics, computer science, and physics. In quantum mechanics, the spectral gap of Schrödinger operators has a long history of study due to its physical relevance, while in quantum computing spectral gaps are an important proxy for efficiency, such as in the quantum adiabatic algorithm. Motivated by convex optimization, we study Schrödinger operators associated with self-concordant barriers over convex domains and prove non-asymptotic …

Contact Forces in Microgel Suspensions
Fran Ivan Vrban (Faculty of Mathematics and Physics, University of Ljubljana, Slovenia), Antonio \v{S}iber (Institute of Physics, Zagreb, Croatia, Jo\v{z}ef Stefan Institute, Ljubljana, Slovenia), Primo\v{z} Ziherl (Faculty of Mathematics and Physics, University of Ljubljana, Slovenia, Jo\v{z}ef Stefan Institute, Ljubljana, Slovenia)

Contact Forces in Microgel Suspensions
Within a model where micrometer-size soft colloidal particles are viewed as liquid drops, we theoretically study the contact interaction between them. We compute the exact deformation energy across a broad range of indentations and for various model parameters, and we show that it can be reproduced using truncated superball and spheropolyhedral variational shapes in the attractive and the repulsive regime, respectively. At large surface tensions representative of microgels, this energy is pairw…

Fisher Matrix for Beginners
David Wittman (UC Davis)
https://arxiv.org/abs/2510.09683 https://arxiv.org/pdf/2510.09683

Fisher Matrix for Beginners
The Fisher information matrix is used widely in astronomy (and presumably other fields) to forecast the precision of future experiments while they are still in the design phase. Although many sources describe the mathematics of the formalism, few sources offer simple examples to help the beginner. This pedagogical document works through a few simple examples to develop conceptual understanding of the applications.

Strong convergence: a short survey
Ramon van Handel
https://arxiv.org/abs/2510.12520 https://arxiv.org/pdf/2510.12520…

Strong convergence: a short survey
A family of random matrices is said to converge strongly to a limiting family of operators if the operator norm of every noncommutative polynomial of the matrices converges to that of the limiting operators. Recent developments surrounding the strong convergence phenomenon have led to new progress on important problems in random graphs, geometry, operator algebras, and applied mathematics. We review classical and recent results in this area, and their applications to various areas of mathematic…

Energy-density-driven ultrafast electronic excitations in a cuprate superconductor
Alessandra Milloch (Department of Mathematics and Physics, Universit\`a Cattolica del Sacro Cuore, Brescia, Italy, ILAMP), Francesco Proietto (Department of Mathematics and Physics, Universit\`a Cattolica del Sacro Cuore, Brescia, Italy, Department of Physics and Astronomy, KU Leuven, Leuven, Belgium), Naman Agarwal (Elettra - Sincrotrone Trieste S.C.p.A., Trieste, Italy), Laura Foglia (Elettra - Sincrot…

Energy-density-driven ultrafast electronic excitations in a cuprate superconductor
Controlling nonequilibrium dynamics in quantum materials requires ultrafast probes with spectral selectivity. We report femtosecond reflectivity measurements on the cuprate superconductor Bi$_2$Sr$_2$CaCu$_2$O$_{8+δ}$ using free-electron laser extreme-ultraviolet (23.5--177~eV) and near-infrared (1.5~eV) pump pulses. EUV pulses access deep electronic states, while NIR light excites valence-band transitions. Despite these distinct channels, both schemes produce nearly identical dynamics: above …

Characterization of Lattice Properties Within Modal Extensions
Alfredo R. Freire (Department of Philosophy, University of Brasilia, Brasil), Manuel A. Martins (Department of Mathematics, University of Aveiro, Portugal)
https://arxiv.org/abs/2509.25882

Characterization of Lattice Properties Within Modal Extensions
This paper investigates the extension of lattice-based logics into modal languages. We observe that such extensions admit multiple approaches, as the interpretation of the necessity operator is not uniquely determined by the underlying lattice structure. The most natural interpretation defines necessity as the meet of the truth values of a formula across all accessible worlds -- an approach we refer to as the \textitnormal interpretation. We examine the logical properties that emerge under this…

LLM-Driven Rubric-Based Assessment of Algebraic Competence in Multi-Stage Block Coding Tasks with Design and Field Evaluation
Yong Oh Lee, Byeonghun Bang, Sejun Oh
https://arxiv.org/abs/2510.06253

LLM-Driven Rubric-Based Assessment of Algebraic Competence in Multi-Stage Block Coding Tasks with Design and Field Evaluation
As online education platforms continue to expand, there is a growing need for assessment methods that not only measure answer accuracy but also capture the depth of students' cognitive processes in alignment with curriculum objectives. This study proposes and evaluates a rubric-based assessment framework powered by a large language model (LLM) for measuring algebraic competence, real-world-context block coding tasks. The problem set, designed by mathematics education experts, aligns each proble…

Computing moment polytopes - with a focus on tensors, entanglement and matrix multiplication
Maxim van den Berg, Matthias Christandl, Vladimir Lysikov, Harold Nieuwboer, Michael Walter, Jeroen Zuiddam
https://arxiv.org/abs/2510.08336

Computing moment polytopes - with a focus on tensors, entanglement and matrix multiplication
Tensors are fundamental in mathematics, computer science, and physics. Their study through algebraic geometry and representation theory has proved very fruitful in the context of algebraic complexity theory and quantum information. In particular, moment polytopes have been understood to play a key role. In quantum information, moment polytopes (also known as entanglement polytopes) provide a framework for the single-particle quantum marginal problem and offer a geometric characterization of ent…

A PCA-based Data Prediction Method
Peteris Daugulis, Vija Vagale, Emiliano Mancini, Filippo Castiglione
https://arxiv.org/abs/2510.09246 https://arxiv.org/…

A PCA-based Data Prediction Method
The problem of choosing appropriate values for missing data is often encountered in the data science. We describe a novel method containing both traditional mathematics and machine learning elements for prediction (imputation) of missing data. This method is based on the notion of distance between shifted linear subspaces representing the existing data and candidate sets. The existing data set is represented by the subspace spanned by its first principal components. Solutions for the case of th…

The Log-Rank Conjecture: New Equivalent Formulations
Lianna Hambardzumyan, Shachar Lovett, Morgan Shirley
https://arxiv.org/abs/2510.02583 https://arxiv.or…

The Log-Rank Conjecture: New Equivalent Formulations
The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are quasi-polynomially related. We propose a relaxed but still equivalent version of the conjecture based on a new matrix parameter, signed rectangle rank: the minimum number of all-1 rectangles needed to express the Boolean matrix as a $\pm 1$-sum. Signed rectangle …

Crosslisted article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Explicit Min-wise Hash Families with Optimal Size
Xue Chen, Shengtang Huang, Xin Li

1/7
This air-quote #Mathematics unquote article https://www.quantamagazine.org/a-new-bridge-links-the-strange-math-of-infinity-to-co…

Low-dimensional topology and symplectic dynamics
Dan Cristofaro-Gardiner
https://arxiv.org/abs/2510.07680 https://arxiv.org/pdf/2510.07680

Low-dimensional topology and symplectic dynamics
These are notes to accompany my lectures at the $2024$ "Current Developments in Mathematics" conference hosted by Harvard/MIT. The lectures were about some recent progress in our understanding of two and three dimensional dynamical systems, using in part some tools from low-dimensional topology. In these notes, I try to give a sense for how this works by discussing a few examples from problems I have worked on and surveying some related developments. Some symplectic variants of Weyl's law play …

SubApSnap: Solving parameter-dependent linear systems with a snapshot and subsampling
Eleanor Jones, Yuji Nakatsukasa
https://arxiv.org/abs/2510.04825 https://

SubApSnap: Solving parameter-dependent linear systems with a snapshot and subsampling
A growing number of problems in computational mathematics can be reduced to the solution of many linear systems that are related, often depending smoothly or slowly on a parameter $p$, that is, $A(p)x(p)=b(p)$. We introduce an efficient algorithm for solving such parameter-dependent linear systems for many values of $p$. The algorithm, which we call SubApSnap (for \emph{Sub}sampled $A(p)$ times \emph{Snap}shot), is based on combining ideas from model order reduction and randomised linear algebr…

A Numerical Rosenblatt Method for Forced Variable Independence
Radek Vav\v{r}i\v{c}ka (Faculty of Mathematics and Physics, Charles University, Institute of Particle and Nuclear Physics), Tom\'a\v{s} S\'ykora (Faculty of Mathematics and Physics, Charles University, Institute of Particle and Nuclear Physics)
https://arxiv.org/abs/250…

A Numerical Rosenblatt Method for Forced Variable Independence
A novel numerical technique is presented to transform one random variable within a system toward statistical quasi-independence from any other random variable in the system. The method's applicability is demonstrated through a particle physics example where a classifier is rendered quasi-independent from an observable quantity.

Topological Vector Spaces
Pierre Colmez, Wies{\l}awa Nizio{\l}
https://arxiv.org/abs/2509.25981 https://arxiv.org/pdf/2509.25981

Topological Vector Spaces
Motivated by applications to duality theorems for $p$-adic pro-étale cohomology of rigid analytic spaces, we study the category of Topological Vector Spaces in the setting of condensed mathematics. We prove that it contains, as full subcategories, both the category of (topologically) bounded algebraic Vector Spaces and the category of perfect complexes on the Fargues-Fontaine curve. Vector Spaces coming from $p$-adic pro-étale cohomology of smooth partially proper rigid analytic varieties are…

Improved upper bounds on color reversal by local inversions
Kumud Singh Porte, RB Sandeep, Kamal Santra
https://arxiv.org/abs/2510.00149 https://arxiv.org/…

Improved upper bounds on color reversal by local inversions
We study the problem of color reversal in bicolored graphs under local inversions. A \emph{bicoloration} of a graph $G=(V,E)$ is a mapping $β: V \to \{-1,1\}$. A \emph{local inversion} at a vertex $v \in V$ consists of reversing the colors of all neighbors of $v$ and replacing the subgraph induced by these neighbors with its complement, while leaving $v$ and the rest of $G$ unchanged. Sabidussi (Discrete Mathematics, 1987) showed that any bicolored graph on $n$ vertices without isolated vertic…

Pointed Hopf algebras revisited, with a view from tensor categories
Iv\'an Angiono
https://arxiv.org/abs/2510.03124 https://arxiv.org/pdf/2510.03124

Pointed Hopf algebras revisited, with a view from tensor categories
Hopf algebras appear in connection with various problems in Pure Mathematics and Theoretical Physics, mainly through their categoriesof representations, which are examples of tensor categories. In recent years, there have been major advances in the classification of finite-dimensional Hopf algebras over the complex numbers, especially when restricted to the pointed case. In this survey, we aim to review the main results in this direction, stating the classification theorems recently obtained an…

Effectiveness of Quota Policies Across STEM, Biological, and Humanities Programs
Ricardo D. Matheus, Elmer M. Gennaro, Marcelo T. Yamashita
https://arxiv.org/abs/2510.08261 http…

Effectiveness of Quota Policies Across STEM, Biological, and Humanities Programs
We examine more than a decade of quota policy at Unesp, analyzing Physics, Biology, and Pedagogy as representative programs of distinct assessment styles. Quotas show little impact in Physics, where the admission barrier is low, and in Pedagogy, where high pass rates make it difficult to differentiate students, but they reveal systematic differences in Biology. Focusing the analysis on Calculus I - an introductory course in Physics and other Science, Technology, Engineering, and Mathematics (ST…

🇺🇦 #NowPlaying on #BBC6Music's #HuwStephens
Joy Crookes:
🎵 Mathematics (feat. Kano)
#JoyCrookes
https://open.spotify.com/track/68sOQ9M10Uy7eL8rhaWdyj

O-Forge: An LLM Computer Algebra Framework for Asymptotic Analysis
Ayush Khaitan, Vijay Ganesh
https://arxiv.org/abs/2510.12350 https://arxiv.org/pdf/251…

O-Forge: An LLM + Computer Algebra Framework for Asymptotic Analysis
Large language models have recently demonstrated advanced capabilities in solving IMO and Putnam problems; yet their role in research mathematics has remained fairly limited. The key difficulty is verification: suggested proofs may look plausible, but cannot be trusted without rigorous checking. We present a framework, called LLM+CAS, and an associated tool, O-Forge, that couples frontier LLMs with a computer algebra systems (CAS) in an In-Context Symbolic Feedback loop to produce proofs that a…

A new application of the Fox-Wright functions: the coherent states formalism
Dusan Popov
https://arxiv.org/abs/2510.04874 https://arxiv.org/pdf/2510.04874

A new application of the Fox-Wright functions: the coherent states formalism
In this paper we extend the applicability of Fox-Wright functions beyond mathematics, specifically in quantum physics. We focused our attention on a new application, on the connection between the Fox-Wright functions and the generalized coherent states formalism. We constructed the generalized coherent states in the Barut-Girardello manner, in which the Fox-Wright functions play the role of normalization functions, and we demonstrated that the Fox-Wright coherent states satisfy all general cond…

Replaced article(s) found for math.GM. https://arxiv.org/list/math.GM/new
[1/1]:
- Symplectic structures and globally hyperbolic spacetimes
Romero Solha
https:/…

Mind Your Tone: Investigating How Prompt Politeness Affects LLM Accuracy (short paper)
Om Dobariya, Akhil Kumar
https://arxiv.org/abs/2510.04950 https://ar…

Mind Your Tone: Investigating How Prompt Politeness Affects LLM Accuracy (short paper)
The wording of natural language prompts has been shown to influence the performance of large language models (LLMs), yet the role of politeness and tone remains underexplored. In this study, we investigate how varying levels of prompt politeness affect model accuracy on multiple-choice questions. We created a dataset of 50 base questions spanning mathematics, science, and history, each rewritten into five tone variants: Very Polite, Polite, Neutral, Rude, and Very Rude, yielding 250 unique prom…

Replaced article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Menger's Theorem for Temporal Paths (Not Walks)
Allen Ibiapina, Raul Lopes, Andrea Marino, Ana Silva

PRISM-Physics: Causal DAG-Based Process Evaluation for Physics Reasoning
Wanjia Zhao, Qinwei Ma, Jingzhe Shi, Shirley Wu, Jiaqi Han, Yijia Xiao, Si-Yuan Chen, Xiao Luo, Ludwig Schmidt, James Zou
https://arxiv.org/abs/2510.03185

PRISM-Physics: Causal DAG-Based Process Evaluation for Physics Reasoning
Benchmarks for competition-style reasoning have advanced evaluation in mathematics and programming, yet physics remains comparatively explored. Most existing physics benchmarks evaluate only final answers, which fail to capture reasoning processes, while recent stepwise methods rely on heuristic LLM-as-judge scoring or restrictive linear assumptions, limiting reliability and diagnostic validity. We introduce PRISM-Physics, a process-level evaluation framework and benchmark for complex physics r…

Crosslisted article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Thin Trees via $k$-Respecting Cut Identities
Mohit Daga
https://

Personalized Auto-Grading and Feedback System for Constructive Geometry Tasks Using Large Language Models on an Online Math Platform
Yong Oh Lee, Byeonghun Bang, Joohyun Lee, Sejun Oh
https://arxiv.org/abs/2509.25529

Personalized Auto-Grading and Feedback System for Constructive Geometry Tasks Using Large Language Models on an Online Math Platform
As personalized learning gains increasing attention in mathematics education, there is a growing demand for intelligent systems that can assess complex student responses and provide individualized feedback in real time. In this study, we present a personalized auto-grading and feedback system for constructive geometry tasks, developed using large language models (LLMs) and deployed on the Algeomath platform, a Korean online tool designed for interactive geometric constructions. The proposed sys…

Hedging of exotic options in Hawkes jump-diffusion models by Malliavin calculus
Ayub Ahmadi, Mahdieh Tahmasebi
https://arxiv.org/abs/2510.05689 https://arx…

Hedging of exotic options in Hawkes jump-diffusion models by Malliavin calculus
In financial mathematics, the calculation of the Greeks, especially the delta, is emphasized due to its role in risk management. In this article, we employ Malliavin calculus to determine the delta of European and Asian options, where the underlying asset evolves according to a Hawkes jump-diffusion process. A central feature is that the Hawkes jump intensity is stochastic, which substantially affects the delta representation.

Advancing mathematics research with large language models
Lisa Carbone
https://arxiv.org/abs/2511.07420 https://arxiv.org/pdf/2511.07420

#gpt5 has found solutions to some of the Erdős problems on https://www.erdosproblems.com/
The fun part: by "found" they mean "found on the web". 😁
But that points to something. Mathematics literature is quite spread out and sometimes hard to read.
The social network is very important. We need experienced folks who tell us "oh, in 1971 X told me about her paper Y containing result Z".
While Gary Marcus is still making fun of this, it shows how valuable llms could be for literature search.

[2025-10-15 Wed (UTC), 1 new article found for math.GM General Mathematics]
toXiv_bot_toot

Replaced article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- On open-separating dominating codes in graphs
Dipayan Chakraborty, Annegret K. Wagler

Crosslisted article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- A Denoising Diffusion-Based Evolutionary Algorithm Framework: Application to the Maximum Independ...
Joan Salv\`a Soler, G\"unther R. Raidl

[2025-10-14 Tue (UTC), 2 new articles found for math.GM General Mathematics]
toXiv_bot_toot

Replaced article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Hamiltonian dynamics of Boolean networks
Arturo Zapata-Cort\'es, Julio Aracena
…

Replaced article(s) found for math.GM. https://arxiv.org/list/math.GM/new
[1/1]:
- Evolution on Sets
Eduardo Santana
https://arxiv.org/abs…

1/10
#MathsMonday
This #Mathematics article came across my feed, about how #Maths #teachers te…

[2025-10-15 Wed (UTC), no new articles found for cs.DM Discrete Mathematics]
toXiv_bot_toot

Replaced article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges
Jan Bok, Ji\v{r}\'i Fiala, Petr Hlin\v{e}n\'y, Nikola Jedli\v{c}kov\'a, Jan Kratochv\'il

[2025-10-13 Mon (UTC), no new articles found for math.GM General Mathematics]
toXiv_bot_toot

Crosslisted article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Finite Simple Groups in the Primitive Positive Constructability Poset
Sebastian Meyer, Florian Starke

Replaced article(s) found for math.GM. https://arxiv.org/list/math.GM/new
[1/1]:
- A symmetry approach to number tricks
H{\aa}kon Kolderup
https://

[2025-10-14 Tue (UTC), no new articles found for cs.DM Discrete Mathematics]
toXiv_bot_toot

Replaced article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- On classes of bounded tree rank, their interpretations, and efficient sparsification
Jakub Gajarsk\'y, Rose McCarty

Crosslisted article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs
Pierre Charbit, Michel Habib, Amalia Sorondo

Replaced article(s) found for math.GM. https://arxiv.org/list/math.GM/new
[1/1]:
- Nontrivial Solutions to a Cubic Identity and the Factorization of $n^2 n 1$
Hajrudin Fejzi\'c

Replaced article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Improved Lower Bounds on Multiflow-Multicut Gaps
Sina Kalantarzadeh, Nikhil Kumar
h…

[2025-10-10 Fri (UTC), 2 new articles found for math.GM General Mathematics]
toXiv_bot_toot

Crosslisted article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Note on the Number of Almost Ordinary Triangles
Adrian Dumitrescu, J\'anos Pach

Crosslisted article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Exact Causal Attention with 10% Fewer Operations
Dmitry Rybin, Yushun Zhang, Ding Tian, Zhihang Lin, Ruoyu Sun, Zhi-Quan Luo

[2025-10-09 Thu (UTC), no new articles found for math.GM General Mathematics]
toXiv_bot_toot

[2025-10-13 Mon (UTC), 1 new article found for cs.DM Discrete Mathematics]
toXiv_bot_toot

Replaced article(s) found for math.GM. https://arxiv.org/list/math.GM/new
[1/1]:
- An Alternate Method for Finding Particular Solutions of Nonhomegeneous Differential Equations
Ashot Djrbashian, Milena Safaryan

Crosslisted article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Higher-arity PAC learning, VC dimension and packing lemma
Artem Chernikov, Henry Towsner

Replaced article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- On Brooks' Theorem
Gopalan Sajith (IIT Guwahati), Sanjeev Saxena (IIT Kanpur)
h…

[2025-10-08 Wed (UTC), no new articles found for math.GM General Mathematics]
toXiv_bot_toot

Replaced article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
Martin P\'epin, Alfredo Viola

[2025-10-10 Fri (UTC), 2 new articles found for cs.DM Discrete Mathematics]
toXiv_bot_toot

Crosslisted article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- On cuts of small chromatic number in sparse graphs
Guillaume Aubian, Marthe Bonamy, Romain Bourneuf, Oscar Fontaine, Lucas Picasarri-Arrieta

Replaced article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Computability of extender sets in multidimensional subshifts: asymptotic growths, dynamical const...
Antonin Callard, L\'eo Paviet Salomon, Pascal Vanier

[2025-10-09 Thu (UTC), 4 new articles found for cs.DM Discrete Mathematics]
toXiv_bot_toot

Replaced article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Extension property for partial automorphisms of the $n$-partite and semigeneric tournaments
Jan Hubi\v{c}ka, Colin Jahel, Mat\v{e}j Kone\v{c}n\'y, Marcin Sabok

Crosslisted article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Dynamic Necklace Splitting
Rishi Advani, Abolfazl Asudeh, Mohsen Dehghankar, Stavros Sintos

Crosslisted article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- Balanced Fibonacci word rectangles, and beyond
Jeffrey Shallit, Ingrid Vukusic
h…

[2025-10-08 Wed (UTC), no new articles found for cs.DM Discrete Mathematics]
toXiv_bot_toot

[2025-10-07 Tue (UTC), 4 new articles found for cs.DM Discrete Mathematics]
toXiv_bot_toot

[2025-10-06 Mon (UTC), 1 new article found for cs.DM Discrete Mathematics]
toXiv_bot_toot

[2025-10-03 Fri (UTC), 1 new article found for cs.DM Discrete Mathematics]
toXiv_bot_toot

[2025-10-02 Thu (UTC), 1 new article found for cs.DM Discrete Mathematics]
toXiv_bot_toot

[2025-10-01 Wed (UTC), 1 new article found for cs.DM Discrete Mathematics]
toXiv_bot_toot