Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Tuesday 8 September

Astrophysics of Galaxies

Low-Redshift Interlopers in the SDSS DR16 $z > 5$ Quasar Catalogue

High-redshift quasars ($z>5$) are crucial for studying early black hole growth and reionisation. SDSS Data Release 16 catalogues 655 such sources with multiple redshift estimators. We systematically examined this subsample and found 480 sources (73.2%) where pipeline redshift (Z\_DR16Q) disagrees with the derived estimate (Z\_FIT) significantly. Visual inspection confirms that 125 of these (19.1% of the total) are actually low-redshift active galactic nuclei. In 114 cases, broad Mg\,ii with C\,iii and C\,iv was misidentified as Ly$\alpha$; in 11 cases, H$\alpha$ was misidentified as Ly$\alpha$. This error is immediately revealed by the absence of Gunn–Peterson trough blueward of Ly$\alpha$. Crucially, Z\_FIT recovers correct redshift in the affected sources where emission lines are prominent, indicating the algorithm is sound; the issue lies in community preference for Z\_DR16Q or Z\_SPEC. We urge caution against uncritical use of pipeline redshifts for $z>5$ DR16Q sources and recommend Z\_FIT as the preferred estimator.
Read the full abstract

High Energy Physics (Phenomenology)

Near-Threshold Dynamics of ḩi}c1(3872) and T+cc(3875) States via Effective Range Expansion and Monte Carlo Uncertainty Propagation

We investigate the near-threshold structure of the exotic tetraquark candidates $\chi_{c1}(3872)$ and $T_{cc}^+(3875)$ using the effective-range expansion (ERE) and resonance compositeness relations. From the experimental masses and widths, we extract scattering lengths, effective ranges, and molecular compositeness coefficients within a two-channel framework, with uncertainties propagated through $N=50000$ Monte Carlo samples. We find large negative scattering lengths, $a=-8.49^{+0.93}_{-1.05}$ fm for $\chi_{c1}(3872)$ and $a=-14.57^{+1.70}_{-1.66}$ fm for $T_{cc}^+$, and dominant molecular components $X_2>0.95$. The results are robust against variations of compositeness, experimental correlations, and the loop-function subtraction constant. An explicit ERE+CDD-pole analysis finds no physically reasonable bare-state contribution consistent with the observed poles and a natural background. Our results provide strong evidence for predominantly molecular structures of both states and demonstrate the robustness of the ERE approach to near-threshold exotic hadrons.
Read the full abstract

All authors A. A. Atangana Likéné, A. Franck Rothen, J. M. Ema'a Ema'a, P. Pradyun Hebbar, Saralees Nadarajah, Tobias Golling, G. H. Ben-Bolie

Artificial Intelligence

LEBGen: An LLM-Enhanced Bayesian Network Framework for Few-Shot Travel Survey Data Generation

Travel survey data are essential for transportation planning and travel behavior analysis, yet collecting large-scale representative samples is costly and time-consuming. A practical alternative is to generate synthetic survey records from a few-shot sample. However, such samples provide incomplete coverage of heterogeneous traveler groups and insufficient evidence for recovering the complex dependencies between demographic characteristics and travel behavior. Existing approaches have complementary limitations. Probabilistic generative models such as Bayesian networks (BNs) offer explicit distributional control, but structures learned from few-shot samples may omit meaningful dependencies or retain spurious ones. Large language models (LLMs) can help address these difficulties in BN structure learning by providing behavioral knowledge that complements the limited statistical evidence. We therefore propose LEBGen, an LLM-enhanced BN framework that uses this knowledge to refine network structure for few-shot travel survey data generation. Specifically, the LLM first identifies traveler personas from demographic attribute and travel behavior statistics, then recovers dependencies missed by the persona-augmented BN structure and prune spurious ones. The refined BN is parameterized exclusively from the observed data to generate synthetic records. Under a 2% few-shot setting on the 2022 Hong Kong Travel Characteristics Survey, LEBGen reduces the mean marginal Jensen-Shannon divergence from 0.0671 to 0.0091 and the mean absolute Cramer's V error by 14.3% over the best-performing baseline, substantially improving both distributional and dependency fidelity.
Read the full abstract

All authors Zijian Shen, Bin Zhou, Jiguang Wang, Ya Zhao, Jintao Ke

Algebraic Geometry

On the Surjectivity of the Geometric Sen Map of Perfectoid Torsors

We study surjectivity of the geometric Sen map for perfectoid $G$-torsors over smooth rigid analytic spaces over $\mathbb{C}_p$, where $G$ is a compact $p$-adic Lie group. We construct an affinoid perfectoid $\mathbb{Z}_p^2$-torsor over a smooth curve whose Sen map is not surjective, thereby disproving Rodríguez Camargo's conjectured implication from perfectoidness to surjectivity. We prove that the Sen map of every perfectoid $G$-torsor over a smooth curve is nevertheless surjective on a Zariski open dense subset. Finally, we show that locally analytic decompletion implies Sen surjectivity for diamondian affinoid perfectoid torsors.
Read the full abstract

Machine Learning

HypLTSF: A Hyperbolic Geometric View of Multi-Scale Hierarchies for Long-Term Time Series Forecasting

Multi-scale modeling has become an effective approach for long-term time series forecasting, capturing temporal patterns that range from fine-grained local dynamics to coarse global trends. Representations across these temporal scales are inherently hierarchical, with coarser scales abstracting and aggregating information from finer ones. While existing approaches readily exchange information across these scales, the hierarchy itself is typically left as an emergent byproduct of such interactions rather than captured as a geometric structure in its own right. In this paper, we introduce HypLTSF, a framework that endows the multi-scale hierarchy with a concrete geometric form by embedding scale-wise representations into the Poincaré ball, whose exponentially expanding volume naturally accommodates hierarchical structures. To align this geometry with the temporal hierarchy, HypLTSF imposes two constraints: (1) a radial constraint that orders embeddings by their level of abstraction, and (2) an angular constraint that groups fine-scale patterns sharing a common coarser-scale ancestor. Extensive experiments on long-term time series forecasting benchmarks show that HypLTSF achieves state-of-the-art performance, suggesting that explicitly modeling the multi-scale hierarchy as a geometric structure is effective for forecasting.
Read the full abstract

Information Theory

Physics of Information Geometry - Part I: Principle of Least Action on the Probability Simplex

We develop a least-action framework for describing how a probability distribution can evolve from an equilibrium state to a prescribed nonequilibrium state under constrained incremental changes. Taking a Gibbs distribution as the equilibrium reference, the framework gives a direct physical meaning to the geometry of the probability simplex: distance from equilibrium corresponds to nonequilibrium free energy, while changes between successive distributions carry an informational kinetic cost. The Pythagorean structure of relative entropy then provides the central insight of the work. It shows that intermediate distributions chosen via sequential information projections can reduce the kinetic cost of large transitions and establishes an energy-conservation-like relation between the kinetic expenditure along a path and the free energy accumulated in reaching the target distribution. Motivated by this geometry, we construct a greedy least-action path through successive information projections, obtain a closed-form characterization of each projection through the Lambert W function, and establish a finite-step performance guarantee. We further show that state-dependent costs can be incorporated naturally by reshaping the underlying Gibbs reference, providing a thermodynamic interpretation of path penalties as modifications of the effective energy landscape. Together, these results provide a unified view of distributional evolution through least action, information geometry, and nonequilibrium thermodynamics.
Read the full abstract

Probability

Global Existence and Stability of 3D Stochastic NSEs in Bounded and Unbounded Domains Driven by a Special Multiplicative Wiener Process

The aim of this work is to extend the results from a recent paper by Hong, Li and Liu, from bounded domains to both bounded and unbounded domains. We show the global existence and uniqueness of 3D stochastic Navier-Stokes equations with nonlinear multiplicative noise for every initial data from the Sobolev space $H^1$. We do not use any tightness argument. Instead, we firstly show the existence of a local maximal solution and then we use Lyapunov function to prove the solution is global. Our approach is motivated by a recent paper of the first named author with Ferrario, Maurelli and Zanella about a similar result for stochastic nonlinear Schrödinger Equations. The main idea is that once the local existence of strong solutions is established, a very strong noise pushing toward the origin, will make blow-up impossible.
Read the full abstract

Computer Vision

MARS-CLIP: Multi-Resolution and Attention Refined Zero-Shot Image Segmentation

Contrastive Language-Image Pre-training (CLIP) has demonstrated impressive capabilities in zero-shot transfer but often struggles with dense prediction tasks due to low spatial resolution and the loss of structural information. To address these limitations, we propose MARS-CLIP (Multi-resolution and Attention Refined Segmentation for CLIP), a novel framework for zero-shot semantic segmentation. Our approach introduces two key strategies: (i) a multi-resolution feature extraction module that fuses local fine-grained features with global context to overcome input resolution constraints, and (ii) an attention refinement mechanism that injects spatial and color biases from intermediate layers into the final self-attention block to accurately restore object boundaries. A set of experiments on six public datasets demonstrates that MARS-CLIP significantly outperforms state-of-the-art methods.
Read the full abstract

All authors Nagito Saito, Shintaro Ito, Koichi Ito, Takafumi Aoki

Computer Vision

Dreaming in Flow: Bidirectional Self-Refinement for Unified Multimodal Models

Unified multimodal models can generate images and interpret them, but their two capabilities are usually optimized with separate supervision. We introduce Bidirectional Self-Refinement via Flow-Direction Feedback and Semantic Replay (BiSe), a post-training method that uses self-generated visual episodes to construct feedback for both pathways. Understanding-guided generation aligns the prompt-conditioned flow direction with an image-conditioned prediction and with the model's response to a repair instruction. Generation-guided understanding replays the source intent through captioning and image generation, and learns a stable semantic evidence profile across the replayed images while separating an independent episode. Flow-matching and source-prompt objectives remain active, and frozen initial-model predictions limit drift. BiSe requires no paired image–text data during post-training. It improves text-to-image compositionality across three unified backbones and visual understanding on the two backbones evaluated for that task.
Read the full abstract

All authors Ke Hao, Yuanzhi Liang, Tingxi Chen, Rui Li, Haibin Huang, Chi Zhang, Yun Gu, Xuelong Li

Computer Vision

SAM3-O2D2: Zero-Shot Object Out-of-Distribution Detection by Object Class Prompting of the SAM3-Image Model

Object detectors have shown remarkable performance in various fields, among these medical imaging, surveillance, and autonomous driving. However, they are prone to overconfidence when encountering unseen objects in real-world deployments, causing potential safety issues. To address this, detecting out-of-distribution (OOD) objects is essential for reliable object detection. Modern approaches leverage the broad semantic knowledge of foundation models such as CLIP for post-hoc few- and zero-shot OOD detection. However, these methods typically perform OOD assessment in feature space, which can be sensitive to object detector localization errors and variations in object appearance. Moreover, the current state-of-the-art (SOTA) zero-shot method performs computationally costly diffusion in inference. In this work, for our proposed zero-shot object OOD detection method SAM3-O2D2, we employ the SAM3-image foundation model in an efficient manner. Specifically, we prompt SAM3 only with the object detector's predicted classes and compare the predictions of the object detector and SAM3. An object is in-distribution (ID), if SAM3 also detects an object at the corresponding location. If SAM3 does not detect the prompted object, this indicates a mismatch between the detector's prediction and the image content, suggesting that the object is OOD. Experimental results show that our method significantly surpasses the so-far zero-shot SOTA method. Specifically, we achieve new SOTA AuROC and FPR95 metrics over both ID datasets Pascal-VOC and BDD100K and both OOD datasets MS-COCO and OpenImages.
Read the full abstract

Robotics

Seeing is Not Believing: Breaking the Physical-to-Digital Trust Boundary in Robotics

In multi-robot collaboration, task handovers rely on downstream verifiers performing remote attestation, which inspects sensor telemetry to ensure a robot's physical behavior strictly matches its assigned task. But can this telemetry be trusted? We show that it often cannot. In this paper, we uncover a severe vulnerability in Robot Operating System (ROS) 2: by modifying a single environment variable, an adversary can execute a pre-built hook to covertly intercept and inject both telemetry and control signals before they are published. Consequently, adversaries can hijack a robot to perform dangerous tasks while spoofing downstream verifiers with synthesized fake telemetry. Worse still, by exploiting the widespread reliance on third-party Docker containers and auxiliary tools, attackers can distribute compromised packages embedded with these malicious hooks to launch such attacks easily. On a physical Franka Emika robotic arm running Secure ROS 2, our attack injects fabricated telemetry in real time with only around 3 ms of jitter, preserving temporal synchronization and hardware integrity while achieving an 87% success rate even against an AI-based detector. We have responsibly disclosed these findings to the ROS 2 development team. We prepared a demo video available at https://youtu.be/ExeiGqUrnhQ.
Read the full abstract

All authors Leming Shen, Shikai Geng, Yuanqing Zheng, Chris Xiaoxuan Lu

Computation and Language

What Eviction Destroys: A Restore-Counterfactual Audit of Forgetting in Agent Memory

Agent memory systems must discard stored information when their history exceeds a fixed token budget. Existing budget-accuracy frontiers quantify the resulting loss in accuracy, but do not distinguish irreversible losses caused by eviction from recoverable retrieval failures. We introduce the restore counterfactual, a per-question paired intervention that reinstates the question's gold evidence in the read-time context and reruns the same reader. Combining the change in correctness with whether the evidence was retained after eviction classifies each oracle-answerable error as recoverable, irreversible, or residual; in the residual case, the answer remains incorrect after restoration. We evaluate FIFO, random, redundancy-aware, and LLM-importance eviction on LongMemEval-S at three budgets and under two retrieval regimes, using GPT-4o-mini as the primary reader and judge and GPT-5.4-mini as a robustness reader. Under top-k retrieval at an 80k-token budget, the irreversible share among errors corrected by restoration is 0.67-0.73 for FIFO, random, and redundancy-aware eviction, compared with 0.60 for LLM-importance. At 8k tokens, it reaches 1.00 for all four policies. Recoverable errors occur under top-k retrieval at 80k tokens but are absent under forced-gold injection by construction, so budget-accuracy results are not directly comparable unless the retrieval regime is reported. An exploratory matched-accuracy analysis detects no difference in irreversible rate among accuracy-matched policy pairs at a resolution of 1.2-6 percentage points. The same analysis detects the deliberately destructive control. To our knowledge, this is the first per-item, per-question restore-counterfactual audit of eviction for external agent-memory stores on a standard conversational benchmark.
Read the full abstract

Superconductivity

Néel-Vector Control of the Josephson Diode Effect in $\mathcal{PT}$-symmetric Antiferromagnets

The interplay of superconductivity and magnetism gives rise to rich phenomena in Josephson junctions. In this Letter, we study Josephson junctions formed by conventional $s$-wave superconductors and a $\PT$-symmetric collinear antiferromagnet modeled on CuMnAs. Using microscopic modeling and symmetry analysis, we show that these junctions exhibit both the Josephson diode effect and $\varphi_{0}$-junction states. Remarkably, both effects are controlled by the Néel vector: rotating it by $90^{\circ}$ switches off both, while reversing it switches the diode polarity. To reveal the microscopic mechanism, we develop a channel-resolved scattering theory that accurately captures the anomalous phases and establishes the exact condition for the diode effect. The interplay of the channel current-phase relations yields a sizable diode efficiency, tunable by both the magnitude and direction of the exchange field. Furthermore, a Green-function reduction identifies a single renormalized $\PT$-degenerate band as the transport carrier and precisely reproduces the full current amplitudes. Our work establishes $\PT$-symmetric antiferromagnets as versatile platforms for field-free, highly tunable Josephson diodes and $\varphi_{0}$ junctions.
Read the full abstract

All authors Xian-Tang Xu, Xun-Jiang Luo, Mingliang Tian, Ning Hao

Machine Learning

Adaptively Incorporating Directional Hints into Zeroth-Order Optimization

We study zeroth-order optimization of nonconvex functions with the aid of directional hints, which are cheap but potentially inaccurate approximations of the true gradient direction, given by linear subspaces at each iteration. To leverage these hints adaptively while maintaining robustness to their quality, we introduce Control-Variate Zeroth-Order Descent (CV-ZOD), a new framework that refines the classical zeroth-order gradient estimator with a control variate that can be set based on the directional hints. We first show that the oracle algorithm that optimally sets the reference vector and step size at each iteration achieves a convergence rate that interpolates between the first-order $O(1/T)$ rate and the zeroth-order $O(d/T)$ rate, depending on the quality of the hints along the trajectory. We then develop a practical variant of CV-ZOD that achieves the same oracle guarantee up to logarithmic factors, without any prior knowledge of the hint quality. We validate the method empirically on simulation-based scientific optimization tasks, demonstrating sustained progress on nonconvex landscapes where zeroth-order descent is slower and existing guided methods stall as guidance deteriorates.
Read the full abstract

Machine Learning

Online Signature Verification Using Augmented Path Signature and T-Mamba

Handwritten signature verification is vital for personal authentication across commercial and financial applications. Although deep learning methods are widely adopted for online signature verification (OSV), they often struggle with capturing highly discriminative features and modelling long-range dependencies. To address these issues, we propose a novel framework that integrates the augmented path signature (APS) descriptor with the T-Mamba model. The APS descriptor first applies time and basepoint augmentations, then computes sliding-window path signatures. The path signature is a non-parametric feature map from rough path theory that effectively captures geometric structures and nonlinear inter-channel interactions. Inspired by the efficacy of state space models (SSMs) in sequence modelling, our T-Mamba model employs a hybrid design combining two temporal convolutional network (TCN) blocks with a time-scanning Mamba. This design enables the model to learn both local temporal patterns and global long-range dependencies, substantially improving verification accuracy. Our framework achieves state-of-the-art EERs on three public benchmark datasets (MCYT-100, SVC-2004 Task 2, DeepSignDB), validating its effectiveness and robustness, especially when the training data is limited. Our code is publicly available at https://github.com/DLRL04/OSV-using-APS-and-T-Mamba.
Read the full abstract

Artificial Intelligence

Beyond Coherence: Benchmarking Professional Editing-Technique Execution in Multi-Shot Audio-Video Generation

Recent multi-shot audio-video generators can produce increasingly coherent and cinematic outputs, but coherence does not imply the ability to execute editing techniques. Professional editing depends on shot structure, transition grammar, audio-video cut relations, and montage, yet existing benchmarks largely rely on proxies such as content quality, synchronization, or physical plausibility, systematically missing whether such editing instructions are actually executed. We introduce CutCraft, the first benchmark for editing-technique execution in multi-shot audio-video generation. CutCraft extends structured multi-shot prompts with explicit editing specifications and is paired with a hierarchical hybrid evaluation framework that combines shot-structure alignment, expert-model metrics, tool-grounded multimodal judgment, and rubric-based question answering. Beyond evaluation, we design an agentic editing baseline that decomposes generation into planning, shot-level synthesis, and post-hoc composition, explicitly realizing editing semantics such as J-cuts, L-cuts, and transition timing. Across 13 state-of-the-art closed- and open-source models, CutCraft reveals a consistent gap between coherence and editing-technique execution: current systems often produce plausible multi-shot videos yet fail to execute editorial instructions reliably. We find unstable shot structures, weak control of transition execution, and sharp degradation on higher-order montage, while aesthetic quality is only weakly correlated with editing-technique compliance. The benchmark and metrics, and the editing agent baseline are available at https://github.com/AlibabaResearch/cut-craft-bench.
Read the full abstract

All authors Tianyi Zeng, Junchao Liao, Yujie Wei, Ziying Zhang, Litao Li, Tianyi Wang, Zhichao Wei, Shuyao Xu, Wenwen Qiang, Siyu Zhu, Zhenghao Zhang, Long Qin

Optimization and Control

Risk-Averse Bayesian Games with an Unknown Type Distribution: Bayesian Learning, Equilibrium Analysis, and Finite-Sample Guarantees

Classical Bayesian games assume that the joint distribution of players' types is common knowledge, an assumption that rarely holds in practical applications. We address this issue by studying a group of myopic players who repeatedly interact under the Bayesian Nash conjecture and learn a parametric joint type distribution from type profiles observed over time within a Bayesian learning framework. Players may hold heterogeneous priors and may be risk averse toward both epistemic uncertainty about the distributional parameter and aleatoric uncertainty in their rivals' types. We propose two models: a Bayesian Nash equilibrium among risk-averse Bayesian learners (BNE-RABL), in which epistemic and aleatoric risks are evaluated separately, and a BNE based on Bayesian predictive distributions (BNE-BPD), in which the two sources of uncertainty are integrated into a Bayesian predictive distribution and evaluated through a single risk measure. Under suitable conditions, we establish the existence and uniqueness of both equilibria, and derive non-asymptotic convergence rates of the equilibrium sequences toward the corresponding oracle BNE under the true type distribution as the game is repeatedly played and more type profiles are observed. These results further show that the discrepancy between the BNE-RABL and BNE-BPD strategies vanishes as the sample size grows, which illustrates that the two models can be regarded as effective approximations to each other. We apply the proposed models to a price competition problem and numerically illustrate the theoretical results.
Read the full abstract

Artificial Intelligence

MemForest: Efficient Agent Memory Management via EventTree Partitioning and Progressive Merging

Agent memory systems have demonstrated significant potential in long-term dialogue, personalized assistants, and video understanding. However, continuously accumulated memory introduces substantial storage and retrieval costs during inference. To address this issue, we propose MemForest, a general memory compression framework adaptable to various agent memory systems. Specifically, MemForest partitions historical memory into event-centric units by leveraging global semantic similarity and local temporal continuity. For each unit, it constructs a maximum spanning tree, termed an EventTree, and progressively merges redundant memory nodes by selecting high-weight edges, reducing storage overhead. Furthermore, we introduce an anchor-guided propagation retrieval mechanism that retrieves relevant memory nodes from the temporal neighborhoods of key nodes, improving retrieval accuracy. Extensive experiments demonstrate the effectiveness of MemForest. Under the unimodal Mem0 framework, MemForest retains 97.1% of the original performance while compressing 50% of historical memory across three benchmarks (LoCoMo, LongMemEval, and PersonaMem), achieving a 1.89x retrieval speedup. Under the multimodal M3-Agent framework, it preserves 99.7% of the original performance with a 50% compression ratio across two benchmarks (M3-Bench-robot and M3-Bench-web), achieving a 2.24x retrieval speedup. \textcolor{RoyalBlue}{Our code is available at [https://github.com/Celina-love-sweet/MemForest.}](https://github.com/Celina-love-sweet/MemForest.}})
Read the full abstract

All authors Junxi Wang, Te Sun, Jiayi Zhu, Chen Zhang, Siyuan Li, Xuyang Liu, Zichen Wen, Xiaobing Tu, Jinkui Ren, Xiantao Zhang, Ziqi Yuan, Linfeng Zhang

Game Theory

Subquadratic Subsidies for Nonnegative or Nonpositive Valuations

We study envy-freeness with subsidies for indivisible items beyond additive valuations. Assuming that every single-item marginal value lies in $[-1,1]$, we prove that a total subsidy of $O(n^{3/2}\sqrt{\log n})$ suffices to achieve envy-freeness among $n$ agents whenever all agents assign nonnegative values to every bundle or all assign nonpositive values to every bundle. These valuation classes include monotone goods and monotone chores, respectively, but do not require monotonicity. Our result establishes the first subquadratic total-subsidy bound for general monotone valuations that holds for every number of agents.
Read the full abstract

Artificial Intelligence

Three Types of Negation of Triple and its Elements and an Extension of Triple

In various data models, the classical triple is a typical semantic data model. However, due to the design of the triple as a simple structure for representing positive assertions, it cannot sufficiently express different forms of negation present in the triple and its elements. This paper conceptually proposes that there are three distinct forms of negation within triples and their elements: contradictory negation, opposite negation and intermediary negation. Based on the the set SCOI and the logic LCOI+PLCOI with three kinds of negation, we propose an extension of triple that can distinguish and express these three different negations in the triple and its elements, called the TCOI triple with contradictory negation, opposite negation and intermediary negation. The TCOI triple is a semantic and structural extension of the classical triple. While retaining the ability to express positive assertions, it systematically introduces the three semantic dimensions of three negations, allowing these negations to independently act on the elements of the triple and on the whole triple. This significantly enhances the triple model capability to represent and reasoning about complex negative information. This paper also explores the expressive power and reasoning of the TCOI triple, as well as the application of TCOI triple implication reasoning in counterfactuals and counterfactual reasoning. We propose a truth-value (continuous value) algorithm for TCOI triple implication reasoning and perform its calculation through an example of the counterfactuals and counterfactual reasoning.
Read the full abstract

Materials Science

Light-facilitated ferroelectric switching in wurtzite crystals

Wurtzite ferroelectrics combine large remanent polarization with full CMOS compatibility, positioning them as a leading platform for next-generation non-volatile memory. Their practical deployment, however, is hindered by an intrinsically large coercive field, rooted in the high energy barrier separating the polar wurtzite phase from the nonpolar hexagonal phase that mediates polarization switching. Here, using first-principles calculations, we propose an alternative, field-free strategy for lowering this barrier: above-bandgap electronic photoexcitation. Taking LaN as a representative wurtzite ferroelectric, we show that light induced carriers dramatically reduce the energy difference between the hexagonal intermediate phase and the wurtzite ground state, sharply reducing the energy barrier to ferroelectric switching. This effect originates from a photoinduced partial metallization of the polar phase, which screens the dipole-dipole interactions that stabilize ferroelectric order and thereby favors the competing nonpolar structure. The robustness of this mechanism is further confirmed for the rocksalt polymorph. Our results establish light as a powerful, non-invasive route to controlling ferroelectric switching in wurtzites, opening a path toward faster, lower-voltage, and more energy-efficient non-volatile memory technologies.
Read the full abstract

All authors Ricardo Jiménez-Sánchez, Fernando Salazar, Miguel Cruz-Irisson, Riccardo Rurali, Claudio Cazorla

Representation Theory

Quasi-split iYangians: minimalistic presentations and coideal structures

We study iYangians, namely twisted Yangians in the Drinfeld current presentation, associated with quasi-split symmetric pairs of type $\mathsf{ADE}$ with nontrivial diagram involution. We establish minimalistic presentations in terms of degree-zero and degree-one generators. Type $\mathsf A_{2n}$ is treated separately: the isolated rank-two case requires two additional relations, whereas in higher rank these relations are forced by the neighboring noncentral orbit. As a by-product, we strengthen Theorem 3.1 in arxiv:2511.07136 by proving that the extra relation in the minimalistic presentation of split iYangian is redundant whenever $\mathfrak g$ has rank at least two. We also construct explicit injective homomorphisms from quasi-split iYangians into Yangians, identify their images as right coideal subalgebras, and obtain isomorphisms between the Drinfeld and $J$ presentations. Finally, we derive triangular estimates for the Drinfeld currents and their coproducts and apply them to the ${}^\imath\ell$-weights arising by restriction from finite-dimensional Yangian modules.
Read the full abstract

Machine Learning

Synergistic Fusion of Topological Structure and Temporal Semantics of Mobility for Urban Region Embedding

Urban region embeddings have shown promising results in diverse urban sensing tasks such as crime, income, and service-call prediction. Recent methods improve representation quality by integrating mobility data with auxiliary modalities, using cross-view attention or contrastive objectives to align heterogeneous features into a unified region representation. However, leveraging the temporal dynamics of human mobility remains under-explored. Regional inflow and outflow fluctuate throughout the day, and inter-region connections emerge, persist, and dissolve over time. Moreover, prevailing fusion strategies combine views additively and miss the joint signal that emerges only when views co-occur. To address these gaps, we propose Mobility Stream-Structure Synergy (MoSS), which derives complementary views from mobility data: a Sequence view that preserves each region's hourly inflow/outflow profile, and a Structure view based on zigzag persistence diagrams that capture how regional connectivity emerges, persists, and dissolves over time. A synergy module then extracts emergent representations from the co-occurrence of these views through multi-degree interactions, explicitly capturing higher-order signal across views. Extensive experiments on New York City and Chicago show that MoSS achieves state-of-the-art performance across three downstream tasks using mobility data alone, outperforming baselines that rely on auxiliary modalities.
Read the full abstract

All authors Namwoo Kim, Jeeyun Chang, Kanghoon Lee, Yoonjin Yoon

Artificial Intelligence

Evidence-Aligned Entity Verification for Hallucination Detection in Retrieval-Augmented Generation

Hallucination detection is crucial for large language models (LLMs), as hallucinated content creates significant barriers in applications requiring factual accuracy. Current detection methods mainly depend on internal signals like uncertainty and self-consistency checks, using the model's pre-trained knowledge to identify unreliable outputs. However, pre-trained knowledge may become outdated and has coverage limitations, especially for specialized or recent information. To address these limitations, retrieval-augmented generation (RAG) has emerged as a promising solution by retrieving relevant evidence at inference time, grounding outputs beyond the model's parametric knowledge. In this paper, we target a critical and practical learning problem RAG-based hallucination detection (RHD), where RAG is employed to enhance hallucination detection by addressing information updating challenges. To address RHD, we propose a novel method Evidence-Aligned Entity Verification (EAEV), which detects entity-level hallucinations by leveraging RAG to align generated entities with retrieved evidence contexts. Specifically, EAEV evaluates entity-evidence alignment through three complementary dimensions and introduces counterfactual stability analysis to ensure robust alignments under evidence perturbations. Experiments across multiple RAG benchmarks demonstrate that EAEV achieves consistent improvements over existing methods with strong generalization capabilities.
Read the full abstract

All authors Runsong Jia, Zhen Fang, Mengjia Wu, Jie Lu, Yi Zhang

High Energy Physics (Experiment)

Search for the doubly Cabibbo-suppressed decays $D^0\to K^+\pi^-\eta^\prime$ and $D^+\to K^+\pi^0\eta^\prime$

We present the first search for the doubly Cabibbo-suppressed decays $D^0\to K^+\pi^-\eta^\prime$ and $D^+\to K^+\pi^0\eta^\prime$ using an $e^+e^-$ collision data sample corresponding to an integrated luminosity of 20.3 fb$^{-1}$, collected at a center-of-mass energy of 3.773 GeV with the Beijing Spectrometer III (BESIII) detector at the Beijing Electron-Positron Collider II (BEPCII). No significant signals are observed, and the upper limits on their decay branching fractions are set to be $3.0\times 10^{-5}$ and $2.1\times 10^{-5}$ at the 90% confidence level, respectively. By combining these results with the world-average branching fractions of the corresponding Cabibbo-favored decays, upper limits at the 90% confidence level are obtained on the ratios of doubly Cabibbo-suppressed to Cabibbo-favored branching fractions. The limits are determined to be $1.6\times \tan^4\theta_C$ and $3.7\times \tan^4\theta_C$ for $D^0\to K^+\pi^-\eta^\prime$ and $D^+\to K^+\pi^0\eta^\prime$, respectively, where $\theta_C$ denotes the Cabibbo mixing angle.
Read the full abstract

All authors BESIII Collaboration: M. Ablikim, M. N. Achasov, P. Adlarson, X. C. Ai, C. S. Akondi, R. Aliberti, A. Amoroso, L. P. An, Q. An, M. S. Anderson, Y. Bai, O. Bakina, H. R. Bao, X. L. Bao, M. Barbagiovanni, V. Batozskaya, K. Begzsuren, N. Berger, M. Berlowski, M. B. Bertani, D. Bettoni, F. Bianchi, E. Bianco, A. Bortone, I. Boyko, R. A. Briere, A. Brueggemann, D. Cabiati, H. Cai, M. H. Cai, X. Cai, A. Calcaterra, G. F. Cao, N. Cao, X. Cao, S. A. Cetin, X. Y. Chai, J. F. Chang, T. T. Chang, G. R. Che, Y. Z. Che, C. H. Chen, Chao Chen, G. Chen, H. S. Chen, H. Y. Chen, J. D. Chen, M. L. Chen, S. J. Chen, S. M. Chen, T. Chen, W. Chen, X. R. Chen, X. T. Chen, X. Y. Chen, Y. B. Chen, Y. Q. Chen, Z. K. Chen, J. Cheng, L. N. Cheng, S. K. Choi, X. Chu, G. Cibinetto, F. Cossio, J. Cottee-Meldrum, H. L. Dai, J. P. Dai, X. C. Dai, A. Dbeyssi, R. E. de Boer, D. Dedovich, Z. Y. Deng, A. Denig, I. Denisenko, M. Destefanis, F. De Mori, E. Di Fiore, X. X. Ding, Y. Ding, J. Dong, L. Y. Dong, M. Y. Dong, Z. J. Dong, K. B. Du, M. C. Du, S. X. Du, Shaoxu Du, X. L. Du, Y. Q. Du, C. D. Duan, Z. H. Duan, P. Egorov, G. F. Fan, K. X. Fan, Y. H. Fan, Z. F. Fan, J. Fang, Jin Fang, S. S. Fang, W. X. Fang, L. Fava, F. Feldbauer, G. Felici, C. Q. Feng, J. H. Feng, Q. X. Feng, Y. T. Feng, M. Fritsch, C. D. Fu, J. L. Fu, Y. W. Fu, Xu Gao, Y. Gao, Y. N. Gao, Yunong Gao, Z. Gao, S. Garbolino, I. Garzia, L. Ge, L. Q. Ge, P. T. Ge, C. Geng, A. Gilman, K. Goetzen, J. Gollub, J. B. Gong, J. D. Gong, L. Gong, W. X. Gong, W. Gradl, M. Greco, M. D. Gu, M. H. Gu, C. Y. Guan, S. Y. Guan, A. Q. Guo, H. Guo, J. N. Guo, L. B. Guo, M. J. Guo, R. P. Guo, X. Guo, Y. P. Guo, Z. Guo, A. Guskov, J. Gutierrez, J. Y. Han, T. T. Han, X. Han, F. Hanisch, J. Y. Hao, K. D. Hao, X. Q. Hao, F. A. Harris, C. Z. He, K. K. He, K. L. He, F. H. Heinsius, C. H. Heinz, Y. K. Heng, C. Herold, N. D. Hoffman, P. C. Hong, G. Y. Hou, X. T. Hou, Z. L. Hou, H. M. Hu, J. F. Hu, Q. P. Hu, S. L. Hu, T. Hu, Y. Hu, Y. X. Hu, Z. M. Hu, G. S. Huang, L. Q. Huang, P. Huang, X. T. Huang, Y. P. Huang, Y. S. Huang, T. Hussain, N. Hüsken, N. in der Wiesche, Q. Ji, Q. P. Ji, W. Ji, X. B. Ji, X. L. Ji, Y. Y. Ji, L. K. Jia, S. Jia, X. Q. Jia, D. Jiang, H. B. Jiang, S. J. Jiang, X. S. Jiang, Y. Jiang, J. B. Jiao, Z. Jiao, B. W. Jin, L. C. L. Jin, S. Jin, Y. Jin, M. Q. Jing, X. M. Jing, T. Johansson, S. Kabana, X. L. Kang, X. S. Kang, B. C. Ke, A. Khoukaz, O. B. Kolcu, S. H. Kong, B. Kopf, L. Kröger, L. Krümmel, Y. Y. Kuang, M. Kuessner, X. Kui, N. Kumar, A. Kupsc, W. Kühn, L. Y. Lan, Q. Lan, J. Y. Lee, T. T. Lei, M. Lellmann, T. Lenz, C. Li, C. H. Li, C. J. Li, C. K. Li, Cong Li, D. M. Li, F. Li, G. Li, H. B. Li, H. J. Li, H. N. Li, H. P. Li, Hui Li, J. N. Li, J. W. Li, K. Li, K. L. Li, L. J. Li, L. K. Li, Lei Li, M. H. Li, M. R. Li, M. T. Li, P. L. Li, P. R. Li, Q. M. Li, R. Li, S. X. Li, S. Y. Li, Shanshan Li, T. Li, T. Y. Li, W. D. Li, W. G. Li, X. Li, X. H. Li, X. K. Li, X. L. Li, X. Y. Li, X. Z. Li, Y. H. Li, Y. B. Li, Y. C. Li, Y. G. Li, Y. L. Li, Y. P. Li, Yi Li, Z. H. Li, Z. J. Li, Z. L. Li, Z. X. Li, Z. Y. Li, Zaiyi Li, C. Liang, H. Liang, Y. F. Liang, Y. T. Liang, Z. Z. Liang, G. R. Liao, L. B. Liao, M. H. Liao, Y. P. Liao, J. Libby, A. Limphirat, C. X. Lin, D. X. Lin, T. Lin, B. J. Liu, C. Liu, C. X. Liu, F. Liu, F. H. Liu, Feng Liu, G. M. Liu, H. Liu, H. B. Liu, H. M. Liu, Huihui Liu, J. B. Liu, K. Liu, K. Y. Liu, Ke Liu, Kun Liu, L. Liu, L. C. Liu, Lu Liu, M. H. Liu, P. L. Liu, Q. Liu, S. B. Liu, T. Liu, W. T. Liu, X. Liu, X. K. Liu, X. L. Liu, X. P. Liu, X. T. Liu, X. Y. Liu, Y. Liu, Y. B. Liu, Yi Liu, Z. A. Liu, Z. D. Liu, Z. Q. Liu, Z. X. Liu, Z. Y. Liu, X. C. Lou, H. J. Lu, J. G. Lu, X. L. Lu, Y. Lu, Y. H. Lu, Y. P. Lu, C. L. Luo, J. Q. Luo, J. R. Luo, J. S. Luo, M. X. Luo, Q. Q. Luo, T. Luo, X. L. Luo, XiaoRong Lv, Z. Y. Lv, X. R. Lyu, Y. F. Lyu, Y. H. Lyu, C. L. Ma, F. C. Ma, H. L. Ma, Heng Ma, J. L. Ma, L. L. Ma, Q. M. Ma, R. Q. Ma, T. Ma, X. T. Ma, X. Y. Ma, F. E. Maas, M. Maggiora, S. Maity, S. Malde, L. M. Mansur, Y. J. Mao, Z. P. Mao, S. Marcello, A. Marshall, F. M. Melendi, Z. X. Meng, G. Mezzadri, H. Miao, T. J. Min, T. Mineeva, S. W. Ming, R. E. Mitchell, X. H. Mo, A. F. Mohammed, B. Moses, N. Yu. Muchnoi, J. Muskalla, Y. Nefedov, F. Nerling, H. Neuwirth, Z. Ning, S. Nisar, Q. L. Niu, W. D. Niu, Y. Niu, C. Normand, S. L. Olsen, Q. Ouyang, I. V. Ovtin, S. Pacetti, X. Pan, Y. Pan, C. Y. Pang, A. Pathak, Y. P. Pei, Y. Y. Pei, M. Pelizaeus, G. L. Peng, H. P. Peng, X. J. Peng, Y. Y. Peng, K. Peters, K. Petridis, J. L. Ping, R. G. Ping, S. Plura, S. Polikarpov, V. Prasad, L. Pöpping, F. Z. Qi, H. R. Qi, L. Y. Qian, S. Qian, W. B. Qian, C. F. Qiao, J. H. Qiao, J. J. Qin, J. L. Qin, L. Q. Qin, L. Y. Qin, P. B. Qin, X. P. Qin, X. S. Qin, Z. H. Qin, J. F. Qiu, J. Rademacker, K. Ravindran, C. F. Redmer, Y. Ren, A. Rivetti, M. Rolo, G. Rong, S. S. Rong, F. Rosini, Ch. Rosner, M. Q. Ruan, W. R. Ruangyoo, N. Salone, A. Sarantsev, Y. Schelhaas, M. Schernau, K. Schoenning, M. Scodeggio, Jian Shan, W. Shan, X. Y. Shan, Z. J. Shang, J. F. Shangguan, L. G. Shao, M. Shao, C. P. Shen, H. F. Shen, W. H. Shen, X. Y. Shen, B. A. Shi, Ch. Y. Shi, H. Shi, J. L. Shi, J. Y. Shi, S. Shi, X. Shi, X. D. Shi, H. L. Song, J. J. Song, M. H. Song, T. Z. Song, W. M. Song, Y. Song, Y. X. Song, Zirong Song, S. Sosio, S. Spataro, S. Stansilaus, F. Stieler, M. Stolte, J. L. Su, S. S Su, G. B. Sun, G. X. Sun, H. Sun, H. K. Sun, J. F. Sun, K. Sun, L. Sun, R. Sun, S. S. Sun, W. Y. Sun, Y. C. Sun, Y. J. Sun, Y. S. Sun, Y. Z. Sun, Z. Q. Sun, Z. T. Sun, H. Tabaharizato, N. T. Tagsinsit, C. J. Tang, G. Y. Tang, H. Y. Tang, J. Tang, J. J. Tang, L. F. Tang, Y. A. Tang, Z. H. Tang, L. Y. Tao, M. Tat, J. X. Teng, J. Y. Tian, W. H. Tian, Y. Tian, K. Yu. Todyshev, I. Uman, E. van der Smagt, S. W. Wan, X. Wan, B. Wang, B. Q. Wang, Bin Wang, Bo Wang, C. Wang, C. L. Wang, Cong Wang, D. Y. Wang, F. K. Wang, H. J. Wang, H. R. Wang, J. Wang, J. H. Wang, J. J. Wang, J. P. Wang, K. Wang, L. L. Wang, M. Wang, Mi Wang, N. Y. Wang, S. Wang, Shun Wang, W. Wang, W. P. Wang, X. F. Wang, X. L. Wang, X. N. Wang, Xin Wang, Y. Wang, Y.-K. Wang, Y. D. Wang, Y. F. Wang, Y. H. Wang, Y. J. Wang, Y. L. Wang, Yanning Wang, Yaqian Wang, Yi Wang, Yuan Wang, Z. Wang, Z. L. Wang, Z. Q. Wang, Z. Y. Wang, Zhi Wang, D. Wei, D. H. Wei, D. J. Wei, H. R. Wei, F. Weidner, H. R. Wen, S. P. Wen, U. Wiedner, G. Wilkinson, J. F. Wu, L. H. Wu, L. J. Wu, S. G. Wu, S. M. Wu, X. W. Wu, Y. C. Wu, Z. Wu, H. L. Xia, L. Xia, B. H. Xiang, D. Xiao, G. Y. Xiao, H. Xiao, Y. L. Xiao, Z. J. Xiao, C. Xie, K. J. Xie, Y. Xie, Y. Xie, Y. G. Xie, Y. H. Xie, Z. P. Xie, T. Y. Xing, G. F. Xu, H. Y. Xu, Q. J. Xu, Q. N. Xu, X. P. Xu, Y. Xu, Y. C. Xu, Z. S. Xu, F. Yan, J. Z. Yan, L. Yan, W. B. Yan, W. C. Yan, W. H. Yan, X. Q. Yan, Y. Y. Yan, H. J. Yang, H. L. Yang, H. X. Yang, J. H. Yang, L. Y. Yang, N. Yang, R. J. Yang, X. Y. Yang, Y. Yang, Y. G. Yang, Y. H. Yang, Y. Q. Yang, Y. Z. Yang, Z. B. Yang, Z. W. Yang, W. J. Yao, Z. P. Yao, M. Ye, M. H. Ye, M. Y. Ye, Z. J. Ye, H. L. Yi, K. Yi, Junhao Yin, Qiqin Yin, X. Y. Yin, Z. Y. You, B. X. Yu, C. X. Yu, G. Yu, J. S. Yu, L. W. Yu, T. Yu, X. D. Yu, Yongchao Yu, C. Z. Yuan, H. Yuan, J. Yuan, Jie Yuan, L. Yuan, M. K. Yuan, S. H. Yuan, Y. Yuan, Z. Y. Yuan, C. X. Yue, Ying Yue, A. A. Zafar, F. R. Zeng, S. H. Zeng, Xin Zeng, Y. J. Zeng, Yujie Zeng, M. Z. Zhai, Y. C. Zhai, Y. H. Zhan, B. L. Zhang, B. R. Zhang, D. H. Zhang, G. Y. Zhang, Gengyuan Zhang, H. C. Zhang, H. H. Zhang, H. L. Zhang, H. Q. Zhang, H. R. Zhang, H. Y. Zhang, H. Z. Zhang, Han Zhang, J. Zhang, J. J. Zhang, J. L. Zhang, J. Q. Zhang, J. W. Zhang, J. Y. Zhang, J. Z. Zhang, Jianyu Zhang, Jiawen Zhang, Jin Zhang, Jiyuan Zhang, L. M. Zhang, Lei Zhang, N. Zhang, P. Zhang, Q. Y. Zhang, Q. Z. Zhang, R. Y. Zhang, Rui Zhang, S. H. Zhang, S. N. Zhang, Shulei Zhang, W.-C. Zhang, X. M. Zhang, X. Y. Zhang, Y. T. Zhang, Y. H. Zhang, Y. P. Zhang, Y. X. Zhang, Yao Zhang, Yu Zhang, Yu Zhang, Yu Zhang, Z. Zhang, Z. D. Zhang, Z. H. Zhang, Z. R. Zhang, Z. Y. Zhang, Zh. Zh. Zhang, Zhaoke Zhang, Zhilong Zhang, Ziyang Zhang, Ziyu Zhang, P. Zhang, G. Zhao, J.-P. Zhao, J. Y. Zhao, J. Z. Zhao, L. Zhao, Lei Zhao, M. G. Zhao, R. P. Zhao, Y. B. Zhao, Y. L. Zhao, Y. P. Zhao, Y. X. Zhao, Z. G. Zhao, A. Zhemchugov, B. Zheng, B. M. Zheng, J. P. Zheng, W. J. Zheng, W. Q. Zheng, X. R. Zheng, Y. H. Zheng, B. Zhong, C. Zhong, X. Zhong, H. Zhou, J. Q. Zhou, S. Zhou, X. Zhou, X. K. Zhou, X. R. Zhou, X. Y. Zhou, Y. X. Zhou, Y. Z. Zhou, A. N. Zhu, J. Zhu, J. J. Zhu, K. Zhu, K. J. Zhu, K. S. Zhu, Lin Zhu, S. H. Zhu, T. J. Zhu, W. D. Zhu, W. J. Zhu, W. Z. Zhu, Y. C. Zhu, Z. A. Zhu, X. Y. Zhuang, M. Zhuge, J. H. Zou, J. Zu

Computer Vision

Tracking-by-detection in Multi-object Tracking: Survey and Experiments

Multi-object tracking (MOT) is an essential computer vision task that simultaneously tracks multiple objects in video sequences, with various applications in surveillance, autonomous navigation, and human-computer interaction. The tracking-by-detection (TBD) paradigm, which combines object detection with temporal association, has emerged as a leading approach, driven by innovative algorithms. Despite recent progress, fair evaluation of TBD-based methods remains a challenge. Many studies introduce modules such as similarity metrics, data association strategies, or motion models, but they are often evaluated under inconsistent protocols, with different baseline trackers, hyperparameters, and datasets. Such inconsistencies obscure the genuine contribution of each module and hinder objective comparison. This survey systematically reviews TBD-based MOT techniques, including similarity measurements, data association, camera motion compensation, and interpolation strategies. Starting from a minimal baseline tracker, we fairly evaluate the contributions of each method across diverse datasets and accumulate well-balanced methods. Our findings establish a strong baseline tracker and provide a foundation for the principled design of robust and versatile MOT systems suitable for real-world deployment.
Read the full abstract

All authors Yujin Yang, Kyujin Shim, Kangwook Ko, Changick Kim

Astrophysics of Galaxies

AEON-z5: A Candidate AGN-driven Outflow Enriching the Circumgalactic Medium at $z\simeq5.23$

The dispersal of chemically enriched gas from galaxies into their surroundings is a key process in galaxy evolution, yet direct observational evidence at z>5 remains scarce. We present AEON-z5, a galaxy at z~5.23 in the COSMOS field comprising a compact continuum-emitting core surrounded by an extended, line-dominated ionized nebula. JWST/NIRCam imaging shows that H$\alpha$+[N II] and H$\beta$+[O III] emission extends to projected radii of >4 kpc - 2-2.5 times the typical effective radius at the host stellar mass - reaching the outer ISM and the inner CGM. F444W grism data reveal a highly asymmetric H$\alpha$+[N II] profile, which we interpret as a bipolar outflow and decompose into three kinematic components. The dominant component has a flux-weighted velocity offset of ~+489 km/s and FWHM~630 km/s, with a wing reaching $v_{84}$~792 km/s. A tentative detached feature at $\Delta v_{LOS}$~2800 km/s, detected at 1.5$\sigma$ in the 1D spectrum (2.4$\sigma$ in the 2D fit), may trace an outflow clump. These kinematics are most coherently explained by an AGN in the core. For the extended nebula, we derive a velocity curve shifting redward with radius, reaching 200-400 km/s at $r_p$~1.3-2.5 kpc - a trend that may reflect an accelerating outflow, corotating gas, or recycled inflow viewed in projection. Crucially, the measured [N II]/H$\alpha$ ratios imply near-solar N2-based abundances (0.7-1.0 $Z_\odot$), remaining >0.37 $Z_\odot$ after allowing for AGN excitation and calibration systematics. The combination of large extent, enrichment, and extreme kinematics identifies AEON-z5 as a candidate snapshot of feedback-driven metal transport, offering a direct view of how early AGN activity may redistribute chemically processed gas into the CGM within the first ~1.1 billion years.
Read the full abstract

All authors Xiaoyang Wei, Zheng Cai, Shiwu Zhang, Fujiang Yu, Yunjing Wu, Shuaiyi Li, Xiaojing Lin, Mingyu Li, Xuelun Mei

Number Theory

Todd's relation conjecture and binary relations for multiple zeta values in positive characteristic

We prove Todd's relation conjecture: all $\mathbb{F}_q(\theta)$-linear relations of Thakur's multiple zeta values are generated from the fundamental binary relation by the operators $\mathcal{B}^{\mathrm{S}}$, $\mathcal{C}^{\mathrm{S}}$, $\mathcal{B}^{\mathrm{S}}\circ \mathcal{C}^{\mathrm{S}}$; moreover they are also generated by $\mathcal{B}^{\ast\mathrm{S}}$, $\mathcal{C}^{\mathrm{S}}$, $\mathcal{B}^{\ast\mathrm{S}}\circ\mathcal{C}^{\mathrm{S}}$. The $\mathcal{B}^{\ast\mathrm{S}}$-part of this conjecture has been proved by Chang, Chen and Mishiba. We prove the whole conjecture for Carlitz multiple polylogarithm values, which implies the $\mathcal{B}^{\mathrm{S}}$-part for multiple zeta values. We also determine all fixed relations and binary relations. Let $\mathfrak{BR}^{\mathrm{S}}_w$ be the $\mathbb{F}_q(\theta)$-linear space spanned by binary relations of weight $w$, and let $\operatorname{Fix}^{\mathrm{S}}_w$ be the $\mathbb{F}_q(\theta)$-linear space spanned by fixed relations. We derive generating functions $\sum_{w\ge 1}\bigl(\dim_{\mathbb{F}_q(\theta)}\operatorname{Fix}^{\mathrm{S}}_w\bigr)x^w=\frac{x^{q+1}(1-x)}{(1-2x)(1-2x+x^{q+1})}$ and $\sum_{w\ge 1}\bigl(\dim_{\mathbb{F}_q(\theta)}\mathfrak{BR}^{\mathrm{S}}_w\bigr)x^w=\frac{x^q(1-x)}{(1-2x)(1-2x+x^{q+1})}.$ Our results are based on the recent work of Im-Kim-Ngo Dac on the $\mathbb{F}_q$-linear relations of Thakur's multiple zeta values, and a system of transfer theorems between multiple zeta values and multiple polylogarithm values.
Read the full abstract

Strongly Correlated Electrons

Kane-Lubensky phonons in Maxwell lattice frustrated Mott insulators

We show that zero-energy gapless Weyl-line phonons of the Kane-Lubensky's type can arise in the three-dimensional Maxwell lattice frustrated Mott insulators through the magnetopological mechanics. In a pyrochlore antiferromagnet with the spin-lattice coupling, a magnetic field selects the spin state whose lattice distortion generates a $P4_3 32$ topological lattice. More crucially, the spin-lattice coupling and the spin configuration cause the bending of the neighbouring bonds, and converts the system into the topological Maxwell lattice. Remarkably, the resulting system is found to host the bulk zero-frequency Weyl-line phonons protected topologically, and these gapless phonons are not Goldstone modes. Unlike the conventional ${C_{\rm ph}\sim T^3}$ for the Goldstone phonons, these one-dimensional zero-mode manifolds yield a characteristic low-temperature phonon specific heat ${C_{\rm ph}\sim T^2}$. Our results could find applications in the Cr-based spinel systems, and moreover, we establish a low-energy platform where an extensive number of topological zero-frequency phonons can strongly couple to other degrees of freedom, opening a route to exotic phonon-mediated phenomena.
Read the full abstract

Atomic Physics

Nuclear slowing-down factors in alkali-metal vapors

Nuclear slowing-down factors account for the sharing of angular momentum between the electron and the nucleus in the effective Bloch description of alkali-metal spin dynamics in the spin-exchange-relaxation-free (SERF) regime. For collinear optical pumping and magnetic field, we find that longitudinal and transverse spin dynamics are characterized by different polarization-dependent slowing-down factors. Transverse dynamics are governed by the conventional factor $q(p)$, with $p$ the electron spin polarization, whereas longitudinal relaxation is governed by $q(p)+p\,dq(p)/dp$. The two factors coincide at zero polarization but differ substantially at high polarization, where the single-factor description overestimates the underlying pumping and relaxation rates inferred from longitudinal transients by factors approaching two to four, depending on the nuclear spin. We further derive closed-form expressions, valid at arbitrary polarization, for the residual spin-exchange relaxation of the transverse spin components at finite magnetic field along the pumping axis. This contribution is quadratic in the magnetic field and can become comparable to the zero-field linewidth at fields well within the SERF regime. The results are obtained by perturbation theory on the density-matrix dynamics linearized around the stationary state and are verified by numerical solutions of the microscopic density-matrix equation. These findings refine the effective Bloch description of alkali-metal spin dynamics and are directly relevant to atomic magnetometers and alkali-metal–noble-gas comagnetometers, including those used in precision searches for physics beyond the Standard Model.
Read the full abstract