Statistical Mechanics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 5 September
We develop a comprehensive many-body theory for systems of particles obeying quantum unified statistics, or quons. After exploring the properties of the Fock space of this system, we formulate a systematic S-matrix expansion and a generalized Wick's theorem. A consistent Green-function formalism is constructed at both zero and finite temperatures, accompanied by a generalized Wick's theorem appropriate for infinite-statistics operator algebras. Within this framework, we establish diagrammatic rules for interacting quon systems. Employing the random phase approximation, we derive the dielectric function and reveal the emergence of anomalous plasmon modes that have no direct counterpart in conventional Bose or Fermi systems. We further analyze the ground-state energy, energy-loss function, generalized Thomas-Fermi screening wave vectors, and Friedel oscillations, elucidating how infinite statistics qualitatively modifies collective behavior and screening properties.
Machine Learning
A budget-dependent crossover between coverage- and response-based training-set selection for machine-learned interatomic potentials
Selecting compact training sets for machine-learned interatomic potentials requires deciding whether to preserve structural diversity or target configurations on which models disagree. The better choice can depend on how much data is retained, making a comparison at one training-set size insufficient. Here we link selection criteria to prediction accuracy through a budget-resolved comparison of retrained MACE models on GAP-20 Carbon and pooled revised MD17. Structural coverage is compared with a response-guided selector that targets disagreement between a coverage-trained model and a full-data reference. This retrospective response witness tests the value of model disagreement for compressing an already labelled pool. At 5%, coverage gives smaller absolute deviations from the full-data error than random sampling across four force endpoints in both datasets. The witness has larger deviations than coverage at 1% and 5%, but the ordering reverses at 20%. At 20%, witness-selected models also lower direct held-out force errors by 0.46–5.89% relative to coverage, with all eight paired training-seed intervals favouring the witness. Six errors fall below the full-data reference. Mean force-error reductions are 0.164–0.167~meV~$\text{\AA}^{-1}$, with larger gains for tail and masked endpoints. Complementary analyses show that learned similarity preserves the coverage ranking, while selecting by frozen-model error gives higher error than embedding coverage. These findings establish retained-data budget as a deciding variable in atomistic training-set selection and provide a direct test of when response-guided compression improves on structural coverage.
Read the full abstract
Computer Vision
FACT: A Forensic Agent with Compiled Tool-Use Trajectories for AI-Generated Image Detection
AI-generated image detection is increasingly open-world: new image generators produce highly realistic images that make visual artifacts harder to identify. Existing detectors usually rely on a fixed set of forensic cues, so a detector that works well for one generator family may fail on another. We introduce FACT (Forensic Agent with Compiled Tool-use Trajectories), which learns an image-conditioned tool-use policy for forensic analysis. Instead of applying a fixed detector, FACT decides which forensic tools to call, interprets the returned evidence, and stops when sufficient evidence has been collected. FACT follows an Evolve–Distill–Refine pipeline: it evolves an execution-verified forensic skill, compiles the skill into action–observation tool-use trajectories, distills them into a compact agent, and refines the policy with cost-aware GRPO. Across two internal and four public benchmarks, FACT achieves the best performance among all compared methods, including on recent unseen generators, deepfakes, and manipulated images.
Read the full abstract
Superconductivity
Extended strange metal regime in a pure nematic quantum critical superconductor
High-temperature superconductivity often emerges from a strange metallic state, where the electrical resistivity exhibits a linear-in-temperature dependence over an anomalously extended temperature range. The prevailing belief is that magnetic critical fluctuations gives rise to strange metallicity, enhancing the superconducting transition temperature. Here, using high pulsed magnetic fields, we have uncovered the strange metallic ground state hidden below the superconducting dome of nonmagnetic FeSe$_{1-x}$Te$_{x}$, which harbors a quantum critical point (QCP) of pure electronic nematicity, characterized by spontaneous rotational symmetry breaking. Unlike the conventional quantum criticality, this strange metallic state does not appear in a fan-shaped region above the singular QCP but spans a wide compositional range, where pairing interactions are strengthened by nonmagnetic nematic critical fluctuations. This stands in sharp contrast to the much cleaner system FeSe$_{1-x}$S$_{x}$, which displays a quantum critical fan above nematic QCP, indicating that disorder-induced spatial randomness of the nematic fluctuations likely enlarges the QCP of FeSe$_{1-x}$Te$_{x}$ into an extended region of criticality, as suggested by relevant hybrid Quantum Monte Carlo simulations. These observations highlight superconductivity promoted by a unique interplay between pure nematic critical fluctuations, strange metallicity and disorder, providing new insight into the emergence of non-Fermi-liquid transport in various correlated materials.
Read the full abstract
Computational Complexity
Ulam Rank Aggregation Is Hard to Approximate for Four Rankings
We study the approximability of rank aggregation under the Ulam metric. In the Ulam median problem, the goal is to find a ranking (permutation) minimizing the sum of its Ulam distances to the input rankings, while in the Ulam center problem, the objective is to minimize the maximum such distance. We prove that, for every $0<\varepsilon< 1/34$, it is $\mathrm{NP}$-hard to approximate either Ulam median or Ulam center within a factor of $35/34-\varepsilon$, even when the input consists of only four rankings. We further show that unless P = NP, neither problem admits a polynomial-time additive approximation scheme. Prior to our work, only the exact versions of both problems were known to be $\mathrm{NP}$-hard, and that too only when the number of input rankings is unbounded [Fischer et al., ESA'25 and Bachmaier et al., J. of Discrete Algorithms'15]. Furthermore, our inapproximability results are optimal in terms of the number of input rankings since for three inputs it is already known to be polynomial-time solvable [Chakraborty, Das, Krauthgamer, SODA'21]. En route, we introduce a new general framework for reducing Boolean constraint satisfaction problems (CSP) to the Ulam median with only four inputs. As a specific instantiation of the reduction framework, we obtain our hardness-of-approximation results. The corresponding hardness for the Ulam center follows from a reduction from the Ulam median.
Read the full abstract
Analysis of PDEs
Long-time asymptotics of nonlinear Fokker-Planck equations with inhomogeneous diffusion and natural boundary conditions
In this paper, we study the long-time asymptotics for nonlinear Fokker-Planck equations with spatial inhomogeneous diffusion, based on the law of energy dissipation. First, we derive a priori positive lower and upper bounds for solutions of the equations. Next, we give a sufficient condition for deriving the exponential decay of the dissipation function. Finally, we investigate whether the given sufficient condition is essential or not by numerical computation.
Read the full abstract
Mathematical Physics
An Algebraic Proof of Gauge-Fixing Independence
This paper provides an algebraic proof of the gauge-fixing independence of perturbative asymptotic expansions in a finite-dimensional model of non-Abelian gauge theory. We develop an algebraic framework using the BRST formalism and perturbation theory. Our main theorem shows that under appropriate transversality conditions, normalized expectation values of observables remain unchanged under smooth deformations of the gauge-fixing conditions that preserve these assumptions.
Read the full abstract
Sound
Where Does the Sound Go? Tracing Acoustic Information Loss in Audio-Conditioned LLMs
Audio-conditioned language models often underuse acoustic cues such as prosody, emotion, and non-speech sounds, raising the question of whether ASR-supervised frontends discard this information before it reaches the LM. We test whether the frontend is responsible by comparing Whisper-Tiny and Whisper-Small with EnCodec, DAC-VAE, and WavTokenizer in a shared Qwen3.5-4B audio-LM pipeline on ASR, emotion recognition, and sound captioning. Encoder replacement alone does not resolve this underuse: Whisper variants remain strongest overall, including on emotion and environmental sound captioning. To localize the failure, we trace task-relevant information through the encoder, projector, LM layers, and LM head. Linear probes and geometric analyses show that discriminative acoustic structure remains recoverable at the final LM layer, even when MCQA accuracy trails probe accuracy by up to 83 points. Because the answer format and decoding procedure are controlled, this task-dependent gap points to content-specific readout failure rather than generic format bias. LogitLens analyses and a targeted LM head intervention support the conclusion that acoustic underuse is not explained solely by encoder-side information loss and that readout alignment can be a dominant bottleneck.
Read the full abstract
Information Theory
Algorithmic List Decoding at Capacity and Optimal Proximity Gaps for Reed-Solomon Codes
We give a unified hidden-derivative framework for list decoding and mutual correlated agreement of ordinary Reed–Solomon codes over prime fields, on arbitrary prescribed evaluation sets. For every fixed slack $\gamma>0$, every sufficiently large block length $n$, every prime $q\ge n$, and every dimension $1\le k\le(1-\gamma)n$, a deterministic algorithm finds all codewords within relative distance $1-k/n-\gamma$ in $q^{O_\gamma(1)}$ time. The final list has size $n^{O_\gamma(1)}$, independently of $q$. Both statements extend to bounded-input-list recovery, with constants depending additionally on the input-list bound. For every fixed curve degree $\ell$, at most $n^{O_{\gamma,\ell}(1)}$ parameters on a curve $f_0+zf_1+\cdots+z^\ell f_\ell$ admit a nearby codeword whose exact agreement support is not a maximal jointly explained support of the coefficient words. For lines this gives MCA error $n^{O_\gamma(1)}/q$, with no proximity loss. The interpolation stage reparameterizes and optimizes the hidden-derivative construction of Brakensiek, Chen, Putterman, Zhang, and Zheng; differential root enumeration uses Kopparty's algorithm. We then prove that a specialization-safe differential equation has a cover by constant-dimensional varieties of polynomial cumulative degree, outside polynomially many parameter values. Intersecting these varieties with equations from the full agreement support yields both the field-size-independent list bound and exact-support MCA.
Read the full abstract
Metric Geometry
Exact Finite Integral Geometry: Directional Kernels and Spherical Designs
We study when an invariant directional average from integral geometry can be replaced exactly by finitely many directions. For an even continuous kernel $\psi:[-1,1]\to\R$, let $T_\psi$ be the associated zonal convolution operator on the sphere and let $\cB_\psi K$ be the corresponding surface-area observable of a convex body $K\subset\R^d$. Our first result is a sharp norm identity: the worst relative error over all convex bodies equals one half of the $L^\infty$ norm of the potential discrepancy $T_\psi(\mu-\sigma)$, for every normalized signed directional measure $\mu$. Hence universal exactness is equivalent to $\mu-\sigma\in\ker T_\psi$. Funk–Hecke diagonalization then gives a complete spectral criterion: one must annihilate exactly the spherical harmonic degrees on which the multiplier of $T_\psi$ is nonzero. This yields kernel-adapted designs and positive finite exact rules for finite active spectrum. For $\psi_p(s)=|s|^p$ we obtain a complete classification: even powers give precisely weighted real projective designs, whereas non-even powers admit no finite signed atomic rule that is exact for every convex body. For the classical Cauchy kernel $|s|$, exactness fails but spherical $t$-designs give a uniform $O(t^{-1})$ relative surface-area error. We also derive exact projection-moment identities for rectifiable submanifolds.
Read the full abstract
Solar and Stellar Astrophysics
Magnetically Confined Mountains on Accreting White Dwarfs
The hydromagnetic structure of magnetically confined mountains on accreting white dwarfs is computed, alongside the effects of accretion on the reduction of the star's magnetic field. The equilibrium structure of the mountain is obtained by numerically solving the Grad-Shafranov equation with a self-consistent scheme that enforces magnetic flux freezing. For characteristic system parameters, it is shown that magnetic field lines are significantly deformed and dragged equatorwards by mountains with masses $\sim10^{-3}M_\odot$ that have a characteristic height of $\sim10^5\,\mathrm{cm}$. A mathematical relation is obtained for the maximum mass that a white dwarf can confine magnetically given the star's magnetic field and temperature. It is found that the accretion buries the star's magnetic field by reducing it by up to $10\%$ of its pre-accretion value. The star's magnetic field remains dominantly dipolar, but with added multipolar components.
Read the full abstract
Human-Computer Interaction
Tactile Search: Enhancing Targeting in 3D Space
Visual search is crucial in daily life, from scanning for relevant information to spotting signs of danger. When sensory channels are overloaded or degraded, cognitive tasks can be supported by crossmodal information representations through vibrotactile cues. We introduce Tactile Search, an approach that uses modulation of frequency and amplitude of vibrations to the hands, for guiding attention to the location of objects in 3D space. We evaluated this approach in a competitive VR game where participants searched for targets using both vision and touch. Across two studies – an in-the-wild demonstration (n=55) and a controlled laboratory experiment (n=28) – we found that vibrotactile feedback significantly improved performance and increased user confidence. In the combined haptic condition, performance did not differ across target heights. We further analyzed participants' subjective experiences and search strategies highlighting the benefits of the tactile cues. Our findings suggest that Tactile Search can enhance interaction and provide design considerations for integrating haptic search into interactive systems.
Read the full abstract
Quantum Physics
Demailly's Conjecture in Quantum Language and Its Solution
We give an exact translation between fat-point interpolation in complex projective space and a dark-state problem for fixed-particle-number bosons. Under the unitary Fischer–Bargmann realization, homogeneous degree becomes particle number, the Veronese lift becomes a bosonic symmetric product state, and order-$m$ vanishing becomes orthogonality to all coherent jet excitations of orders below $m$. The initial degree of a symbolic power is therefore the first particle number admitting a dark state of a positive constraint Hamiltonian, and the Waldschmidt constant is the asymptotic particle cost per suppression order. After developing both sides of this dictionary from first principles, we prove a finite-scale no-dark-state amplification theorem. Frobenius amplifies the associated full-rank certificate in one good positive-characteristic fiber; a nonzero maximal minor returns it to characteristic zero. Its asymptotic consequence is Demailly's conjectured inequality. The paper is written so that the projective statement, the quantum reformulation, and the arithmetic part of the solution can be read independently and then identified exactly.
Read the full abstract
High Energy Physics (Phenomenology)
Deconfining Phase Transition under Real Rotation: A Matrix Model Study
We construct a matrix model to study the deconfining phase transition for a pure gluon plasma that is confined in a cylinder of radius ${\cal R}$ and rotating rigidly at a real-valued angular velocity $\Omega$, satisfying $\mathcal{R} \Omega<1$. The deconfining phase transition arises due to the competition between two terms that constitute the matrix model. The perturbative term comes from the one-loop effective potential computed in the presence of a background field, while the non-perturbative term represents a correction to the perturbative contribution which is brought about by taking into account an effective mass of the gauge fields. Our results show that real rotation induces a radial inhomogeneity of the system and the deconfining temperature $T_c$ drops away from the rotation axis which is consistent with the Tolman-Ehrenfest law. As for the $\Omega$-dependence of $T_c$, it relies on our assumptions of the gluon effective mass. For a constant mass, $T_c$ is found to always decrease with increasing $\Omega$. A non-monotonic behavior of $T_c$ shows up when a $\Omega$-dependent mass is considered, leading to a qualitative change in the region of small angular velocity. In addition, by setting $\Omega=0$ to eliminate rotational effects, we also demonstrate that the finite-volume effect reduces the deconfining temperature relative to the infinite-volume limit. Comparisons between our results and those from various lattice simulations and phenomenological models suggest that controversy remains over how the deconfining phase transition is modified by real rotation and further work is required to reach a definite conclusion.
Read the full abstract
Computer Vision
Hierarchical Prompt Injector for Domain Generalization Segmentation
Domain Generalized Semantic Segmentation (DGSS) is a challenging task, as vision models often rely on low-level appearance cues that change across domains. In contrast, structural attributes exhibit cross-domain stability, motivating the use of structural priors for DGSS. Existing methods use prompt learning to transfer such priors into DGSS models, but typically encode each class as a single holistic prompt. Moreover, these methods apply prompts uniformly to all pixels, offering no mechanism to adapt when only a subset of object regions is visible due to viewpoint changes, occlusion, and environmental variation. We address this with Spatial Hierarchical Prompts (SHP) that enrich each class with region-level geometric anchors capturing structural appearance from distinct viewing angles, ensuring complementary coverage under arbitrary viewpoints. Additionally, we propose the Hierarchical Prompt Injector (HPI), which enables spatially adaptive prompt injection in foundation models. HPI spatially grounds prompts by modeling their semantic relevance and spatial influence with visual features. Considering the difficulty of learning spatially and semantically aware prompt injection, we further introduce auxiliary supervision to align hierarchical prompts with their corresponding object regions. We achieve 70.62% and 72.74% mIoU on synthetic-to-real and real-to-real benchmarks, respectively. Code and checkpoints are released at https://github.com/MosukFate/HPI
Read the full abstract
Optimization and Control
Endpoint Asymptotics of Optimal Stabilization Prefactors
Consider the stabilizable finite-dimensional linear control system $\dot x=Ax+Bu$. For a prescribed decay rate $\delta>0$, we define the optimal stabilization prefactor $$ \hat{C}(\delta) := \inf_{K\in\mathbb{R}^{m\times n}} \sup_{t\ge0}e^{\delta t}\|e^{(A+BK)t}\|. $$ We determine its asymptotic behavior as $\delta$ approaches the right endpoint of the achievable decay-rate range. If $(A,B)$ is controllable and $\mu$ is its largest controllability index, then $\hat{C}(\delta)\asymp\delta^{\mu-1}$ as $\delta\to+\infty$; whereas if $(A,B)$ is stabilizable but not controllable, then $\hat{C}(\delta)\asymp(\delta_*-\delta)^{-(q-1)}$ as $\delta\uparrow\delta_*$, where $\delta_*$ is the supremal achievable decay rate and $q$ is the largest size of a Jordan block of the uncontrollable part associated with the spectral boundary $\operatorname{Re}\lambda=-\delta_*$. Thus, in both cases, the endpoint asymptotic order of $\hat{C}(\delta)$ is determined by the corresponding structural invariant—$\mu$ in the controllable case and $q$ in the noncontrollable case—and conversely this order recovers that invariant.
Read the full abstract
Machine Learning
Budgeted Task-Aware Acquisition of Dynamic Networks
Learning on dynamic graphs is difficult when changes in the underlying network are only partially observed. Acquiring current graph information incurs observation and computational costs, making complete updates impractical under limited resources. This paper focuses on budgeted task-aware acquisition on dynamic networks, where a model needs to decide which stale graph information to refresh for a downstream task. We propose Scout, a lightweight framework that learns the task value of querying each node from the maintained graph and observation history. Our evaluation covers one synthetic and 4 real-world dynamic networks, 2 downstream tasks, 9 acquisition baselines, and several query budgets. Scout achieves the highest mean downstream performance in 15 of the 21 benchmark-budget settings and ranks within the top two in 19 of them. Its average rank is 1.4, compared with 3.2 for the strongest baseline. On the same dynamic network, task-matched acquisition improves link-prediction AUC by 0.005-0.007 and node-classification accuracy by 0.007-0.017 over task-mismatched acquisition. These results show that useful graph observations depend on the downstream task and that limited observation budgets can be allocated effectively by learning directly from downstream utility.
Read the full abstract
Networking
SLA-Safe Energy Control for AI-Native NG-RAN Using Stability-Aware Constrained PPO
One important AI-for-RAN use case is energy saving, in which radio resources and cell energy modes must be dynamically controlled without violating user quality-of-service (QoS) or service-level agreement (SLA) requirements. However, aggressive sleep-state or deactivation decisions may reduce energy consumption at the cost of throughput degradation, delay increase, SLA violations, and unstable mode switching, especially under time-varying and bursty traffic conditions. This paper proposes a stability-aware constrained reinforcement learning framework for SLA-safe energy control in 5G NG-RAN. The problem is formulated as a constrained Markov decision process in which an AI-native controller selects closed-loop energy-saving actions based on cell load, queue status, active-user information, current energy mode, and SLA-related indicators. The proposed framework uses constrained proximal policy optimization with adaptive Lagrangian penalties to account for throughput, delay, and SLA constraints. To improve operation under traffic distribution shift, the controller is trained using mixed nominal and stress traffic regimes, while a switching-stability penalty is introduced to reduce oscillatory transitions between active and low-power modes. Simulation results in a seven-cell NG-RAN environment show that the proposed controller reduces energy consumption by approximately 41.4% under nominal traffic, 10.5% under stress traffic, and 22.9% under unseen-stress traffic relative to the Always-On baseline. Under stress and unseen-stress traffic, the controller preserves zero SLA violation and zero throughput loss, indicating service-preserving operation under challenging conditions. The proposed method also reduces switching activity compared with basic threshold-based energy saving.
Read the full abstract
Machine Learning
Beyond Arbitrary Geometry: Topology Generalization In neural PDE Operators
Neural operators that accept arbitrary meshes are often treated as geometry-general, but unseen domain topology changes both the invariant and decaying subspaces of a PDE operator. We use Hodge heat flow as a controlled lens on this distinction and introduce TopoBox-3D, where tunnels and cavities vary Betti support while the exact Hodge decomposition separates the harmonic kernel from the positive spectrum. Across six architectures, models that infer topology implicitly suffer excess matched degradation in 37 of 45 model–task topology-OOD cells, yet cases that change harmonic dimension are not more strongly penalized on average. The dominant difficulty is instead spectral: the initial Rayleigh quotient is the most stable predictor of error, and spectral broadening adds information for edge and face cochains. Most strikingly, controlled probes show that explicit incidence and harmonic coordinates do not yield the best kernel-identity accuracy; nevertheless, TNO ranks first in mixed-input nonharmonic accuracy on all six tasks with nontrivial harmonic support. Together, these results establish topology as a distinct generalization axis beyond arbitrary-geometry compatibility and show that its influence extends across the Hodge spectrum rather than remaining confined to the harmonic kernel. More broadly, they suggest that global, low-frequency structural priors may help organize predictions in the faster-decaying complementary component, offering a new perspective on how neural operators may generalize across topology as well as geometry.
Read the full abstract
Machine Learning
Selective Posterior Margin Regularization for Forward-Corrected Classification
Learning with class-conditional label noise often relies on a transition model from latent clean classes to observed annotations. Forward correction embeds this transition in the likelihood, yet finite-sample networks may still memorize corrupted labels. The corrected likelihood also induces a reverse posterior over the clean classes that could explain each annotation. When its leading class differs from the annotation, the model and transition matrix provide evidence against that annotation, but the leading alternatives can remain nearly tied. We introduce Selective Posterior Margin Regularization (SPMR), which preserves the Forward objective and converts this disagreement into a graded update on the clean classifier. SPMR selects the leading reverse-posterior class, scales a detached pairwise margin by the separation between the two leading posterior classes, and assigns correspondingly little influence to diffuse conflicts. The gap factorizes into transition- adjusted pairwise separation and the posterior mass carried by the leading pair. The active margin follows the locally minimum-norm logit direction that enlarges the selected pairwise margin. Across five known-transition benchmarks, SPMR improves full-length Forward by 2.5-7.0 percentage points and remains 0.7-2.5 percentage points above Forward with Mixup and early stopping. Matched interventions support distinct gains from the posterior-space coefficient, transition-adjusted target, and pairwise action. The same design transfers to estimated transitions, human annotations, architectural changes, and stronger Forward recipes. The formulation uses latent-class evidence already available inside Forward correction without promoting every posterior conflict to a corrected label.
Read the full abstract
Biological Physics
Fluidization in Growth-Induced Morphogenesis
Elastic buckling has explained shape formation in growing tissues, yet the role of tissue fluidity remains elusive. We derive a minimal fluidized growth-elasticity model as a nonlinear analogue of Maxwell rheology. Analysis of a growing strip reveals a different picture of growth-induced morphogenesis: rather than emerging at a critical stress, symmetry breaking develops continuously during growth. Fluidity regulates stress evolution, the rate of shape-symmetry breaking, and flow patterns, establishing it as an active regulator of morphogenesis beyond its intuitive role in stress relaxation.
Read the full abstract
Quantum Physics
Quantum Message Passing Convergence and Vanishing Block-Error Probability for Random LDPC Codes
Belief propagation with quantum messages (BPQM) is a quantum algorithm that decodes classical codes transmitted over classical–quantum channels. It realizes optimal decoding on tree factor graphs over pure-state classical-quantum channels. However, this tree-based analysis does not ensure vanishing block-error probability for LDPC Tanner graphs with cycles. In this work, we construct a two-stage BPQM decoder for random $q$-ary LDPC codes over symmetric $q$-ary pure-state channels, where $q$ is prime, and prove that its ensemble-average block-error probability vanishes as the blocklength $N$ tends to infinity. For regular ensembles with $d_v\geq3$, fidelity bounds yield double-exponential decay of the average symbol-error probability throughout the BPQM success region. We apply depth-$\ell$ BPQM to coordinates with tree neighbourhoods and treat the remaining coordinates as erasures. With a suitable $\ell=\Theta(\log\log N)$, a noncommutative union bound controls the BPQM decoding errors, while the minimum-distance property guarantees erasure recovery. We also extend the analysis to finite-support irregular ensembles. These results are relevant to quantum algorithms based on Regev's reduction, where coherent decoding uncomputes a codeword register. Decoded quantum interferometry (DQI) uses a closely related Fourier-based framework that reduces sparse max-LINSAT optimization problems to LDPC decoding problems on pure-state channels. Our results justify the use of BPQM in the decoding step of DQI and of coding-theoretic algorithms based on Regev's reduction whenever the code is drawn from one of the random LDPC ensembles analyzed here and the induced memoryless symmetric pure-state channel lies in the BPQM success region. Curiously, our numerical results indicate that DQI+BPQM achieves a satisfaction ratio that closely matches that of simulated annealing.
Read the full abstract
Optimization and Control
Transformation of Adaptive Multistage Sampling for Solving Finite-Horizon Markov Decision Processes with Unknown Model
This work provides a learning approach to solving finite-horizon Markov decision processes (MDPs) when the underlying model of a given finite MDP is unknown to the decision maker. We transform the adaptive multistage sampling (AMS) algorithm into a sampling-free algorithm, called "adaptive multistage rollout (AMR)," for estimating the optimal value at an initial state when only the state set and the action set are known. AMR emulates the backward induction as in AMS but in a reinforcement learning (RL) setting. At each iteration, AMR generates a non-stationary policy to be used for exploration and rolls out the policy in order to obtain a single trajectory of experiences and traces it backwards in a non-recursive way while doing relevant updates only at visited states and for actions taken at the visited states. We show that AMR is asymptotically optimal such that the sequence of the expected absolute errors approaches zero and its convergence rate depends on the number of visits to each reachable state at each stage from the initial state, essentially transforming the result of AMS into the RL setting.
Read the full abstract
Adaptation and Self-Organizing Systems
Spatio-temporal structures in frog chorus with two species examined by laboratory experiments and mathematical modeling
Synchronization can be observed in various systems in physics and biology. The choruses of male frogs are known as an example of biological synchronization in which the well-organized temporal structure, i.e., anti-phase synchronization between neighbors, is realized. Given that male frogs produce sounds to advertise their territories to competitors, the dynamics of phases and spatial coordinates should be mutually coupled in the frog choruses. In this study, we examined the spatio-temporal dynamics in the choruses consisting of male Japanese tree frogs and other acoustic animals. First, we carried out playback experiments using actual frogs and observed that male Japanese tree frog synchronized in anti-phase with the stimuli of a similar frequency but did not synchronize with the stimuli of a much different frequency. Second, we modeled the choruses with two species as a system of coupled mobile oscillators and numerically evaluated how the spatio-temporal structure depends on the similarity of call frequencies. Numerical simulations of the model showed that (1) the two-cluster antisynchronization is established in the same species when the distributions of call frequencies are much different between two species and (2) the two-cluster antisynchronization is disturbed when the distributions of call frequencies are similar. These results highlight the occurrence of various spatio-temporal patterns in the proposed model, indicating the importance of repulsive effects with different weights on the variation of the spatio-temporal patterns.
Read the full abstract
Functional Analysis
From Majorization to Horn and Unitary-Orbit Inequalities
Majorization inequalities encode spectral comparisons through leading partial sums, whereas complete Horn inequalities capture all admissible selected-eigenvalue constraints associated with sums of Hermitian matrices [Fulton, 2000]. We develop a general framework for lifting majorization inequalities to this complete Horn level, which is equivalent to unitary-orbit inequalities. The main ingredients are a generalized Hersch–Zwahlen variational formula for coordinatewise monotone functions of selected eigenvalues and a Schubert-geometric lifting principle that reduces the desired Horn inequalities to the concavity or convexity of suitable scalarizer functions on matrix compressions. As examples we apply the framework to three families of operator inequalities. First, we obtain a complete Horn extension of the weak-majorization inequality for convex functions established by Aujla and Silva [Aujla and Silva, 2003]. Second, we lift the concavity and convexity results for two-variable positive-power functions due to Carlen, Frank, and Lieb and Zhang [Carlen, Frank, and Lieb, 2016; Zhang, 2020]. Third, we establish multiplicative Horn inequalities for multivariable geodesic means, including the weighted Karcher mean and the two-variable geometric mean, extending determinant-level inequalities of Bourin and Hiai [Bourin and Hiai, 2014]. The resulting statements yield unitary-orbit inequalities that generalize familiar weak-majorization, trace, and determinant inequalities.
Read the full abstract
Number Theory
On the classification of small cyclotomic integers
We give a general classification theorem for cyclotomic algebraic integers with all complex absolute values bounded by a fixed constant $c$, modeled on the theorem of Cassels which treats the case $c = \sqrt{5}$ up to finitely many exceptions. As a corollary, we establish that the range of the function taking a cyclotomic integer to its maximum complex absolute value is a well-ordered (but not closed) subset of the real numbers. We also formulate analogous statements for algebraic numbers in the maximal cyclotomic extension of a fixed number field. The proofs combine a result of Loxton, which bounds the number of roots of unity in the shortest additive representation of a cyclotomic integer in terms of the maximum complex absolute value, with an equidistribution theorem of Bilu et al. for Galois orbits of torsion points on algebraic tori.
Read the full abstract
Differential Geometry
Constant $k$th-mixed curvature on locally conformal Kähler manifolds
In this paper, we consider compact locally conformal Kähler manifolds with constant $k$th-mixed curvature. By using a recent method of Huang-Wan for constant Chern holomorphic sectional curvature, we prove that if a compact LCK manifold has nonzero constant $k$th-mixed curvature, then its Hermitian metric is Kähler. For the second mixed curvature, the same conclusion also holds when the curvature constant is zero. We also study some special parameters related to the general constant mixed curvature conjecture. In particular, we obtain a torsion-energy identity and a sign obstruction for compact Hermitian manifolds, and characterize an exceptional Kähler case by Bochner–Kähler geometry.
Read the full abstract
Numerical Analysis
High-order smoothness and high-order collocation approximation for Volterra integral equation with multiscale and nonlinear exponent kernel
We consider a Volterra integral equation with multiscale and nonlinear exponent kernel. We propose the high-order smoothing conditions, under which the initial singularity of the solutions can be eliminated up to any prescribed order. This indicates the application of the multiscale nature of the kernel on local modification of the solutions. Then a discontinuous high-order collocation method with arbitrary polynomial degree is developed and analyzed on uniform or graded meshes based on the solution regularity. This work serves as a comprehensive extension and complement to [Zheng, Qiu and Stynes, SIAM J. Numer. Anal., to appear] in both mathematical and numerical aspects.
Read the full abstract
Machine Learning
SAFEGuard: Detect Optimization-Based Jailbreak Attacks Through Harmful Semantic Analysis and Fluency Measurement
Despite the significant efforts devoted to aligning large language models (LLMs) with human values and ensuring safe deployment, recent work has revealed that LLMs remain vulnerable to adversarial jailbreak attacks that can bypass safety guardrails and elicit harmful responses. Many defense methods are proposed to detect jailbreaks but they are limited in their effectiveness to counter wide-range optimization-based jailbreak mechanisms that can yield highly fluency-optimized or harmful semantic obfuscated prompts. To tackle this challenge, we propose a unified detection framework SAFEGuard which incorporates a hybrid fluency measurement based on cross-layer distribution distance and perplexity, and the analysis of harmful semantics through gradient matching. Our method is grounded in a paramount observation: high fluency prompts maintain their malicious intention close to harmful prompts while harmful semantic obfuscated prompts often inject gibberish token sequences. Our evaluation demonstrates that SAFEGuard consistently outperforms state-of-the-art baselines and achieves significant improvement in accuracy across different optimization-based jailbreaks. This underscores the effectiveness of SAFEGuard against evolving jailbreak attacks.
Read the full abstract
Numerical Analysis
Efficient $C^1$ Bernstein Quasi-Trefftz Discretization for Heterogeneous High-Frequency Helmholtz Problems
We develop an efficient $C^1$ Bernstein quasi-Trefftz discretization for heterogeneous high-frequency Helmholtz problems on unstructured triangular meshes. The method first imposes strong $C^1$ continuity through Bernstein–Bézier smoothness relations on local macro-patches and then reduces the resulting conforming polynomial space by enforcing projected Helmholtz residual constraints. On two-triangle patches, this compresses the local dimension from quadratic growth in the polynomial degree to a trace-sized space of dimension $2p+1$ under the natural rank condition. Variable matrix-valued coefficients are handled through local polynomial projection, allowing coefficient-approximation effects to be separated from discretization error. A graph-residual formulation couples the reduced patch spaces and produces a sparse global system in compressed coordinates. The implementation combines explicit $C^1$ continuation, batched coefficient projection, batched residual construction, and stable local kernel extraction by QR factorization. Numerical experiments on heterogeneous unstructured meshes demonstrate high-order accuracy, roundoff-level $C^1$ conformity, robust high-frequency resolution, and substantial reductions in local and global computational cost. Turning-point and penetrable-scattering examples further illustrate the flexibility of the approach.