Peer Revenue Publish or profit

Papers

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

All of arXiv

Thursday 3 September

Computation and Language

Fixed Suffix Dependency Ratio: Quantifying the Dual-Track Mechanism of Gender Assignment in Latvian Loanwords

Existing research has repeatedly observed the tendency for English loanwords to cluster in the masculine gender across different recipient languages, yet the origin of this pattern remains difficult to determine, as fixed morphological rules and default assignments are frequently analysed together. This study proposes the Fixed Suffix Dependency Ratio (FSDR) to quantify the degree of reliance on fixed derivational suffixes across different genders, and to distinguish between morphological anchoring and free-choice in distribution. By examining 1,832 Latvian noun lemma types, the results reveal a significant FSDR asymmetry within the loanword system: feminine loanwords rely significantly more on fixed derivational suffixes, while masculine loanwords are more concentrated in the free-choice zone. This pattern exhibits loanword specificity and has become more pronounced in contemporary usage. FSDR therefore provides a quantitative framework for testing default gender and shows how masculine default can be activated and reinforced under language contact.
Read the full abstract

Systems and Control

Quantifying Power to Voltage and Frequency Dynamics for Oscillation Propagation Assessment

The integration of Inverter-Based Resources (IBRs) into power systems introduces multi-timescale dynamics and oscillations which may propagate to distant areas and endanger the safe system operation. These oscillations pose a significant challenge as their source, frequency, and propagation pathways are often challenging to identify in large interconnected systems, comprising numerous synchronous machines and IBRs. For the above reasons, analytical tools that identify the sensitivity of the system to oscillations within a large frequency spectrum, affecting both voltage and frequency variables across various network locations, are of interest. This paper addresses this topic by introducing a frequency-domain framework based on linear analysis, which characterizes the sensitivity to oscillations of each network bus voltage and of each generation unit frequency. Within this framework, two quantitative indicators are proposed, namely the Frequency Sensitivity Index (FSI) and Voltage Sensitivity Index (VSI). These indexes are derived analytically from the transfer functions which relate the active and reactive power injections to each bus with the voltage and frequency variables across the network, derived from the linear Electromagnetic Transient (EMT) power system model. The proposed indices quantify the sensitivity of the system to oscillations of different type and frequency, providing insights for both oscillation detection and propagation analysis. The methodology is applied to a case study based on the modified IEEE 68-bus benchmark system under partial and full IBR penetration, while its accuracy is validated through EMT time-domain simulations using linear and nonlinear models developed in Matlab/Simulink environment.
Read the full abstract

All authors Onur Alican, Dionysios Moutevelis, Marc Cheah-Mañe, Oriol Gomis-Bellmunt, Eduardo Prieto-Araujo

Quantum Physics

Approximate maximum-likelihood decoding via truncated free energies

Maximum-likelihood decoding (MLD) achieves the minimum logical error rate of stabilizer codes under known i.i.d. Pauli noise, but its exact evaluation is \#P-hard. Practical pipelines therefore approximate MLD by minimum-weight decoding (MWD), retaining only the lowest-weight recovery per syndrome and discarding the coset degeneracy. The minimum-weight search is in turn implemented by stochastic solvers. We introduce approximate maximum-likelihood decoding (AMLD), a black-box framework that recycles the candidate samples discarded by stochastic inner decoders into a per-class truncated free-energy estimator. For every logical class represented in the candidate pool, the estimator is provably bounded below by the exact free energy and above by the empirical minimum weight. AMLD returns the logical class minimizing the estimated free energy with linear classical overhead. In SA-based Ising-decoder benchmarks, AMLD closes up to $83\%$ of the MWD–MLD threshold gap across the toric and color codes under bit-flip and depolarizing noise. The largest threshold improvement, from $17.28\%$ to $18.62\%$, occurs on the $6.6.6$ color code under depolarizing noise. We further demonstrate AMLD on the $[[144,12,12]]$ bivariate-bicycle code, whose bit-flip decoding problem has a hypergraph structure. This application requires neither matching-based enumeration nor code-specific tensor-network contraction. At $p=0.05$, AMLD reduces the logical error rate by $13\%$ relative to MWD evaluated on the same BP-OSD candidate pool.
Read the full abstract

All authors Yuanqi Liu, Weilei Zeng, Junjie Wu, Lingling Lao

Robotics

Toward Unified Robot Learning: Bridging Representation, Vision-Language-Action, and World Models

For robots to operate reliably in real-world environments, they need to perceive their surroundings, act, and reason about the consequences of those actions. Rapid progress in the domains of representation learning, VLA models, and world models has significantly enhanced the capabilities of robot learning systems, enabling robots to work in increasingly complex environments. However, these paradigms are typically developed in isolation, resulting in fragmented systems that struggle with generalization, long-horizon temporal reasoning and planning, and deployment in unstructured environments. In this survey, we present a unified perspective on robot learning by organizing the existing methods along three complementary axes: understanding through representation learning, acting through VLA models, and reasoning through world models. We introduce a structured taxonomy that captures key design choices in environment representation, policy learning, and predictive modeling, and summarize the recent progress in these domains. Beyond classifying the existing works, we analyze how these components interact, discuss common limitations, and highlight emerging trends towards more integrated systems. Through this lens, we identify the challenges in the domain of robot learning, including uncertainty quantification, out-of-distribution generalization, cross-embodiment transfer, long-context understanding, and long-horizon planning. We argue that these challenges arise not only from limitations within individual components but also from the lack of integration across perception, action, and reasoning. Building on this analysis, we outline future directions towards unified, physically grounded, and probabilistic robot learning to develop robust robotic systems that maintain consistent internal representations and support decision making over extended interactions in real-world environments.
Read the full abstract

All authors Shaunak A. Mehta, Ananya Hazarika, Haochen Zhang, Fan Yang, Ryo Moriyama, Wenkai Li, Yash Patel, Kanata Suzuki

Number Theory

Overcolored Partition $k$-tuples Restricted by Parity of the Parts

In this paper, we study the combinatorial object $\bar{b}^k_{r,s}(n)$ which counts the colored overpartition $k$-tuples wherein both even and odd parts occurs with $r$ and $s$ colors, respectively. We establish several congruences which extends the results of Chacon and Sellers for infinite families of $r,s$ and $k$. In particular, we prove divisibility properties for $\bar{b}^k_{r,s}(n)$ modulo prime $p$ and derive new congruences modulo powers of $2$. The techniques involved to obtain our results rely on theta function identities and modular forms.
Read the full abstract

Quantum Physics

Ultra-Precise Quantum Projective Designs in Constant Depth

Random quantum objects are powerful resources for quantum information processing, yet exact Haar randomness is costly and typically unnecessary. We introduce an explicit sparse commuting circuit ensemble on $n$ qubits that reproduces low-order Haar moments in the stringent relative-error sense. The circuit consists of a sparse Clifford phase layer followed by independent single-qubit Clifford gates. Acting on a simple product state, the resulting ensemble forms $\epsilon$-approximate projective $2$- and $3$-designs in relative error, with the required logarithmic interaction degree being asymptotically optimal within this circuit family. It admits an ancilla-free implementation of quantum depth $O(\log(n/\epsilon))$ on an all-to-all architecture, as well as an adaptive constant-depth implementation—in fact, depth seven—using $O(n\log(n/\epsilon))$ ancilla qubits. Departing from existing shallow-design paradigms, our analysis exploits the intrinsic moment structure of commuting phase circuits; at third order, this requires a new block decomposition and combinatorial analysis that also suggests a route toward higher-order shallow designs. Our results show that precise Haar-like statistics can emerge from sparse commuting dynamics with remarkably low quantum resources, with applications to randomized characterization, quantum metrology, quantum algorithms, and many-body physics.
Read the full abstract

All authors Qingyue Zhang, Junjie Chen, Zhou You, You Zhou

Probability

Beyond normal fluctuations in local laws for Wigner matrices

We identify non-Gaussian corrections to the central limit theorem for the global and local laws, i.e. for Stieltjes transform of the empirical eigenvalue distribution of a large real symmetric or complex Hermitian Wigner matrix. We find that in the real case the rate of convergence in this CLT is substantially slower than in the complex case. For the proofs, we develop new static and dynamic hierarchies of extended cumulants up to any order that can be analyzed by a refinement of the zigzag strategy.
Read the full abstract

Artificial Intelligence

Speak for Me: Giving LLMs the Situational Awareness to Participate in a Meeting

In online meeting delegation, LLM agents fail to recognize when to speak. With no structured way to track stances, coverage, and floor, they miss the moments where they should contribute. Prompt-only delegates stay silent on 51.4% of the absent participant's talking opportunities on the AMI corpus. We present CAPA (Collaborative Agent Predictive Architecture), an architecture for online meeting delegation. A Perceiver updates the meeting state from each observed turn. A Predictor forecasts how the conversation will continue. A Controller decides whether to speak and which proposition to surface. A Generator phrases the chosen contribution in the participant's style. Two judges score the forecast and the action against the next observed turn. A Recalibrator updates the meeting state from those verdicts for future decisions. To evaluate online delegation, we introduce an episode-level protocol that scores whether, when, and what a delegate contributes around the participant's actual idea units. The protocol's schema-constrained LLM judges align with human annotations at Cohen's kappa = 0.71. On 137 AMI meetings, CAPA reduces the silence rate from 51.4% to 2.5%, doubles credited recovery (26.1 –> 52.2), and keeps hallucination at 0.6%. The failure mode shifts from omission to selection, with each residual near-miss attributable to a specific module of the architecture. Mechanism ablations identify the meeting state as the lever that closes the recognition gap, where raw-context scaling alone does not.
Read the full abstract

All authors Muneeb Khan, Frederic Kirstein, Terry Ruas, Bela Gipp

Computational Engineering

sp-DBA: a general framework for adaptive transform-domain computation

Transform-domain methods simplify analysis and computation, making them central to scientific computing and signal processing. However, existing adaptive strategies often introduce new data structures or require substantial workflow redesign, limiting efficient execution on massively parallel hardware. Here we present spectral dynamic block activation (sp-DBA), an adaptive acceleration framework for transform-domain workflows. sp-DBA dynamically activates transform-domain computation blocks as a calculation evolves, concentrating computation where it is needed while retaining numerical accuracy and optimized transform operations. Across representative workflows in materials science, biology, and optical communications, the demonstrated implementations achieve speedups of up to 28.1-fold for transform-domain updates and up to 8.4-fold overall acceleration; strong- and weak-scaling tests on up to eight GPUs show that the local adaptive update remains effective within distributed FFT workflows. By introducing execution-level adaptivity into mature transform-domain workflows without rebuilding existing solvers, sp-DBA extends the scale, duration, and complexity of scientific simulations and signal-processing calculations on modern parallel systems.
Read the full abstract

Systems and Control

Data-Based Clustering and Control of Similar Biological Systems

Cybergenetic control of gene expression enables applications in synthetic biology, drug development, and biomanufacturing. Microfluidic platforms allow the parallel control of large cell populations. However, the resulting computational burden and intrinsic biological heterogeneity limit the scalability of conventional control strategies. In this work, we propose a similarity-based framework to reduce the computational requirement of controlling large numbers of dynamical systems. Building on existing data-driven methods for quantifying control-relevant similarity from input-output data, we cluster systems with similar dynamics without requiring explicit system identification. Based on this grouping, we develop a hierarchical leader-follower control architecture, where a single controller is designed for each cluster and applied to all members. This significantly reduces the number of control problems that need to be solved. Furthermore, we analyse the closed-loop behaviour within clusters and develop data-driven conditions under which the clustered closed-loop systems remain well-posed. The proposed approach is demonstrated in simulations of gene expression dynamics, showing that similarity-based grouping enables scalable and reliable control of heterogeneous biological systems.
Read the full abstract

Artificial Intelligence

Value-Preserving Architectures for Agentic AI Systems

The emergence of agentic AI and LLM-based multi-agent systems (MAS) presents unprecedented opportunities for automating complex tasks, while simultaneously raising critical concerns about the preservation of fundamental human-centered values, such as privacy, fairness, and safety. Although software engineering has traditionally focused on functional correctness, the adoption of LLMs and AI agents into complex socio-technical systems has intensified the need for responsible software engineering and robust value alignment. In MAS, architectural design decisions, such as coordination mechanisms, communication protocols, and system topologies, play a central role in shaping system behavior and the outcomes they produce. This paper argues that architectural choices influence not only the functionality and performance of MAS but can also promote value-oriented system behavior. Therefore, we investigate how different architectural designs support different human-centered values, discussing the following value-preserving architectural patterns: (i) a privacy-aware architecture with a federated topology, (ii) a distributed architecture to promote pluralism and diversity, and (iii) a guard-agent architecture to detect and mitigate unfairness. Finally, we introduce representative use cases to illustrate the proposed architectures in real-world scenarios. By linking architectural design with human-centered values, this work lays the foundation for a unified set of architectural patterns and guidelines towards the design of trustworthy MAS.
Read the full abstract

All authors Alessandro Pesare, Tommaso Dolci, Katja Hose, Emanuel Sallinger

Computer Vision

OctWorld: Long-Range World-Consistent Video Generation with Octree-Based 3D Mapping

We present OctWorld, a video diffusion framework with persistent 3D memory for generating explorable, world-consistent, and high-fidelity visual scenes. Given a single image, OctWorld performs stable autoregressive world generation along user-specified camera trajectories. We focus on long-range generation, characterized by extended camera paths and wide viewpoint coverage, where preserving spatial consistency is particularly challenging when previously generated regions are revisited. To address this problem, we introduce OctMap, an extensible and spatially adaptive 3D memory that progressively fuses generated visual observations and their corresponding depth maps into a global representation. OctMap employs TSDF fusion within a dynamic sparse octree whose spatial resolution adapts to image evidence. This design preserves geometric and appearance details across diverse scene scales while maintaining low memory overhead. Experiments demonstrate that OctWorld generates long-range, spatially consistent videos and outperforms prior methods on both existing benchmarks and challenging long-range generation settings. OctMap also provides clear advantages over point-based caches and fixed-resolution TSDF volumes. Project page: https://github.com/microsoft/OctWorld
Read the full abstract

All authors Zelong Lv, Sicheng Xu, Jianfeng Xiang, Ruicheng Wang, Yue Dong, Yu Deng, Guangzhong Sun, Jiaolong Yang

Human-Computer Interaction

Grounding GUI Design in Computational Psychology

Creating visually appealing user interfaces often requires extensive manual iteration. We propose an approach that applies answer set programming (ASP) to automatically generate and optimize UI layouts while satisfying design objectives such as grid alignment, grouping, color harmony, and whitespace, along with designer-specified preferences. Our method encodes constraints on element properties and relative positioning, producing layouts that balance functional and aesthetic goals. We evaluate this approach in three studies. Across two user studies, participants rated layouts generated with the full ASP model higher than both random designs and those based on simple heuristics. Designers reported that ASP-generated layouts supported early-stage sketching and exploration.
Read the full abstract

All authors Xianni Wang, Javier Romero Davila, Saku Sourulahti, Torsten Schaub, Jussi P. P. Jokinen

Human-Computer Interaction

From Misconceptions to Evidence: What Science Teachers Make Visible When Co-Designing Agentic Learning Apps

Science educators increasingly encounter AI tools that generate content, yet disciplinary teaching depends on eliciting learners' models, diagnosing misconceptions, interpreting evidence, and preserving professional judgment. This study asks how science teachers translate such epistemic work into specifications for agentic learning applications. It contributes to the conference theme, "Innovating Pedagogies, Inspiring Minds: Transforming Science Learning," and the Teachers' Professional Learning strand by examining app co-design as a form of pedagogical reasoning. We conducted a bounded qualitative cross-case analysis of four de-identified artifacts produced in a teacher professional-learning workshop: an experimental-design diagnostic, a Kinetic Particle Theory dialogue guide, a chemistry prior-knowledge checker, and a physics application/scaffolding tool. Each artifact was coded for the disciplinary problem, learner interaction, evidence made visible, teacher authority, and safeguard. All four connected a science-learning problem to an interaction and pedagogically interpretable evidence: misconceptions and gaps, explanations-in-progress, class-level readiness patterns, or investigation performance. However, only two made teacher control or evaluation explicit, and only two named a safeguard. The proposals therefore positioned AI less as an answer generator than as an elicitor, scaffold, and evidence-return mechanism, while leaving decision rights and protections unevenly specified. We argue that teacher professional learning should treat AI app ideation as epistemic specification work. A five-question design protocol–problem, learner interaction, evidence, teacher authority, and safeguard–can help teachers transform science-learning needs into accountable human-AI arrangements before building or adopting a tool.
Read the full abstract

All authors Nizam Kadir, Wei Ting Liow, Sumbul Khan, Lay Kee Ang

2609.03917 · 3 Sep · 10 pages, 1 figure, 2 tables. Working paper. A related abstract with the same title was accepted for a 25-minute oral presentation followed by 10 minutes of Q&A at the 8th Singapore International Science Teachers' Conference (SISTC 2026), Science Centre Singapore, 24-26 November 2026. The full manuscript has not been peer reviewed or accepted for conference proceedings

Analysis of PDEs

A Halfspace Theorem for Global Anisotropic Perimeter Minimizers

We prove an arbitrary-dimensional halfspace theorem for global minimizers of a smooth uniformly elliptic anisotropic perimeter: if the nonempty boundary of a minimizing set is contained in a halfspace, then the set itself is a halfspace. No evenness of the integrand or regularity of the minimizing boundary is assumed. The proof combines wall contact with a plane-peeling argument for the complementary phase defect and a simultaneous second blow-down. We also give a direct, self-contained exterior-barrier proof of the two-dimensional stationary anisotropic statement. Its rigidity conclusion is already covered by Bergner's earlier halfspace theorem; the proof is retained because it works directly with the anisotropic Euler-Lagrange operator.
Read the full abstract

Computation and Language

RuleMem: Active Rule Memory for Long-Term Conversational Agents

Question answering agents in long-term conversations must reason over massive, temporally dispersed dialogue histories. However, existing memory mechanisms primarily treat past information as passively stored facts, leading to semantic gaps and unreliable reasoning. To address this limitation, we propose RuleMem, a rule-based memory framework that induces reusable logical rules from historical interactions to actively guide both evidence retrieval and reasoning. Specifically, RuleMem constructs natural-language Horn clauses from conversations and validates them via a Rule Perplexity Consistency (RPC) mechanism. These induced rules enable the retrieval of semantically distant evidence while providing an explicit logical structure for answer generation. We conducted a comprehensive evaluation of RuleMem on two long-term conversational benchmarks, LoCoMo and LongMemEval_s*. In a rigorous comparison against 14 baselines on LoCoMo, RuleMem achieved the highest accuracy, exceeding the baseline average by 27.47 points (a 54.3% relative improvement).
Read the full abstract

All authors Xingyuan Zeng, Zuohan Wu, Quanming Yao, Yue Wang, Wei Liu, Libin Zheng, Jiuke Wang, Jian Yin

Nuclear Experiment

Neutron dynamics in the fusion of neutron-rich O ions with $^{12}$C

The fusion excitation function for $^{21}$O + $^{12}$C was measured for the first time and compared to the fusion of less neutron-rich isotopes. The impact of valence neutrons in the d$_{5/2}$ shell on the fusion excitation function is examined. The experimental data manifest a clear dependence of the extracted barrier height, V$_B$, and barrier position, R$_B$ on neutron excess. To assess the role of dynamics the experimental data are compared with both density constrained frozen Hartree Fock (DCFHF) and density constrained time-dependent Hartree Fock (DCTDHF) theories.
Read the full abstract

All authors A. Leon, H. Desilets, Rohit Kumar, J. Samol, Z. Berend, R.T. deSouza, C. Ciampi, D. Ackermann, A. Chbihi, M. Basson, S. Brown, K.W. Brown, J. Cory, G. Flores, C.E. McCormick, V. Zerbach, C. Dembski, P.D.O'Malley, W.W. von Seeger, K.Godbey, A.S. Umar

Soft Condensed Matter

Electromechanical Domain Wall Propagation in Dielectric Elastomers: An Exact Geometric Resolution via Conformal Mapping

The localized electromechanical phase transition in dielectric elastomers involves complex moving boundaries and severe electrostatic fringe fields driven by high-curvature interfaces. Traditional phenomenological models fundamentally underestimate the configurational forces by completely ignoring the in-plane electric field components and geometric singularities. Here, we present a asymptotically exact geometric framework to resolve the domain wall propagation. By mapping the highly deformed current configuration to a regular parametric strip via conformal mapping, the field singularities are algebraically eliminated. An exact integration by parts directly translates the higher-order geometric metric into a rigorous topological mass term, projecting the global conformal electrostatics into a non-linear $\sigma$-model Lagrangian density. Incorporating the Gent strain-stiffening model, the continuous translation symmetry yields a Hamiltonian first integral. Eigenvalue analysis and Bogomol'nyi-Prasad-Sommerfield (BPS) bound calculations prove that the domain wall emerges strictly as an asymmetric heteroclinic orbit connecting two saddle points. This geometric resolution provides exact analytical scalings for the localized interface energy, domain wall thickness, and asymptotic decay lengths, eliminating all phenomenological parameters and offering a deterministic paradigm for geometric instabilities in active soft matter.
Read the full abstract

Artificial Intelligence

Lose the Order, Keep the Hierarchy: Deordering HTN Plans

Hierarchical Task Network (HTN) planning is a powerful planning formalism based on task decomposition. Although most of the literature studied plan generation, comparatively less attention has been paid to post-plan optimization. In particular, plan deordering has been extensively studied in classical planning but remains under-researched in the HTN setting. Plan deordering removes unnecessary ordering constraints between actions in a plan whilst keeping the plan valid. In this paper, we adapt two established plan deordering techniques from classical planning by extending the techniques to account for hierarchical decomposition constraints. We evaluate our proposed approaches on the IPC 2023 Partial-Order HTN benchmarks and we compare them against Optiplan, an HTN planner that generates partially ordered plans directly. Our results show a substantial reduction in number of ordering constraints in both our implementations. Although we also observe a reduction in critical path length, the improvements are less pronounced.
Read the full abstract

All authors Takudzwa Togarepi, Gaspard Quenard, Damien Pellier, Humbert Fiorino

Group Theory

On second maximal subgroups of finite groups

A second maximal subgroup of a finite group $G$ is a subgroup $H$ that is maximal in every maximal overgroup of $H$ in $G$. We prove that every maximal subgroup of a prime-index subgroup of a finite group is a second maximal subgroup.

Quantum Physics

Spin-to-polarization mapping with a coherent quantum dot-cavity receiver

Coherent light-matter interfaces controllably modifying the state of a photon upon interaction with a stationary qubit are a key resource for implementing deterministic entangling gates for optical quantum technologies. This requires a one-to-one mapping between the state of the scattered photon and that of the embedded qubit. Here, we present an experimental signature of such a bijection by leveraging the spin-induced Kerr rotation present in a low-noise charged quantum dot-micropillar cavity device. Through time-resolved polarization measurements, we project the electron spin to one of its eigenstates with $95\pm2\%$ fidelity with a single reflected photon detection, and follow the subsequent spin relaxation through the detection of a second reflected photon. We demonstrate that, after a transient regime governed by the trion radiative lifetime, two orthogonal polarization states can be produced, each associated to a given spin eigenstate. While the current results are limited by a timescale competition between electron spin relaxation and trion radiative lifetime, they could be improved using hole spins displaying increased relaxation times. Our work paves the way towards deterministic logic gates exploiting this one-to-one mapping between a spin and the polarization of a scattered photon.
Read the full abstract

All authors Adrià Medeiros, Vincent Vinel, Eliott Rambeau, Petr Steindl, Elham Mehdi, Manuel Gundín, Clément Millet, Petr Stepanov, Niccolo Somaschi, Aristide Lemaître, Isabelle Sagnes, Olivier Krebs, Pascale Senellart, Dario A. Fioretto, Loïc Lanco

Differential Geometry

Conic Pseudo-Finslerian Mechanical Systems

We develop a geometric framework for conservative mechanical systems modeled on conic pseudo-Finslerian manifolds, extending classical Riemannian and semi-Riemannian mechanics to anisotropic geometries. In this setting, we define a Jacobi-type pseudo-Finslerian metric and demonstrate that motions of fixed energy correspond, up to reparametrization, to its geodesics. We establish energy and momentum conservation under suitable symmetry assumptions via a generalized Noether's theorem, and provide new analytical criteria for the completeness of both the Jacobi metric and the mechanical system. Furthermore, for mechanical systems with holonomic and non-holonomic constraints, we prove the existence and uniqueness of reaction forces satisfying d'Alembert's principle. These results provide a unified geometric foundation for constrained and unconstrained anisotropic dynamics.
Read the full abstract

Databases

Property Testing for Recursive Query Languages

In the context of database querying, property testing provides a framework for testing query answers with high confidence while inspecting only a sublinear part of the database, through completion queries and size queries. A fundamental result of Chen and Yoshida (2019) states that non-satisfaction of a Boolean conjunctive query $q$ is testable with a constant number of such queries and one-sided error if and only if $q$ is equivalent to an $\alpha$-acyclic query. In this article, we initiate the study of property testing for recursive query languages, focusing on two-way regular path queries (2RPQs) and monadic Datalog. One of our main results is positive: non-answers to any 2RPQ are constant query testable with one-sided error. We extend this slightly to a certain class of monadic Datalog programs in which recursion is restricted to be linear and rule bodies must be $\alpha$-acyclic. Turning towards unrestricted monadic Datalog, we next show that if a monadic Datalog program $\Pi$ is not equivalent to an $\alpha$-acyclic program, then falsity of $\Pi$ is not constant query testable with one-sided error. This is under the assumption that all rule-bodies are self-join free. We leave open the case of monadic Datalog programs with $\alpha$-acyclic rule bodies that are not restricted to linear recursion, but observe as a first step that there exist $\alpha$-acyclic programs that are mildly non-linear and constant query testable with one-sided error.
Read the full abstract

All authors Isolde Adler, Carsten Lutz, Quentin Manière, Marcin Przybyłko, Lukas Schulze

Mesoscale and Nanoscale Physics

Hierarchy of topological superconductivity generated via heterostructures of unconventional $p$-wave magnets

A theoretical framework is proposed to engineer both first and second-order topological superconducting phases in a two-dimensional (2D) heterostructure, consisting of a quantum spin Hall insulator (QSHI) and an unconventional $p$-wave magnet in presence of proximity-induced $s$-wave superconducting pairing. Our analysis establishes that the transitions between the trivial and topological superconducting (TSC) phases can be regulated though the parameters of $p$-wave magnet. Presence of chiral symmetry leads to the characterization of both types of TSC phases by the respective invariants, one-dimensional winding number and quadrupolar winding number. These results are supplemented by an analytical effective low-energy edge theory that yields a deeper insight into the emergence of the different topological phases of the system. Bulk pairing analysis reveals the competition between the effective $(p_x+p_y)$ and $(p_x+ip_y)$ type pairings that are governed by the intrinsic spin-orbit coupling inherited to the QSHI and spin-split bands of the $p$-wave magnet, respectively.
Read the full abstract

Robotics

Revisiting Topological Graphs for Macro Action based Closed-loop Reinforcement Learning of Vision Language Navigation in Continuous Environment

Vision-Language Navigation in Continuous Environments (VLN-CE) requires an agent to follow natural language instructions through unseen environments. Existing imitation learning (IL) pipelines struggle in this closed-loop setting: behavior cloning suffers from distribution shift, and DAgger's expert actions become ambiguous upon trajectory deviation. While Reinforcement Learning (RL) offers a natural paradigm to address this, directly applying RL to micro action spaces is sample-inefficient due to reward sparsity. To overcome this bottleneck, we reformulate VLN-CE as a Hierarchical Markov Decision Process (MDP), explicitly decoupling high-level planning from low-level control. By abstracting the environment into a topological graph, our high-level policy operates on a macro action space of frontier nodes, with a training-free low-level controller acting as its state transition, which significantly compresses the decision horizon and makes closed-loop RL tractable. To support RL optimization on the macro MDP, we propose an action-aware value head to effectively evaluate state values under the dynamic frontier action space, powering a graph-based PPO. Extensive experiments demonstrate the effectiveness of our architecture. Finally, our model achieves state-of-the-art performance on the R2R-CE and RxR-CE benchmarks.
Read the full abstract

All authors Shuhao Ye, Sitong Mao, Yuxiang Cui, Yufei Wei, Xuan Yu, Shichao Zhai, Wen Chen, Shunbo Zhou, Rong Xiong, Yue Wang

Distributed Computing

Every Kernel Is a Join: Automatic Multi-GPU Parallelism for AI Computations in Einsummable

Distributing an AI computation across the GPUs of a multi-GPU server is one of the central problems in systems-for-AI. We present Einsummable, a prototype system that accepts a PyTorch-like description of an AI computation and automatically distributes it across a multi-GPU server, with no device assignments, sharding annotations, or communication operations written by the programmer. Einsummable models every operation as a relational join followed by an aggregation over tensor relations, in which the tuples contain sub-tensors. Each operation exposes its possible decompositions through what we call "join-agg specs". An optimizer then selects decompositions across the whole computation to minimize a communication-cost proxy. Because it searches decompositions rather than a menu of named strategies, Einsummable discovers plans that mesh-based auto-parallelizers cannot. Each decomposed operation is implemented by synthesizing an exchange program, which is a topology-aware generalization of Volcano's exchange operator. Einsummable invokes no canned collectives: all communication and aggregation is special-purpose, derived at compile time. Despite being fully automatic, Einsummable can outperform custom-designed implementations. For example, on LLaMA transformer blocks on an eight-GPU A100 server, Einsummable achieves a geometric-mean runtime of 8.97 ms, versus 13.80 ms for hand-tuned PyTorch and 15.90 ms for vLLM.
Read the full abstract

All authors Zhimin Ding, Chen-Kuan Liao, Chima Adiole, Brianna Barrow, Fangzhou Du, Yu Hsiao, Ge Huang, Yicheng Jin, Ismail Syed, Chris Jermaine

Combinatorics

Extremal Families for Matchings in Permutations

Two permutations $\sigma,\tau\in S_n$ are called disjoint if the composition $\sigma\tau^{-1}$ has no fixed point. If a family $\mathcal F\subseteq S_n$ contains no $s$ pairwise disjoint permutations, then a simple averaging argument gives $|\mathcal F|\leq(s-1)(n-1)!$. Inozemtsev, Kolupaev and Kupavskii characterized the equality cases in the range $s\leq n/(2^{17}\log n).$ We characterize all equality cases throughout the range $2\le s\le n$: equality holds if and only if $\mathcal F$ is a union of $(s-1)$ pairwise disjoint $1$-cosets. We also prove the linear statement underlying this classification: a real-valued function on $S_n$ has constant sum on every one-factorization if and only if it lies in the span of the indicators of the $1$-cosets. The proof is combinatorial and applies to every order, with a few small orders handled separately.
Read the full abstract

Nuclear Theory

Reduced-basis method for linear response within nuclear density functional theory

Background: The quasiparticle random-phase approximation (QRPA) within nuclear density functional theory provides a powerful framework for describing collective excitations. Although the finite-amplitude method (FAM) efficiently solves the QRPA problem, repeated calculations for different external-field parameters remain computationally demanding. Purpose: We construct a reduced basis method (RBM)-based emulator for the FAM that treats the complex energy of the external field as a model parameter to efficiently reproduce FAM amplitudes and QRPA eigenmodes. Methods: High-fidelity FAM calculations are performed at a small set of training points in the complex-energy plane. The resulting FAM amplitudes form a non-orthogonal reduced basis. A variational equation yields an emulator that can predict the response at arbitrary complex energies and QRPA eigensolutions without additional full FAM calculations. Results: The RBM emulator accurately reproduces FAM strength distributions in both giant-resonance and low-energy regions when the relevant energy domain is covered by the training set. It also reproduces imaginary QRPA modes associated with shape instabilities of the HFB state. Applied to the $K^\pi=0^+$ mode of rare-earth Dy isotopes in a realistic model space, the emulator reproduces strength distributions and the lowest $0^+$ collective states with precision comparable to full FAM calculations, reducing the computational cost by more than an order of magnitude. Conclusions: The RBM provides an efficient and accurate FAM emulator. Its ability to reproduce giant-resonance, low-energy, and imaginary-energy modes at drastically reduced computational cost makes it promising for density-functional optimization, calculations of collective inertia, and large-scale surveys of nuclear collective excitations.
Read the full abstract

Nuclear Theory

\texorpdfstring{$\alpha$}{}-decay for superheavy nucleus: The alpha decay energy to the one-fourth power

Recently, Sobhani and Luo \cite{sobhani2025unified} proposed a new empirical formula for $\alpha$ decay based on the $Q_\alpha^{-1/4}$ energy dependence, incorporating the proton number $Z$, neutron number $N$, and relative neutron excess $I = (N - Z)/(N + Z)$ as primary parameters. In this work, we extend this model by explicitly including the angular momentum of the emitted $\alpha$ particle and the quadrupole deformation of the daughter nucleus. Using this improved formula to evaluate the $\alpha$-decay half-lives of 400 nuclei yields a root-mean-square (RMS) deviation of 0.97 relative to experimental data. Furthermore, we employ support vector regression (SVR)-taking $Q_\alpha^{-1/4}$, $N$, $Z$, angular momentum, and daughter-nucleus deformation as input features-which further reduces the RMS deviation to 0.56. Finally, we apply both the extended formula and the SVR model to predict the $\alpha$-decay half-lives of even-even nuclei with $Z = 120$ and $Z = 122$. The predicted half-lives show good consistency with those from the Sobhani and Poenaru formulas, and both approaches strongly support $N = 184$ as the next neutron magic number.
Read the full abstract

Information Retrieval

Comparing Retrieval Methods for Academic Advisor Discovery: A Six-Method Study of 768 CS Faculty Profiles Across 9 US Universities

We present a comparative evaluation of six information retrieval methods for the task of academic advisor discovery: ranking CS faculty members by relevance to a graduate applicant's research interest statement. The methods span sparse lexical matching (Jaccard overlap, TF-IDF, BM25), dense semantic retrieval (all-MiniLM-L6-v2 sentence embeddings), hybrid score fusion, and learning-to-rank. Evaluation uses a new domain-specific collection: 768 faculty profiles scraped from 9 US CS departments, with 162 graded relevance judgments (grade 0/1/2) across 5 queries representing distinct graduate student research profiles. Across all five queries, Reranked achieves the highest mean NDCG@10 (0.477, std 0.138), followed by Semantic (0.450), Hybrid (0.421), BM25 (0.406), Jaccard (0.303), and TF-IDF (0.246). After Bonferroni correction across all 15 pairwise comparisons, TF-IDF is significantly worse than BM25, Semantic, Hybrid, and Reranked; no other pairwise difference survives correction at 5 queries. A field ablation reveals that biography alone (NDCG 0.634) outperforms the full model combining biography with research area tags (0.593). A controlled experiment shows that concatenating arXiv paper abstracts reduces NDCG@10 by 0.176, motivating a late-fusion architecture. All code, scrapers, and relevance labels are released openly.
Read the full abstract