Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 30 August
For a finite graph, its energy is the sum of the absolute values of its adjacency eigenvalues. Let n be the product of powers of distinct odd primes, where all exponents are positive integers, the sum of the exponents is odd, and every prime whose exponent is odd is at least five. Among all nonempty sets of proper divisors of n, the energy of the corresponding integral circulant graph is uniquely maximised by the checkerboard divisor set consisting of those divisors for which the sum of the prime-power exponents is even. The maximum energy is one half of the sum of n and the product, over all prime factors, of explicit polynomial quantities. For exponent k and parameter x, the corresponding polynomial is given by two k plus one times x to the k-th power, together with four times the sum from zero to k minus one of j plus one times x to the j-th power with alternating sign determined by the parity of k minus j. For the proof, we use weighted prime-power Ramanujan transforms, which give an exact energy model in tensor form and extend to a polynomial matrix family for real parameters greater than one. A semidefinite parity theorem shows that the matrix obtained from this polynomial family by an explicit positive diagonal normalisation is a real symmetric contraction whose unique eigenvalue of modulus one is the simple eigenvalue determined by the parity of the exponent; this holds for even exponents at least two and parameters at least three, and for odd exponents at least one and parameters at least five. Tensorising this spectral structure and centring the binary divisor tensor yield a sharp one-norm bound for the corresponding tensor operator on sign vectors. In particular, for n equal to p squared times q cubed, with distinct odd primes p and q and with q at least five, this proves Roldan's conjectured maximality in this range.
Analysis of PDEs
Infinite time blow-up of solutions to the classical Keller-Segel model of chemotaxis in higher dimensions
We study the simplest parabolic-elliptic model of chemotaxis in ${\bf R^N}$, and show the optimal criteria for the existence of infinite time blow-up of solutions with the initial data below the Chandrasekhar singular solution when $N \geq 10$. In particular, we exhibit the differences of the criteria between the cases $N \geq 11$ and $N = 10$. Our argument is based on the study of the Cauchy problem for the transformed equation involving the averaged mass of the solution and the asymptotic expansions of solutions to the Liouville equation.
Read the full abstract
Optimization and Control
Online Gate-Driven Flow Control in Resin Transfer Moulding Using a Neural-Network Surrogate
In resin transfer moulding, complete saturation of the fibre preform is necessary before the resin front reaches the outlet vent(s), to prevent dry-spot formation. In practice, the flow front rarely advances uniformly due to race-tracking effects. We propose a combined estimation and control strategy to address this issue. We use pressure-sensor data collected during filling to estimate the unknown race-tracking strengths via an iterated extended Kalman filter, and to simultaneously optimise auxiliary gate pressures to prevent the resin from arriving at the vent before complete saturation occurs. To make this approach feasible in real time, we replace the expensive finite element-control volume model with neural network surrogate models. The Bayesian approximation error framework is used to account for the discrepancy between the surrogates and the original model. To make the training of the surrogates feasible with time-dependent control actions, we prove that the flow-front geometry depends only on the time-averaged gate pressures. We demonstrate the methodology on a representative forked geometry, showing that the combined estimation-and-control framework can substantially reduce the number of unfilled nodes at the end of filling compared with an uncontrolled baseline. However, the level of improvement depends strongly on the location and number of auxiliary gates.
Read the full abstract
Classical Analysis and ODEs
Monodromy and Isomonodromy for Linear $q$-Difference Systems with Coefficient Matrix $Ax+B$
In this paper, we construct canonical fundamental solutions for linear $q$-difference systems with coefficient matrix $Ax+B$, develop the associated isomonodromy theory, and study the differential limit as $q\to1$. We determine the asymptotic behavior of generic isomonodromic deformations, and derive explicit formulas for their monodromy data in terms of their asymptotic leading terms. We also show that the differential limit as $q\to1$ recovers the canonical fundamental solutions, the monodromy data, and the isomonodromic deformations of the corresponding differential systems.
Read the full abstract
Computer Vision
FuncRoom-Agent: Sequential Feed-Forward 3D Functional Indoor Scene Generation
We introduce Function-Room Generation, a new indoor 3D scene generation setting that creates rooms supporting explicit functional goals rather than merely visually plausible layouts. Existing agentic and executable methods improve controllability, but often depend on costly test-time generate–evaluate–revise loops, making functional room generation slow and computationally expensive. We address this challenge with three technical contributions. First, we design a recursive domain-specific language to effectively organize the hierarchical object compositions required by functional rooms, from room structure and major furniture to dense support-surface and nested small objects. It represents rooms as staged executable programs with explicit geometric and functional relations. Second, we propose a sequential feed-forward scene construction framework that distills recursive construction traces into a scene construction expert. At inference time, the expert writes executable DSL code stage by stage, and a deterministic executor directly instantiates each stage without teacher agents, online critics, or iterative repair. Third, we introduce ScenePRM, an execution-grounded process reward framework that improves the expert through reinforcement learning with functional, geometric, relational, and future-constructability feedback. We further establish a function-oriented benchmark and show state-of-the-art performance on both general indoor scene generation and function-room generation, achieving stronger functional completeness, relation correctness, geometric executability, and generation efficiency.
Read the full abstract
Systems and Control
Stimulated Oscillations in Renewable Energy Integrated Power Systems - Part II: Methodology of Oscillation Mitigation
As presented in Part I of this series, closely located poles can produce high-amplitude oscillations even under small perturba-tions, which are referred to as stimulated oscillations. As the second installment of this series, this paper develops a method-ology for stimulated oscillation mitigation. Firstly, the logical relationship between system stability and oscillation risk is in-vestigated, clarifying that stability is neither a necessary nor a sufficient condition for oscillation risk. Secondly, the dominant factors affecting the pole and zero position on the complex plane, as well as their effectiveness and limitations are analyzed. For feedback control systems in particular, the influence of feedback paths on the pole-zero distribution of closed-loop systems is ana-lyzed. On this basis, a methodology for stimulated oscillation mitigation is proposed. Combined with the reduced-order trans-fer function of systems with closely separated poles, the order relation and configuration of poles and zeros for the feedback path transfer function, together with the criteria for gain selec-tion, are elaborated. Finally, a parameter tuning scheme for the poles, zeros and gain of the feedback path transfer function is presented. The proposed methodology for stimulated oscillation mitigation based on feedback control is not restricted to specific devices and can serve as a methodological reference for the design of diverse oscillation suppression schemes.
Read the full abstract
Computation and Language
LLM Judges as Raters: A Pre-Registered Audit of Severity, Halo, Reliability, and Version Instability in LLM Essay Scoring on Public Corpora
Large language models (LLMs) are increasingly used as essay graders in learning analytics, evaluated almost exclusively with agreement statistics. Educational measurement warns that raters also differ in severity, show halo, and drift as instruments. We treat LLM judges as raters and run a pre-registered rater-effects battery (many-facet Rasch severity, residual halo, generalizability/decision studies, cross-version shifts, differential functioning) on public corpora in two languages (ENEM/Essay-BR; ASAP): 2,377 essays, 12 judges, 4 providers, 5 version contrasts, replicated cells, released as a score tensor. Judge severity spans 219 points on ENEM's 0-1000 scale; on ASAP the panel spread is 15-33% of the score range against a between-trained-human gap near 1%. Judge-human correlations sit in an undiscriminating .47-.56 band. All five version contrasts shift severity beyond a family-wise permutation null (up to 133 points), and one judge was deprecated mid-study, caught by identity canaries. Two pre-registered tests returned honest nulls: severity-adjusted leaderboard reversals did not survive a permutation null, and "silent drift" was refuted: agreement moved with severity in four of five contrasts. Replication yields self-consistency (phi>=.80 at k<=2) but not human-level accuracy, and a same-instrument check overturned our own halo comparison: matched on instrument and calibration, we find no credible evidence that judge halo exceeds the trained-human range.
Read the full abstract
Robotics
Task-Relevant Feature-Dynamics Fidelity Enables Zero-Shot Sim-to-Real Transfer for Robotic Ultrasound Scanning
Robotic ultrasound policies operating directly on B-mode images require extensive interaction data, whereas real-robot data collection is costly and safety-constrained. Simulation provides a scalable alternative, but zero-shot transfer depends not only on single-frame realism but also on whether simulated observations reproduce task-relevant feature changes induced by probe motion. We term this cross-domain consistency task-relevant feature-dynamics fidelity (TR-FDF). Under local regularity assumptions, our contraction analysis shows that greater sensitivity of TR-FDF mismatch to probe motion reduces the effective closed-loop contraction margin, whereas motion-independent errors primarily enlarge the residual error bound. Guided by this analysis, we develop a TR-FDF-oriented ultrasound simulator that combines a shared structural intermediate domain, trajectory-level fixed noise, and few-step conditional flow generation. In phantom experiments, a policy trained exclusively in simulation succeeded in 390 of 400 zero-shot deployments across four target planes. The simulator achieved an FID of 29.66 and generated observations at 67.1 Hz. Controlled interventions, ablations, and baseline comparisons showed that TR-FDF sensitivity complements single-frame realism in predicting zero-shot transfer performance.
Read the full abstract
Quantum Physics
Demonstration of traveling-wave interactions between spontaneous photon emissions and atoms in a chiral F-P cavity
The enhancement of atom-photon interactions with F-P cavities provides a suitable platform for studying quantum optics and atomic physics. However, the emission fields in linear F-P cavities are in the standing-wave mode, which leads to non-uniform atom-photon coupling and a short storage lifetime of cavity-enhanced spin-wave quantum storages. This study experimentally demonstrates traveling-wave atom-light interactions in an F-P cavity that can preserve light helicity. First, a bias magnetic field is applied along the z-axis to define the quantization axis, which lifts the Zeeman degeneracy and breaks the time reversal symmetry. Next, non-classically correlated pairs of Stokes photons and spin waves are produced based on the Duan-Lukin-Cirac-Zoller scheme. The Stokes photons initially emitted from a single circularly polarized atomic transition have left-and right-hand circular polarizations when propagating along the +z (forward) and -z (backward) directions, which are preserved in the chiral cavity within the atom-photon interaction region. Thus, when the forward and backward Stokes fields resonate with the cavity, they may interact with the atoms in a traveling-wave manner. This is confirmed by measuring the time-dependent retrieval efficiencies of spin waves correlated with the forward and backward Stokes fields. This work paves the way for demonstrating traveling-wave atom-photon interactions in F-P cavities.
Read the full abstract
Robotics
A Sliding Window Filter on the Galilean Group for Consistent Aided Inertial Navigation with Unknown Measurement Delays
We study aided inertial navigation when the aiding sensor measurements are subject to an unknown constant delay. The goal is to estimate the delay and navigation state jointly so that delayed measurements correct the trajectory at the appropriate times, yielding a more accurate navigation solution. We formulate the problem on the special Galilean group, which provides a natural state-space structure for aided navigation with uncertainty in both motion and timing. We then examine the observability of joint delay and state estimation and show that, for a single delayed measurement, the model admits an exact symmetry in which a change in the delay can be compensated by a change in the navigation state, leaving the measurement unchanged. Processing measurements individually allows spurious information to `leak' along the corresponding null direction of the measurement Jacobian, producing overconfident and inconsistent estimates. Applying measurements from multiple times together can eliminate this direction when the trajectory is informative enough. Motivated by this result, we develop a sliding window filter that retains a short history of navigation states and applies delayed aiding corrections jointly across the active window. We conduct a series of simulation studies to characterize estimator accuracy and consistency. The simulations demonstrate that an estimator that does not maintain an adequate window can rapidly become highly inconsistent, whereas even a short sliding window markedly improves consistency by providing the temporal support that observability requires.
Read the full abstract
Machine Learning
On the Plasticity Collapse in Continual Machine Unlearning
Machine unlearning enables deep neural networks to selectively remove the influence of specific data in response to privacy and regulatory requirements. While prior work largely studies single-shot unlearning, real-world systems must accommodate continual unlearning, where multiple unlearning requests occur sequentially over time. In this work, we identify a fundamental limitation of this setting: plasticity collapse, a progressive breakdown in a model's ability to effectively forget. Through theoretical analysis of continual unlearning dynamics, we show that continual unlearning operations accumulate geometric constraints in parameter space, leading to saturated subspaces that restrict future updates. This structural effect induces two distinct failure modes: (1) Forward failure – diminishing forgetting quality for subsequent tasks, and (2) Backward failure – spontaneous re-memorization of previously forgotten information. Extensive experiments across multiple architectures, datasets, and methods in image classification confirm that plasticity collapse is not an artifact of specific implementations, but a pervasive phenomenon inherent to continual unlearning. Our findings reveal a critical barrier to the long-term reliability of machine unlearning systems and motivate the development of plasticity-preserving unlearning algorithms. Our code is available at https://github.com/TIML-Group/Continual-Machine-Unlearning-Plasticity-Collapse
Read the full abstract
Combinatorics
A complete solution to the Tokushige measure conjecture and its stability
We resolve three conjectures proposed by Tokushige in 2013 about cross $t$-intersecting families of subsets and integer sequences. For $0<p<1$ and $\mathcal F\subseteq2^{[n]}$, define the $p$-biased measure by $\mu_p(\mathcal F)=\sum_{F\in\mathcal F}p^{|F|}(1-p)^{n-|F|}$. Two families $\mathcal F_1,\mathcal F_2\subseteq2^{[n]}$ are cross $t$-intersecting if $|F_1\cap F_2|\geq t$ for every $F_1\in\mathcal F_1$ and $F_2\in\mathcal F_2$. We prove that, for every $n\geq t\geq 2$ and $0<p_1,p_2\leq1/(t+1)$, such a pair satisfies $\mu_{p_1}(\mathcal F_1)\mu_{p_2}(\mathcal F_2)\leq(p_1p_2)^t$. When $p_1,p_2<1/(t+1)$, equality holds if and only if both families are the same $t$-star $\mathcal S_T=\{F\subseteq[n]:T\subseteq F\}$ for some $T\in\binom{[n]}{t}$. Together with the previously known case $t=1$, this completely resolves Tokushige's measure conjecture. We also prove that every pair whose measure product is close to the maximum must be close to a common $t$-star. More precisely, if $p_1,p_2<1/(t+1)$ and $\mu_{p_1}(\mathcal F_1)\mu_{p_2}(\mathcal F_2)>(1-\varepsilon)^2(p_1p_2)^t$, then there exists $T\in\binom{[n]}{t}$ such that $\mu_{p_i}(\mathcal F_i\mathbin{\triangle}\mathcal S_T)<C\varepsilon$ for $i=1,2$, where $C$ depends only on $t,p_1,p_2$. This improves Tokushige's conjectured $C\sqrt{\varepsilon}$ estimate to $C\varepsilon$. For integer sequences, we prove that if every sequence in $\mathcal H_1\subseteq[m]^n$ agrees with every sequence in $\mathcal H_2\subseteq[m]^n$ in at least $t$ coordinates, then $|\mathcal H_1||\mathcal H_2|\leq m^{2(n-t)}$ for all $n\geq t\geq1$ and $m\geq t+1$. We further obtain a more general result in which a separate agreement requirement is imposed for each possible value. This extends a theorem of Frankl and Kupavskii and recovers their earlier cross intersection–union product theorem.
Read the full abstract
Information Theory
Linear Coding of LTI Sources Over Vector Gaussian Channels: A Majorization Approach
We study the design of linear time-invariant (LTI) encoder-decoder pairs for transmitting the state of a discrete-time LTI vector source over power-constrained parallel Gaussian channels with feedback. Two types of power constraints are considered. Under individual subchannel power constraints, a necessary and sufficient condition for designing an encoder-decoder pair that achieves bounded estimation error covariance (EEC) is established via two coupled majorization inequalities involving the subchannel signal-to-noise ratios and the antistable poles of the source. Under total channel power constraint, we derive the minimum total power required for a feasible encoder-decoder design by exploiting partial-order progamming under majorization order. An analytical optimal power allocation is obtained for the case of equal noise variances, which admits a water-filling interpretation; for general noise case, a sequential water-filling algorithm is developed. Our results reveal that the difficulty of transmitting a discrete-time LTI source via LTI coding is governed not only by its topological entropy, but also by the evenness of the log-magnitudes of its antistable poles. The design methods for feasible encoder-decoder pairs are also provided.
Read the full abstract
Computer Vision
ARMOR: Manifold-Oriented Training for Adversarially Robust Aerial Object Detection under Data Scarcity
Aerial object detection is increasingly deployed in real-world applications, but models remain vulnerable to physical, universal adversarial patches that cause them to miss objects. Furthermore, defenders face the practical constraint of training data scarcity: aerial imagery is costly to collect and label, so a deployment site typically yields hundreds of images rather than the tens of thousands that adversarial robustness benchmarks assume. To tackle model vulnerability and training data scarcity, we propose Adversarial Robustness with Manifold-Oriented Training (ARMOR), a novel defense that realizes the core insights of on-manifold adversarial training (OMAT) in low-data regimes. ARMOR builds on the insight of OMAT to model the data manifold - the compact structure capturing the data's relevant features - to learn and robustify these features during training. While OMAT relies on the data-intensive operations of training large generative models and adversarial training to achieve this, ARMOR adopts a data-efficient approach that reuses labels the detection task already supplies: ARMOR (i) masks image backgrounds to retain object-relevant features, and (ii) injects randomized patches on objects to improve feature robustness. Our low-data experiments with physically-realizable adversarial patches evaluate both query-free transfer attacks and defense-aware attacks. ARMOR maintains strong clean performance of over 0.90 model confidence, while improving adversarial robustness by up to 0.32 in model confidence over state-of-the-art defenses. Physical experiments with printed patches confirm that these gains survive deployment. Overall, ARMOR translates insights from manifold-based training to defend object detectors amidst training data scarcity.
Read the full abstract
High Energy Physics (Experiment)
Low-energy Muon-Nucleon scattering experiment: LUNE (White Paper)
The HIAF will provide high-intensity, high-quality muon beams with momenta from 0.5 to 7.5 GeV/c. This energy range is uniquely suited for precision muon scattering, bridging the gap between low-energy electron facilities and future high-energy lepton-ion colliders. In particular, HIAF will enable precision measurements with both positive and negative muon beams over a broad kinematic range, complementing existing electron-scattering facilities such as JLab, EicC and EIC. Based on HIAF muon source, the LUNE Collaboration has been established to address several fundamental questions in nuclear and particle physics, including the proton charge radius puzzle, nucleon electromagnetic structure, and the dynamics of quantum electrodynamics and hadronic interactions. The program proceeds in two phases, from elastic scattering to nucleon structure and beyond-Standard-Model searches. The experiment is expected to determine the proton charge radius with a precision of approximately 1.0% using elastic muon-proton scattering. It will also perform systematic measurements of the proton electromagnetic form factors with both $\mu^+$ and $\mu^-$ beams, enabling precise studies of two-photon exchange effects and stringent tests of quantum electrodynamics. Beyond elastic scattering, LUNE will investigate TMD, gravitational form factors, and nuclear charge radii, providing new insights into the 3D structure of nucleons and nuclei. The experiment will further address important topics including Coulomb-distortion corrections, nuclear medium effects, and possible signatures of physics beyond the Standard Model. This white paper presents the scientific motivation, detector concept, expected performance, and long-term strategy of LUNE.
Read the full abstract
Information Theory
Generalized Hamming Weights of AJ-Gorenstein One-Point Codes
We study generalized Hamming weights along the one-point code flag of an AJ-Gorenstein curve. We organize these weights in a graded array, the zero diagram, whose entries are generalized coweights: the largest numbers of evaluation points on which subcodes of prescribed dimensions vanish simultaneously. Twisted and Wei duality show that each row of the zero diagram determines both the generalized Hamming weights of a lower block of short codes and the missing weights of a reflected upper block of long codes in the GHW diagram of the complete flag. Our main quantitative result is a uniform coverage theorem. For an AJ-Gorenstein curve of genus $g$ and evaluation length $n>2g$, the proportion of generalized-weight positions determined exactly throughout the complete flag satisfies $\operatorname{Cov}_{\mathrm{full}} \ge \frac{n(n-1)+4g}{n(n+2g-1)}>\frac12$. Thus more than half of all generalized-weight positions in the complete flag are determined uniformly. For the smallest Suzuki curve, the general and Castle-specific mechanisms together determine $2{,}280$ of the $2{,}912$ positions, giving an exact coverage of $78.30\%$.
Read the full abstract
Machine Learning
Denoising as Projection: Constrained Optimization with Gradient-Guided Diffusion
Diffusion models are increasingly used not only for sampling from learned data distributions, but also for generating samples that optimize task-specific objectives. A common approach is to guide the reverse diffusion process using gradients of an external objective. However, when the data distribution is supported on a structured feasible set, such as a manifold or a constraint set, gradient guidance can move samples away from the learned data geometry. In this paper, we study a simple projected-gradient-guided diffusion update based on the observation that the Stein denoising operator can act as an approximate projection onto the data geometry. The proposed update incorporates the objective gradient inside the denoising step, yielding an inference-time method that uses only a pretrained denoiser and gradient evaluations. We analyze this update as an inexact projected-gradient method for constrained optimization over learned feasible geometries. Our theory covers three settings: linear manifolds, compact convex feasible sets, and compact Riemannian submanifolds. In all these settings, we prove descent and finite-time convergence guarantees. Numerical experiments support the theoretical interpretation and illustrate how the proposed update balances objective descent with preservation of the learned geometry.
Read the full abstract
Theoretical Economics
Pure Risk
We introduce a behavioral notion of domain-specific risk aversion that separates attitudes toward risk from deterministic utility: an agent is more pure risk averse in one domain than in another if, for prizes that are indifferent under certainty, he is more averse to risk in the former domain than in the latter. We develop a model that goes beyond expected utility by allowing risk attitudes to vary across domains, while preserving expected utility within each domain. The domains are subjective and need not be specified in advance; they are identified from choice behavior. We establish uniqueness of the model's parameters and provide an axiomatic characterization.
Read the full abstract
Metric Geometry
Simultaneous Busemann-Petty and Shephard Volume Comparisons
We study the simultaneous Busemann-Petty and Shephard volume comparison problem: whether comparison of the volumes of all central hyperplane sections and all orthogonal hyperplane projections determines the ordering of the volumes of two convex bodies. For every $n\geq5$, we construct origin-symmetric convex bodies of revolution $K,L\subset {\mathbb R}^n$ such that every central hyperplane section and every orthogonal hyperplane projection of $K$ has strictly smaller volume than the corresponding section or projection of $L$, while $|K|>|L|$. For $n\leq4$, the affirmative solution of the Busemann–Petty problem shows that the section inequalities alone imply $|K|\leq|L|$. Without origin symmetry, we construct such counterexamples in every dimension $n\geq2$, with one body a nontrivial translate of a Euclidean ball and the other a noncentrally symmetric body of constant brightness.
Read the full abstract
Networking
RadioSight: Predictive mmWave XR Network Optimization from Dynamic Neural Radio Fields
Next-generation extended reality (XR) networks rely on mmWave communication for multi-gigabit throughput, yet highly directional links are vulnerable to user mobility and blockages, causing frequent outages under reactive beam management. Emerging neural radio fields can predict radio propagation, but prior work remains limited to offline channel reconstruction. We introduce RadioSight, a real-time multi-modal radio field system for predictive mmWave optimization and proactive Multi-User MIMO beamforming. RadioSight combines backward beam-tracing with real-time semantic object synchronization to anticipate RF geometry changes without full model retraining. Implemented as an edge-executable pipeline for commercial 28 GHz arrays, RadioSight determines each scheduling window's beams during the preceding window without exhaustive beam sweeps. Experiments show that RadioSight reduces beam-search error by up to ~50%, improves median throughput by 2x, and enhances link stability.
Read the full abstract
Machine Learning
Adversarial Online Classification with a Preview
Worst-case online classification is governed by sequential complexity, such as Littlestone dimension, and can be impossible even for statistically simple classes, such as thresholds of VC dimension one. We study a preview model in which an oblivious adversary fixes an entire labeled sequence of length $T$, a uniformly random subset of size $pT$ is revealed before prediction begins, and the remaining $(1-p)T$ examples are then presented in their original adversarial order. Against the best full-sequence hypothesis evaluated on the unrevealed examples, we characterize the dependence on the preview rate $p$: for binary classes of VC dimension $d$, the optimal excess loss is $\Theta(d/p+\sqrt{dT})$, up to the trivial cap at $T$; for multiclass classes we obtain the corresponding $\widetilde O(d_{\rm DS}/p+\sqrt{d_{\rm Nat}T})$ bound with no dependence on the number of labels. Thus a random preview can replace worst-case sequential complexity by classical statistical dimensions without randomizing the online order. To achieve the sharp binary bound, our ChainedPrediction algorithm uses an online analogue of chaining, implemented as a multiscale aggregation algorithm rather than only as an analytic argument.
Read the full abstract
High Energy Physics (Experiment)
From a Long-standing Prediction to a New Family of Hadrons
Fully charmed tetraquarks have evolved from a long-standing theoretical prediction into one of the most active frontiers in hadron spectroscopy. This article reviews their development from early theoretical studies and experimental searches to the recent breakthroughs at the Large Hadron Collider, with particular emphasis on the contributions of the Nanjing Normal University (NNU) and Tsinghua University (THU) teams at the CMS experiment. We summarize the discovery of the fully charmed tetraquark family, the establishment of interference among resonances, and the first determination of their quantum numbers. These advances have transformed the search for a single exotic resonance into the study of a new family of hadrons and opened a promising avenue for exploring the nonperturbative dynamics of Quantum Chromodynamics.
Read the full abstract
Probability
Disorder Thresholds and Free Energy of Brownian Directed Polymers with Product and Radial Spatial Correlations
We study a Brownian directed polymer in a centered Gaussian environment that is white in time and colored in space having long-range spatial correlations. For product-type covariances \(Q(x)\asymp\prod_{j=1}^d(1+|x_j|)^{-\alpha_j}\), with \(\alpha_j\in(0,1)\) and \(\kappa=\sum_j\alpha_j\), we identify the disorder transition at the marginal value \(\kappa=2\). For \(\kappa>2\), weak disorder holds at sufficiently small inverse temperature; for \(\kappa<2\), the quenched free energy $p(\beta)$ satisfies \(-p(\beta)\asymp\beta^{4/(2-\kappa)}\) as \(\beta\downarrow0\). For \(\kappa=2\), strong disorder holds for every \(\beta>0\), while \(p(\beta)=0\) for all sufficiently small \(\beta\), so \(\beta_c=0<\bar\beta_c\). We also consider the radial covariance cases, where $ Q(x)\asymp(1+|x|)^{-\vartheta}$, when \(d\ge3,\vartheta=2\) and \(d=2,\vartheta\ge2\), which was left unanswered in Lacoin~\cite{Lacoin2011}. When $d=2$, we get \(\ln(-p(\beta))\asymp-\beta^{-2}\) for \(\vartheta>2\) and \(\ln(-p(\beta))\asymp-\beta^{-1}\) for \(\vartheta=2\). The proofs consist of replica coupling, Feynman–Kac variational formula, overlap methods, and continuous-space fractional moments with ordered Wiener-chaos changes of measure.
Read the full abstract
Analysis of PDEs
Non-time-decaying global classical solutions to nonlinear wave equations in 3D under the null condition
We present an alternative proof of the global well-posedness of nonlinear wave equations in three spatial dimensions under the null condition, in the regularity regime of the classical local existence theory, assuming smallness of the angular derivatives. Unlike previous methods, which rely on decay in time, our approach is based solely on spatial decay. This provides a new perspective on the problem and offers potential applications to the study of Einstein's equations, which we intend to explore in future work.
Read the full abstract
Numerical Analysis
ENPINN: Energy-Norm-Guided Gradient-Enhanced PINNs for Generalized Transport Problems with Sharp Gradients
Physics-informed neural networks (PINNs) have emerged as a meshless alternative to conventional numerical methods for solving partial differential equations (PDEs). However, their limited ability to capture sharp gradients can lead to substantial errors when resolving boundary and interior layers. Here, we introduce an energy-norm-enhanced PINN (ENPINN) that incorporates gradient information and variational structure into the loss function to improve the resolution of layer-dominated solutions. We first examine two related formulations: weak-loss PINNs (WLPINNs), which incorporate test functions into the conventional PINN residual, and gradient-enhanced PINNs (gPINNs), which augment the loss with spatial derivatives of the PDE residual. By analyzing these formulations, we identify their limitations in resolving steep solution gradients and motivate the systematic construction of ENPINN. We establish theoretically how the energy-norm error depends on the ENPINN loss and show that a suitably modified residual-derivative term is essential for accurately capturing boundary layers. We further establish the existence of neural-network approximations with arbitrarily small energy error and derive corresponding derivative bounds, providing a theoretical foundation for the proposed framework. The performance of ENPINN is assessed through systematic comparisons with existing PINN variants for convection-diffusion-reaction problems exhibiting steep gradients. Numerical experiments include a combustion model, a coupled multi-scale system, a two-dimensional Burgers equation with an interior layer, and a three-dimensional time-dependent problem.
Read the full abstract
Spectral Theory
Scaling inequalities and limits for clamped plate eigenvalues on geodesic disks
For the bilaplacian in spherical and hyperbolic spaces, clamped vibrating and buckling eigenvalues on geodesic disks are shown to satisfy scaling inequalities analogous to the standard scale invariance of Euclidean plate eigenvalues. These results extend curved-space scaling results from the Laplacian to fourth-order eigenvalue problems. In addition, the limiting behavior of the scaled eigenvalues is determined as the disks expand to fill the ambient space. Depending on the geometry and the choice of scaling, the eigenvalues tend to zero, positive or negative infinity, or finite values associated with the bottom of the hyperbolic spectrum. The negative divergence in one spherical buckling limit is related by conformal inversion to an exterior buckling problem.
Read the full abstract
Game Theory
Fair Division Under Boolean Valuations: Beyond Normalization
We study fair division of indivisible items when agents have arbitrary two-level preferences: the value of each agent for any set of items is Boolean, which need not be monotone or additive. Notably, we do not impose the standard assumption of normalization, i.e., different agents may value the empty set at different Boolean levels. Since the preferences are nonmonotone, envy-freeness up to one item (EF1) and envy-freeness up to any item (EFX) each admit several variants, depending on which items are tested for removal and whether they are removed from the envious agent's bundle or the envied agent's bundle. This paper investigates the existence of these variants of EF1 and EFX, on their own and together with economic efficiency, incentive compatibility, feasibility constraints, and lottery-based randomization. Our paper presents a wide range of positive and negative results that collectively highlight an interesting phenomenon: the landscape of achievable guarantees depends crucially on the number of normalized agents, who value the empty bundle at the lower Boolean level.
Read the full abstract
Machine Learning
Target-Aware State-Adaptive $p$-Dirichlet Graph Neural Regression for Non-Invasive Body-Composition Estimation
Accurate estimation of body-composition outcomes, including body fat percentage (BFP), bone mineral density (BMD), and appendicular lean mass (ALM), is important for evaluating metabolic, skeletal, and muscular health. Direct assessment using dual-energy X-ray absorptiometry (DXA), however, requires specialized equipment and involves ionizing radiation. We propose a target-aware, state-adaptive $p$-Dirichlet energy-flow graph neural regression ($p$SADE-GNR) framework for estimating these outcomes from non-invasive anthropometric measurements. A neural encoder maps participant representations to hidden states that are propagated over an outcome-specific participant-similarity graph by a state-adaptive forward-Euler discretization of the graph $p$-Dirichlet energy flow. Graph distances weight each original or latent coordinate by its normalized absolute training-fold correlation with the outcome. Using clinical data from the Pennington Biomedical Research Center and five-fold cross-validation, the correlation-weighted model using the original standardized measurements achieved the lowest root mean squared error in all nine primary outcome-cohort combinations and outperformed previously reported support vector regression or least-squares support vector regression reference values in eight of nine comparisons. Autoencoder, variational-autoencoder, and Gaussian-mixture variational-autoencoder representations generally did not improve primary-outcome prediction or reduce computational cost. In an exploratory age-prediction analysis including ALM, BMD, and BFP as predictors, the correlation-weighted GMVAE model achieved the lowest mean error in all three cohorts. These results support target-aware, state-adaptive $p$-Dirichlet graph neural regression for non-invasive body-composition estimation.
Read the full abstract
Category Theory
The $(\infty,\infty)$-category of spans
In this paper, we construct the $(\infty,\infty)$-category $\mathsf{Span}_\infty(\mathcal{C})$ of spans, also known as correspondences, in any given $(\infty,1)$-category $\mathcal{C}$ with finite limits. This yields new models for the span $(\infty,n)$-categories for $n \in \mathbb{N} \cup \{\infty\}$. We characterize the mapping $(\infty, n-1)$-categories in these $(\infty,n)$-categories, and thereby verify that our model agrees with other models for spans. Finally, and most importantly, we prove a new universal property, characterizing functors into span $(\infty,n)$-categories, which specializes to the well-known relation with the twisted arrow categories in dimension $1$. These results will be used in the sequels to construct higher analogs of the classical Hall algebra construction, where "higher" refers to both higher categorical and "higher monoidal" structures, i.e., $\mathsf{E}_k$-algebras in $(\infty, n)$-categories for $n, k>1$.
Read the full abstract
Machine Learning
Learning Human Health and Diseases from 24-hour Wrist Movement
Much of human health and function unfolds beyond the clinic, through the movements of everyday life. Wrist-worn accelerometers capture these movements continuously, yet their rich signals are often reduced to a small set of predefined behavioural summary measures. Here, we present Sensori, a self-supervised foundation model that learns general-purpose health representations directly from 24 hours of raw tri-axial wrist movement. We developed and evaluated the model across four population-based cohorts from the United Kingdom, China and the United States, comprising 122,640 participants contributing 683,617 person-days of free-living recordings. Sensori condensed each day of movement into a representation that captured diverse movement behaviours, demographic characteristics, health axes and physical function. Evaluation in independent cohorts showed that these representations generalised across populations and measurement settings without retraining. When added to common clinical covariates, Sensori significantly improved prevalent disease classification for 52 of 102 eligible conditions (median delta AUROC, 0.060; range, 0.012-0.242) and incident disease risk prediction for 26 of 87 eligible conditions (median delta Uno's C-index, 0.064; range, 0.025-0.172), with the largest gains for neurological and psychiatric disorders. These findings establish 24-hour wrist movement as a rich and scalable source of health information, with the potential to support passive health monitoring and disease prediction at population scale.