SearcharxivSearch

arXiv subjects

Yong Lu

Publications and source records attributed to Yong Lu.

At least 19 recordsLinked to original sources

Quantum-hardware spectral co-design framework for multifrequency Rydberg electrometry

Engineering electromagnetic hardware to satisfy discrete quantum-defined spectral constraints constitutes a general spectral co-design problem for quantum systems. Here we address this challenge in multifrequency Rydberg electrometry by directly coupling a fabrication-constrained simultaneous perturbation stochastic approximation (SPSA)--Adam optimizer to full-wave finite-element eigenmode simulations. Requiring neither analytical nor adjoint gradients, the method operates over a discrete design space containing approximately $10^{300}$-configurations and yields a novel multimode electrometry architecture that simultaneously aligns four high-$Q$ eigenmodes with four selected Cs Rydberg transitions. The optimized design remains highly robust to fabrication imperfections, achieving a relative frequency error as low as $8.42\times10^{-7}$ while reducing the device length by a factor of $1.75\times10^{2}$, thereby overcoming the difficulty of simultaneous multimode spectral matching encountered in conventional design. For a comparable simulation budget, the proposed co-design framework achieves frequency-matching errors approximately 10 and 41 times smaller than those of covariance matrix adaptation evolution strategy and discrete simulated annealing, respectively. The electrometry is predicted to provide an average input-power-sensitivity enhancement of approximately $4.04\times10^{3}$, demonstrating quantum--hardware spectral co-design as a general route toward compact hardware for multichannel quantum sensing.

quant-ph

Exact random covers of metric trees: balanced rounding, duality, and sharp thresholds

Norin and Turcotte's asymptotically sharp bound for graph burning [J. Combin. Theory Ser. B 168 (2024), 208--235] led them to an exact random-cover conjecture for finite metric trees. Let $U[0,r]$ be the uniform probability measure on $[0,r]$. They conjectured that every finite metric tree $T$ of length $L\ge2r$ admits a probability measure on $0$-good ball covers whose expected radius measure is at most $(L/r)U[0,r]$. We prove the conjecture for every finite metric tree. We recast the bootstrapping calculation of Norin and Turcotte as a zero-error replacement certificate. The resulting local scale reduction, together with a three-piece decomposition and a macro-recursion, produces a fractional marked-ball cover with the exact radius budget. We then pass from the fractional cover to random finite covers by a compact rounding argument. For metric-tree balls, Tamir's balancedness theorem and standard balanced-matrix ideality provide the finite-dimensional integrality input. We also prove an arbitrary-budget duality criterion. If $0<R\le L$ and $\beta$ is a finite positive Borel measure on $[0,R]$, then $\beta$ dominates the expected radius measure of a random $0$-good cover if and only if $\sigma(T)\le\int_{[0,R]}\max_{v\in T}\sigma(B_T(v,s))\,d\beta(s)$ for every finite positive Borel measure $\sigma$ on $T$; it is enough to test finite atomic measures. We use this criterion to extend the uniform range to every $r\le L-\operatorname{diam}(T)/2$, determine the exact range for equal-arm metric stars, and derive deterministic bounds, interval rigidity, and a diameter-defect stability estimate.

math.CO

A Proof of the Chen--Raspaud Conjecture

For every integer $k\ge2$, Chen and Raspaud conjectured that each graph $G$ with odd girth $\og(G)\ge2k+1$ and maximum average degree $\mad(G)<2+1/k$ has a $(2k+1:k)$-coloring. In this paper, we prove the conjecture.

math.CO

Optimal convergence rates of the Klein-Gordon-Schr\"odinger system in the nonrelativistic limit

In this paper, we study the Klein-Gordon-Schr\"{o}dinger system in the nonrelativistic regime $\epsilon \to 0$, where $\epsilon$ is proportional to the inverse of the speed of light. We show that the Klein-Gordon-Schr\"{o}dinger system converges to a system of decoupled linear Schr\"odinger equations over a long time interval of order $\epsilon^{-1}$ with error estimates of the form $(1+t)\epsilon^2$; in particular, the error estimate for the Schr\"odinger component is uniform in time of the form $\epsilon^{2}$ The specific forms of the error estimates coincide with the numerical results shown by Bao et a.l., and the $O(\epsilon^{2})$ convergence rates coincide with the order of initial error, and thus are optimal.

math.AP

Hamiltonian cycles in 7-tough $(P_4\cup P_1)$-free graphs

Shan~[J. Graph Theory (2026)] proved that every 23-tough $(P_4\cup P_1)$-free graph on at least three vertices is Hamiltonian. We improve this bound to 7 by replacing the final cut analysis in Shan's framework with an asymmetric separation criterion and a cograph covering lemma.

math.CO

Homogenization of the Navier-Stokes-Cahn-Hilliard system in the small-hole regime

This paper investigates the homogenization of the 3D Navier--Stokes--Cahn--Hilliard (NSCH) system in domains containing a large number of solid obstacles (named holes). Each hole has diameter of order $\varepsilon^{\alpha}(\alpha>3)$, where $\varepsilon > 0$ denotes the small length scale for inter-hole separation. Both viscosity and mobility depend on the phase-field variable. We establish two distinct asymptotic regimes: if the capillary strength $\lambda_\varepsilon\to \lambda>0$ as $\varepsilon\to 0$, the limit system coincides with the original NSCH system; if $\lambda_\varepsilon\to 0$ as $\varepsilon\to 0$, the scaled velocity, phase field and chemical potential converge to a weak solution to a Stokes--Cahn--Hilliard (SCH) system. To the best of our knowledge, this work constitutes the first rigorous homogenization analysis for evolutionary NSCH flows with phase-dependent viscosity and mobility under the subcritical hole scaling.

math.AP

Homogenization of a non-homogeneous incompressible heat-conducting fluid in perforated domains

This paper provides the study of the homogenization of the 3D non-homogeneous incompressible heat-conducting fluid in perforated domains with holes of subcritical size, where the viscosity and the heat conductivity coefficient are assumed to depend on the temperature. The diameter of the holes is of order $\varepsilon^{\alpha} \ (\alpha>3)$, where $\varepsilon > 0$ is a small parameter that measures the mutual distance between the holes. We prove that as $\varepsilon\to 0$, the limit behavior of velocity, density and temperature is governed by the original system in homogeneous domain without holes.

math.AP

Qualitative and quantitative homogenization of some non-Newtonian flows in perforated domains: case of `small holes'

We consider the homogenization of three dimensional viscous incompressible non-Newtonian flows satisfying certain general $r$-structure in perforated domains. We focus on the case of `small holes' by assuming the holes under consideration are of size $\varepsilon^{\alpha}$ with $\alpha >3$, where $\varepsilon$ is the perforation parameter used to measure the mutual distance between the holes. We show the limit equations remain unchanged in the homogenization limit under the constraint $ \frac{6(\alpha - 1)}{4\alpha-5}< r<3-\frac{3}{\alpha}$, which seems optimal in the sense of Sobolev capacity of holes as explained in Remark 1.3. Quantitative convergence rates are further derived for both the velocity field and the pressure. To the best of our knowledge, both the qualitative and quantitative homogenization results are firstly given for non-Newtonian flows in the `small holes' case.

math.AP

Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical

A graph $G$ is called $k$-factor-critical if after deleting any $k$ vertices the remaining subgraph still has a perfect matching. Fan and Lin [Adv. in Appl. Math. 174 (2026) 103019] posed an adjacency spectral condition for a graph with minimum degree to be $k$-factor-critical. A graph $G$ is fractional $k$-factor-critical if after deleting any $k$ vertices the remaining subgraph still has a fractional perfect matching. Clearly, the fractional $k$-factor-criticality of a graph is a necessary property for a graph to be $k$-factor-critical. Jia, Fan and Liu [Discrete Appl. Math. 386 (2026) 255-263] proposed a tight sufficient condition in terms of the spectral radius for a graph with fractional $k$-factor-criticality to be $k$-factor-critical. A natural question arises: can we derive analogous sufficient conditions by incorporating the minimum degree parameter of graphs? We first establish a lower bound on the size to ensure that a $(k+1)$-connected graph with fractional $k$-factor-criticality is $k$-factor-critical, where $k$ is a positive integer with $k\geq1$. Moreover, we provide a sufficient condition in terms of the spectral radius for a $(k+1)$-connected graph with fractional $k$-factor-criticality to be $k$-factor-critical. Our results generalize the result of Jia, Fan and Liu to $(k+1)$-connected graphs. Furthermore, our spectral conditions apply to a broader family of connected graphs compared with the results of Fan and Lin, as well as Jia et al.

math.CO

Sufficient conditions for spanning $k$-trees in tough graphs

The toughness of a graph $G$, denoted by $\tau(G)$, is defined by $\tau(G)=$min $\{\frac{|S|}{c(G-S)}:S\subseteq V(G)$ and $c(G-S)\geq2\}$. A graph $G$ is said to be $\tau$-tough if $\tau(G)\geq \tau$. Let $k\geq2$ be an integer. A tree $T$ is called a $k$-tree if $d_{T}(v)\leq k$ for each $v\in V(T)$, that is, the maximum degree of a $k$-tree is at most $k$. A $k$-tree $T$ is a spanning $k$-tree if $T$ is a spanning subgraph of a connected graph $G$. In 1989, Win [Graphs Combin. 5 (1989) 201--205] proved that if $\tau(G)\geq\frac{1}{k-2}$, where $k\geq3$, then $G$ contains a spanning $k$-tree. Liu, Fan and Shu [Discrete Math. 348 (2025) 114593] provided a tight sufficient condition based on the spectral condition for connected $\frac{1}{k}$-tough and $\frac{1}{k-1}$-tough graphs to contain a spanning $k$-tree, where $k\geq3$ is an integer. A natural and interesting problem arises: Can the value of $\tau$ be refined? When $\frac{1}{k-2}>\tau\geq\frac{1}{k-1}$, we initially establish a lower bound on the size to ensure that a connected $\frac{t}{t(k-2)+1}$-tough graph $G$ contains a spanning $k$-tree, where $k\geq3$ and $t\geq1$ are integers. Meanwhile, we provide two sufficient conditions in terms of spectral radius and signless Laplacian spectral radius for a connected $\frac{t}{t(k-2)+1}$-tough graph $G$ to contain a spanning $k$-tree, where $k\geq3$ and $t\geq1$ are integers. When $t=1$, we obtain the result $\eta=1$ from Liu, Fan and Shu.

math.CO

Some sufficient conditions for a graph with minimum degree to be $k$-critical with respect to $[1,b]$-odd factors

A graph $G$ is $k$-factor-critical if $G-S$ has a perfect matching for every subset $S \subseteq V(G)$ with $|S|=k$. A spanning subgraph $H$ of $G$ is called a $[1,b]$-odd factor if $b \equiv 1 \pmod{2}$ and $d_{H}(v) \in\left\lbrace 1, 3, \ldots, b\right\rbrace$ for every $v\in V(G),$ where $d_{H}(v)$ denotes the degree of vertex $v$ in $H$. Moreover, $G$ is said to be $k$-critical with respect to $[1,b]$-odd factors if $G-X$ contains a $[1,b]$-odd factor for every subset $X \subseteq V(G)$ with $|X|=k$. In this paper, we provide some sufficient conditions based on the distance spectral radius and the distance signless Laplacian spectral radius for a graph with minimum degree to be $k$-critical with respect to $[1,b]$-odd factors.

math.CO

The existence of even factors based on the $A_\alpha$-spectral radius of graphs

An even factor of $G$ is a spanning subgraph $F$ such that every vertex in $F$ has a nonzero even degree. Note that $\delta(G)\geq2$ is a trivial necessary condition for a graph to have an even factor, where $\delta(G)$ is the minimum degree of $G$. In this paper, for a connected graph $G$ with minimum degree $\delta$, we establish a lower bound on the $A_\alpha$-spectral radius of $G$ such that $G$ contains an even factor.

math.CO

Weak solutions and weak-strong uniqueness for a compressible power-law-Oldroyd--B fluid model

We consider a model of a viscoelastic compressible flow in $R^{3}$ which is additionally shear thickening (the stress tensor corresponds to the power law model, however, the divergence of the velocity is due to the model bounded). We prove existence of a weak solution to this model provided the growth in the power law model is larger or equal than $\frac 52$. We also prove that any sufficiently smooth solution of this model is unique in the class of weak solution, provided extra integrability of the initial value for the extra stress tensor is assumed.

math.AP

Error estimates in the non-relativistic limit for the two-dimensional cubic Klein-Gordon equation

In this paper, we study the non-relativistic limit of the two-dimensional cubic nonlinear Klein-Gordon equation with a small parameter $0<\varepsilon \ll 1$ which is inversely proportional to the speed of light. We show the cubic nonlinear Klein-Gordon equation converges to the cubic nonlinear Schr\"{o}dinger equation with a convergence rate of order $O(\varepsilon^2)$. In particular, for the defocusing case with high regularity initial data, we show error estimates of the form $C(1+t)^N \varepsilon^2$ at time $t$ up to a long time of order $\varepsilon^{-\frac{2}{N+1}}$, while for initial data with limited regularity, we also show error estimates of the form $C(1+t)^M\varepsilon$ at time $t$ up to a long time of order $\varepsilon^{-\frac{1}{M+1}}$. Here $N$ and $M$ are constants depending on initial data. The idea of proof is to reformulate nonrelativistic limit problems to stability problems in geometric optics, then employ the techniques in geometric optics to construct approximate solutions up to an arbitrary order, and finally, together with the decay estimates of the cubic Schr\"{o}dinger equation, derive the error estimates.

math.AP

Correlation Matrix Method for Phonon Quasiparticles

Phonon anharmonicity is ubiquitous in real materials and is crucial for understanding thermal properties and phase stability. In this work, we show that anharmonic phonon modes can be obtained by maximizing their vibration stability during fitting the atomic trajectory. We prove that all information about these quasiparticles is contained in two small correlation matrices $\mathcal{S}$ and $\mathcal{Q}$, which can be constructed directly from molecular dynamics simulations. Based on these matrices, we proposed an optimization scheme, which allows us to efficiently determine temperature-dependent phonon modes along with their frequencies and lifetimes. We verified this method by applying it to silicon and cubic CaSiO$_3$, where it successfully captured their temperature-dependent phonon behaviors and the well-known phonon softening in cubic CaSiO$_3$. This theory provides a convenient tool for investigating phonon quasiparticles and can be extended to study other quasiparticles, such as electrons, holes, and magnons.

cond-mat.mtrl-sci

Scattering number and $\tau$-toughness in graphs involving $A_\alpha$-spectral radius

The scattering number $s(G)$ of graph $G=(V,E)$ is defined as $s(G)$=max\big\{$c(G-S)-|S|$\big\}, where the maximum is taken over all proper subsets $S\subseteq V(G)$, and $c(G-S)$ denotes the number of components of $G-S$. In 1988, Enomoto introduced a variation of toughness $\tau(G)$ of a graph $G$, which is defined by $\tau(G)$=min\big\{$\frac{|S|}{c(G-S)-1}$, $S\subseteq V(G)$ and $c(G-S)>1$\big\}. Both the scattering number and toughness are used to characterize the invulnerability or stability of a graph, i.e., the ability of a graph to remain connected after vertices or edges are removed. The smaller the value of $s(G)$ (or the larger the value of $\tau(G)$), the stronger the connectivity of a graph $G$. The $A_{\alpha}$-spectral radius of $G$ is denoted by $\rho_{\alpha}(G)$. Using typical $A_{\alpha}$-spectral techniques and structural analysis, we present a sufficient condition such that $s(G)\leq 1$. This result generalizes the result of Chen, Li and Xu [Graphs Comb. 41 (2025)]. Furthermore, we establish a sufficient condition with respect to the $A_{\alpha}$-spectral radius for a graph to be $\tau$-tough. When $\alpha=\frac{1}{2}$, our result reduces to that of Chen, Li and Xu [Graphs Comb. 41 (2025)].

math.CO

Improved bounds on the $H$-rank of a mixed graph in terms of the matching number and fractional matching number

A mixed graph $\widetilde{G}$ is obtained by orienting some edges of a graph $G$, where $G$ is the underlying graph of $\widetilde{G}$. Let $r(\widetilde{G})$ be the $H$-rank of $\widetilde{G}$. Denote by $r(G)$, $\kappa(G)$, $m(G)$ and $m^{\ast}(G)$ the rank, the number of even cycles, the matching number and the fractional matching number of $G$, respectively. Zhou et al. [Discrete Appl. Math. 313 (2022)] proved that $2m(G)-2\kappa(G)\leq r(G)\leq 2m(G)+\rho(G)$, where $\rho(G)$ is the largest number of disjoint odd cycles in $G$. We extend their results to the setting of mixed graphs and prove that $2m(G)-2\kappa(G)\leq r(\widetilde{G}) \leq 2m^{\ast}(G)$ for a mixed graph $\widetilde{G}$. Furthermore, we characterize some classes of mixed graphs with rank $r(\widetilde{G})=2m(G)-2\kappa(G)$, $r(\widetilde{G})=2m(G)-2\kappa(G)+1$ and $r(\widetilde{G})=2m^{\ast}(G)$, respectively. Our results also improve those of Chen et al. [Linear Multiliear Algebra. 66 (2018)]. In addition, our results can be applied to signed graphs and oriented graphs in some situations.

math.CO

Sufficient conditions for $t$-tough graphs to be Hamiltonian and pancyclic or bipartite

The toughness of graph $G$, denoted by $\tau(G)$, is $\tau(G)=\min\{\frac{|S|}{c(G-S)}:S\subseteq V(G),c(G-S)\geq2\}$ for every vertex cut $S$ of $V(G)$ and the number of components of $G$ is denoted by $c(G)$. Bondy in 1973, suggested the ``metaconjecture" that almost any nontrivial condition on a graph which implies that the graph is Hamiltonian also implies that the graph is pancyclic. Recently, Benediktovich [Discrete Applied Mathematics. 365 (2025) 130--137] confirmed the Bondy's metaconjecture for $t$-tough graphs in the case when $t\in\{1;2;3\}$ in terms of the size, the spectral radius and the signless Laplacian spectral radius of the graph. In this paper, we will confirm the Bondy's metaconjecture for $t$-tough graphs in the case when $t\geq4$ in terms of the size, the spectral radius, the signless Laplacian spectral radius, the distance spectral radius and the distance signless Laplacian spectral radius of graphs.

math.CO