Peer Revenue Play credits. Real papers.

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Thursday 10 September

Computer Vision

Evaluating the Robustness of Anti-UAV Detection under Controlled Fog Degradation: Fog-Aware Training and Clear-Sky Tradeoff

Vision-based anti-UAV systems must function in poor visibility, yet most benchmarks use only clear-sky footage, and previous robustness studies treat adverse weather as a simple present/absent condition. As a result, the impact of fog severity on ground-to-air UAV detection remains poorly understood. This work presents the first severity-controlled fog benchmark for this task: synthetic fog at ten severity levels is applied to the RGB modality of the Anti-UAV300 dataset, comparing a clear-trained YOLOv5m baseline to a fog-aware model trained on both clear and foggy images. Detection performance drops sharply and non-linearly: degradation is front-loaded across light-to-moderate fog (beta approximately 0.05-0.10), with a 96% reduction in mAP@0.5:0.95 from clear to thickest fog, mainly due to lost recall and confidence. On the comparable metric (mAP@0.5), this collapse exceeds the most extreme rain degradation reported in the closest prior benchmark. Fog-aware training boosts detection across all severities (up to +0.320 mAP@0.5:0.95) with only a 9.1% drop in clear-sky accuracy, raising the threshold for reliable detection while not preventing collapse under extreme fog. Since reliability is lost within a narrow visibility range, simple clear vs adverse tests underestimate operational risk.
Read the full abstract

Optimization and Control

Minimal control time of some 1D first-order linear hyperbolic systems with row rank deficient boundary coupling matrix

The minimal control time of one-dimensional first-order linear hyperbolic systems is by now well-known when the boundary coupling matrix is full row rank. The goal of this article is to characterize the minimal control time for a class of systems with row rank deficient boundary coupling matrices.
Read the full abstract

High Energy Physics (Phenomenology)

M1 Radiative Transitions in the $B_c$ System after the $B_c^\ast(1S)$ Observation: Radial-Node Cancellation and Quark-Line Filtering

The recent ATLAS observation of the $B_c^*(1S)$ meson fixes the photon momentum for $B_c^*(1S)\to B_c(1S)\gamma$. We calculate four $1S$ and $2S$ M1 radiative transitions with relativistic Salpeter wave functions calibrated to the measured ground-state masses, and obtain $\Gamma[B_c^*(1S)\to B_c(1S)\gamma]=5.24\times10^{-2}$~keV. For the hindered $2S\to1S$ transitions, contributions from different radial-momentum regions largely cancel, leaving form factors about 25 times smaller than that of the ground-state allowed transition. The cancellation factors, defined as the ratio of the integral of the absolute radial contribution to the magnitude of the net integral, are approximately 18–20. Nevertheless, the hindered radiative widths are not suppressed, because their much larger photon momenta compensate for the smaller form factors. Separating the photon-emission contributions of the $b$ quark and $\bar c$ antiquark, we find particularly strong cancellation in the $b$ contribution to $B_c(2S)\to B_c^*(1S)\gamma$: only about $0.46\%$ of the integrated absolute radial contribution remains after cancellation, compared with about $4.5\%$ for the $\bar c$ contribution. The unmeasured $B_c^*(2S)$ mass remains the main limitation on the $2S\to2S$ radiative width.
Read the full abstract

Probability

Cutoff for the Overhand Shuffle

We study the overhand shuffle with a fixed cut probability $p\in(0,1)$. In the packet-reversal convention, each gap is cut independently with probability $p$, and each resulting packet is reversed in place. We prove total-variation cutoff at \[ \frac{p^2}{2(1-p)\pi^2}\,n^2\log n. \] The lower bound uses an exact finite-deck cosine eigenfunction and a uniform conditional-variance estimate. For the upper bound, a coalescing coupling reduces a transposition discrepancy to a symmetric killed two-card chain. Its principal decay rate is $(1-p)\pi^2/(p^2n^2)+o(n^{-2})$. A boundary-flux identity bounds the sum of adjacent discrepancy probabilities without a factor equal to the deck size. The remaining ingredient is a two-sided $L^1$ inequality on permutations, with constant at most $\sqrt n\exp\{O(\sqrt{\log n\log\log(n+2)})\}$. Its proof decomposes a fixed block-table fiber into assignment words and independent smaller permutations, and closes a recursion using a multivariate hypergeometric inequality and an explicit routing comparison. We also prove relative-entropy cutoff with an $O_p(n^2)$ window about the intrinsic entropy transition time. Its leading coefficient lies between the total-variation coefficient and twice that value; a sharp entropy location is not obtained. The proof states the normalization and hypotheses of its established functional-inequality inputs. An appendix proves the intermediate static bounds and explains the change from one-scale averaging to recursive fibers.
Read the full abstract

Cryptography and Security

Evasion Attacks: How Adversarial Noise Bypasses ML Classifiers

This paper presents a reproducible, educational study of evasion attacks in image classification and text classification. A compact convolutional network trained on MNIST reached 98.63% clean test accuracy and was evaluated under two white-box attacks. Under FGSM, accuracy fell to 60.20% at $\epsilon$ = 0.15 and 1.72% at $\epsilon$ = 0.30; under PGD it fell to 32.47% and 0.41%, and a bit-depth-reduction defense recovered only part of the loss. In the second experiment, DistilBERT fine-tuned on the SMS Spam Collection reached 98.75% accuracy and a 94.96% F1-score, but a controlled sequence of pre-defined perturbations (character substitutions, whitespace noise, and a benign suffix) produced only modest probability shifts in most displayed examples and no flip from spam to ham. Adversarial vulnerability is strongly modality-dependent: the MNIST experiment is a clear evasion demonstration, whereas the text experiment is a controlled robustness evaluation. Robustness must be tested empirically rather than inferred from clean accuracy.
Read the full abstract

Representation Theory

A characterization of triangulated structures induced by premutation triples

Let $(\mathcal{S},\mathcal{Z},\mathcal{V})$ be a premutation triple in an extriangulated category. Set $\mathcal{I}=\mathcal{S}\cap\mathcal{Z}=\mathcal{Z}\cap\mathcal{V}$. Iitsuka introduced premutation triples as a unified framework for various mutation constructions and showed that the quotient category $\mathcal{Z}/[\mathcal{I}]$ admits a canonical pretriangulated structure. In this paper, we prove that the compatibility condition $(\mathrm{MT4})$ is not only sufficient but also necessary for this structure to be triangulated. Therefore, $(\mathrm{MT4})$ precisely characterizes when Iitsuka's canonical pretriangulated structure becomes triangulated. Furthermore, we prove that, for concentric twin cotorsion pairs, the compatibility condition used by Nakaoka in the construction of triangulated quotients is equivalent to $(\mathrm{MT4})$. Finally, we construct an explicit reducible triple which is not a mutation triple. This gives a negative answer to a question posed by Iitsuka.
Read the full abstract

Instrumentation and Methods for Astrophysics

The Preprint Evolution: The Rise of Unreviewed Drafts on arXiv and its Implications for Astronomy

The arXiv preprint server originally democratized astronomical research by digitizing the circulation of early manuscripts and removing the financial barriers of journal subscriptions. However, a system designed for the lower publication volumes of the 1990s has fractured under modern research output. Today, the sheer volume of unreviewed manuscripts—often tagged as “submitted,”, “under review”, or “comments welcome”—imposes a severe cognitive “tax” on the community. Researchers are forced to track multiple, unvetted versions of the same work, creating a massive redundant workload. This practice also bypasses the blinded peer-review process by establishing premature precedence, and it takes a heavy toll on early-career researchers. The pressure to rapidly post unvetted results stifles independent research, pushing young scientists toward massive mainstream collaborations where individual creativity gets lost. In this Short Communication, I analyze a decade of astro-ph metadata to quantify this trend. To safeguard both researchers' time and research freedom, I propose bifurcating submissions into two separate streams. Level-1 (peer-reviewed science) would host peer-reviewed science (accompanied by a journal acceptance or final DOI), while Level-2 (pre-review drafts) would be reserved for discussion drafts. This distinction would remove the unfair advantage of establishing false precedence through drafts and drastically cut the daily reading burden by allowing researchers to opt out of tracking unvetted versions.
Read the full abstract

Machine Learning

FIDAL: Diversity-Aware Federated Active Learning Under Real-World Distribution Shifts

Federated learning enables collaborative model training across institutions without centralizing data, yet high annotation costs, domain shifts, and class imbalance remain major obstacles, especially when irrelevant out-of-distribution (OOD) samples dilute the labeled data. Existing active learning methods target uncertainty or diversity within in-distribution (ID) data and overlook unknown samples in federated clinical settings. We propose FIDAL, an open-set federated active learning framework that combines calibrated global-local evidential uncertainty, support-set diversity weighting, and adaptive OOD rejection. The rejection gate thresholds a foundation-model Gaussian-coverage signal per client and per round with Otsu's criterion, so that highly informative ID samples are queried while irrelevant outliers are excluded without any hand-tuned threshold. Evaluated on three multi-center medical imaging benchmarks (dermatology, histopathology, and mammography with organically occurring artifacts) in realistic open-set scenarios, FIDAL outperforms detector-based open-set methods by up to about 12 percentage points of balanced accuracy and is the only method on the accuracy-ID purity Pareto front of all three benchmarks. At an equal query budget it spends at least 1.3 times fewer annotations on OOD samples than every accuracy-matched baseline, saving an estimated 7-29 hours of expert reading on the mammography benchmark. By labeling only a fraction of the data pool, it matches or exceeds fully supervised performance across modalities. These results highlight the value of integrating uncertainty, diversity, and OOD rejection in open-set federated active learning for medicine.
Read the full abstract

Machine Learning

Grounding Vision-Language Models in Driving Semantics: A Multi-Dataset Predicate Framework for Explainable Reasoning

Vision-language models are increasingly used for driving-scene understanding, yet the semantic relations expressed in their outputs are often difficult to verify against the underlying traffic situation. This paper introduces a deterministic multi-dataset predicate framework that derives driving-scene semantics from measurable geometric, kinematic, temporal, map, and traffic-control evidence. Dataset-specific interfaces are used only to recover the required scene information, while predicate definitions remain unchanged across nuPlan and nuScenes and are materialised in a common Predicate Knowledge Graph. Quantitative semantic validation against manually annotated predicate relations on 200 scenarios from each dataset yields macro F1 scores of 0.94 on nuPlan and 0.93 on nuScenes, with an average cross-dataset difference of 0.02 across the shared predicates. The Predicate KG is further evaluated using a frozen LLaVA-OneVision-7B model on the nine NuPlanQA subtasks. Predicate grounding achieves the highest accuracy among the evaluated visual-input conditions in seven of nine NuPlanQA subtasks, including Traffic Light (53.2% to 71.5%), Situation Assessment (76.2% to 86.1%), and Action Recommendation (82.9% to 89.0%). Weather/Lighting remains essentially unchanged (89.4% vs. 88.8%), consistent with the absence of corresponding predicates, while Predicate KG only input outperforms metadata-only input in eight of nine subtasks. The results show that deterministic predicates provide a consistent and traceable semantic representation and, under oracle grounding, can reduce visual dependence for reasoning tasks covered by the predicate vocabulary.
Read the full abstract

Machine Learning

What Next-Event Accuracy Cannot See: Closed-Loop Evaluation of Emergency Department Trajectory Simulators

Clinical trajectory models are usually evaluated by next-event accuracy on observed histories. Simulation is different: models must condition on their own generated events, allowing errors to compound. Although this problem is well known in sequence modelling, it has not been systematically quantified for clinical trajectory simulators. We developed EDSim-Bench to evaluate this failure mode using 425,028 MIMIC-IV-ED stays, with external replication on MC-MED, and release the evaluation protocol and scoring code. Starting from held-out visit prefixes, models generate the remainder of each visit and are evaluated on termination, event composition, timing, conditional fidelity, and occupancy forecasting, with a train-only order-3 n-gram as a reference baseline. Despite next-event accuracies within 0.001, three neural architectures behaved very differently under rollout. Across seeds, one Transformer recipe ranged from 0.43 to 0.96 in termination score and from 4.2- to 137-fold the divergence of the n-gram; no prefix-trained neural model approached the n-gram on termination or event composition. Inference-time interventions improved termination but did not jointly recover composition and timing. Supervising every eligible sequence position rather than only the final prefix position was associated with one to two orders of magnitude lower divergence across Transformer, GRU, and LSTM models, with the pattern persisting under model scaling, temporal shift, and external-site evaluation. Nevertheless, even the best model generated visits approximately half as long as observed, and model rankings reversed on occupancy forecasting, a downstream quantity relevant to bed management. These results show that next-event accuracy is insufficient to evaluate clinical trajectory simulators and motivate closed-loop evaluation across seeds, rollout criteria, and downstream tasks.
Read the full abstract

Machine Learning

Symmetry-quotient Flatness and Generalization

This paper develops a theorem-level pipeline in symmetry-quotient settings: quotient linear stability implies quotient flatness, quotient flatness implies input smoothness, and input smoothness yields generalization under local covering assumptions. Flatness is often associated with generalization, and Stochastic Gradient Descent (SGD) is frequently viewed as implicitly biased toward flat solutions. However, standard flatness measures are typically defined in the raw parameter space and are therefore not invariant under function-preserving symmetries such as positive rescaling. We develop a symmetry-aware theory of quotient flatness, quotient linear stability, input smoothness, and generalization on quotient spaces of neural-network parameters. For square loss and models equipped with function-preserving group actions, we define quotient flatness as the trace of the Hessian of the empirical loss on the regular quotient manifold. We show that quotient flatness controls input smoothness through a quotient-space analogue of the flatness-to-smoothness argument. We also prove that one-step mean-square quotient linear stability of the linearized SGD dynamics implies an explicit quotient-flatness bound in terms of the batch size and learning rate, and extend this analysis to higher-order tensor moments. Finally, under local covering and boundedness assumptions, we derive population generalization bounds in terms of quotient flatness and, consequently, in terms of quotient linear stability.
Read the full abstract

Machine Learning

Enhancing generalization in endwall film cooling prediction: Incorporating the superposition principle into transformer-based neural operators

In this study, a physics-enhanced neural operator framework is proposed to enhance the generalization prediction ability of the cooling layout of a turbine endwall with variable number of film holes. Specifically, inspired by the film cooling superposition principle, we propose a film cooling prediction model, namely superposition-based deep neural operator (SDNO), that divides the endwall temperature field prediction into two stages. In the first stage, the cooling layout of a turbine endwall is divided into several sub-parts with randomly assigned film holes, and a Transformer-based neural operator network, namely Calculate Net, is designed to predict the temperature field of each sub-part. Then, in the second stage, another neural operator network, i.e., Super Net, is trained to combine the temperature fields predicted by Calculate Net for each sub-part and obtain the superposed temperature field of the full cooling layout. Additionally, instead of directly taking the film cooling contours as pixel plots, a signed distance function (SDF) which is sensitive to the variable locations of cooling holes, is designed to encode the location information of cooling holes. Furthermore, the proposed endwall film cooling prediction model is trained with the samples that changing the number of film holes from 1-5 with variable locations. Then, the trained prediction shows excellent generalization prediction ability, which can accurately predict the film effectiveness of the cooling layout with 10-20 film cooling holes that are unseen in the training samples. The proposed SDNO also improves prediction accuracy relative to the fully supervised baseline. With the above, the effectiveness of our proposed prediction model has been well demonstrated.
Read the full abstract

All authors Qineng Wang, Liming Song, Tianyuan Liu, Zhendong Guo

Machine Learning

EEGAgentBench: Benchmarking LLM Agents on Short- and Long-Horizon EEG Analysis

Electroencephalography (EEG) analysis is evolving from short-segment classification toward long-horizon interpretation that demands iterative evidence accumulation, multi-step reasoning, and coordinated use of specialized signal-processing tools. Although large language models (LLMs) have recently shown promise as autonomous agents for EEG analysis, existing EEG agentic evaluations remain fragmented, covering limited tasks over narrow temporal horizons with inconsistent protocols, and providing no comprehensive assessment of agents' reasoning, tool-use, and workflow construction capabilities. To address this gap, we propose EEGAgentBench, a unified benchmark for systematically evaluating LLM agents on short- and long-horizon EEG analysis. EEGAgentBench spans six representative EEG applications ranging from knowledge question answering to sleep staging. It encompasses signal durations from 2 seconds to nearly 23 hours, with prediction targets ranging from class labels to event intervals and epoch-level sequences. This design supports unified evaluation across knowledge reasoning, short-horizon interpretation, long-horizon event detection, and sequential understanding. The benchmark further provides 10 deterministic EEG analysis tools that expose only task-relevant signal measurements. Agents must therefore select tools autonomously, accumulate evidence iteratively, and construct multi-step workflows. For evaluation, we benchmark 29 frontier LLMs from 15 model families. Results demonstrate that EEGAgentBench effectively distinguishes agent capabilities beyond model scale and inference cost, while revealing substantial limitations of current LLM agents in long-horizon EEG analysis, particularly in sustained evidence accumulation and multi-step reasoning.
Read the full abstract

All authors Huyu Wu, Weining Weng, Yuchen Liu, Yiqiang Chen, Yang Gu

Number Theory

Lie algebras for multiple Eisenstein series and multiple q-zeta values

Racinet's double shuffle Lie algebra $\mathfrak{dm}_0$ encodes the double shuffle relations of multiple zeta values. We study two analogues of $\mathfrak{dm}_0$ for multiple Eisenstein series and $q$-analogues of multiple zeta values, namely the space $\operatorname{BARI}_{\operatorname{swap},\mathrm{il}}$ of swap-invariant alternil bimoulds with the uri bracket of Kühn and Schneps, and Burmester's balanced double shuffle space $\mathfrak{bm}_0$. Both were conjectured to be Lie algebras. We prove both conjectures and show that $\mathfrak{bm}_0$ is isomorphic to the Lie algebra of finite-depth polynomial elements of $\operatorname{BARI}_{\operatorname{swap},\mathrm{il}}$.
Read the full abstract

Algebraic Geometry

The Tate conjecture for powers of abelian fourfolds and the Hodge conjecture for powers of CM fourfolds

We prove the Tate conjecture in every codimension on every power of an abelian variety of dimension at most four over a finite field. For geometrically simple fourfolds, we use Broe's theorem and the classification of Frobenius relations. For dihedral pairs of abelian surfaces, we construct algebraic classes using families of abelian threefolds, the Gross–Schoen height formula, and polarization contractions. We also prove the Hodge conjecture for every power of a complex CM abelian fourfold, using Markman's theorem on Weil classes and Milne's criterion. The finite field results imply standard conjecture~D and the expected pole orders of the zeta function on every power.
Read the full abstract

Statistics Applications

Can Large Language Model-Generated Responses Support Assessment Development? A Human-Calibrated Rasch Benchmark

Large language models (LLMs) are proposed as synthetic respondents for pilot testing, but their usefulness depends on whether they supply the evidence assessment development requires. We calibrated rating scale models on 14 digital-use skill items from 6,245 adults and used the human item parameters to evaluate responses generated for 1,300 demographically matched personas. LLM responses had high internal consistency ($\alpha \approx .94$) but used the lowest category in 0.2-0.3% of responses versus 13.7-21.5% for humans, and no persona chose it on every item. These gaps changed the response-category judgment on both subscales and the PC targeting judgment; on the human-calibrated scales, 12 of 14 items had infit below 0.70, indicating responses more predictable than the Rasch model expects. Preregistered changes to the prompt, category order, and persona information did not restore the human lower range. High internal consistency is insufficient evidence that LLM responses can replace human pilot data.
Read the full abstract

Computer Vision

Enabling Vision and Cross-Modal Learning for Multimodal Stroke Recurrence Prediction: An Interpretable Two-Step Framework

Multimodal stroke recurrence prediction requires effective integration of heterogeneous clinical and imaging data, yet modality imbalance often causes models to over-rely on dominant modalities and underutilize complementary information. While self-supervised pretraining and selective parameter freezing are commonly employed to improve representation learning and fine-tuning stability, their effect on modality contributions and cross-modal behavior in multimodal medical models remains largely unexplored. In this work, we investigate whether image pretraining on 3D CTA scans reduces modality imbalance and improves cross-modal integration for stroke recurrence prediction, a clinically critical task we recently addressed. To this end, two multimodal neural networks are pretrained in a self-supervised manner and subsequently fine-tuned using two distinct freezing strategies. Their performance and modality utilization are compared against both the baseline model from our previous work and models trained entirely from scratch in this study. Our results demonstrate that self-supervised pretraining enables more effective utilization of the multimodal image-tabular dataset, outperforming both the prior baseline and all non-pretrained models. Notably, the best-performing Vision Transformer based neural network successfully overcomes unimodal collapse. Synergy analysis reveals significant interactions between vision and both gender and CHD, suggesting clinically relevant patterns for stroke recurrence. Overall, our findings demonstrate that self-supervised pretraining and strategic fine-tuning support more balanced modality utilization and enable meaningful cross-modal interactions. Code is publicly available at https://github.com/ChristianGappGit/SSL_Pretraining.
Read the full abstract

All authors Christian Gapp, Elias Tappeiner, Martin Welk, Karl Fritscher, Stephanie Mangesius, Constantin Eisenschink, Philipp Deisl, Michael Knoflach, Astrid E. Grams, Elke R. Gizewski, Rainer Schubert

Signal Processing

Utility-Aware Adaptive Downlink DM-RS Allocation from Uplink CSI for Lightweight O-DU dApps

Adaptive demodulation reference signal (DM-RS) placement in 5G New Radio (NR) trades pilot overhead against channel-tracking robustness, making a single static density suboptimal across heterogeneous mobility and propagation regimes. This paper studies a lightweight per-UE controller intended for O-DU-side distributed application (dApp) execution. The controller consumes eleven deployable uplink-CSI statistics and selects among six standards-derived PDSCH DM-RS configurations. Rather than optimize oracle-class accuracy, we train an 11-128-64-32-6 multilayer perceptron with a utility-aware objective that preserves the throughput structure of all candidate actions. In a large-scale trajectory-disjoint evaluation covering 294 channel/speed/SNR conditions and 7,056 observations, the proposed U-SoftCE policy significantly improves throughput over a training-selected best fixed pattern by 1.30, 0.86, and 1.13 percentage points on in-distribution, CDL channel-OOD, and 300-km/h mobility-OOD splits, respectively; paired 95% bootstrap intervals exclude zero in all three cases. An independent bit-accurate Sionna NR LDPC validation over 36 held-out conditions and 50 transport blocks per candidate retains a +1.21-point gain with a 95% cluster-bootstrap interval of [0.27, 2.13]. A native C++ implementation uses 12,070 dense parameters and requires 5.59 microseconds mean inference time, while a FlexRIC-based emulated O-DU prototype demonstrates sub-10-ms closed-loop operation. These results support utility-aware objectives for compact adaptive PHY controllers while exposing the limits of exact class-accuracy optimization.
Read the full abstract

2609.22270 · 10 Sep · 4 pages, 3 figures, 2 tables. Includes large-scale trajectory-disjoint evaluation, independent bit-accurate NR LDPC validation, and a FlexRIC-based emulated O-DU/native C++ dApp prototype. Extended follow-up "Receiver-Aware DM-RS Selection With Uplink CSI Statistics for O-RAN xApps" submitted to IEEE WCL, 31 Oct 2026. v2 adds notice only; technical content unchanged

Quantum Physics

Pauli-string grouping for VQE measurement reduction on a sparse-connectivity quantum annealer

The Variational Quantum Eigensolver (VQE) requires a large number of measurements to evaluate molecular Hamiltonians. Expressing a molecular Hamiltonian as a linear combination of Pauli strings creates a measurement bottleneck: non-commuting Pauli strings cannot be measured simultaneously. Consequently, mutually commuting Pauli strings must be grouped and measured together to minimise the number of quantum-state preparations. This task maps to the minimum clique cover problem on a commutativity graph, an NP-hard problem typically addressed using classical heuristics. Although an Ising-model formulation has recently been explored on fully connected CMOS Ising machines and demonstrated on physical quantum annealers only at small scale, the embedding cost that governs its behaviour on hardware with sparse connectivity, where each logical variable must be represented by a chain of physical qubits, has not been characterised. In this work, we formulate the Pauli-grouping problem as a standard QUBO colouring model and study its scalability on a D-Wave quantum annealer. Across a series of molecular systems and for both qubit-wise and full commutativity, we quantify the growth in the number of logical variables and the QUBO interaction density, characterise the physical-qubit and chain-length overhead required for embedding on the Zephyr topology, and compare the annealer's time-to-solution and solution quality with those of heuristic classical baselines. This analysis identifies the threshold of molecular complexity beyond which hardware connectivity prevents viable embedding, and shows that a second, practical limit is reached earlier. The threshold therefore measures how far current annealers are from the regime in which pre-optimising a VQE measurement scheme on hardware would be worth considering.
Read the full abstract

Number Theory

Arithmetic Constraints and Limit Laws for Diagonal Rational Partitions

Let $R_N(m)$ count unordered partitions of $m$ into reduced positive fractions whose numerators and denominators are at most $N$, excluding integer parts. Uniformly for $\rho$ in compact positive intervals, $\log R_N(\lfloor\rho N\rfloor)=\sqrt{2\rho}\,N^{3/2}-\kappa(\rho)N^{3/2}/\log N+o(N^{3/2}/\log N)$. The positive, continuously differentiable function $\kappa$ is an explicit sum of lattice-distance integrals, with $\kappa(1)\approx 0.00264713$. For a uniform partition of $n$, all but $o_{\mathbb{P}}(n/\log n)$ prime-denominator blocks in $(n/2,n]$ have total 2 or 3, according to whether $p/n$ lies below or above an explicit threshold near 0.7522. For fixed $N$, we give the Ehrhart numerator and determine how its poles control quasipolynomial coefficients. Its residue distribution is asymmetric for $N\ge 4$, but agrees with an independent model in every moment below order $\lceil N/2\rceil$. We identify the first discrepancy and prove a Gaussian limit. We also obtain joint denominator and size laws under two sampling rules.
Read the full abstract

General Relativity and Quantum Cosmology

Fold-Point Scaling and Phenomenological Cascade Closures in Regular Black Hole Spacetimes

Semiclassical analyses of regular black holes suggest that inner-horizon instabilities can drive the trapped region to evaporate faster than the Hawking time and seed a transient anti-trapped region. Whether this repeats into a cascade terminating in a horizon-free configuration requires a self-consistent solution of the semiclassical Einstein equations, which we do not attempt. Instead, within the static Bardeen family, we show that the renormalized-stress-tensor (RSET) result of Arrechea, Liberati and Spadafora (arXiv:2608.03538) does not by itself force any damping of a hypothetical cascade near extremality, since its near-extremal limit at fixed cycle duration is finite and nonzero. We then prove, under explicit nondegeneracy hypotheses on any static metric family whose horizons merge at a fold point, that the inner-horizon surface gravity scales as |kappa_-| ~ (M-M_crit)^{1/2}, and verify this in two regular black hole families, Bardeen and Hayward, with a quantified systematic uncertainty. A phenomenological closure built on this scaling gives a mass gap decaying as x_n ~ n^{-2}, generalizing to x_n ~ n^{-1/(pq)} for a fold exponent p and an uncalibrated closure exponent q; the required cycle count is a property of the closure, not a physical prediction. As a separate exercise, we build an effective adiabatic model for the outer-horizon mass from the exact Einstein tensor of a generalized Vaidya-Bardeen ansatz matched to the cited RSET flux; the resulting law includes an O(1) correction absent from the naive Schwarzschild-Vaidya relation, relaxes to M_crit only asymptotically, and gives a timescale shorter than the inner-horizon amplification timescale by up to four orders of magnitude away from extremality but longer very close to extremality. We distinguish what is derived under stated assumptions from what the closure simply postulates.
Read the full abstract

Differential Geometry

An improved second pinching theorem for minimal hypersurfaces with constant scalar curvature in spheres

Let $M^n$ be a closed minimal hypersurface of the unit sphere with constant squared norm $S$ of the second fundamental form. For $n\geq4$, we prove that $S>n$ implies $S>85n/59$, improving the bound $10n/7$ of Suh and Yang. No constancy assumption is imposed on the cubic trace $f_3$. The proof combines a symmetrized Hessian estimate, an integral identity for a mixed moment, and a weighted estimate for the repeated-index components of the covariant derivative of the second fundamental form. An exact polynomial argument treats the entire excluded interval. We also prove an explicit positive lower bound for the average of the normalized quadratic defect $P/S^2$, where $P=f_4-f_3^2/S-S^2/n$. This second estimate holds in every dimension $n\geq2$ and gives a quantitative obstruction to concentration near the locus of two principal curvatures.
Read the full abstract

General Relativity and Quantum Cosmology

Horizon Structure and Geodesic Properties of Simpson-Visser Black Holes in Einstein-Euler-Heisenberg Theory

We investigate a regularized charged black hole (BH) spacetime constructed by applying the Simpson-Visser (SV) prescription to a BH in Einstein-Euler-Heisenberg (EEH) theory. The resulting Simpson-Visser Einstein-Euler-Heisenberg (SV-EEH) geometry incorporates nonlinear electromagnetic corrections through the parameter $(a)$ and the SV regularization through the length scale $(b)$. By varying these parameters, spacetime provides a smooth interpolation between a regular BH, a one-way wormhole, and a traversable wormhole configuration. Introducing the effective areal radius $(R=\sqrt{r^{2}+b^{2}})$, we analyze the horizon structure and derive the conditions for degenerate and extremal configurations. Furthermore, we examine the null and timelike geodesic structures, computing the photon sphere radius, the BH shadow size, and the innermost stable circular orbit (ISCO). Our results demonstrate how nonlinear electrodynamics and SV regularization jointly modify the causal and geodesic structure of charged BHs while preserving the appropriate Reissner-Nordström and SV limits.
Read the full abstract

Game Theory

Computing Stationary Equilibria in Measure-Dependent Markov Systems

Many stochastic systems in operations and economics exhibit feedback between their long-run state distribution and the transition law governing their dynamics. In this paper, we develop a computational framework for stationary equilibria in such measure-dependent Markov systems when this feedback operates through a finite-dimensional aggregate. We show that the original stationary-equilibrium problem can be reduced to a finite-dimensional self-consistency equation, separating steady-state analysis of the underlying Markov system from equilibrium computation. We use properties of the resulting self-consistency map to guide the choice among fixed-point iteration, relaxed fixed-point iteration, and minimization of the fixed-point residual. The last approach requires derivatives of the self-consistency map, which are typically unavailable in closed form. We therefore develop finite-time infinitesimal perturbation analysis estimators for these derivatives, with error bounds that separate Monte Carlo error from finite-time bias. We illustrate the framework through a strategic $G/G/c$ queue and an opinion-dynamics model, showing how different structural properties lead naturally to different equilibrium-computation methods.
Read the full abstract

Differential Geometry

Harmonicity and Existence of Algebraic Generalized Ricci Solitons

In this paper, we study the harmonicity and existence of algebraic generalized Ricci solitons. Firstly, we characterize harmonic torsion of algebraic generalized Ricci solitons on arbitrary metric Lie algebras by an identity involving the Killing form. In particular, positive semidefiniteness of the Killing form implies harmonicity without a unimodularity assumption. Then, we construct generalized nilsolitons with nonzero torsion on indecomposable three-step nilpotent Lie algebras admitting no classical nilsoliton, in dimension seven and in dimensions $6m+d$ for $m>d\geq1$. Furthermore, we provide a spectral obstruction for nilpotent Lie algebras with abelian derived algebra and an obstruction based on the action of derivations on the quotient by the center. Combining these obstructions with explicit constructions, we prove that the filiform Lie algebra $\mathfrak m_2(n)$, $n\geq5$, admits a generalized nilsoliton if and only if $5\leq n\leq8$.
Read the full abstract

Chemical Physics

Molecular representation shapes the balance between target fidelity and exploration in flow based polymer generation

Designing polymers with targeted properties requires navigating vast chemical spaces from limited labeled data. Here we introduce PolyLatentFlow, a framework based on continuous-time flow matching in latent space for unconditional and conditional polymer generation, together with LlamaUni, a multimodal representation combining polymer sequence and 3D structural information. In unconditional generation, PolyLatentFlow with LlamaUni produced the largest yield of valid candidates novel relative to PolyInfo among the evaluated unconditional generators while maintaining high diversity. For $T_g$ conditioning, generated property distributions shifted systematically across a 200 {\deg}C target range. In multi-property tasks, molecular representations showed similar surrogate target fidelity but differed markedly in validity, training-set replay, and structural proximity to labeled polymers. PolyLatentFlow with LlamaUni consistently combined high validity with low replay and achieved the largest per-attempt yield of nonreplayed target hits for CO$_2$/N$_2$ conditioning. These results demonstrate latent space flow matching for polymer inverse design and identify molecular representation as a key determinant of target control and exploration beyond labeled chemistry.
Read the full abstract

History and Overview of Mathematics

Formalization of Sullivan's No Wandering Domains Theorem in Lean

We report on a Lean 4 formalization of Sullivan's No Wandering Domains theorem: every Fatou component of a rational self-map of the Riemann sphere of degree at least two is eventually periodic. The project formalizes the relevant background in normal families, the Montel-Carathéodory theorem, Julia and Fatou sets, local Sobolev regularity and Wirtinger derivatives, the Cauchy and Beurling transforms, the equivalence of analytic and geometric quasiconformality, and the measurable Riemann mapping theorem. This paper describes the translation of this mathematics into Lean, the proof architecture, the reusable components, and the autoformalization workflow.
Read the full abstract

General Mathematics

Qualitative Properties and Stability Analysis of Autonomous and Non-Autonomous Longitudinal T2DM Models

In this paper, we investigate the qualitative properties, long-term dynamic behavior, and stability of a longitudinal mathematical model describing the progression of Type 2 Diabetes Mellitus (T2DM). We significantly extend and refine the mathematical analysis of the model recently proposed by De Gaetano et al. (Journal of Theoretical Biology, 2024). Specifically, we analyze both the autonomous system with a fixed age parameter and the non-autonomous system incorporating explicit time-dependent aging dynamics under generalized conditions, providing rigorous proofs for global existence, uniqueness, positivity, asymptotic bounds, and stability properties.
Read the full abstract

History and Overview of Mathematics

Does the problem of the Nile have a solution?

The problem of the Nile has been stated by R. Fisher in 1936. This problem concerns the fair division of an agricultural land and is the eponymous problem of a general class of problems on measures and similar regions. In 1938, W. Feller has shown that the general problem has no solution. However, we will show that under a natural hypothesis, the original problem of the Nile is solvable with connected plots.
Read the full abstract