Fluid Dynamics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 14 September
Accurately resolving the near-field flow generated by many swimming bacteria while retaining computational efficiency remains challenging. Stokeslet-based models with many force points can capture detailed near-field hydrodynamics but are computationally expensive. Other approaches include far-field and low-order models that use fewer points but sacrifice near-field accuracy. We introduce a reduced-order framework based on the method of regularized Stokeslets that preserves important near-field flow features while using substantially fewer force points. The method replaces the force distribution of a high-fidelity model with forces on a sparse set of points whose strengths are determined by constrained least-squares calibration to the high-fidelity velocity field of a single bacterium. The calibrated forces yield an approximation that preserves the dominant reference-flow structure while satisfying the force-free and torque-free conditions of self-propelled swimming. Principal component analysis is then used to represent the phase-dependent variation of the calibrated forces using only a few dominant modes. By fitting the corresponding modal coefficients as continuous functions of flagellar phase, the reduced-order forces can be approximated at any phase of the flagellar cycle. The framework is applied in both free space and near a no-slip planar boundary, where it preserves the dominant flow structures and captures the wall-induced redirection of the surrounding fluid. The optimized cell-body regularization parameter depends weakly on wall distance, and the remaining velocity discrepancy is concentrated primarily near the cell body. By substantially reducing the number of force points, the reduced-order model lowers both the computational cost and memory requirements of velocity-field evaluation, making large-domain simulations of multi-swimmer flow fields more practical.
Probability
Majority dynamics on sparse random graphs
Consider a simple undirected graph $G$ on $N$ vertices, with each vertex holding an opinion from one of two options. Starting from the initial opinions on day 1, we run majority dynamics: on each subsequent day, all vertices simultaneously adopt the majority opinion among their neighbors, retaining their current opinion in case of a tie. A well-studied conjecture of Benjamini, Chan, O'Donnell, Tamuz, and Tan states that if $G$ is drawn from the random binomial model $\mathbb{G}(N,p)$, and if the starting opinions are chosen uniformly at random, then as long as $pN \to \infty$ the network will converge to 99% consensus with high probability. We confirm this conjecture as long as $pN \ge N^{\varepsilon}$ for any fixed $\varepsilon > 0$, showing that full unanimity is reached with high probability in $O(1/\varepsilon)$ days. This result improves on a line of results by Fountoulakis, Kang, and Makai, who achieve $\varepsilon = 1/2$; Chakraborti, Kim, Lee, and Tran, who achieve $\varepsilon = 2/5$; and Jaffe, who achieves $\varepsilon = 1/3$. The proof technique involves iteratively revealing the "opinion histories" for each vertex through time, keeping track of the degrees between every vertex and each of $2^k$ opinion history classes on day $k$. Our analysis of this process requires intricate estimates for degree-constrained random graph models using graph enumeration tools from the work of McKay and Wormald as well as Canfield, Greenhill, and McKay, and their extensions by Liebenau and Wormald. In doing so, we connect the discrete dynamics to a deterministic idealized process, whose leading-order behavior is described by conditional Gaussian probabilities and expectations.
Read the full abstract
Sound
CAL-MOS: Bridging Layers with Adapters for Robust MOS Prediction Across Speech Foundation Models
Speech Quality Assessment (SQA) is essential for modern speech technologies, and recent non-intrusive SQA predictors increasingly rely on Speech Foundation Models (SFMs). However, because SFMs expose representations from many layers, it remains unclear which depths are most informative for MOS prediction and how multi-layer information should be combined reliably across backbones and datasets. We benchmark ten SFMs on four MOS datasets under three regimes: full fine-tuning, last-layer probing with a frozen encoder, and naive cross-layer weighted aggregation. We find that the best layer is strongly backbone- and dataset-dependent, and that naive weighted fusion can be unstable across settings. We further evaluate a layer-calibrated aggregation variant that applies per-layer adapters before pooling, which improves the robustness of multi-layer fusion and narrows the gap to full fine-tuning while keeping the backbone frozen.
Read the full abstract
High Energy Astrophysical Phenomena
Measurement of Cosmic-Ray Density in the Spiral Arms toward Galactic Anticenter
Using nearly 17 years of Fermi-LAT data, we analyzed the diffuse gamma-ray emission associated with different spiral arms of the Milky Way in the ranges $l = 105^\circ$ to $145^\circ$ and $b = -5^\circ$ to $5^\circ$. The gamma-ray emissions from these spiral arms all exhibited clear pion-bump features, which can be well explained by a power-law spectrum of cosmic-ray protons. The spectral indices corresponding to the three distinct spiral arms – the Local Arm, the Perseus Arm, and the Outer Arm – are found to be approximately $-2.75$, $-2.55$, and $-2.80$, respectively. The energy densities of the cosmic rays above 10 GeV are estimated to be all around 0.2$\rm~eV~cm^{-3}$. We further compared our results with previous studies, which have established various propagation models predicting that cosmic ray density decreases and spectra soften with increasing Galactocentric radius. We found higher densities and harder spectral indices than predicted in the outer Galaxy, suggesting possible contributions from a larger halo, slower magnetic field decay, or a combination of these and other effects. In particular, the spectral hardening observed in the Perseus Arm may be attributed to locally enhanced cosmic-ray acceleration.
Read the full abstract
Numerical Analysis
A time explicit multiscale framework for heterogeneous elastic wave propagation based on multipoint stress discretization
Simulating elastic wave propagation in heterogeneous media presents significant mathematical and computational challenges, since resolving fine-scale material variations requires extremely fine spatial discretizations, while mixed stress–displacement formulations typically lead to large saddle-point systems that are not well suited for efficient time integration. Moreover, conventional multiscale reductions generally produce nontrivial coarse mass matrices, thereby requiring additional linear solves at every time step and diminishing the advantages of explicit schemes. To address these difficulties, we develop a time explicit multiscale method based on a multipoint stress control volume discretization. The central innovation is a unified spatial–temporal reduction strategy that simultaneously removes two dominant algebraic bottlenecks: the complex global fine-scale mixed solve and the repeated coarse-scale mass solve arising in conventional multiscale time stepping. More specifically, the stress and auxiliary rotation variables are eliminated locally, leading to a symmetric positive definite reduced stiffness operator, upon which a multiscale space is constructed using a density-weighted local spectral problem. The associated projected mass bilinear form preserves the physical mass inner product and gives an identity mass matrix under a density-orthonormal auxiliary basis, leading naturally to an explicit central-difference scheme. We establish discrete energy stability under a coarse-scale CFL condition and derive convergence estimates for both the density-weighted displacement and the locally recovered stress. Numerical experiments in heterogeneous media validate the theoretical results and demonstrate the effectiveness of the proposed method for elastic wave propagation.
Read the full abstract
Optimization and Control
Distributed Fast Fixed-Point Algorithms for Composite Monotone Inclusions over Networks
This paper aims to develop new and efficient distributed algorithms for solving a class of monotone inclusions, $0 \in \sum_{i=1}^n (G_ix + T_ix)$, over a connected network of $n$ agents, where the single-valued operator $G_i$ and the possibly multivalued operator $T_i$ remain private to agent $i$. Existing distributed algorithms for this problem class are primarily non-accelerated, and their exact convergence rates in the original primal space are largely unexplored. To bridge this gap, we propose two Decentralized Fast Fixed-Point-based algorithms, ND-DFFP and NI-DFFP, which integrate Nesterov-type acceleration with primal-dual techniques under two prominent settings: (i) \textit{Lipschitz continuity of $G_i$ and maximal monotonicity of $G_i+T_i$}; and (ii) \textit{co-coercivity of $G_i$ and maximal monotonicity of $T_i$}. While ND-DFFP utilizes a homogeneous network-dependent stepsize, NI-DFFP reformulates the problem into a three-operator inclusion to decouple the network topology, enabling heterogeneous network-independent stepsizes. Under appropriate assumptions, we establish an $\mathcal{O}(1/k)$ convergence rate for the consensus error and an $\mathcal{O}(1/k)$ rate for both the restricted gap function and the squared forward-backward splitting residual, with the latter two metrics evaluated at the network-average iterate or its projection onto the effective domain. Finally, numerical experiments on distributed bilinear matrix games and a virtual power plant problem demonstrate the competitive performance and computational efficiency of our methods over recent decentralized baselines in the literature.
Read the full abstract
Machine Learning
Cloud Workflow Scheduling Based on Graph Attention-Driven Hierarchical Reinforcement Learning
Dynamic cloud workflow scheduling must balance deadline satisfaction, container utilization, and energy consumption while dealing with stochastic task-execution speeds, placement-dependent communication, and coupled task and container decisions. Workflows are naturally modeled as directed acyclic graphs (DAGs), but conventional vector- or matrix-based states do not fully capture their dependency topology. To better represent task urgency and structural relationships, we assign predicted sub-deadlines to tasks and use a multi-head graph attention network (GAT) to extract dependency information from the evolving DAGs. Based on these representations, we develop a Graph Attention-Driven Hierarchical Reinforcement Learning (GA-HRL) framework and model the scheduling process as an event-driven hierarchical semi-Markov decision process (SMDP). Workflow arrivals and task completions trigger scheduling events. At each scheduling event, the Task Scheduling (TS) agent first processes the currently ready tasks by assigning them to admissible existing containers or requesting new ones. The requested containers are then processed by the Container Scheduling (CS) agent for host placement before the environment advances. The two agents are trained alternately using separate Proximal Policy Optimization (PPO). Experiments on the 2018 Alibaba cluster trace show that GA-HRL maintains competitive workflow success rate and, in settings where success is comparable, generally achieves higher container utilization and lower energy consumption. Under the largest speed variation, it trades a small success-rate margin for substantially lower energy. Simulation code is available at: https://github.com/zongjin130/GA-HRL.
Read the full abstract
Statistics Applications
Short-term forecasting of wildfire spread: A network epidemiology approach
Wildfire spread poses substantial environmental and public-health risks, motivating interpretable models for short-term forecasting. We develop a statistical framework that combines cellular automata with ideas from network epidemiology to model wildfire evolution across a spatial lattice. Each grid cell is classified as available, burning, or consumed. State transitions distinguish spread from burning neighbors, intrinsic ignition, and cessation of burning, with transition rates linked to meteorological and environmental covariates. A likelihood-based estimation procedure yields transition-specific covariate effects and probabilistic forecasts of cell states. We assess forecasting performance in a simulation study and in applications to the 2018 California wildfires and the 2019-2020 Australian wildfires. We also compare the method with a published forecasting approach using the 2017 Haypress fire. The results show strong short-term discrimination in many settings, with reduced accuracy at longer forecast horizons and during abrupt fire expansion. The framework provides an interpretable basis for studying wildfire dynamics and identifies opportunities to improve ignition forecasts through richer spatial and observation models.
Read the full abstract
Statistical Methodology
Credible Bounds for Causal Quantities with Continuous Outcomes
The problem of partial identification concerns bounding causal quantities that remain unidentifiable given the observed distribution and the causal diagram of the underlying structural causal model (SCM). While bounds have been developed for certain causal quantities with continuous outcomes, they are necessarily univariate and are unable to reflect differing levels of confidence. Building on previous work in partial identification, we propose a simple Bayesian method for deriving probabilistic bounds on a large class of causal quantities with potentially multivariate and/or continuous outcome variables.
Read the full abstract
Mathematical Physics
Boundary transmission and excursion geometry in the Lorentz mirror model: a numerical study
We study boundary transmission and excursion geometry in the planar Lorentz mirror model through finite-volume numerical experiments. Cylinder penetration quantiles grow approximately linearly with circumference over the simulated range, with a systematic upward drift in the normalized quantiles when vacancies are present. Estimated slab-transmission probabilities yield exponential confinement bounds with quantified statistical confidence at the tested widths. Planar excursions conditioned to reach a distant boundary exhibit transverse ranges proportional to the exit radius, while their repeated-visit fractions vary strongly with mirror density. Endpoint-label collision probabilities substantially exceed a general gluing lower bound, although they account for only part of the observed same-column crossing probability. Finally, rerouting at repeated vertices preserves the exit while substantially shortening the sampled paths. These findings characterize finite-volume transport and excursion geometry without determining an asymptotic scaling exponent or resolving infinite-plane localization.
Read the full abstract
Combinatorics
Conway Symbols of Frieze Patterns of Dynkin Types
In this paper, we classify the Conway symbols of the Euclidean symmetry groups of frieze patterns of Dynkin types $A_n$, $B_n$, $C_n$, $D_n$, $F_4$ and $G_2$. First, we show that the Conway symbol of a Conway–Coxeter frieze is determined by the bilateral and the central symmetry of the underlying triangulation. Secondly, we show that a frieze pattern of non-simply-laced type has the symbol ${*}\infty\infty$ or $\infty\infty$ according as its first interior row is palindromic or not, with the single exception of type $C_3$, which realises four symbols. Thirdly, we show that the same dichotomy holds for type $D_n$ with $n \ge 5$, the symbol being read off the tagged triangulation of the once-punctured polygon attached to the frieze together with the value on its puncture edges, and that type $D_4$ realises five symbols.
Read the full abstract
Systems and Control
The Heavy Chain PDE: Rapid Stabilization by Backstepping
We consider boundary stabilization of a heavy chain hanging from a moving trolley with no tip load. Because the tension vanishes at the free end, the wave speed vanishes there; in Riemann coordinates the model becomes a degenerate $2\times2$ hyperbolic system in which the coupling is singular and the free-end reflection is generated in the domain rather than by a boundary condition. We construct a Volterra backstepping transformation that maps this system to the same chain with uniform damping of an arbitrarily prescribed rate and an elastic restraint at the trolley, yielding exponential convergence of displacement, velocity, and strain to zero. The singular kernel equations are solved by selecting their bounded Frobenius branch at the free end, which replaces the missing boundary datum, and the four kernels are generated by a globally convergent power series. The transformation is boundedly invertible on the energy space, with inverse obtained by reversing the prescribed decay rate. The result extends the radial backstepping structure developed for parabolic equations on disks and balls to a degenerate hyperbolic system.
Read the full abstract
Functional Analysis
Componentwise and Measure-Sensitive Bounds for One-Dimensional Time-Frequency Localization
We prove explicit upper bounds for the number of eigenvalues of a one-dimensional time-frequency localization operator in an open transition window. An abstract residual-energy principle combines a rank-N approximant with the Hilbert-Schmidt energy of its remainder and retains the strict integer correction imposed by the open threshold. For the Fourier kernel, centered least-squares polynomials, optimized moments, and Chebyshev-Bessel truncations improve or match the diameter-Taylor certificate; on interval blocks the moment envelope gains the exact factor 1/(2N+1). Finite measurable partitions yield best-polynomial matrix and residual-energy bounds, together with two-level threshold allocations that exploit spatial or Fourier-side orthogonality and remain stable under large empty gaps. A complementary defect channel gives a componentwise variational Schatten envelope for finite interval unions. For arbitrary finite-measure hard windows, exact cross-boundary and symmetric-difference formulas give strict transition counting and a certified near-one cluster that can be subtracted from direct counts. We also treat integrable soft masks, a root-sum-square core-tail decomposition, and unbounded windows controlled by moments. An explicit unbounded finite-measure set has all polynomial moments and infinite fractional translation perimeter for every order in (0,1], yet admits an O(log(1/epsilon)/log log(1/epsilon)) certificate. Finally, kernels with finitely many bounded separated phase interactions and finite separated amplitude rank admit factorial, least-squares, Chebyshev-Bessel, span-compressed, and anisotropic-degree bounds. For bounded hard Fourier windows, the final hybrid is no larger than the corresponding earlier certificates proved here; no universal comparison with all regular-domain estimates is asserted.
Read the full abstract
Combinatorics
Long-range expanders: construction and cutoff
Long-range expansion is a combinatorial graph property introduced to construct metric spaces with strong quantitative obstructions to low-distortion embeddings. Such extremal constructions are motivated by fundamental questions in metric geometry and nonlinear functional analysis. However, the only known constructions of long-range expander sequences are random regular graphs; the problem of constructing explicit sequences, especially with logarithmic girth, remains open. We resolve this question in strong form by proving that the Ramanujan condition implies long-range expansion. In particular, classical Ramanujan constructions (such as LPS graphs) give explicit long-range expander sequences with logarithmic girth. We also clarify that long-range expansion implies spectral expansion, and both implications are strict. While long-range expansion, the Ramanujan property, and spectral expansion are strictly separated, it is a priori not clear how robust these gaps are. We next compare them from a dynamics perspective: how do the different notions of expansion affect the mixing rate of random walks? Our second main result is that, from a dynamics perspective, LRE and the Ramanujan property are equivalent. We show that the random walk on any LRE sequence has the same cutoff location and Gaussian limit profile as on a Ramanujan graph. This incidentally offers intermediate progress between cutoff for Ramanujan graphs—proven by Lubetzky and Peres—and the long-standing conjecture of cutoff for transitive spectral expanders.
Read the full abstract
Analysis of PDEs
Propagation failure in heterogeneous FitzHugh–Nagumo systems via coupled upper and lower solutions
Traveling waves are fundamental objects in reaction–diffusion systems; however, spatial heterogeneities can distort or inhibit their propagation. Determining whether a given heterogeneity results in propagation failure remains challenging, particularly in systems with coupled components. In this paper, we present explicit constructions of stationary coupled upper and lower solutions tailored to specific heterogeneities for a one-dimensional FitzHugh–Nagumo system. By leveraging the mixed quasimonotone structure of the system, these barriers yield sufficient conditions for the failure of propagation for families of trapped initial conditions. The stationary constructions establish directional signal blocking in FitzHugh–Nagumo neuron models with localized reaction heterogeneities, including light-gated ionic conductances, and with abrupt geometric variations; the resulting stationary barriers persist for sufficiently small recovery diffusion. Additionally, we introduce explicit almost stationary barriers, which provide conditional bounds on the expansion of componentwise threshold regions in homogeneous media.
Read the full abstract
Computer Vision
ThreshGuide: Class-Aware Labeled-Guided Thresholding for Semi-Supervised 3D Abdominal Multi-Organ Segmentation
Pseudo-labeling is a strong paradigm for semi-supervised medical image segmentation, yet its effectiveness is highly sensitive to confidence thresholding. In abdominal multi-organ segmentation, a fixed global threshold is particularly suboptimal because organ classes differ substantially in size, appearance, and learning difficulty. In this work, we propose ThreshGuide, a class-aware threshold adaptation framework that uses labeled data to guide pseudo-label selection on unlabeled data. Built upon a standard teacher-student architecture, the teacher model evaluates labeled samples during training to estimate class-aware threshold targets by maximizing an error-aware Fe̱ta} criterion that balances precision and coverage. These targets are then smoothed with an exponential moving average (EMA) and used to filter unlabeled voxels in a class-dependent manner. Experiments on FLARE2022 and AMOS2022 show that ThreshGuide performs competitively overall, yielding clear improvements specifically on hard-to-learn organs.
Read the full abstract
Human-Computer Interaction
The Dynamic Organization of Sustained Human-AI Cognition: From Construct-Level Change to Relational Structure
As generative artificial intelligence becomes a routine participant in writing, learning, information retrieval, analysis, decision making, and problem solving, human-AI cognition research must address not only whether AI changes psychological constructs, use intensity, or task performance, but also how human cognitive activity is organized beneath similar aggregate indicators. This article proposes a dynamic cognitive organization framework that shifts analysis from construct-level change to relational organization anchored in the person's current task-cognitive state under sustained AI participation. The framework distinguishes five relational dimensions: execution locus, cognitive governance, representational reorganization, process organization, and reachable cognitive space; it also proposes a path-specific recursive principle whereby interaction outcomes, costs, and experiences may selectively reweight future probabilities of different organizational pathways. Five sets of testable propositions follow: the same overall AI-use intensity can correspond to different cognitive organizations; similar immediate outcomes can arise from different organizations with different predictive value for proximal subsequent outcomes; longitudinal organizational change need not track overall AI-use intensity; expansion of reachable cognitive space and displacement of pre-existing or emerging human-originated pathways may coexist within one episode; and recurrent cognitive organizations may redistribute cognitive practice opportunities, with accumulated differences potentially corresponding to different developmental trajectories in strategies, habits, and abilities. The contribution is an analytic level and five-dimensional relational structure for describing, comparing, measuring, and testing process differences that aggregate indicators or construct-level analyses do not uniquely determine.
Read the full abstract
Systems and Control
Stabilization of a Heterodirectional Bradytachic (1D, 2D) PDE Pair
A scalar hyperbolic PDE, actuated at one boundary, is coupled with a fast PDE in two spatial dimensions: transport in the axial coordinate and in an internal coordinate, and possibly diffusion in the internal coordinate. Backstepping designs exist for coupled hyperbolic systems, for their ensembles, and for their continua, but in all of these the second variable of the fast subsystem carries no transport or diffusion; when it does, no design is available, and from a scalar input no exact control of the two-dimensional state is to be expected. The pair is stabilized here by time-scale separation: in the quasi-steady limit the two-dimensional subsystem collapses into a spatial Volterra operator inside a one-dimensional reduced plant, backstepping applies there, and the two-dimensional subsystem is left to be a stable boundary layer. One theorem establishes exponential stability of the pair for every time-scale ratio below an explicit threshold, uniformly in the internal diffusion coefficient down to the pure-transport case.
Read the full abstract
Number Theory
Two-term dilogarithms, mixed-base Nahm sums, and Fricke symmetry
We study the arithmetic constraints that two-term Rogers dilogarithm relations impose on rank-two Nahm systems with mixed denominator steps. Monomial complement equations give a uniform conversion to quadratic data in every algebraic degree. Within a specified ten-record simplest-cubic family, positive coupling, positive definiteness, and integer-valued exponents leave, for m > 2, exactly the steps (1,3), (1,13), and (1,31). At the smallest compatible modulus 31, the required support cannot be a multiplicative subgroup coset. Quadratic examples include known product identities and two systems for which the first radial correction excludes every individual modular sum with rational linear terms. For the index-13 system, we prove a two-term Rogers identity and recover its arguments from the matrix of a previously proved two-dimensional Fricke transformation. Its cusp growth agrees with the resulting saddle action, and an independent calculation reproduces all three leading Fricke amplitudes exactly. The associated two-summand product evaluations remain conjectural; the small rank and dimension contrast with the classical rank-five, six-component Andrews-Gordon construction at the same modulus. A mixed-signature cubic family illustrates the limits of the arithmetic restriction
Read the full abstract
Dynamical Systems
Weighted ergodic averages along subpolynomials in Hardy fields and applications
We establish new pointwise convergence results for weighted ergodic averages along sequences of the form \( (\lfloor a(n) \rfloor)_{n \in \mathbb{N}}, \) where $a(x)$ is a subpolynomial function in a Hardy field. For example, we establish pointwise convergence of logarithmic averages along sequences of the form $(\lfloor n^k + \log^{c} n \rfloor)_{n \in \mathbb{N}}$, where $k \in \mathbb{N} \cup \{0\}$ and $c > 0$. This result should be juxtaposed with the fact that either for $k=0$ or for $k \geq 2$ and for sufficiently small $c>0$ (depending on $k$), the standard ergodic averages along these sequences fail to converge pointwise. We also obtain pointwise joint ergodicity results for multiple weighted ergodic averages along slow Hardy field functions. For example, it follows from our results that for $c> 0$ and for any $f, g \in L^{\infty} (\lambda)$, \begin{equation*} \lim_{N \rightarrow \infty} \frac{1}{\log N } \sum_{n=1}^{N} \frac{1}{n} f(T_b^{\lfloor \log^c n \rfloor}x) \, g(T_G^{\lfloor \log^c n \rfloor} x) = \int f \, d \lambda \cdot \int g \, d \mu_G \quad \text{for almost every } x \in [0,1], \end{equation*} where $T_b:[0,1] \rightarrow [0,1]$ is the times-$b$ map defined by $T_b x = bx \, \bmod \, 1 $ and $T_G:[0,1] \rightarrow [0,1]$ is the Gauss map defined by $T_G(x) = \frac{1}{x} \bmod \, 1$ for $x \ne 0$ and $T_G (0) =0$. Here $\lambda$ is the Lebesgue measure on $[0,1]$ and $\mu_G$ is the Gauss measure on $[0,1]$ given by $\mu_G (A) = \frac{1}{ \log 2} \int_A \frac{1}{1+x} dx$ for any measurable set $A \subset [0,1]$.
Read the full abstract
Networking
Burst-mode timing recovery based on fourth-power phase detector for passive optical networks
Driven by the ever-increasing capacity demands, 50G passive optical network (50G-PON) is ready for practical application. It is highly challenging to realize 50GHz burst-mode analog components; therefore, based on 25GHz burst-mode analog devices, burst-mode digital signal processing (DSP) is introduced to achieve the reception and processing of 50Gb/s on-off keying burst signals. To optimize the power consumption and area of the DSP chip, a one-sample-per-symbol (1-SPS) analog-to-digital converter has been applied in 50G-PON. One of the main challenges is implementing burst-mode timing recovery (BM-TR) for the 1-SPS burst signal in 50G-PON. In this paper, we first propose a BM-TR based on the fourth-power phase detector (4PPD) for 50G-PON. We mathematically verify that 4PPD can directly compute the timing phase offset (TPO) from the 1-SPS signal without using training sequences, allowing for immediate BM-TR initialization within 20 cycles to prevent long convergence times. After the initialization, the feedback loop structure tracks the TPO changes based on the sign of 4PPD, the loop filter, and the numerically controlled oscillator. In conclusion, training-sequence-free 4PPD-based BM-TR achieves low burst overhead via fast convergence and is particularly effective for handling burst signals in 50G-PON.
Read the full abstract
Quantum Physics
Entanglement free Metrology Exploiting Multimode Hong Ou Mandel Sensor Advantage
The Hong-Ou-Mandel (HOM) interference in the multimode frequency domain has been explored for precision metrology, with several experimental demonstrations exploiting its robustness against dispersion and phase noise, as well as its large dynamic range and compatibility with fragile samples. Conventional multimode HOM metrology exploits frequency-entangled states, which naturally satisfy bosonic exchange symmetry under any centered symmetric joint spectral distribution, to provide these advantages. However, these entangled states are typically generated via spontaneous parametric down-conversion (SPDC), requiring strong pump lasers that hinder practical implementation. In this paper, we employ frequency product states, which do not possess entanglement or path-mode exchange symmetry, as the probe state and post-select measurement outcomes exhibiting frequency anti-correlation. Our results demonstrate that these advantages,peak narrowing, dispersion cancellation, phase-noise immunity, a large dynamic range, and compatibility with fragile samples, arise neither from entanglement nor from bosonic exchange symmetry, but rather from spectral anti-correlation. We further show that entanglement is not the source of the measurement precision: the entanglement-free approach attains the same quantum Fisher information as the entangled-state scheme, indicating that the fundamental precision limit does not originate from entanglement.
Read the full abstract
Robotics
Comparing Trajectories from Positions Alone: Curvature-Based Time Alignment and Drift Error Metric
In field robotics, acquiring independent large-scale reference trajectories more accurate than the evaluated estimates remains an open challenge. The domain is widely reliant on Absolute Trajectory Error (ATE) and Relative Pose Error (RPE), computed with automated tools, that rest on assumptions and evaluation parameters rarely made explicit. When unreported, the errors can be misleading and hinder fair comparisons. This paper introduces a trajectory-evaluation protocol for standardized and reliable accuracy assessment in state estimation, localization, and Simultaneous Localization And Mapping (SLAM). The approach combines a novel temporal alignment method based on curvature signals with an error metric normalized by travelled distance. We explicitly account for temporal synchronization, sampling alignment, and extrinsic calibration, quantifying their influence through a sensitivity analysis. The proposed protocol contributes to more rigorous, reproducible, and standardized trajectory evaluation.
Read the full abstract
Robotics
Exact Feasibility Certification and Optimal Responsibility Allocation for Multi-Robot CBF Safety Filters
Multi-robot Control Barrier Function (CBF) safety filters can become infeasible, but a failed quadratic program (QP) does not indicate why the conflict occurred or how to resolve it. To address this, we develop an exact feasibility certificate for multi-agent CBF filters with heterogeneous control-affine dynamics and convex input sets. The certificate quantifies a feasibility reserve by separating the demand imposed by safety constraints from the available actuator supply. This decomposition shows when CBF gain tuning or increased actuation can and cannot resolve infeasibility, and identifies the agents and interactions responsible for the conflict. We further propose an algorithm to optimally allocate shared safety constraints by maximizing the worst local feasibility margin, yielding a linear program for polyhedral input sets. In $320$ paired closed-loop simulations, the proposed allocation reduces infeasible control steps from roughly $50\%$ to $6.2\%$, and reduces safety-violating runs from $118/160$ to $24/160$. In addition, across $52$ infeasibility events, the certificate identifies an interaction whose relaxation restores feasibility in $94\%$ of cases.
Read the full abstract
Machine Learning
Cross-Block Conditioning in Deep Boltzmann Machines for Statistical Data Fusion
Statistical data fusion combines two panels that share a block of covariates but observe disjoint outcome blocks, and in its traditional form no row observes both outcomes at once. That rules out the discriminative criterion one would rather train a Deep Boltzmann Machine with, since multi-prediction training needs ground truth for whatever it holds out. We propose observed-block multi-prediction, which restricts the multi-prediction objective to targets drawn from what each row actually observes. It is well defined for any missingness pattern and reduces to the original criterion when rows are complete. Having a discriminative criterion that survives the setting lets us ask whether the joint model is needed at all, by separating what it contributes into a representation part and an inference part. On two datasets of different kinds, a consumer purchase panel and public-domain census microdata, over grids in sample size and covariate width spanning 40 cells and 200 runs per method, almost none of the fine-tuned DBM's advantage comes from generative pre-training, which is confined to the smallest sample size on one dataset and absent on the other. It comes from conditioning on one outcome block when predicting the other. This term amounts to +0.19 and +0.36 percentage points, is positive in all 40 cells, never decays as the panels grow (it is flat on one dataset and grows on the other), and requires neither a second hidden layer nor more inference. Against baselines tuned on validation and given the same conditioning, the fine-tuned DBM is the best method in 37 of the 40 cells. The imputers that can also condition on the other outcome block mostly lose accuracy when they do, whereas the DBM gains in every cell; since fusion data cannot validate that choice, this is the property that matters.
Read the full abstract
Representation Theory
On the derived Hall algebra of a graded gentle one-cycle algebra II: Serre presentation
Data Structures and Algorithms
The Complexity of Weak Partition Connectivity in Hedgegraphs
We prove that deciding whether the weak partition connectivity (WPC) of an unweighted hedgegraph is at most a given integer is NP-complete, resolving an open question about its computational complexity. Hardness holds even for connected full-support split systems, where each hedge consists of two nonempty, vertex-disjoint hyperedges covering all vertices. We also obtain hardness on connected edge-colored simple graphs in which each color class is a spanning forest with exactly two nontrivial trees. On both classes, exact computation of fractional WPC is NP-hard, whereas hedge connectivity is computable exactly in polynomial time. A binary matrix formulation yields the reduction and a deterministic polynomial-time exact algorithm under a linear intersection condition on row supports after normalization and column compression. In particular, both integer and fractional WPC are computable in polynomial time when these supports have size at most two, whereas NP-hardness holds already when their size is bounded by three. For every fixed $b$, we give deterministic and randomized efficient polynomial-time approximation schemes on hedgegraphs in which each hedge has at most $b$ connected components, counting isolated vertices. Both schemes return one partition that simultaneously approximates integer and fractional WPC. Unless $\mathrm P=\mathrm{NP}$, neither objective admits a deterministic FPTAS, even on the two hard instance classes.
Read the full abstract
Geometric Topology
The Lorenz braid index and hyperbolic volume
A result of Futer, Kalfagianni, and Purcell implies that an upper volume bound for all link complements in the 3-sphere cannot depend solely on the braid index. In this paper, we introduce the Lorenz braid index and generalise the bunch algorithm to provide a general upper volume bound for all link complements in the 3-sphere. Such an upper bound is a quadratic polynomial in the Lorenz braid index. In addition, we construct an explicit family of hyperbolic Lorenz knots for which the classical braid index and the Seifert genus both tend to infinity, while the Lorenz braid index remains bounded.
Read the full abstract
Signal Processing
Pareto-Optimal Rate-CRLB Tradeoff via Anchor Placement Optimization for UAV-Assisted 3D ISAC
This paper considers an unmanned aerial vehicle (UAV)-assisted 3D integrated sensing and communication (ISAC) system, where a UAV is deployed to communicate with a base station (BS) and simultaneously monitor a volume of interest (VoI). By exploiting the flexible placement of the UAV anchor node, we aim to characterize the Pareto optimal tradeoff between the communication rate and sensing CRLB. For the special case of a singleton VoI, the exact Pareto-optimal UAV anchor placement set is shown to be the line segment connecting the BS and the sensing target. For a radially truncated spherical sector VoI, we derive geometric conditions under which all Pareto optimal UAV locations are confined to an axial segment inside the inner radial boundary. For general VoIs, we prove the convexity of the regional worst-case CRLB in the inner region, derive a Pareto-optimal radius upper bound, and develop an efficient algorithm to find the Pareto-optimal UAV anchor node placement. Numerical results validate the analytical placement structures and demonstrate that our proposed design achieves significantly enlarged rate-CRLB region over benchmark schemes.
Read the full abstract
Group Theory
Solvable Supplements to Normalizers of Cyclic 2-Subgroups
Amberg and Kazarin proved that a finite group is solvable if the normalizer of every cyclic subgroup of prime power order has a solvable supplement. We substantially relax this hypothesis by requiring it only for cyclic $2$-subgroups. This condition, denoted by $\mathrm{SSN}_2$, sharply restricts the nonabelian composition factors of the group to the family $\PSL_2(q)$, where $q\geq7$ is a prime power satisfying $q\equiv3\pmod4$. Conversely, this family is precisely the nonabelian finite simple groups that satisfy $\mathrm{SSN}_2$. Consequently, a finite group satisfying $\mathrm{SSN}_2$ is solvable if and only if it has no section isomorphic to one of these groups.