arXiv subjects

Weihua Yang

Publications and source records attributed to Weihua Yang.

At least 19 recordsLinked to original sources

arXiv2026

A characterization of tight ($ k, 0 $)-stable graphs

Let k and l be two non-negative integers with k > l. A graph G is (k,l)-stable if alpha(G - S) >= alpha(G) - l for every subset S of V(G) with |S| = k, where alpha(G) denotes the independence number of G. Dong and Wu established that alpha(G) <= floor((n - k + 1)/2) + l for a (k, l)-stable graph G, where n is the order of G. A (k, l)-stable graph G is tight if alpha(G) = floor((n - k + 1)/2) + l. In this paper, we provide a complete characterization of tight (k, 0)-stable graphs for k >= 4. In particular, we prove that tight (k, 0)-stable graphs are K_{k+1} and K_{k+2} for k >= 5, which not only extends the result of Liu, Song and Wang [J. Graph Theory 110(2) (2025), 193-199] from k >= 24 to k >= 5, but also proves the conjecture of Dong and Luo [Electron. J. Comb. 32(4) (2025), 4-45] once more.

math.CO↗

arXiv2026

A characterization of 4-connected graphs with no 6-wheel minor

For each integer $n\geq 3$, let $W_n$ denote the wheel graph obtained by connecting a single vertex to all vertices of a cycle of length $n$. In particular, $W_6$ is obtained from the Petersen graph by contracting three edges incident with a common vertex. In this paper, we determine all $4$-connected graphs that do not contain $W_6$ as a minor.

math.CO↗

arXiv2026

An excluded minor theorem for the 6-wheel

For each integer $n \geq 3$, the wheel graph $W_n$ is defined as the graph obtained by connecting a single vertex to all vertices of a cycle of length $n$. In particular, $W_6$ can be uniquely obtained from the Petersen graph by contracting three edges incident to a common vertex. Gubser provided a characterization of all 3-connected planar $W_6$-minor-free graphs. In this paper, we complete the characterization of $W_6$-minor-free graphs by determining the 3-connected nonplanar cases.

math.CO↗

arXiv2026

Brain-Inspired Capture: Evidence-Driven Neuromimetic Perceptual Simulation for Visual Decoding

Visual decoding of neurophysiological signals is a critical challenge for brain-computer interfaces (BCIs) and computational neuroscience. However, current approaches are often constrained by the systematic and stochastic gaps between neural and visual modalities, largely neglecting the intrinsic computational mechanisms of the Human Visual System (HVS). To address this, we propose Brain-Inspired Capture (BI-Cap), a neuromimetic perceptual simulation paradigm that aligns these modalities by emulating HVS processing. Specifically, we construct a neuromimetic pipeline comprising four biologically plausible dynamic and static transformations, coupled with Mutual Information (MI)-guided dynamic blur regulation to simulate adaptive visual processing. Furthermore, to mitigate the inherent non-stationarity of neural activity, we introduce an evidence-driven latent space representation. This formulation explicitly models uncertainty, thereby ensuring robust neural embeddings. Extensive evaluations on zero-shot brain-to-image retrieval across two public benchmarks demonstrate that BI-Cap substantially outperforms state-of-the-art methods, achieving relative gains of 9.2\% and 8.0\%, respectively. We have released the source code on GitHub through the link https://github.com/flysnow1024/BI-Cap.

cs.CV↗

arXiv2026

Higher-twist effect in inclusive electron-positron annihilation

We establish a comprehensive theoretical framework for the electron-positron single-inclusive annihilation (SIA) process that incorporates higher-twist contributions up to twist-4 and demonstrate that these effects should be considered in low-energy reactions. Through a systematic collinear expansion of the hadronic tensor, we derive the complete set of structure functions in terms of collinear fragmentation functions (FFs), explicitly including multi-parton correlators up to the four-parton level. To evaluate the impact of these power corrections, we estimate the twist-4 unpolarized FF using a spectator model and compute the normalized differential cross section for $π^0$ production. Our numerical analysis reveals that the interplay between kinematic hadron mass corrections and dynamical twist-4 effects improves the theoretical description of recent BESIII data at relatively low-$z$ region. Furthermore, the $Q$-dependence confirms that higher-twist corrections are dominant at intermediate energy scales. These findings indicate that standard leading-twist global analyses must be extended to include these power corrections for precise studies of hadronization dynamics.

hep-ph↗

arXiv2025

Transverse momentum asymmetry in the semi-inclusive electron positron annihilation process

Hadronization, a nonperturbative process, cannot be calculated from first principles. It can be investigated either by using phenomenological models or by examining the behavior of produced hadrons or through fragmentation functions. These fragmentation functions are nonperturbative quantities whose determination relies entirely on experimental data. However, higher-twist fragmentation functions present significant challenges for their determination due to power suppression. In this paper, we propose an asymmetry to study twist-3 fragmentation functions. This asymmetry is defined as the transverse momentum asymmetry of the fragmenting quark and/or the produced jet with respect to the observed hadron direction within the semi-inclusive electron positron annihilation process. As a twist-3 effect, this asymmetry is sensitive to the distribution of the jet relative to the produced hadron direction during hadronization. Furthermore, it is closely related to twist-3 transverse momentum dependent fragmentation functions and provides a set of measurable quantities for their determination.

hep-ph↗

arXiv2025

High-Precision Physics Experiments at Huizhou Large-Scale Scientific Facilities

In response to the capabilities presented by the High-Intensity Heavy Ion Accelerator Facility (HIAF) and the Accelerator-Driven Subcritical System (CiADS), as well as the proposed Chinese Advanced Nuclear Physics Research Facility (CNUF), we are assembling a consortium of experts in relevant discipline--both domestically and internationally--to delineate high-precision physics experiments that leverage the state-of-the-art research environment afforded by CNUF. Our focus encompasses six primary domains of inquiry: hadron physics--including endeavors such as the super eta factory and investigations into light hadron structures; muon physics; neutrino physics; neutron physics; the testing of fundamental symmetries; and the exploration of quantum effects within nuclear physics, along with the utilization of vortex accelerators. We aim to foster a well-rounded portfolio of large, medium, and small-scale projects, thus unlocking new scientific avenues and optimizing the potential of the Huizhou large scientific facility. The aspiration for international leadership in scientific research will be a guiding principle in our strategic planning. This initiative will serve as a foundational reference for the Institute of Modern Physics in its strategic planning and goal-setting, ensuring alignment with its developmental objectives while striving to secure a competitive edge in technological advancement. Our ambition is to engage in substantive research within these realms of high-precision physics, to pursue groundbreaking discoveries, and to stimulate progress in China's nuclear physics landscape, positioning Huizhou as a preeminent global hub for advanced nuclear physics research.

hep-ph↗

arXiv2025

Extremal triangle-free graphs with chromatic number at least four

Let $G$ be an $n$-vertex triangle-free graph. The celebrated Mantel's theorem showed that $e(G)\leq \lfloor\frac{n^2}{4}\rfloor$. In 1962, Erdős (together with Gallai), and independently Andrásfai, proved that if $G$ is non-bipartite then $e(G)\leq \lfloor\frac{(n-1)^2}{4}\rfloor+1$. In this paper, we extend this result and show that if $G$ has chromatic number at least four and $n\geq 90$, then $e(G)\leq \lfloor\frac{(n-3)^2}{4}\rfloor+5$. The blow-ups of Grötzsch graph shows that this bound is best possible.

math.CO↗

arXiv2025

Polarization analysis in $e^+e^-\rightarrow J/ψ\rightarrow$ baryon-antibaryon pairs

We present a comprehensive polarization analysis for the process $e^{+}e^{-} \rightarrow J/ψ\rightarrow$ baryon-antibaryon pairs~$B_{1}\bar{B}_{2}$. All possible helicity amplitudes for $e^{+}e^{-} \rightarrow J/ψ$ and $J/ψ\rightarrow B_{1} \bar{B}_{2}$ are provided, along with their transformation properties under parity and $CP$ operations. Taking full account of beam polarization, we analyze the polarization of the $J/ψ$ produced in $e^{+}e^{-}$ annihilation and show that all eight independent polarization components can be nonzero. By introducing a polarization transfer matrix, we propose a novel method to compute the polarization transfer in the decay $J/ψ\rightarrow B_{1} \bar{B}_{2}$. Considering both hadronic and radiative baryon decay models, we derive the joint angular distribution of the final-state particles. Focusing on the process $J/ψ\rightarrow Λ\barΣ^{0}$, we provide statistical uncertainty estimates for probing $CP$ violation in associated production of different baryons. This work establishes a complete framework for studying the parity and $CP$ violations present in baryon productions and decays within the helicity formalism.

hep-ph↗

arXiv2025

A degree sum condition for the existence of a quasi 5-contractible edge in a quasi 5-connected graph

An edge of a quasi $k$-connected graph is said to be quasi $k$-contractible if the contraction of the edge results in a quasi $k$-connected graph. We show that every 5-connected graph contains a quasi 5-contractible edge. Furthermore, we prove that a quasi 5-connected graph possesses a quasi 5-contractible edge, if the degree sum of any two vertices with distance at most two is at least 9. This result strengthens a theorem proved by Kriesell when $k=4$ (M. Kriesell, A degree sum condition for the existence of a contractible edge in a $k$-connected graph, J. Combin. Theory Ser. B 82(2001)81-101).

math.CO↗

arXiv2025

On the coefficients of interior and exterior polynomials of polymatroids

The Tutte polynomial is an important invariant of graphs and matroids. Chen and Guo \emph{[Adv. in Appl. Math. 166 (2025) 102868.]} proved that for a $(k+1)$-edge connected graph $G$ and for any $i$ with $0\leq i <\frac{3(k+1)}{2}$, $$[y^{g-i}]T_{G}(1,y)=\binom{|V(G)|+i-2}{i}-\sum_{j=0}^{i}\binom{|V(G)|+i-2-j}{i-j}|\mathcal{SC}_{j}(G)|,$$ where $g=|E(G)|-|V(G)|+1$, $\mathcal{SC}_{j}(G)$ is the set of all minimal edge cuts with $j$ edges, $T_{G}(x,y)$ is the Tutte polynomial of the graph $G$, and $[y^{g-i}]T_{G}(1,y)$ denotes the coefficient of $y^{g-i}$ in the polynomial $T_{G}(1,y)$. Recently, Ma, Guan and Jin \emph{[arXiv.2503.06095, 2025.]} generalized this result from graphs to matroids and obtained the dual result on coefficients of $T_M(x,1)$ of matroids $M$ at the same time. In 2013, as a generalization of $T_{G}(x,1)$ and $T_{G}(1,y)$ of graphs $G$ to hypergraphs, Kálmán \emph{[Adv. Math. 244 (2013) 823-873.]} introduced interior and exterior polynomials for connected hypergraphs. Chen and Guo posed a problem that can one generalize these results of graphs to interior and exterior polynomials of hypergraphs? In this paper, we solve it in the affirmative by obtaining results for more general polymatroids, which include the case of hypergraphs and also generalize the results of matroids due to Ma, Guan and Jin. As an application, the sequence consisting of these coefficients on polymatroids is proven to be unimodal, while the unimodality of the whole coefficients of matroids was obtained in 2018 by Adiprasito, Huh and Katz using Hodge theory.

math.CO↗

arXiv2025

D4PM: A Dual-branch Driven Denoising Diffusion Probabilistic Model with Joint Posterior Diffusion Sampling for EEG Artifacts Removal

Artifact removal is critical for accurate analysis and interpretation of Electroencephalogram (EEG) signals. Traditional methods perform poorly with strong artifact-EEG correlations or single-channel data. Recent advances in diffusion-based generative models have demonstrated strong potential for EEG denoising, notably improving fine-grained noise suppression and reducing over-smoothing. However, existing methods face two main limitations: lack of temporal modeling limits interpretability and the use of single-artifact training paradigms ignore inter-artifact differences. To address these issues, we propose D4PM, a dual-branch driven denoising diffusion probabilistic model that unifies multi-type artifact removal. We introduce a dual-branch conditional diffusion architecture to implicitly model the data distribution of clean EEG and artifacts. A joint posterior sampling strategy is further designed to collaboratively integrate complementary priors for high-fidelity EEG reconstruction. Extensive experiments on two public datasets show that D4PM delivers superior denoising. It achieves new state-of-the-art performance in EOG artifact removal, outperforming all publicly available baselines. The code is available at https://github.com/flysnow1024/D4PM.

eess.IV↗

arXiv2025

A forbidden pair for quasi 5-contractible edges

An edge of a quasi $k$-connected graph is said to be quasi $k$-contractible if the contraction of the edge results in a quasi $k$-connected graph. If every quasi $k$-connected graph without a quasi $k$-contractible edge has either $H_{1}$ or $H_{2}$ as a subgraph, then an unordered pair of graphs $\{H_{1}, H_{2}\}$ is said to be a forbidden pair for quasi $k$-contractible edges. We prove that $\{K_{4}^{-}, \overline{P_{5}}\}$ is a forbidden pair for quasi 5-contractible edges, where $K_{4}^{-}$ is the graph obtained from $K_{4}$ by removing just one edge and $\overline{P_{5}}$ is the complement of a path on five vertices.

math.CO↗

arXiv2025

Quaternion Sparse Decomposition for Multi-focus Color Image Fusion

Multi-focus color image fusion refers to integrating multiple partially focused color images to create a single all-in-focus color image. However, existing methods struggle with complex real-world scenarios due to limitations in handling color information and intricate textures. To address these challenges, this paper proposes a quaternion multi-focus color image fusion framework to perform high-quality color image fusion completely in the quaternion domain. This framework introduces 1) a quaternion sparse decomposition model to jointly learn fine-scale image details and structure information of color images in an iterative fashion for high-precision focus detection, 2) a quaternion base-detail fusion strategy to individually fuse base-scale and detail-scale results across multiple color images for preserving structure and detail information, and 3) a quaternion structural similarity refinement strategy to adaptively select optimal patches from initial fusion results and obtain the final fused result for preserving fine details and ensuring spatially consistent outputs. Extensive experiments demonstrate that the proposed framework outperforms state-of-the-art methods.

cs.CV↗

arXiv2025

Neutrino-jet correlations in charged-current SIDIS

Charged-current deep inelastic scattering plays a significant role in determining parton distribution functions with flavour separation.In this work, we present a systematic calculation of the charged-current semi-inclusive deep inelastic scattering (SIDIS) in the $eN$ collinear frame up to twist-3 level at leading order. Semi-inclusive refers to the process in which a jet is detected in addition to the scattered neutrino. We focus on neutrino-jet correlations in our calculation. We first present the differential cross section in terms of structure functions, followed by the differential cross section expressed in term of transverse momentum dependent parton distribution functions. We derive the complete set of azimuthal asymmetries and intrinsic asymmetries. We also introduce an observable $A^C$, defined as the ratio of the difference to the sum of differential cross sections for electron and positron semi-inclusive deep inelastic scattering.We notice that $A^C$ provides a sensitive probe for valence and sea quark distribution functions

hep-ph↗

arXiv2025

Hypergraph Turán problem of the generalized triangle with bounded matching number

Let $\mathcal{H}$ be a 3-graph on $n$ vertices. The matching number $ν(\mathcal{H})$ is defined as the maximum number of disjoint edges in $\mathcal{H}$. The generalized triangle $F_5$ is a 3-graph on the vertex set $\{a,b,c,d,e\}$ with the edge set $\{abc, abd,cde\}$. In this paper, we showed that an $F_5$-free 3-graph $\mathcal{H}$ with matching number at most $s$ has at most $s\lfloor (n-s)^2/4\rfloor$ edges for $n\geq 30(s+1)$ and $s\geq 3$. For the proof, we establish a 2-colored version of Mantel's theorem, which may be of independent interests.

math.CO↗

arXiv2025

A constructive characterization of uniformly 4-connected graphs

A constructive characterization of the class of uniformly $4$-connected graphs is presented. The characterization is based on the application of graph operations to appropriate vertex and edge sets in uniformly $4$-connected graphs, that is, any uniformly $4$-connected graph can be obtained from $C_5^2$ or $C_6^2$ by a number of $Δ_1^+$ or $Δ_2^+$-operations to quasi $4$-compatible sets.

math.CO↗

arXiv2025

Hamiltonian cycles in $ 15 $-tough ($ P_{3}\cup 3P_{1} $)-free graphs

A graph $ G $ is called $ t $-tough if $ \left|S\right|\geq t\cdot w\left(G-S\right)$ for every cutset $ S $ of $G$. Chvátal conjectured that there exists a constant $ t_{0} $ such that every $ t_{0} $-tough graph has a hamiltonian cycle. Gao and Shan have proved that every $7$-tough $(P_{3}\cup 2P_{1})$-free grah is hamiltonian. In this paper, we confirm this conjecture for $ (P_{3}\cup 3P_{1}) $-free graphs.

math.CO↗