Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 5 September
Let $r\geq3$ and $k_1\geq k_2\geq\cdots\geq k_r\geq t$. Let $\mathcal{F}_1,\mathcal{F}_2,\ldots,\mathcal{F}_r$ be families of subspaces, of respective dimensions $k_1,k_2,\ldots,k_r$, in an $n$-dimensional vector space over the finite field $\mathbb{F}_q$. The $r$ families are called $r$-cross $t$-intersecting if $\dim \left(F_{1} \cap F_{2} \cap \cdots \cap F_{r}\right) \geq t$ for all $F_{i} \in \mathcal{F}_{i}, i = 1,2,\dots,r$. In 2016, Frankl and Tokushige conjectured that $\prod_{i=1}^{r}|\mathcal{F}_i|\leq\prod_{i=1}^{r}{n-1\brack k_i-1}$ for $t=1$ and $n\geq rk_1/(r-1)$. The appealing conjecture suggests establishing intersection theorems for $n\sim ck_1$ with $c=c(r)\in(1,2)$, a direction that has long been challenging. In this paper, we overcome this barrier by proving that $$\prod_{i=1}^{r}|\mathcal{F}_i|\leq\prod_{i=1}^{r}{n-t\brack k_i-t}\;\;\mbox{for all}\;\;t\geq1\;\mbox{and}\;n\geq rk_1/(r-1)+C(t,r),$$ where $C(t,r)=rt/(r-1)+1$. This proves the Frankl–Tokushige conjecture except for at most three values of $n$, and establishes an Erdős–Ko–Rado type theorem for almost all values of parameters. Furthermore, we characterize all extremal configurations. Our proof is purely combinatorial and based on the $t$-cover method, with several essential refinements. We also obtain almost complete intersection theorems for $r$-wise $t$-intersecting families and non-trivial $r$-cross $t$-intersecting families.
Statistics Theory
A spectral gap for Metropolis-adjusted Langevin algorithm with a uniformly randomized step size
Let $\pi(\mathrm{d} x)\propto e^{-U(x)}\, \mathrm{d} x$ on $\mathbb{R}^d$, where $U$ is continuously differentiable and $m$-strongly convex with a globally $L$-Lipschitz gradient, $0<m\leq L<\infty$, and $\kappa=L/m$. Fixed-step Metropolis-adjusted Langevin algorithm (MALA) has known warm-start mixing-time upper bounds of order $\kappa\sqrt d$, up to logarithmic factors. A spectral-gap lower bound at the corresponding scale $(\kappa \sqrt{d})^{-1}$ would give an upper bound of order $\kappa \sqrt{d}$ on the Monte Carlo asymptotic variance relative to independent sampling, uniformly over all square-integrable functions. However, when $\kappa$ is bounded away from~1, the best fixed-step spectral gap that can be guaranteed uniformly over this target class is at most of order $\max\{\log(\kappa d)/(\kappa d), e^{-cd}\}$ for some positive universal constant~$c$. We show that uniform randomization of the step size improves this worst-case guarantee. At each iteration, the algorithm draws $h\sim\operatorname{Unif}(0,H)$ and performs one ordinary MALA transition. Choosing $H$ of order $[L\sqrt{d(1+\log d+\log\kappa)}]^{-1}$ yields a right spectral-gap lower bound of order \[ \frac{1}{\kappa\sqrt{d(1+\log d+\log\kappa)}}, \] uniformly over the target class. Thus, given $\kappa > 1$, for all square-integrable functions, the ratio of the Monte Carlo asymptotic variance relative to independence sampling has an upper bound of order $\sqrt{d \log d}$. This contrasts with fixed-MALA, where the ratio can be as bad as $d/\log d$ in thew worst-case scenario. The spectral gap also gives geometric convergence of the lazy kernel from every initial density in $L^2(\pi)$, central limit theorems, and nonstationary mean-square error bounds. This work was developed with substantial assistance from ChatGPT.
Read the full abstract
Machine Learning (Statistics)
Functional Attentive Interpretable Regression
In function-on-function regression, the coefficient surface $\beta(s,t)$ may exhibit complex support structure—from localized patches to global patterns such as disconnected regions, bands, or rings—where effect similarity does not align with Euclidean proximity. Projection-based methods that rely on fixed basis expansions can obscure such structure, while direct smoothing approaches risk oversmoothing the surface and its boundaries. We propose Functional Attentive Interpretable Regression (FAIR), which represents $\beta(s,t)$ directly through coordinate features and uses self-attention to learn effect-adaptive neighborhoods, enabling information sharing at both local and global scales. A scalar compression network maps these learned representations to the coefficient surface. Sparsity and smoothness penalties applied over these neighborhoods promote localized support with coherent boundaries. We establish a sieve equivalence to tensor-product spline spaces and derive convergence rates. Simulations and applications to oceanographic and hydrological data demonstrate that FAIR recovers support geometry more accurately than existing methods while achieving superior prediction, particularly under sparse sampling.
Read the full abstract
Materials Science
Diffusion Quantum Monte Carlo Benchmark of Interlayer Binding and Charge Redistribution in Chemically Distinct Two-Dimensional Van Der Waals Bilayers
Interlayer interactions in two-dimensional materials can generate emergent phenomena absent in their constituent monolayers, including unconventional magnetic order, multiferroicity, and topological magnetic phases. Predicting such emergent behavior requires simultaneously resolving long-range dispersion, short-range orbital hybridization, and electronic correlation interactions that are intrinsically nonlocal and many-body and remain challenging even for advanced density-functional approximations. Here we establish a systematically controlled many-body benchmark for diverse bilayer materials using diffusion Monte Carlo (DMC), spanning single-sheet materials, transition-metal dichalcogenides, and magnetic transition-metal halides. We obtain equilibrium separations, binding energetics, interlayer vibrational modes, and charge redistribution, finding excellent agreement with available experiments while revealing systematic and property-dependent failures across widely used semilocal, meta-GGA, and dispersion-corrected density functionals. Beyond energetics, DMC resolves subtle interlayer charge rearrangements, particularly leading to long-ranged dipolar tails in magnetic Cr trihalides that survive well beyond the regime where semilocal DFT predicts appreciable interlayer polarization, providing a many-body basis for understanding interlayer-coupled ferroic and magnetic phenomena. The resulting energies, response properties, and high-accuracy electron densities constitute a transferable benchmark for developing next-generation density functionals. Finally, we provide a scalable high-performance-computing workflow that enables systematic expansion of many-body benchmark datasets across emerging families of layered quantum materials by the scientific community.
Read the full abstract
Networking
Biased Backpressure Routing for Multihop Wireless Networks with Heterogeneous Interfaces
Heterogeneous-interface multihop wireless networks (Het-MuNets) are emerging as a promising paradigm for tactical networks and for infrastructure-light applications such as vehicular communications, wireless backhaul, and non-terrestrial connectivity. To exploit the diverse profiles of heterogeneous communication technologies in penetration, interference, and bandwidth, packet-to-interface assignment must be determined on a per-hop basis, making routing and scheduling highly complex. In this work, we develop a unified framework for joint packet routing, link scheduling, and interface assignment in Het-MuNets with multiple concurrent flows. By modeling packet-to-interface assignment as transmission between virtual subnodes, we transform interface assignment into intra-device virtual routing, which is solved jointly with physical routing and scheduling under a unified multi-layer shortest path-biased Backpressure (SP-BP) scheme. Numerical results demonstrate that the proposed framework outperforms SP-BP operating on other baseline graph models and non-backpressure routing schemes in goodput, latency, and packet delivery rate.
Read the full abstract
Computation and Language
SinoGlyphBench: A Diagnostic Benchmark for Chinese Glyph-Level Obfuscation in Language-Model Moderation
Glyph-level obfuscation can leave harmful Chinese content readable to humans while degrading automated moderation. We introduce SinoGlyphBench, a diagnostic benchmark that identifies label-critical semantic anchors and creates matched original and glyph-obfuscated inputs in text and image modalities. By perturbing anchors, background context, or both, this design distinguishes corruption of moderation-relevant evidence from general surface variation. Across 176,916 paired evaluations of 12 LLMs and MLLMs, obfuscation increases harmful false-negative and false-positive rates by 6.1 and 4.7 percentage points, respectively, and reduces four-way accuracy by 5.0 points. Models retain 75.7% of the decisions that were correct on the matched original inputs. Full-scope perturbations cause the largest degradation, anchor-only perturbations are more damaging than background-only perturbations, and cross-script substitution is particularly difficult in the text modality. Analysis of structured outputs identifies observable mismatches in visible-form reading, intended-message recovery, and final safety judgment. The evaluated models, therefore, remain brittle to Chinese content written with non-canonical glyphs. Resources are available at https://github.com/fengshun124/SinoGlyphBench.
Read the full abstract
Quantum Physics
Do Quantum AIs Dream in Paths? Path-Integral Slow Thinking through Grover Interference
Reinforcement learning with verifiable rewards enables large language models to think slowly, but the same training can induce policy collapse: probability concentrates onto a few successful trajectories and exploratory diversity erodes. We ask whether quantum AI can realize slow thinking differently. We formulate slow thinking as coherent dynamics over reasoning trajectories, a discrete path integral in which action sequences coexist in superposition and recombine before measurement. In our trainable realization, an exact verifier partitions the ensemble into collective accepted and rejected components that interfere under Grover amplitude amplification. A finite Grover evolution is maximized when the pre-amplification success probability lies at an analytically determined value below one, so inference itself defines an interior training target and removes the monotonic pressure toward unit success. In exact statevector simulations of a 2x3 sliding puzzle, Grover training reaches accuracy 0.95 on a 32-question training set at one round, against 0.73 for the strongest classical control. On held-out questions specialization has a cost: an untrained uniform policy read out through the same amplification remains the strongest reference on this solution-dense benchmark, and quantum training preserves far more held-out accuracy than classical training - at four rounds with matched circuit applications the two quantum models reach 3.2 and 3.9 times the strongest classical controls. The number of training questions supported by fixed-size policies trained at each amplification budget also grows faster with the budget than with matched classical repetition. These results establish a Grover-based realization of path-integral slow thinking: the interior target preserves exploratory path diversity, and ensemble-level interference converts it into verified performance.
Read the full abstract
Computer Vision
Map the Possibilities: Spatial Belief Fields for Language-Goal Aerial Navigation
Language-goal aerial navigation requires an agent to local- ize a potentially unobserved target from relational instruc- tions and partial observations, and translate this inference into metric actions in large-scale continuous environments. Existing methods often reduce language grounding to one single waypoint or action, prematurely collapsing the spatial uncertainty inherent in incomplete evidence and ambiguous relations. To address this limitation, we introduce SBFNav, a closed-loop navigation framework centered on a language- conditioned Spatial Belief Field (SBF). Unlike ego-centric maps that primarily record what has been observed, SBF rep- resents a task-conditioned distribution over plausible target locations, preserving multiple spatial hypotheses under par- tial evidence. At each step, this distribution is updated from accumulated observations as new evidence becomes avail- able. Built on this representation, SBFNav selects the goal that best aligns with the instruction and observations as a met- ric waypoint for control. Experiments on both the original and revised CityNav benchmarks achieve the best reported overall performance. On the Test Unseen split, our method improves SR from 25.91% to 32.29% and SPL from 19.63% to 30.43%. Ablation studies further confirm the advantages of spatial-belief modeling over single-point prediction.
Read the full abstract
Instrumentation and Detectors
An optical cryostat for automated testing of silicon photomultipliers with vacuum-ultraviolet light
We present the design and performance of an optical cryostat for testing silicon photomultipliers (SiPMs) with vacuum-ultraviolet (VUV) light. The cryostat operates within a temperature range of 120 to 340 K, achieving a temperature stability of 1.2 mK, measured in a rolling 10-minute window once settled within a liquid nitrogen fill-cycle, and 13.8 mK over a complete fill-cycle including the refill transient. The cryostat includes a VUV-transparent CaF$_2$ viewport with a 142 mm diameter clear aperture, which limits the optically accessible sample area to 158 cm$^2$. The viewport is integrated into a sealed dark box and optical table to facilitate light delivery. VUV illumination is achieved using a custom xenon scintillation lamp or a xenon flash lamp, with a motorized two-axis linear rail system ensuring precise light positioning over the sample. This paper details the cryostat and optical system design, as well as commissioning current-voltage (IV) measurements using Hamamatsu VUV-sensitive SiPMs from 165 to 295 K and a measurement of the photodetection efficiency at 165 K.
Read the full abstract
Fluid Dynamics
Unsteady Thin-Airfoil Theory Revisited: An Approximate Analytical Solution and the Self-Similar Wagner Effect in Viscous Flows
An approximate analytical solution for the unsteady lift of a thin airfoil with a general unsteady motion is derived from a viscous-flow perspective, where the wake vortex-sheet strength is given in an explicit convolution-type expression as an approximate solution of the Wagner integral equation. For validation, this analytical solution is applied to the Wagner and Theodorsen problems, giving the explicit integral forms of the Wagner and Theodorsen functions as the reduced cases. Further, this analytical solution is applied to the starting flow with a finite timescale in the generalized Wagner problem, revealing the self-similarity of the re-normalized circulatory lift coefficient and its equivalence to the re-normalized Wagner function in a finite time domain. More importantly, the self-similar Wagner effect is found in numerical simulation of the flow over a starting flat-plate airfoil at low Reynolds numbers even when the flow is moderately separated. This self-similarity represents the Reynolds-number-invariance.
Read the full abstract
Quantum Physics
High-Resolution Dynamical Eigenspectroscopy via Variational Trotter Compression on a Superconducting Qubit Processor
The pursuit of high-resolution eigenspectroscopy on noisy intermediate-scale quantum devices is often hindered by the trade-off between circuit depth and coherence time. In this work, we introduce and experimentally demonstrate a dynamical eigenspectroscopy protocol that extracts fine-grained energy structures from time-dependent survival amplitudes. To overcome the finite coherence window of current superconducting processors, we employ Variational Trotter Compression (VTC) as a practical means to extend the duration of high-fidelity unitary evolution. Using a multi-connected 9-qubit superconducting processor, we reconstruct the time-domain autocorrelation signal via quantum state tomography for the H2 molecule at different bond lengths and for the Fermi-Hubbard model across different correlation regimes. Through multi-frequency fitting and Fourier analysis, the extracted eigenenergies agree with the exact-diagonalization values to within 2x10^-3, including the near-degenerate levels in the strongly interacting regime. Our results establish experimental dynamical spectroscopy as a robust and generalizable framework for simulating both quantum chemistry and strongly correlated lattice systems, bridging weak- and strong-coupling regimes on near-term quantum hardware.
Read the full abstract
Artificial Intelligence
AgentBrew: Offline Tool-Use Agent Learning from Raw Real-World Trajectories
LLM-based agents are increasingly deployed in real-world applications through tool-use APIs, yet training them for specific environments remains fundamentally difficult: real-world applications provide no pre-defined tasks or verifiers, no faithful simulators, and limited budget for large-scale environment interaction. In this paper, we propose AgentBrew, an offline training framework that learns effective tool-use policies from a single batch of raw interaction trajectories, without task verifiers or iterative on-policy rollouts. The agent first explores the target environment to collect a raw trajectory corpus without quality filtering. To extract training signal from this noisy corpus, retrospective task inference reconstructs an aligned instruction for each trajectory based on its actual outcome, and PMI-Based credit assignment decomposes the trajectory's total information about the inferred instruction into additive per-action credits via pointwise mutual information (PMI). These credits weight the policy training objective, amplifying informative actions while suppressing ineffective ones. On three real-world MCP applications (GitHub, Notion, PostgreSQL), AgentBrew improves Qwen3-32B by +8.7 Acc / +9.7 Score on average, surpassing Qwen3-235B (+2.3 / +4.4) and outperforming rejection sampling (+5.9 / +10.3). These results demonstrate that fine-grained offline learning can recover useful supervision from raw trajectories that filtering-based approaches would discard. The code is available at https://github.com/alphatogo/AgentBrew
Read the full abstract
Combinatorics
An AFLT-type generalization of the $q$-Baker–Forrester ex-conjecture
The Habsieger–Kadell $q$-Morris constant term identity, which is equivalent to the famous $q$-Selberg integral, has been generalized in numerous ways since the 1980s. Among these, there are two important generalizations: (i) the $q$-Baker–Forrester ex-conjecture, which was conjectured by Baker and Forrester in 1998 and proved by Károlyi, Nagy, Petrov and Volkov in 2015; (ii) the AFLT-type $q$-Morris identity (equivalently, the AFLT-type $q$-Selberg integral), which was obtained by Albion, Rains and Warnaar in 2021, as a $q$-analog of the result of Alba, Fateev, Litvinov and Tarnopolskiy (AFLT). In this paper, by the Gessel–Xin method and the Macdonald polynomials with prescribed symmetry, we unify these two generalizations.
Read the full abstract
Complex Variables
Sharp Deficiency Bounds for Meromorphic Functions in the Unit Disc
In 1986, Shea and Sons obtained the following bound for a meromorphic function $f$ of finite order $\rho$ in the unit disc, under the hypothesis $0<\lambda(f)\leq+\infty$, and for every positive integer $n$: \[ \sum_{a\ne\infty}\delta(a,f) \leq \delta(0,f^{(n)})\bigl(1+n k(f)\bigr) +\frac{2n(\rho+1)}{\lambda(f)}. \] Under the condition $0<\alpha(f)\leq+\infty$, they also obtained \[ \sum_{a\ne\infty}\delta(a,f) \leq \Delta(0,f^{(n)})\bigl(1+n k(f)\bigr) +\frac{2n}{\alpha(f)}. \] Shea and Sons asked whether the factor $2$ could be eliminated. We prove that it can. In fact, whenever $0<\lambda(f)\leq+\infty$, one has \[ \sum_{a\ne\infty}\delta(a,f) \leq \delta(0,f^{(n)})\bigl(1+n k(f)\bigr) +\frac{n(\rho+1)}{\lambda(f)}, \] and under the condition $0<\alpha(f)\leq+\infty$ one has \[ \sum_{a\ne\infty}\delta(a,f) \leq \Delta(0,f^{(n)})\bigl(1+n k(f)\bigr) +\frac{n}{\alpha(f)}. \] The coefficient $n$ in each of $n(\rho+1)/\lambda(f)$ and $n/\alpha(f)$ is best possible for every $n$, and the dependence on $\rho$ and $\alpha(f)$ in these terms is also essential. At the end, we extend both estimates to finite subsets $A$ of an $n$-dimensional complex vector space $V\subset\mathbb{C}(z)$, with $f^{(n)}$ replaced by the monic differential operator $D_Vf$ of order $n$ whose kernel is $V$. We prove that both extensions are sharp for every $V$.
Read the full abstract
Artificial Intelligence
Learning Counterfactual World Models for Embodied Reasoning under Partial Observability
World models promise a general route to embodied intelligence: learn predictive dynamics once, then reason, plan, and act with them. Increasingly, the representations beneath such models are pretrained on large-scale video, interaction, and multimodal corpora, which raises a question prediction quality alone cannot answer: when is a learned representation actually actionable? We identify a failure mode we call counterfactual collapse: a model predicts visually plausible futures while failing to distinguish interventions with different behavioral consequences. This arises whenever a representation is optimized for perceptual similarity rather than intervention structure, which is precisely the objective under which most large-scale pretrained encoders are learned. We introduce Counterfactual Latent World Models (CLWM), which combine a recurrent belief-state encoder, action-conditioned latent dynamics, and a contrastive counterfactual objective that separates futures induced by distinct interventions even when their observations look alike. Across occluded manipulation, aliased navigation, and long-horizon manipulation, CLWM improves planning success over the strongest baseline (65.1% $\to$ 74.6% on Occluded Push and 67.3% $\to$ 78.9% on Aliased Maze) and reduces exploitative planning failures (18.4% $\to$ 9.7% on Deferred Kitchen), with ablations attributing the gains to hard counterfactual negatives, especially perceptual-alias negatives. Finally, our counterfactual separability metric, which tracks planning success across the five baseline model classes ($r \ge 0.94$), is representation-agnostic: given intervention-outcome labels, it can audit any encoder, pretrained or trained from scratch, before a planner trusts it. We do not yet measure it on large-scale pretrained encoders. Here we establish the metric and its relationship to planning success for world models trained from scratch.
Read the full abstract
Algebraic Geometry
Mutation Sequences along Weaves and Amalgamation of Braid Varieties
Let $p,q$ be positive braids with Demazure products $u,v$. The endpoint stratum $\mathrm{Conf}(p,q)_{u,v}$ of the double Bott-Samelson cell splits as $\mathrm{Conf}(u,v) \times X(p) \times X(q^{\mathrm{op}})$, a double Bruhat cell times two braid varieties. We prove that the stratum's cluster structure is given by a cluster localization of the one on $\mathrm{Conf}(p,q)$, and that the splitting map is a quasi-cluster isomorphism. This comes from a mutation sequence along a double Demazure weave, one mutation per trivalent vertex, ending at an amalgamation of an extension of the double word quiver with the weave quiver. In the half-decorated case, this proves the conjecture of Gorsky-Kim-Scroggin-Simental for the splicing map $X(p) \times X(\Delta\Delta) \to X(p\Delta)$, where $\Delta$ is a reduced positive braid for $w_0$ and $\mathrm{dem}(p) = w_0$.
Read the full abstract
Robotics
CR-VLA-Force: Learning Control-aware Compliance VLA Model for Robust Contact-rich Robotic Manipulation
Integrating visuomotor policies or Vision-Language-Action (VLA) models with force/torque (F/T) perception has demonstrated significant progress in imitation learning for robotic manipulation. However, existing force-aware VLA models frequently exhibit limited capability in precise force tracking and rapid successive adjustments. This deficiency stems from the limitations of action-chunk execution strategies and the substantial latency between perception and real-time control. Such limitations can lead to task failures and safety risks, particularly when the execution of an action chunk exerts excessive interaction forces without timely adjustment. To overcome this challenge, we propose the Control-aware Compliance VLA (CC-VLA) framework for reactive control. The CC-VLA model employs a multimodal mixture-of-experts (MoE) to encode force signal sequences and vision-language fused feature. Furthermore, it utilizes a multi-stage training strategy to ensure robust perception within the visual-semantic space and effective force perception under sparse sampling conditions. Additionally, a VLA-guided adaptive compliance controller is designed to facilitate precise position tracking during contact-free motion and optimal force-position tracking for contact-rich tasks. To facilitate high-precision F/T data acquisition, we also implement an adversaria shared teleoperation strategy for contact-rich demonstrations that bolsters system safety and interactivity. Extensive real-world experiments demonstrate that CC-VLA significantly improves success rates in challenging force-perception tasks and enhances force-control precision, while providing multi-level safety and robustness under the tested partial-OOD pose-shift settings.
Read the full abstract
Functional Analysis
Quasi-compactness and uniform stabilization on general Banach spaces under $\theta$-subordinate perturbations of semigroup generators
We prove that the quasi-compactness of an analytic semigroup is preserved under $\theta$-subordinate perturbations of its generator on general Banach spaces, provided the perturbations are compact along trajectories. This allows us to prove the permanence of uniform exponential stability for an analytic semigroup under similar perturbations of its generator, provided the perturbed generator generates a strongly stable semigroup. We then show how the analyticity assumption can be relaxed to the class of Crandall-Pazy semigroups under a smaller class of $\theta$-subordinate perturbations, and to immediately differentiable semigroups under bounded perturbations. As an application of the stabilization result, we consider the one-dimensional Neumann Laplacian on a non-reflexive Banach space. Finally, we present counterexamples that demonstrate the lack of uniform stabilization under the larger class of $A$-bounded perturbations.
Read the full abstract
Classical Analysis and ODEs
Characterization on spectra of self-similar measures and the dual spectral set conjecture
A discrete set $\Lambda$ is called a spectrum of a Borel probability measure $\mu$ if the exponential functions $\{e^{2\pi i \langle\lambda, x\rangle}:\lambda\in\Lambda\}$ form an orthonormal basis for $L^2(\mu)$. In this work, we first give necessary and sufficient conditions for a self-replicating translation set to be a spectrum of the self-similar measure associated with a product-form Hadamard triple, which were discovered by the first-named author and Lai [Adv. Math. 431 (2023) Paper No.109257]. These results extend the studies by Łaba and Wang [J. Funct. Anal. 193 (2002) 409-420], Dutkay and Lai [J. Math. Pures Appl. 107 (2017) 183-204] in $\mathbb R$. As an application, we can explicitly construct such a self-replicating spectrum. Finally, we prove that the dual spectral set conjecture holds for a self-replicating translation set.
Read the full abstract
High Energy Physics (Experiment)
Measurement of CP Asymmetry Parameters and Polarization Correlations in $\Omega^{-}\bar{\Omega}^{+}$ Pairs
Using $(2.71 \pm 0.01) \times 10^9$ $\psi(3686)$ events collected with the BESIII detector, a joint full angular distribution analysis is carried out for the process $\psi(3686) \to \Omega^-(\to\Lambda K^-) \, \bar{\Omega}^{+}(\to \bar{\Lambda}K^+)$. The first simultaneous measurement of the weak decay parameters $\phi_{\Omega^{-}}$ and $\phi_{\bar{\Omega}^{+}}$ for $\Omega^- \to K^-\Lambda$ and $\bar{\Omega}^+ \to K^+\bar{\Lambda}$ is performed, yielding the first result for the CP-sensitive observable, $\phi_{\rm CP} = (-0.004 \pm 0.055 \pm 0.017)~\text{rad}$, where the first and second uncertainties are statistical and systematic, respectively. This further enables the extraction of the weak and strong phase differences between the $P$- and $D$-wave amplitudes: $(\xi_D - \xi_P) = (-0.15 \pm 2.25 \pm 0.69)~\text{rad}$ and $(\delta_D - \delta_P) = (-0.97 \pm 0.88 \pm 0.34)~\text{rad}$. Additionally, the polarization correlations between $\Omega^{-}$ and $\bar{\Omega}^{+}$ are measured.
Read the full abstract
Quantum Physics
On the sample complexity of the generalized hidden shift problem over arbitrary finite groups
We formulate the generalized hidden shift problem over arbitrary finite groups and obtain upper and lower bounds for the sample complexity in terms of group theoretic data.
Combinatorics
Partial Results on Hankel Determinants and the Corresponding J-Fractions of a Sequence Related to Bernoulli Numbers
When exploring the Hankel determinant of the sequence $\mu_{k}=B_{k+1}/(k+1)$, where $B_{k}$ is the $k$-th Bernoulli number, we obtained two interesting results. The first one applies in general to all sequences $(c_{k})_{k\geq0}$ with all even-indexed term $0$, except for $c_{0}$. In this case, the coefficient of the second highest order of the corresponding monic orthogonal polynomials determines the Hankel determinants. Our second result shows, the corresponding J-fractions, obtained from the generating function of $\mu_{k}$, is exactly the same as in early work of Cao, on a faster sequence converging to the Euler–Mascheroni constant.
Read the full abstract
Machine Learning
Scaling Optimal Classification Trees via Adaptive Feature and Sample Reduction
Dynamic programming for optimal classification trees becomes computationally expensive as the numbers of features and training samples increase. We develop a joint feature- and sample-space reduction framework based on STreeD. Weighted STreeD merges duplicate records created after projection onto a fixed candidate set into weighted representatives. This reduces sample-dependent computation without changing the fixed-candidate optimization problem. Adaptive STreeD repeatedly refines a bounded candidate set, retains features used by the incumbent tree, rebuilds the weighted representation, and solves the resulting reduced problems. Each certified Weighted STreeD solution is optimal for its current candidate set, while the outer feature search remains heuristic over the full feature space. Experiments on five data sets show that Weighted STreeD achieves speedups of up to 121.41 times over standard STreeD. Adaptive STreeD reduces runtime in matched comparisons at depths 2 to 4 and continues to return feasible trees at greater depths where full-feature methods are limited by time or memory. Under the same computational budget, its predictive performance remains comparable to the evaluated optimal classification tree baselines and is higher in some comparisons. These results show how joint feature- and sample-space reduction can scale dynamic-programming-based optimal-tree learning to more demanding instances.
Read the full abstract
Solar and Stellar Astrophysics
A Uniform Census of Variable Stars in M101 Based on HST/ACS Photometry
We present a homogeneous HST/ACS F555W/F814W time-series census of variable stars in two M101 disk fields, using a uniform multi-band reduction and reproducible variable-selection workflow for nearby SN-host galaxies. Supplementary archival F555W epochs are used only to refine selected long-period solutions. Candidates are selected with Lomb-Scargle period searches, Fourier light-curve modeling, two-band consistency statistics, artificial-star-test photometric corrections, and mode-aware Cepheid refinement. The final catalog contains 1417 variable-star candidates, including 1102 secure fundamental-mode and 78 secure first-overtone classical Cepheids. Of these secure Cepheids, 420 are newly identified relative to the Shappee & Stanek catalog. The catalog also contains luminous candidates outside the classical Cepheid locus. We release the catalog and source-level two-band light curves for studies of Cepheid physics, stellar variability, and distance-scale applications.
Read the full abstract
Artificial Intelligence
Beyond Top-$k$ Skill Retrieval: Diversity-Aware Skill Routing for LLM Agents
Large language model (LLM) agents increasingly rely on external skills, but routing user requests over large skill registries is difficult because many skills are functionally redundant while complex tasks often require complementary skill sets. Existing skill routers typically rank candidates independently by query relevance, which can waste context budget on redundant skills. We propose Diverse Skill Routing (DSR), a diversity-aware reranking framework that uses a Determinantal Point Process to balance relevance and non-redundancy. DSR introduces a query-residual diversity kernel that penalizes redundant skill overlap while reducing penalties caused only by shared query relevance. On the SkillRouter benchmark, DSR improves recall and full coverage over a strong pointwise reranking baseline, with larger gains on multi-skill queries. These results suggest that skill routing should be treated not only as relevance ranking, but also as complementary set selection.
Read the full abstract
Quantum Physics
Topologically Protected Edge States in One-Dimensional Quantum Walks
Topological insulators host protected boundary states that are robust to disorder, making them attractive for applications and motivating their realization in engineered systems. Discrete-time quantum walks, which have been implemented in a variety of experimental platforms, can exhibit topologically nontrivial phases and their associated boundary states. Here, we introduce a class of topological quantum walks with variable step lengths that offer theoretical insights into the topological classification of such walks. For example, these walks can access higher winding numbers and support multiple edge states. They also provide context for the reduction of topological protection from a $\mathbb{Z}$- to $\mathbb{Z}_2$-valued invariant when time-reversal symmetry is broken. The topologically protected edge states are investigated using a transfer-matrix approach that describes their spatial profiles and spin structures. These predictions are in excellent agreement with numerical results and, where applicable, with the Jackiw–Rebbi zero-mode solution of the Dirac equation. Taken together, our analysis provides a roadmap for designing quantum walks with control over the number, spatial profile, and spin structure of their topological edge states.
Read the full abstract
Machine Learning
Generalizing HVAC Control With Domain Randomized Reinforcement Learning
Deploying advanced HVAC (Heating, Ventilation and Air Conditioning) controllers at scale remains difficult because performance often depends on accurate building models or per-site retuning. We propose NOMAD-RL (Neural Online Meta-Adaptation for Dynamics), a general-purpose Reinforcement Learning (RL) controller designed to transfer across heterogeneous thermal zones through a universal, non-invasive thermostat interface. The controller acts on temperature setpoints from zone measurements and forecasts, while a recurrent policy supports online adaptation under partial observability. Our main contribution is an adaptive domain randomization scheme based on physics-informed normalizing flows, which models correlated and multimodal distributions of thermal-zone parameters while maintaining physical plausibility and controllability. This produces a realistic and progressively adaptive training curriculum that improves transfer across buildings. We evaluate NOMAD-RL against a constant-setpoint PID controller, RL without domain randomization, and MPC in single- and multi-zone settings. NOMAD-RL consistently outperforms the PID and non-randomized RL baselines, and approaches the performance of a well-tuned MPC, especially in the more challenging multi-zone case. These results highlight the potential of adaptive, physics-informed domain randomization for robust and transferable HVAC control.
Read the full abstract
Computation and Language
CONDUIT: A Unified Residual-Stream Restoration Framework for KV Cache Reuse in Vision-Language Models
Vision-language models (VLMs) often answer new questions about recurring visual content, where reusing the key-value (KV) cache can avoid re-encoding expensive visual prefixes. Exact-prefix reuse, however, fails when the same visual content appears under a changed prefix. Selective recomputation can recover quality under a small visual-token budget, but only when the right stale tokens are refreshed. Raw-attention selection can waste budget on high-attention tokens with small value-norm proxy scores and on query-irrelevant images. To address these failure modes, we propose CONDUIT, a training-free refresh policy that unifies single- and multi-image reuse as residual-stream restoration. Building on norm-weighted attention, CONDUIT ranks cached visual tokens using cached-key query attention and an accessible pre-output cached-value-norm proxy, then applies empirical image-level relevance amplification before one global selection. With one image, the coefficient is one and the rule reduces to intra-image token selection. The method preserves model architecture and weights, adding only a single query-conditioned scoring pass at inference. At a 10% refresh budget, CONDUIT achieves 97.0-99.5% of the corresponding full-prefill five-dataset average across three VLM backbones and leads budgeted methods on average; on the MMLongBench-Doc latency subset, it uses 13.5% of full-prefill FLOPs and achieves a 2.99x time-to-first-token speedup.
Read the full abstract
Machine Learning
Online Learning with LLM Experts from Limited Feedback
We study adaptive routing of prompts to large language model (LLM) experts to maximize response quality in an online setting with limited feedback. We formulate it as a bandit problem with $K$ actions that represent experts and $d$ features that encode prompts, over a horizon of $T$ rounds. We propose algorithms that strategically select and observe rewards to minimize regret. In the full-information setting, we achieve a regret of $\tilde{O}(d T / \sqrt{m})$, while in the bandit setting we achieve $\tilde{O}(d T \sqrt{K / m})$, where $m \ll T$ is a budget on feedback. Our experiments show that we efficiently learn high-quality routing strategies across diverse LLMs from limited feedback.
Read the full abstract
Analysis of PDEs
Global existence and finite-time blow-up for a strongly damped wave–MGT system with fully subcritical logarithmic nonlinearity
We study a coupled strongly damped wave–Moore–Gibson–Thompson (MGT) system with logarithmic source $f(u)=|u|^{\gamma-2}u\ln|u|$ in the full Sobolev-subcritical range $2<\gamma<2^*:=2n/(n-2)$. The main difficulty is that, in this full range, the logarithmic nonlinearity does not admit the standard compactness and difference estimates available in the lower subcritical regime. Using the augmented variable $w=v+\tau v_t$, we derive the exact energy-dissipation identity for the strongly damped system and exploit the associated coupled potential-well structure. For the local theory, a Faedo–Galerkin scheme combined with a closed nonlinear differential inequality and a spatial domain-splitting argument yields local existence. The strong damping provides the additional regularity needed to prove uniqueness throughout the full subcritical range and to establish a continuation principle. Below the well depth $d_\alpha$, we then obtain a sharp dynamical dichotomy: solutions with initial data in the stable set exist globally and decay exponentially, whereas solutions with initial data in the unstable set blow up in finite time. The blow-up argument reveals a structural cancellation specific to the augmented formulation: once the logarithmic contribution is reconstructed through the exact energy identity, the unfavorable MGT residual in Levine's concavity functional is absorbed algebraically. This allows the concavity method to close without imposing any additional sign condition on the initial velocities.