Logic
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 6 November
In this paper we focus on rigidity in descriptive set theory. Building on cocycle superrigidity results of Popa, Furman and Ioana, we prove rigidity in the purely Borel context for the orbit equivalence relations arising from the shift actions and translation actions of lattices in semisimple Lie groups with higher rank. Our results sharpen work of Adams and Kechris.
Symplectic Geometry
On the strong Arnold conjecture for Grassmannians
On several families of flag varieties, we provide examples of degenerate Hamiltonian diffeomorphisms exhibiting significantly smaller numbers of fixed points than predicted by the strong Arnold conjecture.
Graphics
Real-Time Self-Penetration Repair for Skinned Characters with Soft Contact Budgets
Motion that is plausible on one body can penetrate another after a change in shape, and motion models can produce self-penetration on their native characters. We present a training-free post-process that reduces these artifacts through pose correction followed by bounded skin compression. The module attaches to any motion model whose native character and output character have compatible character packs, without access to model internals. Each pack is built offline from the rig and skin without training. A vertex-level pose layer solves a local quadratic program in plain C on one CPU core, and a stateless contact deformer acts on the host's final skinned mesh. A part-dependent soft-tissue budget allocates correction between pose and skin through a static convention. Source penetration contributes no extra allowance; optional cloth thickness and compliance modify the pose layer's collision surface. Operation is causal or uses a short buffered lookahead, with frame-exact pass-through at the native interface for clean, inactive frames in the zero state. Across 320 unseen clips and 3 body shapes, the fraction of frames with hand-torso depth above 20 mm falls from 15.53% for copied motion to 0.00%, with final maximum depth 9.3 mm over every frame. Mean pose and skin costs are 1.11 and 1.18 ms, respectively, and their sum of 2.29 ms is a sub-frame processing cost. The median joint-velocity high-frequency ratio relative to copied target motion is 1.008.
Read the full abstract
Computer Vision
PoseRieFlow: Riemannian Flow Matching for Whole-Body Text-to-Pose Generation
We present PoseRieFlow, a compact flow-matching framework for text-conditioned generation of whole-body 3D human poses. Prior text-to-pose methods either neglect articulated hands or model rotations in Euclidean space despite their non-Euclidean geometry. PoseRieFlow instead formulates generation directly on the product manifold of SMPL-H joint rotations, learning a text-conditioned vector field that transports samples from an isotropic $\mathrm{SO}(3)$ Gaussian prior to the data distribution along Riemannian geodesics. A part-tokenized Diffusion Transformer aggregates the 52 joints into eight body-part tokens, allocating a dedicated token and nonlinear projector to each hand, and restores per-joint resolution through part-specific decoders, shortening the sequence while improving kinematic fidelity over per-joint tokenization. With only 21.6M trainable parameters, PoseRieFlow supports expressive SMPL-H generation with detailed hand articulation at a fraction of the scale of recent LLM-based generators. On PoseScript, it attains the lowest whole-body kinematic error among all hand-producing methods, with consistent kinematic gains from the Riemannian formulation over its Euclidean counterpart at every practical inference budget, while distributional and retrieval metrics remain comparable between them.
Read the full abstract
Optimization and Control
A Regular First-Order Calculus for the Wasserstein–Fisher–Rao Geometry
We introduce a notion of intrinsic differentiability for functionals on the space of finite nonnegative measures equipped with the Wasserstein–Fisher–Rao (WFR) distance, also known as the Hellinger–Kantorovich (HK) distance. The resulting static first-order calculus accounts simultaneously for spatial transport and mass reweighting. We characterize regular barycentric logarithms through optimal semicouplings and measurable selections at the transport threshold, and prove their tangency at arbitrary finite source measures. The defining expansion extends to non-optimal semicouplings, with remainder of smaller order than the square root of their cost. This yields differentiation formulas for simultaneous transport and reweighting and uniqueness of the gradients. We also give a sufficient criterion in terms of regular flat derivatives. We characterize differentiability of one half the squared WFR distance by a common optimal Monge transport–growth representation with no target mass created from the cone vertex. Equivalently, the regular barycentric logarithm is unique and its norm equals the distance; the gradient is minus this logarithm. Finally, we formulate the corresponding calculus on probability measures. On $\mathcal{P}_2(\mathbb{R}^d)$, WFR differentiability implies intrinsic Wasserstein differentiability, with the transport component of the WFR gradient coinciding with the Wasserstein gradient. Whenever a flat derivative exists, one quarter of the reaction component agrees almost everywhere with its centered representative. As a byproduct we obtain a Wasserstein differentiability result for the squared $\mathrm{WFR}$ distance.
Read the full abstract
Optics
Probing injection locking of an integrated nanolaser pair through RF beating
We demonstrate simultaneous optical injection locking of an integrated pair of photonic-crystal nanolasers coupled to a common silicon waveguide. Due to fabrication-induced disorder, the two nanolasers exhibit distinct emission wavelengths, allowing their individual locking ranges to be resolved as a function of the injection-laser detuning and power. We identify a region where both nanolasers are simultaneously locked to the master laser. To probe this collective locked state, the two nanolasers are independently pump-modulated at distinct radio frequencies. A beat note at the difference frequency appears only within the overlap region, providing a direct RF signature of simultaneous locking. These results establish RF beating as a compact diagnostic of common-master injection locking in integrated nanolaser systems.
Read the full abstract
Differential Geometry
Deformation of Associative Submanifolds joining Minimal Surfaces in Hyperbolic Geometry
Donaldson and Thomas proposed a Floer-type theory on a Calabi-Yau threefold $M$, generated by the complex curves, and whose boundary operator is given by counting appropriate associative submanifolds in $M\times \mathbb{R}$. We consider a similar setting, in which the Calabi-Yau manifold is replaced by the twistor space $Z$ of an oriented hyperbolic 4-manifold $X$ and the $J$-holomorphic curves in $Z$ project to minimal surfaces in $X$. We give a formula for the virtual dimension of (a subset of) the moduli space of associatives asymptotic to a pair of $J$-holomorphic curves in $Z$, proving it equals the difference of the Morse indices of the corresponding minimal surfaces in $X$.
Read the full abstract
Quantum Physics
An Adaptive Quantum Search Framework under Unknown Solution-density: Minimizing Expected Queries to the First Solution
Grover's algorithm provides a mathematically optimal quadratic speedup for unstructured search, yet its standard formulation relies on a critical prerequisite: prior knowledge of the target solution count to determine the number of algorithm iterations. Although numerous strategies have been developed to identify or bypass this parameter, comparing them directly is nontrivial. This study investigates and computationally optimizes 3 prominent frameworks: Boyer-Brassard-Hoyer-Tapp, Fixed-Point search, and Density Estimation Methods. Density-specific benchmarks select the best tested method and configuration to minimize expected first-solution queries under 2 initialization-cost conventions. To translate these theoretical benchmarks into practical utility, a hybrid quantum-classical adaptive framework integrating Hill-climbing-assisted Grover Adaptive Search with state-space density estimation modeled via the Wang-Landau algorithm is proposed as a potential use-case. This implementation operates directly on the optimized query methods established earlier. Analytical models support the approach; ideal simulations show 18.8%-63.4% lower mean accumulated query costs than the tested randomized and fixed-point baselines.
Read the full abstract
Signal Processing
Payload-Blind Bistatic Delay-Doppler Sensing with Phase-Injected Chirps in CE-OFDM
Constant-envelope orthogonal frequency-division multiplexing (CE-OFDM) preserves a unit-magnitude sample envelope, but its Hermitian-symmetric structure makes dedicated sensing pilots costly, and additive pilots disrupt this envelope. We show that injecting a known chirp, here a Zadoff-Chu (ZC) sequence, into the CE-OFDM phase enables payload-blind bistatic delay-Doppler sensing without dedicated sensing frames or an explicit pilot power split: the residual carrier, given by the ensemble mean under the adopted payload model, becomes an implicit superimposed pilot for a receive-only node. A Doppler-aligned receiver integrates this reference coherently across frames while the payload residual averages down. In contrast, phase-domain injected training (PIT) frame averaging, designed for quasi-static channel estimation, loses about 32 dB for the simulated target with 16 averaged frames. Closed-form approximations characterize the payload-induced floor, known-cell detection probability and direct-path tolerance. In the noise-limited simulations, the receiver incurs a 2.8 dB detection gap relative to a payload-aware matched filter without interference cancellation and matches a dedicated-pilot benchmark of equal reference energy without its 53% frame overhead.
Read the full abstract
Complex Variables
Divergence Rates for Orbits of Semigroups of Holomorphic Functions
We study the asymptotic behavior for forward and backward orbits of one-parameter semigroups of holomorphic self-maps of the unit disk. For both types of orbits, we determine the asymptotic growth rate of hyperbolic length and compare it with the total speed of the semigroup, obtaining sharp constants that depend on the intrinsic properties of the semigroup and on the starting point. In the process, we discover new characterizations for standard notions in the theory of semigroups. We further explore, from a potential theoretic scope, the rate by which compact sets in petals of semigroups degenerate to a boundary point in the backward dynamical setting.
Read the full abstract
Theoretical Economics
Who Picks First? Compensatory Fairness When Equal Division Is Impossible
When indivisible objects, such as heirlooms or tickets to sports events, do not divide evenly among agents with equal claims, some agents must receive more objects than others. Can picking first compensate those with fewer objects? We propose two principles of compensatory fairness. An agent with fewer objects must not envy a larger bundle with any one of its objects removed, and priority advantages among agents with equally many objects must alternate rather than accumulate. Non-wastefulness, neutrality and an object-wise form of Maskin monotonicity characterize the draft rules, in which agents pick in a fixed sequence. Adding the two principles and envy-freeness up to one object singles out the block–snake draft, in which agents with fewer objects pick first in every round and each group's order reverses between rounds. Among draft rules, compensation is compatible with strategy-proofness, but envy-freeness up to one object is not: once at least two agents receive more than one object, no draft that satisfies it is even weakly strategy-proof, and with two such agents the conflict extends to all non-wasteful and neutral rules. When agents may be indifferent between objects, resolving each tie in favor of the earliest later picker who strictly cares preserves the draft's fairness guarantees and ensures efficiency under pairwise dominance.
Read the full abstract
Robotics
SURE:Spatiotemporal Uncertainty Representation for Efficient Vision-Language-Action Learning
Vision-language-action (VLA) policies have become a promising paradigm for end-to-end robot control, but their effectiveness still depends heavily on large volumes of demonstration data. In manipulation tasks, this dependence is compounded by structured spatiotemporal uncertainty in the action space: multiple nearby actions or trajectories may successfully solve the same task, while semantically equivalent demonstrations often unfold at different speeds. Standard pointwise supervision treats each demonstrated action as an exact target, imposing an unnecessary learning burden under such uncertainty. We present SURE, a data-efficient VLA training framework that explicitly models both spatial and temporal uncertainty. SURE augments a VLA backbone with a lightweight transposed-convolutional probabilistic action decoder that captures spatial uncertainty through local correlations among neighboring action bins. It further introduces Soft-DTW alignment supervision to accommodate local timing variations between predicted and demonstrated action chunks. Together, these two components reduce sensitivity to demonstrator-specific poses and execution timing, enabling more data-efficient action learning. We evaluate SURE on LIBERO, RoboTwin 2.0, and real-world manipulation tasks. Even with only 10% of the demonstration data or 20% of the training steps, SURE achieves manipulation success rates that match or surpass baseline VLAs.
Read the full abstract
Optics
Vertically-coupled microring resonators for lithium niobate on insulator integrated photonics
We propose and demonstrate lithium niobate on insulator (LNOI) microring resonators that are verticallycoupled to index-matched silicon-rich silicon nitride (SiN x ) access waveguides as an alternative to conventional lateral coupling schemes for integrated photonics applications. The wafer-scalable fabrication process involves a planarization step exploiting a single-step and reproducible spin-coating of a SU-8 epoxy spacer layer which allows a controlled separation to be established between the resonator and its access waveguide. The resulting multimode and single-mode microring resonators exhibit, for their fundamental TE 0 mode, intrinsic quality factors of 4.0 x 10 5 and 3.4 x 10 5 , respectively.
Read the full abstract
Machine Learning
The Multiscale Single-Index Model: An MSE Analysis of Online SGD Dynamics
We consider the Multiscale Single-Index Model (MSIM), first introduced by Oymak and Soltanolkotabi (2021), as a stylized model for hierarchical feature learning with scale separation. Each layer extracts a shared single-index feature at one physical scale and passes it to the next, giving a tractable setting in which to study how deep architectures learn local multiscale representations. Under non-degeneracy and delocalization assumptions on the link function and planted features respectively, for the two hidden-layer case ($K=2$), we analyze joint online spherical SGD under MSE loss, which is a canonical regression objective, in discrete time and show that it achieves weak recovery from random initialization in $O(d\log^2 d)$ samples, followed by strong recovery to accuracy $\varepsilon$ in $O(d\log(1/\varepsilon))$ additional samples. The main technical challenge arises from the non-Gaussian learned features observed by the second layer. We address this challenge through a quantitative Gaussian comparison using delocalization, combined with sharp trajectory-level control of the coupled SGD dynamics. This work is a companion to Bruna (2026, arXiv:2607.03347), which studies recovery under a correlation objective for general $K$.
Read the full abstract
Number Theory
On a Problem of Gordon and Hughes: The 11-adic Properties of Meromorphic Modular Functions on $\mathrm{X}_0(22)$
Congruence families occur throughout the theory of modular forms. These families superficially resemble one another, though they can vary substantially in their overall difficulty. One major complication resides in the topology of the modular curve associated with a given congruence family. All previously studied families are associated with curves of genus 0 or 1. The existence of a family associated with a curve of genus 2 (and the associated difficulties of a proof thereof) was first speculated upon by Gordon and Hughes. We give the first explicit congruence family associated with $\mathrm{X}_0(22)$, a modular curve of genus 2, and prove it. We also propose two families of conjectures associated with the same modular curve.
Read the full abstract
Information Retrieval
SPARSEUP: Towards Better Recipes for Training Modern Learned Sparse Retrievers
Learned sparse embeddings are a powerful alternative to dense retrieval, yet they have fallen behind single-vector and late interaction models. One reason for their limited adoption is that they are notoriously difficult to train, generally requiring very tight conditions to converge. We present a recipe for training Splade-like encoders on modern backbones and data that achieves a better efficiency-effectiveness trade-off. We discuss the role of logit distribution and its impact on the training stability and the final sparsity of the encoder. We also introduce a new per-position fan-out control - a hard cap on how many vocabulary dimensions each position may emit. We further apply a simple vocabulary merging strategy that removes redundant entries - such as case and word-boundary variants of the same word - which are common in cased BPE-based backbones. We apply our recipe to the LateOn backbone and training data, obtaining SPARSEUP, a sparse encoder that reaches 56.4 average nDCG@10 on BEIR-13, the highest we know of among public vocabulary-based sparse encoders below 150M parameters.
Read the full abstract
Robotics
Autonomous Particle Image Velocimetry Using Zero-Shot Sim-to-Real Reinforcement Learning
Particle image velocimetry (PIV) reconstructs a flow field from the motion of tracer particles but the reconstruction quality is bounded by how well the flow structure of interest is resolved in the images. The acquisition position is typically fixed by the operator before the measurement. We cast camera placement as a sequential decision-making problem and train a reinforcement learning agent to control a 6-DoF manipulator equipped with a camera, enabling it to locate, frame and resolve a hydrofoil wake in a water tunnel. The agent commands the camera pose and observes the scene only through the velocity field and uncertainty estimated from time-separated image pairs. It is trained entirely in a photorealistic simulation of our water tunnel, with wakes generated by Computational Fluid Dynamics (CFD) simulations of hydrofoils with varying profiles, positions and angles of attack. After zero-shot transfer to the real water tunnel, the policy reliably locates and frames the wakes of randomly placed hydrofoils. It resolves the wake at a higher resolution than a fixed camera view and with lower error in the measured flow statistics, in roughly half the time of a full scan and with far fewer image pairs.
Read the full abstract
Computational Engineering
Calibrating demand models versus adjusting OD matrices with traffic counts: a controlled comparison
Traffic counts are routinely used to calibrate travel demand models, particularly when the origin-destination (OD) matrix is not observed directly. An important modelling decision is whether to adjust individual OD flows or the parameters of the demand model that generates them. The latter approach uses fewer parameters and preserves a relationship between zonal characteristics and demand, but its accuracy depends on the assumed model structure. We compare three established approaches using the same prior information, traffic counts and equilibrium assignment. They estimate five production-gravity coefficients, origin and destination adjustment factors, or individual OD flows. Synthetic experiments on the Eastern Massachusetts and Chicago Sketch networks allow recovery to be assessed against known demand under different forms of model misspecification. Calibrating the five-coefficient model gives better OD recovery and held-out link-flow prediction when demand follows its assumptions or a two-purpose gravity process. Its advantage declines or reverses when destination choice or production relationships vary across zones. Cellwise adjustment achieves the closest fit to calibration counts in 65 of 66 evaluated conditions, yet it recovers OD demand least accurately of the three approaches in 45 of them. These findings show that model parameterisation matters beyond calibration fit. For transport planning, traffic counts should be used alongside independent evidence on trip production and distribution when selecting and validating a demand model.
Read the full abstract
Applied Physics
Spin to Orbital Angular Momentum Conversion in the Neutron Nucleus Weak Interaction
The neutron nucleus weak interaction generates a small parity non conserving rotation of the neutron spin as the neutron moves through matter. This parity-odd neutron rotary power can reach up to 2.2e-3 rad * cm-1 for slow neutrons in 139La, which possesses a p-wave resonance at 0.7 eV where the parity-odd asymmetry is greatly amplified. This spin rotation must conserve total angular momentum. Here we show that this conservation occurs through neutron orbital angular momentum generation. We experimentally demonstrate that a neutron prepared initially in a longitudinal spin-orbit state experiences no change in total angular momentum.
Read the full abstract
Statistical Methodology
Local Inference for High-dimensional Time Series
Local stationarity provides a natural framework for time series whose dependence structure evolves smoothly over time. In high-dimensional settings, however, its classical definition can break down, as approximation errors accumulate across time-varying coefficients. To address this limitation, we introduce $(\epsilon_n,\delta)$-stationarity, a generalization of local stationarity that holds locally in time and allows approximation errors to grow with the dimension, and we combine it with local sparsity, which lets the set of relevant predictors change over time. We show that, for high-dimensional time-varying autoregressions, the rate of stationary approximation is driven by local sparsity, so that local sparsity governs not only estimation but also the stationary approximation itself. We then develop a local lasso with time-varying penalties that selects relevant predictors and their periods of activity, and we derive error bounds that depend on the local sparsity, quantify the cost of nonstationarity, and guide penalty and bandwidth selection. For inference, we propose a desparsified local lasso based on local nodewise regressions and establish a linear representation with an explicit smoothing bias. Asymptotic normality then follows under two bandwidth conditions, one for coefficient variation and one for nonstationarity. Simulations and applications to macroeconomic and neuroscience data illustrate the methods.
Read the full abstract
Combinatorics
The maximum size of $3$-distance binary codes
In this paper, we show that for every positive integer $n \ge 24$, the maximum size of a family $\mathcal{F}$ of vectors from $\{-1,1\}^n$ with at most three distinct Hamming distances is equal to $\binom{n}{3}+n$. The threshold $n=24$ is best possible.
Systems and Control
Nonlinear Fault Tolerant Control of Wind Turbine Pitch Systems: A Comparative Study
Electro-hydraulic pitch systems account for about one fifth of wind-turbine failures, motivating the development of resilient control strategies for fault mitigation. The study considers a large set of robust nonlinear control designs of different feedback principles and architectures, and assesses their fault-tolerant capabilities in comparison to each other and against the industrial standard, i.e. the Proportional-Integral (PI) controller. The implementation and tuning of each scheme is based on a high-fidelity simulator to ensure nominal performance, whereas each controller is deployed unchanged on an experimental apparatus that includes a full-scale electro-hydraulic pitch system. The comparative evaluation of the considered fault-tolerant solutions is carried out through several tests that cover nominal operation and twenty-five representative fault scenarios, including sensor, process, and actuator faults. The analysis highlights the trade-off between performance preservation under faults and increased actuator chattering. The experimental results show that introducing a dynamic input-reconstruction module into the design of the nonlinear controllers significantly reduces actuator chatter without compromising their fault-tolerant properties.
Read the full abstract
Optics
Magnon-polaritons in terahertz resonators based on antiferromagnets with weak ferromagnetism
Terahertz magnon-polaritons in antiferromagnets with weak ferromagnetism are theoretically investigated using YFeO$_3$ as an example. Dispersion relations are obtained for the quasi-ferromagnetic and quasi-antiferromagnetic modes. It is shown that the intrinsic Fabry–Perot resonances of the magnetic slab provide strong coupling, but their low quality factor limits the cooperativity. The photonic crystal cavity increases the cooperativity of the quasi-antiferromagnetic mode from $C\sim6$ to $C\sim41$ at 300K and to $2.2\times10^3$ at 63K.
Read the full abstract
Robotics
ODEAction: From Predicting Chunks to Evolving Actions
Vision-language-action (VLA) models typically generate actions in chunks, dividing continuous robot execution into separately predicted action chunks, which can introduce discontinuities at chunk boundaries. We propose ODEAction, a chunk-free action generation paradigm that replaces action chunk prediction with Continuous Action Evolution. We use an ordinary differential equation (ODE) to describe the continuous evolution of actions, and define the vector field of this ODE as the Action Transition Field to characterize how actions evolve with respect to evolution time. During inference, the model takes the current action as the initial condition and numerically solves the ODE defined by the learned Action Transition Field, thereby recursively generating subsequent actions with explicit dependencies. ODEAction is implemented as a modular action head that can be integrated with different vision-language backbones. Experiments on LIBERO, EBench, RoboTwin, and real-robot tasks show that, compared with action-chunk-based baselines, ODEAction improves both task performance and trajectory quality, with particularly pronounced gains on fine manipulation tasks.
Read the full abstract
Materials Science
Experimental Evaluation of High-Throughput Structure Predictions
High throughput computational databases such as Materials Project, the Open Quantum Materials Database, and Alexandria now each list on the order of 10^5 predicted stable compounds. However, the overall reliability of these predictions in terms of actual experimental synthesizability remains poorly understood. In this work we attempt to synthesize, via arc melting, 34 different predicted ternary compounds. The majority of these materials did not form in the predicted structure, instead resulting in disordered variants or multiphase mixtures. Four formed ordered structures not reported before, one of them at a composition reported earlier without a structure. We discuss both the failures and the successes, and identify simple filtering criteria that can help researchers avoid hypothetical materials that are unlikely to form.
Read the full abstract
Robotics
Goodhart in the Planner: Sampling-Based Control Exploits Rewards Learned from Human Preferences
Robots increasingly plan by searching against a reward model learned from human preferences. We measure what this search does to the true objective. On HalfCheetah and Hopper with crowd-sourced labels, and on Meta-World drawer-open and plate-slide with synthetic and blind human labels, harder MPPI search cuts true return by up to 76% while held-out label accuracy stays at 0.75-0.97; with human labels the drawer opens in 0 of 20 runs, against 10 of 10 for the cloned policy the planner starts from. The effect persists with a learned dynamics model and an image scorer. We prove that $\chi^2$-regularized MPPI at a temperature set by the scorer's error spread on the proposals is worst-case optimal, and that no gain can be certified once that spread exceeds the scorer's own. Calibrated from 100 ranked proposal pairs, this rule is the safest fix we test, keeping 86-94% of the cloned policy's return on drawer-open and plate-slide.
Read the full abstract
Materials Science
Inversion symmetry breaking by interlayer hybridization in a tetralayer van der Waals heterostructure
Inversion symmetry breaking unlocks a broad range of physical phenomena fundamental for modern technologies, motivating efforts to engineer noncentrosymmetric materials. In this context, monolayer transition metal dichalcogenides, which naturally lack inversion symmetry, have emerged as a versatile platform for valley physics, strong excitonic effects, and nonlinear optics. However, in their hexagonal stacking phase, inversion symmetry is restored in even-layer stacks and bulk form, suppressing these effects and limiting applications. In this work, inversion symmetry breaking is demonstrated in a vertically stacked tetralayer heterostructure assembled from two intrinsically centrosymmetric bilayer flakes, as evidenced by second harmonic generation measurements with an intensity comparable to that of their constituent monolayer. Spectroscopic measurements and theoretical estimations indicate that effective symmetry breaking in the tetralayer heterostructure is driven by interlayer hybridization, giving rise to pronounced electronic and phononic signatures. This symmetry breaking further induces polar anisotropy, with an intensity ratio reaching 2.36. We propose that asymmetric contributions from excitons to the second harmonic optical dipole may influence this behavior. These findings establish interlayer coupling as a critical mechanism for introducing inversion symmetry breaking and tuning the optical response of van der Waals heterostructures, providing a powerful strategy for photonics and optoelectronics in two-dimensional materials.
Read the full abstract
Mesoscale and Nanoscale Physics
Local Correlations Determine the Dephasing Threshold of $\mathbb{Z}_2$ Topology
In this work, we try to understand the question of how to address the survival of band topology in the presence of dephasing. We investigate this question in the Kane-Mele $\mathbb{Z}_2$ topological insulator. To determine the stability of the topological invariant we construct a single particle Hamiltonian that also provides identical correlation at the single particle level. The phase transition from topological to trivial is determined by the gap closing of this correlation Hamiltonian. This gap closing is related to purity gap. As a diagnostics we calculated the invariant directly and as a complementary diagnostic, coherent two-terminal transport through the auxiliary correlation Hamiltonian exhibits quantized conductance in the nontrivial region. This does not establish physical conductance under dephasing. Our results identify a predictive local criterion for the survival of single-particle topological structure under a specified noise channel.
Read the full abstract
Chemical Physics
Cavity-QED Molecular Dynamics: An eT-i-PI Interface for Ab Initio Cavity Born-Oppenheimer Dynamics and Joint Nuclear-Photon Path-Integral Sampling
Simulating molecules in quantum electrodynamic (QED) cavities requires a consistent description of electronic response, nuclear motion, and electromagnetic-field fluctuations. Here, I present Cavity-QED Molecular Dynamics, an interface connecting eT and i-PI for atomistic simulations of finite molecular systems coupled to a single photon mode. The code evaluates a self-consistent cavity Born-Oppenheimer Hartree-Fock (CBO-HF) energy surface and supports classical-nuclei dynamics under canonical (NVT) and microcanonical (NVE) ensembles, as well as canonical joint nuclear-photon path-integral sampling including nuclear quantum effects (NQEs). A fixed-displacement gradient correction provides nuclear and photon forces consistent with the same energy surface as the photon coordinate evolves independently. OpenMP threading, concurrent bead evaluations, and analysis utilities support practical simulations. Water-monomer benchmarks assess both dynamical propagation and equilibrium sampling. Energy-derivative checks and NVE timestep tests demonstrate consistent force evaluation and integration, while path integral molecular dynamics (PIMD) simulations with PILE-L thermostatting reproduce analytic finite-bead photon second moments, including their centroid and internal contributions, within sampling uncertainties. At the tested parameters, cavity coupling produces a small but statistically resolved increase in photon fluctuations, while changes in mean molecular geometry remain within sampling uncertainty. The resulting Cavity-QED Molecular Dynamics framework enables controlled investigations of how coupled quantum fluctuations of matter and the electromagnetic field influence molecular equilibrium properties within the CBO-HF approximation, providing a foundation for future studies of cavity-modified hydrogen bonding, vibrational spectra, and molecular polaritonic phenomena.
Read the full abstract
High Energy Physics (Phenomenology)
Interference effects in MSSM Higgs boson searches at low $tan\beta$: the $gg\to H\to WW, ZZ, hh$ and $gg \to A \to Zh$ channels
The LHC limits on the heavy neutral Higgs bosons of the minimal supersymmetric extension of the Standard Model, which are particularly relevant at low values of the ratio of vacuum expectation values $\tan\beta$, have been obtained in the narrow-width approximation, without including the interference between the pure Higgs signal and the QCD background. We study the interference of the resonant heavy neutral CP-even $H$ and CP-odd $A$ boson contributions with the non-resonant gluon-fusion amplitudes in the processes $gg\to VV$ with $V=W,Z$, $gg \to hh$ and $gg\to Zh$ at low $\tan\beta$, $1\le \tan\beta \le 6$. We work at leading order but with the exact top-quark mass dependence, and with the longitudinal $VV$ and $Zh$ amplitudes obtained from the Goldstone-boson equivalence theorem that lead to loop form factors similar to those appearing in $gg\to hh$. The lineshapes in the four search channels are governed by a simple complex parameter $\kappa$, the ratio of the resonant to non-resonant amplitudes at the peak. Because the $H$ and $A$ bosons couple weakly to the considered final states, while being broadened by their decays to top quarks, $|\kappa|$ drops to values of a few for masses of $0.5$–$1$ TeV, even though the total widths remain at the percent level. The interference then increases the signal rates by up to tens of per cent, and distorts their lineshapes. For the present ATLAS (and presumably CMS) Run II exclusion limits, the net effect is nevertheless rather modest, except at the high-mass end of the $H\to hh$ contour, but it becomes important for the masses that will be probed at the high-luminosity LHC.