Physics and Society
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 9 November
Managing meaningful change requires more than motivation, insight, or isolated techniques. This paper introduces OCEAN, a five-phase conceptual framework for structuring nonclinical developmental conversations and change-oriented work in coaching and in the practice of leaders and HR professionals. The five phases are Observe, Create, Expose, Awaken, and Nurture. In Observe, individuals develop a systemic, present-oriented understanding of the situation. In Create, they turn that understanding into goals that are meaningful and actionable. In Expose, they identify the attempted solutions that maintain the difficulty they are meant to remove, along with the resistances, biases, and self-deceptions that keep them in place. In Awaken, they activate new behaviors through planning, reframing, paradoxical movement, and emotionally significant experiences. In Nurture, they consolidate progress through repetition, habits, connection, and sustainable contexts. OCEAN integrates insights from systemic and interactional thinking, goal construction, emotional awareness, and habit consolidation into a structured process.
High Energy Physics (Theory)
M-theory anomaly localization and holographic $c$-extremization
We compute the cubic and $C_3\wedge X_8$ caracteristic class contributions to the trial anomaly polynomial of supersymmetric $AdS_3\times M_8$ backgrounds with $M_8=P(\mathcal O \oplus \mathcal L)\to B_6$. Including the Abelian currents descending from $C_3$, we identify the projective invariant $J$ as the denominator arising from their elimination by $c$-extremization and recover the central charge $c^{(0)}=-I_3+3I_+I_-/J$. The $X_8$ push-forward determines the pure R-symmetry, mixed R–Betti and gravitational anomalies. Evaluating it at the classical extremum gives the associated central-charge corrections, linear in the overall unshifted flux. The mixed term contributes equally to both central charges and is required in general. We evaluate these formulae for three flux-quantized backgrounds, including non-polynomial solutions. Direct projective fibre integration reproduces the mixed coefficient obtained by localization. On the wrapped-$M5$ $S^4$ bundle, the same couplings reproduce the independently known field-theory anomaly through orders $N^3$ and $N$. Their interpretation as full CFT central charges requires a unitary SCFT with a normalizable vacuum, suitable supersymmetric boundary conditions, a complete mixing sector of global currents and control of omitted anomaly sectors. A conditional Euclidean relative-equivariant interpretation is discussed separately.
Read the full abstract
Nuclear Theory
Isospin violation and the neutron weak magnetic moment
The recent measurement of weak magnetism in neutron beta decay [1] obtained a value that is consistent with the conserved vector current hypothesis requiring the assumption of isospin conservation. The influence of the quark-mass difference and electromagnetic effects that violate this conservation law are examined using non-relativistic constituent quark models and estimated to be of the order of at most 1%.
Read the full abstract
Differential Geometry
A geometric Kähler–Ricci flow proof of the Calabi–Yau theorem
We give a geometric proof that every Kähler class on a compact Kähler manifold with vanishing real first Chern class contains a unique Ricci-flat metric, and that the Kähler–Ricci flow converges smoothly to this metric. The fixed Kähler class and the bounded logarithmic volume density control the mean pairwise distance. Chow's scalar-curvature decay makes available, at a fixed spatial scale and all sufficiently late times, the relative-volume comparison of Jian–Song, derived from Bamler's pointed Nash entropy estimates. This comparison upgrades the mean-distance bound to a diameter bound without an absolute lower bound for entropy. A restarted heat-gradient estimate then gives exponential decay of the Ricci potential. A parabolic Schwarz estimate and the interior estimates of Sherman–Weinkove yield smooth exponential convergence. The proof does not invoke the Calabi–Yau existence theorem or global estimates for a scalar complex Monge–Ampère equation.
Read the full abstract
Machine Learning
Agentic-OPD: Recovering Forgotten Agent Capabilities via On-Policy Distillation for Agentic Tasks
Reinforcement learning is now the mainstream paradigm for training LLMs on agentic tasks, yet standard practice keeps only the best-validation checkpoint and discards the rest. We show that this is lossy: in GRPO training of LLM agents, the best-validation checkpoint fails on problems that earlier checkpoints from the same run had already solved, and the union of problems solved across checkpoints far exceeds any single one. The discarded checkpoints thus form a teacher pool obtained at no additional training cost, which on-policy distillation (OPD) can mine to recover the lost coverage. Mining this pool raises two challenges: i) which checkpoint to distill from, as no checkpoint dominates the others and complementarity to the student is problem-specific; ii) where to trust it, as even a well-chosen teacher is only locally superior, so indiscriminate distillation overwrites behavior the student has already mastered. We propose Agentic-OPD, which treats the best-validation checkpoint as the student and all saved checkpoints as frozen teacher candidates, using the student's evolving capability gaps to guide both teacher selection and supervision filtering: the HCN policy (Highest Coverage Next) dynamically selects teachers by weighted coverage of the student's unsolved problems, while the LAD module (Locality-Aware Distillation) confines transfer to failed student rollouts on problems where the teacher performs better. Across five agentic task domains and 24 benchmarks and task subsets, Agentic-OPD improves over its initialization checkpoint by up to 7.4 points, with a 4B student surpassing the latest frontier models GPT-5.6 and DeepSeek-V4.1 on deep search. Agentic-OPD recasts a finished RL run as a reusable pool of policies and establishes post-RL capability recovery as a stage orthogonal to improvements in the RL algorithm itself.
Read the full abstract
Computer Vision
Complementarity-Driven Dual-Teacher Hierarchical Alignment for Zero-Shot EEG-to-Image Retrieval
Decoding visual information from EEG is central to brain–computer interfaces and brain-inspired intelligence, and contrastive alignment with pretrained vision foundation models (VFMs) has become the dominant paradigm. However, existing methods align EEG solely with CLIP-family VFMs, leaving hierarchical visual information in neural responses under-exploited. To address this gap, we formulate a mechanism-paradigm correspondence view linking hierarchical visual processing (from appearance to semantics) to the complementary biases of cross-paradigm VFMs, with image-only models (e.g., DINO) and image–text models (e.g., CLIP) capturing distinct facets of this hierarchy. Guided by this view, we propose the Dual-Teacher Hierarchical Alignment (DTHA) framework. Concretely, a shared EEG encoder is supervised by frozen multi-blur CLIP and shallow DINOv2 teachers via dual-branch contrastive alignment, so each branch fully supervises the visual cues it emphasizes. A fused-retrieval objective learns adaptive weights to combine their complementary visual representations for zero-shot EEG-to-image retrieval. For the shared EEG encoder, we introduce the Attentive Modulated Scalp-Pattern Bank Encoder (AMSPBE), combining temporo-spatial attention with a learnable scalp-pattern bank for accurate, interpretable visual feature extraction, while modeling regional temporal dynamics and filter-bank topographies. On THINGS-EEG zero-shot retrieval, DTHA achieves 92.4% Top-1 accuracy, exceeding prior state of the art by 12.4 percentage points. Spatial, spectral, and representational-similarity analyses, together with THINGS-MEG evaluation, validate DTHA's effectiveness, biological plausibility, and cross-modality generalization. This complementarity-driven perspective shows that supervision from cross-paradigm VFMs enables more complete extraction of hierarchical visual information from brain activity.
Read the full abstract
Social and Information Networks
The Radicalization Pipeline: Characterizing and Predicting Online Misogyny
Social media platforms are known to shape and polarize user opinions and, increasingly, facilitate pathways toward ideological extremism. Among these trends, online misogynistic communities associ- ated with the incel (involuntary celibate) ideology have received growing scholarly attention. Previous work has primarily focused on ideological narratives and linguistic content within incel communities them- selves. However, much less is known about how user behaviors evolve over time, particularly before and after their engagement with incel spaces, and whether early signals can anticipate such transitions. In this study, we conduct a longitudinal analysis of Reddit users who participated in the r/incels community on Reddit. Our results show that engagement with the incel community is associated with a substantial in- crease in toxicity in both posts and comments, while hate increases particularly in posts after engagement. These changes extend beyond explicitly ideological communities: users who engage with the r/incels sub- reddit display elevated toxicity and hate speech even in subreddits related to leisure, entertainment, and everyday interests. In parallel, user activity shifts away from recreational and support-oriented communi- ties toward subreddits focused on social issues, indicating a broader reorientation of online participation. Finally, we show that future incel users can be identified with high accuracy prior to engagement using supervised machine learning models trained on linguistic, contextual, and interaction-based features. These findings suggest that online misogynistic radicalization follows detectable behavioral trajectories and diffuses across the broader social media ecosystem.
Read the full abstract
Machine Learning
Smartphone-Enabled Depth-Aware Transillumination Imaging for Detection of Chicken Breast Fillet Myopathies in Chicken Fillets
Woody Breast (WB) myopathy is a major quality defect in broiler chickens characterized by fibrosis, increased tissue hardness, and altered structural properties that affect product quality. Conventional palpation is subjective and labor-intensive, while many non-destructive methods require specialized equipment or substantial computational resources. This study developed a smartphone-based transillumination and 3D point-cloud framework for non-destructive WB severity classification. A total of 267 chicken breast fillets, including normal breast (NB, n = 87), mild WB (MWB, n = 85), and severe WB (SWB, n = 95), were evaluated using RAW transillumination images and 3D point clouds acquired with an iPhone 16 Pro. A total of 91 features, comprising 14 image-derived, 76 geometric, and one physics-informed Beer-Lambert attenuation feature, were extracted. Partial correlation controlling for thickness revealed a significant association between image characteristics and WB severity (r = 0.413, p < 0.0001), indicating optical information independent of fillet geometry. SWB tissue exhibited approximately 26% greater light attenuation per unit thickness than NB. The 2D-only models achieved approximately 82% test accuracy, while the multimodal ensemble combining Fusion-DGCNN, XGBoost, and physics-guided logistic regression (PGLR) achieved approximately 90% accuracy. These findings demonstrate the complementary value of optical, geometric, and physics-informed features and establish the feasibility of smartphone-based, non-destructive WB severity assessment.
Read the full abstract
Quantum Physics
A short proof of the Aaronson-Ambainis Conjecture via the completion framework
We give a short proof of the Aaronson-Ambainis conjecture. If a partial Boolean function $f$ is defined on a $\delta$-fraction of all $n$-bit strings and have quantum query complexity $Q(f)$, then, for every $0<\epsilon<1$, a deterministic algorithm computes $f$ correctly on at least a $1-\epsilon$ fraction of its domain using $O( Q(f)^6 / (\epsilon \delta)^2)$ queries. Our proof uses the completion framework and establishes a more general bound in terms of the classical adversary measure. The only result we use from Turturean's recent proof is a special case of his certificate inequality, for which we provide a self-contained proof. We also derive the stronger variant of the Aaronson-Ambainis Conjecture, the bounded-polynomial influence conjecture, from our main result in the appendix.
Read the full abstract
Functional Analysis
Extensions from Positive and Full Unit Spheres of $C^\infty([0,1])$ with a Compatible Fréchet Metric
We study isometric extensions from positive and full unit spheres of $C^\infty([0,1],\mathbb F)$, where $\mathbb F\in\{\mathbb R,\mathbb C\}$. We equip these spaces with a translation-invariant metric that induces the usual Fréchet topology, is unbounded, has convex balls, and has strictly increasing distances from zero along nonzero rays. Every surjective isometry of the pointwise positive unit sphere extends uniquely to a complex-linear surjective isometry of the complex-valued space. Restriction gives the unique real-linear isometric extension on the real-valued space. On the full unit sphere, every surjective isometry extends uniquely to a real-linear surjective isometry. The positive-sphere maps are compositions with the identity or an admissible reflection. The full-sphere maps also allow constant unimodular factors and, over the complex field, conjugation. We also classify the surjective ambient isometries. A counterexample shows that these metric properties alone do not guarantee positive-sphere extension. Under an explicit anchor condition, we classify surjective isometries of finite-order jet-positive spheres for maximum-type anchored metrics and prove that they extend uniquely to complex-linear surjective isometries. The classification allows any permutation of the anchored coordinates, combined with the identity or reflection on the highest-derivative component. The condition holds for every anchor when $m=1$ or $m=2$.
Read the full abstract
High Energy Physics (Phenomenology)
Electroweak Parton Distribution Functions for Future Lepton Colliders
At future high-energy colliders, such as a multi-TeV muon collider or the high-energy stages of an $e^+e^-$ linear collider, collinear radiation of electroweak gauge bosons becomes a dominant phenomenon. In this regime, many key processes are primarily initiated by photons and gauge bosons originating from lepton splittings. Electroweak Parton Distribution Functions (EW PDFs) provide an appropriate framework to describe these interactions by resumming large collinear logarithms arising from all possible Standard Model splittings, thereby enabling a partonic interpretation of the hard scattering. The formalism is particularly suitable for studying new physics beyond the Standard Model in the electroweak sector at higher scales. In this paper, we present the implementation of the EW PDF formalism within the Monte Carlo event generator Whizard. We demonstrate several applications of this framework and analyze its interplay with full fixed-order calculations as well as the purely kinematic Effective Weak Boson Approximation. We highlight scenarios where the EW PDF approach is especially useful for phenomenology and physics-potential studies for future lepton colliders. The EW PDF formalism is a vital step towards the “electroweak jet regime” where electroweak particles behave similarly to QCD jets.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Coupled dark energy and apparent phantom crossing: a potential-independent lower bound
Baryon acoustic oscillation measurements from the Dark Energy Spectroscopic Instrument (DESI), combined with the cosmic microwave background (CMB) and type Ia supernovae, prefer a dark energy whose equation of state was below $-1$ in the past and is above $-1$ today. A canonical scalar field cannot cross this line, but it can appear to do so if it is coupled to dark matter, and we ask how strong this coupling must be, for any potential. We show that the apparent crossing requires the dark matter to lose a minimum fraction of its mass after recombination, fixed by the expansion history $H(z)$. For a constant coupling $\beta=d\ln m/d\phi$, the mass can change only as fast as the field moves, and the speed of the field is itself set by $H(z)$, so that the coupling must be larger than a minimum value $\beta_{\rm min}[H(z)]$. This bound holds for any potential, applies to the largest value of the coupling when the coupling depends on the field, and is reached exactly when the field comes to rest within the observed range. For the DESI DR2 best fits, the dark matter must lose about 5-7% of its mass by $z\simeq 0.8$, which requires $\beta_{\rm min}=0.047$-$0.058$; including the uncertainties of the data, the public DESI DR2 chains give the 95% lower limit $|\beta|>0.025$-$0.038$. We also apply the bound to published fits of coupled quintessence: all of them respect it, and those with a constant coupling reproduce only a shallow version of the crossing. Since the coupling cannot be smaller than $\beta_{\rm min}$, two known effects of the coupling have a minimum size: an extra attraction between dark matter particles of at least a few tenths of a per cent of gravity, and a lensing signal at least a few per cent weaker than the clustering of dark matter would suggest.
Read the full abstract
Computation and Language
Large Language Models as a Universal Searcher for Open-World Automated Machine Learning
Developing effective machine learning models requires complex manual tuning, while current Automated Machine Learning (AutoML) frameworks remain domain-specific and isolate model architecture, training hyperparameter, and data ratio optimization. Here, we bridge this gap by proposing a universal, large language model (LLM)-based AutoML framework that jointly optimizes these configurations for the first time without the need for task-specific fine-tuning. We propose NCode, a unified numerical encoding scheme that translates diverse AutoML design choices into universal discrete sequences and effectively reframes the optimization process as a unified ranking task. Trained solely on optimization trajectories derived from a limited, single-domain vision task, the proposed LLM-based searcher demonstrates impressive cross-task, cross-modality and joint search-space optimization generalizability, achieving state-of-the-art performance across image classification, image segmentation, speaker verification and text-to-image benchmarks. Crucially, it exhibits superior scalability in the large-scale training and joint optimization of a billion-parameter Diffusion Transformer, requiring 896 GPU-days and attaining a state-of-the-art GenEval score of 0.91. By leveraging reinforcement learning to instill Chain-of-Thought reasoning, we provide a systematic way to interpret the LLM-based searcher's internal decision-making mechanisms, revealing its optimization strategy shifted from the early-stage diversity-driven exploration to the late-stage anchor exploitation. Our proposed framework provides a scalable, generalizable, and interpretable pathway toward general-purpose open-world machine learning optimization.
Read the full abstract
Group Theory
Strong pseudo Frobenius numbers
By Sylow's theorem, the number of Sylow $p$-subgroups of a finite group is congruent to $1$ modulo $p$, but not every such integer occurs. Frobenius extended the congruence to the number of subgroups of order $p^a$ for every $a\ge0$. Kulakoff and Hall showed that this number is congruent to $1$ or $1+p$ modulo $p^2$ whenever $p^{a+1}$ divides the group order. A positive integer is a Frobenius $p$-number if it is the number of subgroups of order $p^a$ of some finite group for some $a$. There are integers congruent to $1$ modulo $p^2$ which are not Frobenius $p$-numbers, and it remained open whether there are also such integers congruent to $1+p$ modulo $p^2$. We show that no finite group has exactly $106$ subgroups of order $5^a$ for any $a\ge0$.
Read the full abstract
Dynamical Systems
The generic behavior of permutation entropy for continuous maps
Permutation entropy, introduced by Bandt and Pompe in 2002, measures the complexity of a dynamical system through the ordinal patterns of its trajectories. Bandt, Keller and Pompe established that for measure-preserving, piecewise monotone interval maps with finitely many monotonicity intervals, the normalized order-$n$ permutation entropy $H_n^{\mathrm{perm}}(f)/n$ converges to the Kolmogorov–Sinai entropy. Although this result has subsequently been extended to broader classes of maps, whether normalized permutation entropy always converges has remained unknown. We show that convergence can fail, and indeed that nonconvergence is generic. More precisely, for a generic continuous Lebesgue measure-preserving map $f:[0,1]\to[0,1]$, we prove that \[ \liminf_{n\to\infty}\frac{H_n^{\mathrm{perm}}(f)}{n}=0, \qquad \limsup_{n\to\infty}\frac{H_n^{\mathrm{perm}}(f)}{n\log n}=1. \] Thus, despite the generic vanishing of Kolmogorov–Sinai entropy, permutation entropy exhibits oscillations between vanishing linear growth and the maximal possible asymptotic growth. We also construct an explicit Lebesgue measure-preserving interval map with countably many monotonicity intervals for which the normalized permutation entropy has lower limit zero and upper limit infinity. This demonstrates that nonconvergence can occur even within the countably piecewise-monotone setting, beyond the scope of the convergence theorem of Gutjahr and Keller, relying on conditions concerning the lengths of the pieces.
Read the full abstract
Superconductivity
Ambient-pressure superconductivity in bulk single crystals of La$_5$Ni$_4$O$_{10}$
Superconductivity in the Ruddlesden-Popper (RP) nickelates has so far been confined either to multilayer compounds under high pressure or to square-planar infinite-layer-type films stabilized by epitaxial strain. Here we report the high-pressure high-temperature (HPHT) growth of bulk single crystals of the quadruple-layer RP nickelate La$_5$Ni$_4$O$_{13}$ ($n=4$) and reproduce the quintuple-layer La$_6$Ni$_5$O$_{16}$ ($n=5$) synthesis, two members of the series that had previously been accessible only as thin films. Topotactic reduction of La$_5$Ni$_4$O$_{13}$ single crystals with CaH$_2$ yields the square-planar phase La$_5$Ni$_4$O$_{10}$, which we show to be a bulk, ambient-pressure superconductor with $T_\mathrm{c}^\mathrm{onset} \approx 18\,\mathrm{K}$, a shielding fraction above 60%, and a specific-heat jump that confirms a bulk pairing transition. All crystals show besides superconductivity a coexistence with a density-wave or metal-insulator transition. The upper critical field shows a small anisotropy, $\gamma \approx 2.4$, which remains finite as $T \to T_c$, indicating three-dimensional superconductivity with substantial coupling between the four-layer blocks. These results identify the square-planar nickelates $R_{n+1}$Ni$_n$O$_{2n+2}$ as a bulk platform in which the layer number alone tunes the nickel valence into the superconducting regime, without chemical substitution, pressure, or epitaxial constraint.
Read the full abstract
Earth and Planetary Astrophysics
MarsNet: Learning the Martian Atmosphere from Observations Alone
We present MarsNet, a machine-learned model of the Martian atmosphere trained only on observations. Existing reanalyses assimilate spacecraft retrievals into general circulation models (GCMs), so where observations are sparse their fields largely reflect the model. We therefore use extant reanalyses only for evaluation. MarsNet alternates a two-hour forecast with an update that assimilates the observations of each window, and both steps are learned jointly. Because the Martian record is too sparse for an unrestricted network, learning is confined within a fixed physical structure: the state is in physical units, the forecast uses physical tendencies of fixed form and learned strength, and the update is a bounded Kalman update. MarsNet is trained on Mars Years (MY) 24–31 and evaluated on independent observations. On three seasons of MGS radio-occultation temperatures assimilated by no dataset, MarsNet matches or improves on the three reanalyses in the lowest three scale heights, with a near-surface root-mean-square error (RMSE) of 4.2 K against 4.4–5.4 K, but is less accurate aloft. The model's surface pressures are the most accurate of the four products (RMSE 10 Pa against Curiosity in MY32, compared with 20–46 Pa). On withheld Mars Climate Sounder profiles of MY32, its temperatures beat an observed climatology and persistence, including in ten-sol forecasts without new observations, and its stated uncertainty is close to calibrated. Much of the temperature skill is present before training and appears to come from the structure and tables fitted to the observations, while training mainly improves the surface pressures, at some cost to dust. The model cycles stably through nine Mars years, and the influence of each observation can be traced. Its speed makes experiments on the observing record practical, and it offers an independent reference for GCMs and reanalyses.
Read the full abstract
Algebraic Geometry
The Minimum Canonical Volume of Threefolds of General Type
We prove the sharp lower bound $vol(X) \geq 1/420$ for every smooth complex projective threefold $X$ of general type.
Probability
Brown Measures and Spectral Convergence for Arbitrary GUE Polynomials
For arbitrary noncommutative polynomials in independent GUE matrices, we prove that the empirical eigenvalue measure converges weakly in probability to the Brown measure of the corresponding polynomial in free semicircular variables. We also prove convergence of the entire eigenvalue set in Hausdorff distance and convergence of the spectral radius, both in probability. Equivalently, these matrix conclusions hold for arbitrary $*$-polynomials in independent complex Ginibre matrices. Independently, we prove that the support of the Brown measure of every polynomial in free semicircular variables equals its operator spectrum. The proof of weak convergence combines a criterion based on the second moment of the Brown measure with complex Gaussian rotation and convexity. The support theorem uses linearization and rigidity of matrix Dyson equations. We also prove absolute continuity for nonconstant polynomials without adjoints in free circular variables. A matrix Dyson equation recovers Brown measures of arbitrary semicircular polynomials through regularized logarithmic potentials. For drift-corrected nondegenerate elliptic free random walks, it yields quantitative convergence of potentials in the interior of the limiting domain and weak convergence of Brown measures to that of free multiplicative Brownian motion.
Read the full abstract
Quantum Physics
Quantum Simulation of Quantum Channels and Applications
We review the basic theory of quantum channels and develop a strategy for simulating them on digital quantum computers, drawing upon the Choi-Kraus operator-sum representation and Stinespring dilation to provide a unified approach for various applications. We discuss three types of applications, offering explicit examples for each: the preparation of mixed states, measurements described by positive operator-valued measures (POVMs), and the simulation of the evolution of Markovian quantum systems. We recover fundamental concepts from quantum theory, such as the purification of a mixed state and the Naimark dilation associated with a POVM. Regarding the simulation of the evolution of a Markovian quantum system, we introduce an operator, termed the residual operator, to construct, from the system's Liouvillian, a quantum channel that serves as a first-order approximation of the quantum dynamical semigroup. This allows the simulation of quantum dynamics to be performed in a manner analogous to the Euler method for ordinary differential equations, avoiding Trotterization. We prove all the theoretical results mentioned, with the exception of the fundamental Choi-Kraus theorem concerning the operator-sum representation of quantum channels, for which we provide the appropriate references. The explicit simulations discussed were implemented using the AerSimulator from IBM's Qiskit SDK, with the corresponding code available on GitHub.
Read the full abstract
Mesoscale and Nanoscale Physics
Universal semiclassical drift velocity of magnetic edge channels
Magnetic edge channels, arising at the edge of a two-dimensional electron gas in a magnetic field, are topologically protected and propagate unidirectionally along the edge. Their group velocities at the Fermi level, being averaged harmonically, result in drift velocity, which is related to the edge density of states, quantum capacitance, and the velocity of edge magnetoplasmons. Using semiclassical quantization of electron skipping orbits, we show that the drift velocity equals 1/2 of the electron Fermi velocity in the limit of a large number of edge channels crossing the Fermi level. This result, being universal for a hard edge and for isotropic dispersion, is checked numerically for massive electrons and for massless electrons in graphene. The drift velocity at smooth electrostatically defined edges lacks such universality. In the case of anisotropic dispersion, the semiclassical drift velocity at the hard edge reduces to a coordinate-velocity correlation along the cyclotron orbit.
Read the full abstract
Quantum Physics
Self-Energy Construction for Chain Representations of Open Quantum Systems
We identify the self-energy as the environmental response to the system, which transforms covariantly under shifts of the system–environment cut. For a semi-infinite chain with asymptotically uniform parameters, this transformation admits a fixed point that defines the asymptotic boundary self-energy (BSE), whose spectral density is the Wigner semicircle. A chain-extended BSE exploits the trend of the retained chain, offering improved accuracy in representing the environment. The transformation introduces a pseudo-hyperbolic self-energy distance that is invariant under shifts of the cut, providing a natural geometry for comparing environmental responses. As a demonstration, this geometry enables cut-independent error measure of finite damped-oscillator closures of the chain, distinguishing the closure error from the chain depth error, and offers a more accurate fitting scheme than fitting the time-domain correlation function.
Read the full abstract
Combinatorics
Average distance and maximum induced linear forest
Let G be a connected graph of order n, let {\mu}(G) denote its average distance, and let L(G) denote the maximum order of an induced linear forest of G, that is, of an induced subgraph whose components are chains. Hansen, Hertz, Kilani, Marcotte and Schindl conjectured that {\mu}(G) {\le} L(G)/2, which can be written as 4W(G) {\le} L(G)n(n-1), where W(G) is the Wiener index of G. This inequality strengthens their bound {\mu}(G) {\le} F(G)/2, where F(G) is the maximum order of an induced forest, as well as Chung's classical bound {\mu}(G) {\le} {\alpha}(G). In this paper we prove the conjecture for all connected graphs.
Read the full abstract
Combinatorics
The dimension of multi-index assignment polytopes and Latin-square transversal polytopes, via association schemes
We determine the dimensions, and the implicit equations, of several polytopes from integer programming whose vertices are the largest stable sets of highly symmetric graphs. Our main tools are two new dimension formulae within Lee's spectral method, which reads the dimension off of an association scheme: for amorphic schemes it becomes a threshold formula, and for point sets in $GF(q)^d$ invariant under the maps $z\mapsto az+b$ it is $q-1$ times the number of hyperplane directions along which some point is not equidistributed. A single integer point, a witness, then certifies a whole eigenspace. For the multi-index assignment polytopes of Appa, Magos, and Mourtos at prime-power orders, the dimension equals that of the linear relaxation except in two infinite families, which are, to our knowledge, the first counterexamples to their expectation that the two always coincide. The missing equations are explicit clique equations that the standard integer-programming formulation omits. For every abelian group with a transversal, the Latin-square transversal polytope of its Cayley table, equivalently the polytope of rainbow perfect matchings of the corresponding edge-colored $K_{n,n}$ , has the maximal dimension ${(n-1)(n-2)}$; the witnesses come from new constructions of complete mappings. We also treat transversals of Desarguesian nets and the largest sets of symmetric $3\times3$ and $4\times4$ matrices over $GF(q)$ whose differences have rank at least $3$, of sizes $q^3$ and $q^5$.
Read the full abstract
Quantum Physics
Unified architecture for arbitrary two-qubit gates with neutral atoms
We propose a unified architecture for two-qubit gates in neutral-atom quantum processors which allows the implementation of the complete set of two-qubit gates. Our approach rests on a single resource that unlocks the entire gate set: an XXZ interaction with tunable anisotropy, combined only with single-qubit operations. We introduce a Rydberg-atom realization of the tunable XXZ interaction and combine it with optimally controlled global microwave pulses to implement the B, QFT, iSWAP, and $\sqrt{\mathrm{iSWAP}}$ gates, as well as a continuous gate family interpolating from CZ to iSWAP via the B gate. This work allows the implementation of any two-qubit gate natively in neutral-atom platforms, enabling flexible switching between instruction sets to reduce circuit depth and compilation overhead in quantum algorithm implementation.
Read the full abstract
Functional Analysis
Concave shifts and the complete Nevanlinna–Pick property
Let $\mathcal H$ be a reproducing kernel Hilbert space of holomorphic functions on the unit disc, and assume $\mathcal H$ is invariant under the forward and backward shifts. We show that if the forward shift on $\mathcal H$ is concave, then $\mathcal H$ is a complete Nevanlinna–Pick space. This gives an affirmative answer to the concavity part of Shimorin's question \cite{Sh02} and extends his theorem on the complete Nevanlinna–Pick property of Dirichlet-type spaces with superharmonic weights.
Read the full abstract
Machine Learning
Anchor Behavior, Not Parameters: Rehearsal-Free Continual Learning with a Single Shared Prompt
Prompt-based continual learning adapts a frozen pre-trained vision transformer by tuning a small set of prompt tokens. Recently, one-prompt methods which share one single prompt across all tasks make this paradigm maximally parameter efficient. The open question is how a shared prompt can keep the knowledge of old classes while being updated for new ones. Existing methods protect old knowledge in parameter space, where they freeze task-specific prompts, expand new components, or sparsely gate which tokens receive gradients. However, this method sacrifices plasticity, yet the drift it still permits in shared tokens can corrupt the prompt's function on past classes. What must be preserved is the prompt's behavior. We propose TEA-Prompt, which couples (i) a token evaluation module that assigns each prompt token a continuous, input-conditional relevance score injected into the attention logits, softly specializing tokens across tasks without discarding any of them, and (ii) an attention-behavior anchoring loss that constrains each token's attention output around class-specific query regions using only compact Gaussian query statistics without stored old images, weighted by the token's past relevance. Anchoring the attention value allows the parameters to continue updating freely, as long as their interaction remains unchanged. TEA-Prompt achieves state-of-the-art accuracy with markedly lower forgetting on CIFAR-100, ImageNet-R, and CUB-200 with only 0.38M parameters. Code is publicy available at https://github.com/cuonga1cvp/TEA-Prompt.git
Read the full abstract
Number Theory
Why the non-abelian Gyarmati–Matolcsi–Ruzsa inequality does not generally work: mechanisms and explicit examples
For finite sets in a commutative semigroup, Gyarmati, Matolcsi and Ruzsa proved \[ |A_1+\dots+A_n|^{n-1}\ \le\ \prod_{i=1}^n|A_1+\dots+A_{i-1}+A_{i+1}+\dots+A_n| . \] They asked whether in an arbitrary group \[ |A_1\cdots A_n|^{n-1}\ \le\ \prod_{i=1}^n\ \max_{a\in A_i}\,|A_1\cdots A_{i-1}\,a\,A_{i+1}\cdots A_n| , \] where each omitted set is replaced by the largest slice obtained by fixing one of its elements. Nair, Namayandeh and Zhu proved that this inequality does not hold when $n=4$ and $G=D_4^{14}$, of group order $8^{14}$. We develop its double-coset mechanism and construct counterexamples in many other groups. For $n=4$, the smallest group found has order $518\,400$, namely $A_6^2\times C_2^2$; no absolute minimality is claimed. For $n=6$ there is a witness in a group of order $1728$, for $n=10$ a class-three $3$-group of order $243$ suffices, and for $n=4$ a single class-two $2$-group of order $2^{23}$ works. We also obtain torsion-free examples. The violation ratio $R_n=|A_1\cdots A_n|^{n-1}/\prod_iN_i$ is greater than one exactly when the inequality fails; explicit four-set constructions attain $R_4\approx1.29$ in $A_8^2$, and a larger ratio of about $1.43$ is reported for $A_{10}^2$. For every $n\ge4$, the inequality holds in all direct powers of $G$ precisely when $G$ is abelian. For $n\ge2$ the optimal exponent $\theta_n$ is the infimum of $\log(\prod_iN_i)/\log|A_1\cdots A_n|$ over products of size at least two. We obtain $2\le\theta_n\le n-1.0768$, and an infinite family in $C_3*C_3$ shows $\theta_n\le n-1-\delta$ for every $\delta<5-2\log_25\approx0.3561$ and all sufficiently large $n$.
Read the full abstract
Artificial Intelligence
LogCDM: Interpretable Log Anomaly Detection via Behavioral Graph Drift and Adaptive Signal Fusion
Log-based anomaly detection is increasingly dominated by large pretrained models, from BERT-scale encoders to 8B-parameter language models, which require GPUs at inference time and are difficult to deploy on the monitoring nodes where logs are produced. We present LogCDM, a compact detector that scores each log session using three complementary signals: the next-event surprise of a small causal Transformer, the distance between a graph-attention embedding of the session's own transition graph and that of a normal reference graph, and a transition-drift statistic that we show is exactly a frequency-weighted chi-squared divergence between transition kernels. The divergence view yields an asymptotic null distribution, a length-standardized score, and a per-edge decomposition that explains each alarm. A sigmoid gate fuses the three signals; under a shared-covariance Gaussian model, this gate is the Bayes posterior, and its learned weights indicate which signal each dataset relies on. With 8.1-8.8M parameters and no GPU required at inference, LogCDM reaches F1 scores of 0.984 on HDFS, 0.870 on chronologically split BGL, and 0.850 on Thunderbird, within 0.013-0.12 of an 8.1B-parameter LLM detector evaluated under the same protocol and above all compact baselines on BGL. It scores a session in 5.5-10.5 ms on a CPU. Ablations show that the structural signals add 0.025-0.030 F1 on BGL and Thunderbird but almost nothing on HDFS, consistent with the learned fusion weights.
Read the full abstract
High Energy Physics (Experiment)
Search for Dark Photon Dark Matter at 74–159 $\mu$eV/$c^2$ Using Broadband Cryogenic Receivers
Dark photons are hypothetical massive vector bosons that couple to ordinary photons through kinetic mixing $\chi$. Dark photon dark matter (DPDM) converts into photons at a metal surface, with a frequency set by its mass. Using cryogenic K- and Ka-band receivers with a broadband spectrometer, we searched for this signal over 74–159 $\mu$eV/$c^2$ (18–38.5 GHz) with an integration time of $4.8\times10^5$ s per frequency bin. We found no statistically significant signal and set upper limits of $\chi<(3.1$–$17)\times10^{-12}$ at the 95% confidence level over 99.8% of the search range, assuming DPDM constitutes all local dark matter. These results improve on previous limits by more than an order of magnitude over most of 74–110 $\mu$eV/$c^2$ and provide the first direct limits over most of 110–159 $\mu$eV/$c^2$, approximately two orders of magnitude below cosmological bounds.