arXiv subjects

Yuhan Jiang

Publications and source records attributed to Yuhan Jiang.

At least 19 recordsLinked to original sources

arXiv2026

MAGNETAR: Multipath-Guided Spatial Posteriors for Transmitter Pose Inference in the Upper Mid-Band

Robots that localize a radio transmitter need more than a point estimate: in cluttered rooms, one measurement is often consistent with several transmitter locations and, because upper-mid-band antennas are directional, several headings. We present MAGNETAR, which infers a joint posterior over planar transmitter position and heading from a single asynchronous radio-frequency (RF) multipath snapshot, represented by angle-of-arrival and signal-to-noise-ratio estimates, given the room layout and receiver pose. Among our five neural scorers, MAGNETAR adopts a shared 2D U-Net conditioned on each candidate heading, jointly normalizing scores over a discretized position-heading grid. Training uses real-to-sim-calibrated 10 GHz simulations and a small measured subset. Grid-based joint posteriors outperform parametric ones on held-out simulations, the heading-conditioned scorer transfers best to robotic measurements, and fusing joint posteriors improves on fusing position-only marginals.

cs.RO↗

arXiv2026

Covariance-Weighted Spectral Delay Fusion With a One-Dimensional Affine Model for High-Precision Distributed Optical-Fiber Sensing

Periodic disturbances can produce ambiguous delay estimates, limiting reliable high-precision localization in distributed optical-fiber sensing. We develop spectral delay fusion for a sensing system using a dual-wavelength bidirectional Mach-Zehnder interferometer, with four phase traces recovered by heterodyne detection and digital demodulation. With calibrated propagation parameters and timing offsets fixed, the six pairwise delay predictions form a one-dimensional affine line segment parameterized by the position of a single dominant disturbance, with sensitivities determined by propagation direction and chromatic dispersion. A generalized least-squares estimator combines unwrapped delays from robust cross-spectral phase slopes with wrapped delays from polarity-invariant phase alignment to jointly estimate position and integer ambiguities under the proposed model, using an effective joint covariance to account for shared-channel and cross-representation dependence. Experiments use a 131.335-km sensing fiber at 1530 and 1550 nm, with periodic phase perturbations applied at five nominal positions from 25 to 125 km. Across the reported groups of 20 records, the proposed method yields sample standard deviations of 1.007-1.685 m at a drive voltage of 500 mV and 0.449-1.324 m at 1 V. The ratio of the smallest single-pair sample standard deviation to that of the proposed method ranges from 2.57 to 19.56 at 500 mV and from 2.12 to 2900 at 1 V. The upper ratio reflects unstable single-pair phase-slope delay estimates for periodic disturbances in the 1-V, nominal 50-km group, where the proposed covariance-weighted fusion maintains meter-scale localization repeatability.

eess.SP↗

arXiv2026

Type $B$ fermionic coinvariant rings

Let $\mathfrak{B}_n$ denote the hyperoctahedral group. The type $B$ coinvariant rings $R_{\mathfrak{B}_n}^{(k,j)}$ are quotients of the ring of polynomials in $k$ sets of $n$ commuting variables and $j$ sets of $n$ anticommuting variables by the ideal generated by the diagonal $\mathfrak{B}_n$-invariants without constant term. Building upon the work of Kim--Rhoades (2022), we give an explicit formula for the bigraded Frobenius series of $R_{\mathfrak{B}_n}^{(0,2)}$: the bigraded multiplicity of each irreducible $\mathfrak{B}_n$-character is a single Schur polynomial, so $R_{\mathfrak{B}_n}^{(0,2)}$ is multiplicity-free as a $\operatorname{GL}_2 \times \mathfrak{B}_n$-module. We then determine that the trigraded multiplicity of the sign character of $R_{\mathfrak{B}_n}^{(0,3)}$ is given by a single Schur function. Finally, for all $k$ and $j$, we determine the multiplicity of the standard character in the type $A$ coinvariant ring $R_{n}^{(k,j)}$, as well as the multiplicities of the characters indexed by the bipartitions $((n-1),(1))$ and $((n-1,1),\varnothing)$ in $R_{\mathfrak{B}_n}^{(k,j)}$. These are the first nontrivial characters established for all $(k,j)$ in either of types $A$ or $B$.

math.CO↗

arXiv2026

Correlated decoherence in a common environment activated by relative motion

We study two spatially separated boundary subsystems coupled to a common structured environment under relative motion within a Gaussian open-system framework. By integrating out the environment, we obtain an influence functional governed by a dressed environmental correlator evaluated at the boundary positions. Its retarded and Hadamard components govern coherent mediation and correlated fluctuations, respectively. Relative motion activates the leading resonant contribution to correlated decoherence through Doppler-shifted spectral overlap of the boundary excitations. For identical boundary dispersions, this contribution has an ideal narrow-linewidth onset at $v>2u_ϕ$. Below this value, no resonant momentum shell exists, whereas above it a finite shell opens and produces an enhanced correlated-decoherence contribution. Finite spectral linewidth generates subthreshold tails and rounds the ideal onset into a crossover centered on the same kinematic condition. The leading resonant contributions to motion-induced excitation production and correlated decoherence probe the same on-shell environmental structure. The proposed readout of this two-subsystem reduced-dynamics signature uses either differential-coherence measurements or a two-node noise cross-spectrum.

quant-ph↗

arXiv2026

A decomposition of $m$-Dyck paths

We construct a decomposition of an $m$-Dyck path into an $m$-tuple of Dyck paths such that the area sequence and bounce sequence of the $m$-Dyck path are entrywise the sum of the area sequences and bounce sequences of the Dyck paths in the tuple.

math.CO↗

arXiv2026

Coherent Control of Three-Level System Using Shaped Free Electrons

Three-level systems exhibit quantum interference effects absent in two-level systems, making them important for quantum optics. Here, we study the coherent interaction of a Lambda-type three-level system with free electrons shaped by optical near fields. By treating the electron train as a quantum drive, we show that the interplay between electron modulation and the three-level system's transition pathways induces tunable interference patterns. This interaction effectively realizes electron-mediated coherent population trapping (CPT). We identify a regime that enables complete population transfer between the two lower states and the preparation of a high-coherence superposition, manifested as dark states. In particular, these driven-dissipative steady states are independent of the initial state. Our work proposes shaped free electrons as a platform for steady-state coherent control of three-level systems, enabling atomic-scale state engineering.

quant-ph↗

arXiv2026

Constructing coherent spatial memory in LLM agents through graph rectification

Given a map description through global traversal navigation instructions, an LLM can often infer the implicit spatial layout and answer user queries by providing shortest paths. However, such context-dependent querying becomes incapable as environments grow larger, motivating the need for incremental map construction that builds a complete topological graph from stepwise observations. We propose LLM-MapRepair, a framework for LLM-driven construction and map repair, designed to detect, localize, and correct structural inconsistencies in incrementally constructed navigation graphs. Our contributions include a Version Control mechanism for graph construction, an Edge Impact Score for repair prioritization, and a cleaned variant of the MANGO benchmark tailored for LLM-driven map construction and repair. We evaluate the framework on four evaluation settings: a synthetic per-component ablation (gpt-4.1, n=20 seeds per cell), a cross-vendor sweep over seven LLMs from OpenAI, Anthropic, and Google on both synthetic and TextWorld procedurally-generated text-adventure games, a repair-stage evaluation on all 42 cleaned-MANGO games with non-zero residual conflicts (534 conflicts; three vendors x three modes plus two non-LLM references), and an end-to-end natural-text deployment on Chapters 16-17 of Dream of the Red Chamber. On the DRC deployment, LLM-MapRepair achieves 94.3% node recall (+8.6 pp over direct LLM mapping) and 88.2% edge recall (+55.8 pp), using GPT-4.1; the recall improvements come with predicted node and edge counts that are roughly 4x the ground-truth counts (Table 4), reflecting the discretization-driven over-generation trade-off we discuss in the Limitations.

cs.AI↗

arXiv2026

Stochastic first-passage modeling of single-event burnout in SiC power MOSFETs

Single-event burnout (SEB) in silicon carbide (SiC) power MOSFETs is often characterized by deterministic threshold quantities. Near the boundary between recovery and runaway, stochastic variability can make this threshold description probabilistic rather than sharp. This work introduces a first-passage perspective for stochastic threshold broadening in burnout. The process is described by a reduced electrothermal feedback-relaxation model with an absorbing boundary. The model combines carrier multiplication, avalanche feedback, localized heating, carrier loss, and thermal relaxation. Stochastic carrier and thermal terms represent unresolved event-level variability. The main finding is that finite fluctuations broaden the deterministic burnout threshold into a probabilistic transition band. Noise-induced subthreshold runaway also emerges, where nominally recoverable conditions can still fail through rare stochastic excursions. First-passage-time distributions resolve the time scale of burnout and survival probabilities further distinguish rapid feedback-dominated runaway from delayed stochastic failure. A feedback-relaxation phase diagram organizes recoverable, probabilistic, and rapidly unstable regimes. This framework provides a statistical-physics interpretation of threshold dispersion in single-event burnout of SiC power MOSFETs by linking coarse-grained electrothermal dynamics to probabilistic and time-resolved failure observables.

cond-mat.stat-mech↗

arXiv2025

FSG-Net: Frequency-Spatial Synergistic Gated Network for High-Resolution Remote Sensing Change Detection

Change detection from high-resolution remote sensing images lies as a cornerstone of Earth observation applications, yet its efficacy is often compromised by two critical challenges. First, false alarms are prevalent as models misinterpret radiometric variations from temporal shifts (e.g., illumination, season) as genuine changes. Second, a non-negligible semantic gap between deep abstract features and shallow detail-rich features tends to obstruct their effective fusion, culminating in poorly delineated boundaries. To step further in addressing these issues, we propose the Frequency-Spatial Synergistic Gated Network (FSG-Net), a novel paradigm that aims to systematically disentangle semantic changes from nuisance variations. Specifically, FSG-Net first operates in the frequency domain, where a Discrepancy-Aware Wavelet Interaction Module (DAWIM) adaptively mitigates pseudo-changes by discerningly processing different frequency components. Subsequently, the refined features are enhanced in the spatial domain by a Synergistic Temporal-Spatial Attention Module (STSAM), which amplifies the saliency of genuine change regions. To finally bridge the semantic gap, a Lightweight Gated Fusion Unit (LGFU) leverages high-level semantics to selectively gate and integrate crucial details from shallow layers. Comprehensive experiments on the CDD, GZ-CD, and LEVIR-CD benchmarks validate the superiority of FSG-Net, establishing a new state-of-the-art with F1-scores of 94.16%, 89.51%, and 91.27%, respectively. The code will be made available at https://github.com/zxXie-Air/FSG-Net after a possible publication.

cs.CV↗

arXiv2025

Rowmotion and Echelonmotion

Given a linear extension $σ$ of a finite poset $R$, we consider the permutation matrix indexing the Schubert cell containing the Cartan matrix of $R$ with respect to $σ$. This yields a bijection $\mathrm{Ech}_σ\colon R\to R$ that we call echelonmotion; it is the inverse of the Coxeter permutation studied by Klász, Marczinzik, and Thomas. Those authors proved that echelonmotion agrees with rowmotion when $R$ is a distributive lattice. We generalize this result to semidistributive lattices. In addition, we prove that every trim lattice has a linear extension with respect to which echelonmotion agrees with rowmotion. We also show that echelonmotion on an Eulerian poset (with respect to any linear extension) is an involution. Finally, we initiate the study of echelon-independent posets, which are posets for which echelonmotion is independent of the chosen linear extension. We prove that a lattice is echelon-independent if and only if it is semidistributive. Moreover, we show that echelon-independent connected posets are bounded and have semidistributive MacNeille completions.

math.CO↗

arXiv2025

The Ehrhart series of alcoved polytopes

Alcoved polytopes are convex polytopes, which are the closure of a union of alcoves in an affine Coxeter arrangement. They are rational polytopes and, therefore, have Ehrhart quasipolynomials. Here we describe a method for computing the generating function of the Ehrhart quasipolynomial, or Ehrhart series, of any alcoved polytope via a particular shelling order of its alcoves. We also show a connection between Early's decorated ordered set partitions and this shelling order for the hypersimplex $Δ_{2,n}$.

math.CO↗

arXiv2025

The Ehrhart $h^*$-polynomials of positroid polytopes

A positroid is a matroid realized by a matrix such that all maximal minors are non-negative. Positroid polytopes are matroid polytopes of positroids. In particular, they are lattice polytopes. The Ehrhart polynomial of a lattice polytope counts the number of integer points in the dilation of that polytope. The Ehrhart series is the generating function of the Ehrhart polynomial, a rational function with a numerator called the $h^*$-polynomial. We give explicit formulas for the $h^*$-polynomials of an arbitrary positroid polytope regarding permutation descents. Our result generalizes that of Early, Kim, and Li for hypersimplices.

math.CO↗

arXiv2024

Securing FC-RIS and UAV Empowered Multiuser Communications Against a Randomly Flying Eavesdropper

This paper investigates a wireless network consisting of an unmanned aerial vehicle (UAV) base station (BS), a fully-connected reconfigurable intelligent surface (FC-RIS), and multiple users, where the downlink signal can simultaneously be captured by an aerial eavesdropper at a random location. To improve the physical-layer security (PLS) of the considered downlink multiuser communications, we propose the fully-connected reconfigurable intelligent surface aided round-robin scheduling (FCR-RS) and the FC-RIS and ground channel state information (CSI) aided proportional fair scheduling (FCR-GCSI-PFS) schemes. Thereafter, we derive closed-form expressions of the zero secrecy rate probability (ZSRP). Numerical results not only validate the closed-form ZSRP analysis, but also verify that the proposed GCSI-PFS scheme obtains the same performance gain as the full-CSI-aided PFS in FC-RIS-aided communications. Furthermore, optimizing the hovering altitude remarkably enhances the PLS of the FC-RIS and UAV empowered multiuser communications.

eess.SP↗

arXiv2024

The doubly asymmetric simple exclusion process, the colored Boolean process, and the restricted random growth model

The multispecies asymmetric simple exclusion process (mASEP) is a Markov chain in which particles of different species hop along a one-dimensional lattice. This paper studies the doubly asymmetric simple exclusion process $\mathrm{DASEP}(n,p,q)$ in which $q$ particles with species $1, \dots, p$ hop along a circular lattice with $n$ sites, but also the particles are allowed to spontaneously change from one species to another. In this paper, we introduce two related Markov chains called the colored Boolean process and the restricted random growth model, and we show that the DASEP lumps to the colored Boolean process, and the colored Boolean process lumps to the restricted random growth model. This allows us to generalize a theorem of David Ash on the relations between sums of steady state probabilities. We also give explicit formulas for the stationary distribution of $\mathrm{DASEP}(n,2,2)$.

math.CO↗

arXiv2023

Critical transitions on route to chaos of natural convection on a heated horizontal circular surface

The transition route and bifurcations of the buoyant flow developing on a heated circular horizontal surface are elaborated using direct numerical simulations and direct stability analysis. A series of bifurcations, as a function of Rayleigh numbers (Ra) ranging from $10^1$ to $6\times10^7$, are found on the route to the chaos of the flow at $Pr=7$. When $Ra<1.0\times10^3$, the buoyant flow above the heated horizontal surface is dominated by conduction, because of which distinct thermal boundary layer and plume are not present. At $Ra=1.1\times10^6$, a Hopf bifurcation occurs, resulting in the flow transition from a steady state to a periodic puffing state. As Ra increases further, the flow enters a periodic rotating state at $Ra=1.9\times10^6$, which is a unique state that was rarely discussed in the literature. These critical transitions, leaving from a steady state and subsequently entering a series of periodic states (puffing, rotating, flapping and doubling) and finally leading to chaos, are diagnosed using spectral analysis and two-dimensional Fourier Transform (2DFT). Moreover, direct stability analysis is conducted by introducing random numerical perturbations into the boundary condition of the surface heating. We find that when the state of a flow is in the vicinity of bifurcation points (e.g., $Ra=2.0\times10^6$), the flow is conditionally unstable to perturbations, and it can bifurcate from the rotating state to the flapping state in advance. However, for relatively stable flow states, such as at $Ra=1.5\times10^6$, the flow remains its periodic puffing state even though it is being perturbed.

physics.flu-dyn↗

arXiv2022

Joint Reconfigurable Intelligent Surface Location and Passive Beamforming Optimization for Maximizing the Secrecy-Rate

The physical layer security (PLS) is investigated for reconfigurable intelligent surface (RIS) assisted wireless networks, where a source transmits its confidential information to a legitimate destination with the aid of a single small RIS in the presence of a malicious eavesdropper. A new joint RIS location and passive beamforming (J-LPB) optimization scheme is proposed for the sake of maximizing the secrecy rate under the RIS location constraint and the constraint that the modulus of the reflecting coefficient at each RIS's unit is not larger than 1. Specifically, we analyze the optimal location of the RIS, and conclude that the product involving the source-RIS distance and the RIS-destination distance should be minimized. Since the product minimization problem is nonconvex, we then propose a two-tier optimization algorithm for solving it. Based on the near-optimal RIS 3D location obtained, we further formulate the passive beamforming optimization problem, and then propose to apply the Charnes-Cooper transformation along with the sequential rank-one constraint relaxation (SROCR) algorithm to solve it. Our numerical results show that the secrecy rate of the proposed J-LPB optimization scheme is higher than that of the benchmarks. Explicitly, we use the following benchmarks: the near-source-based RIS location and passive beamforming (NSB-LPB) optimization scheme, the near-destination-based RIS location and passive beamforming (NDB-LPB) optimization scheme, and the random RIS location and passive beamforming (R-LPB) optimization scheme. Finally, the benefits of our J-LPB scheme are further increased with the number of RIS units.

cs.IT↗

arXiv2021

Bad Projections of the PSD Cone

The image of the cone of positive semidefinite matrices under a linear map is a convex cone. Pataki characterized the set of linear maps for which that image is not closed. The Zariski closure of this set is a hypersurface in the Grassmannian. Its components are the coisotropic hypersurfaces of symmetric determinantal varieties. We develop the convex algebraic geometry of such bad projections, with focus on explicit computations.

math.AG↗

arXiv2020

Linear Spaces of Symmetric Matrices with Non-Maximal Maximum Likelihood Degree

We study the maximum likelihood degree of linear concentration models in algebraic statistics. We relate the geometry of the reciprocal variety to that of semidefinite programming. We show that the Zariski closure in the Grassmanian of the set of linear spaces that do not attain their maximal possible maximum likelihood degree coincides with the Zariski closure of the set of linear spaces defining a projection with non-closed image of the positive semidefinite cone. In particular, this shows that this closure is a union of coisotropic hypersurfaces.

math.AG↗