SearcharxivSearch

arXiv subjects

Nannan Chen

Publications and source records attributed to Nannan Chen.

5 recordsLinked to original sources

Investigation on the X-ray emission of NGC 4051 during its 2009 optical/UV-X-ray dissociation phase

This study investigates the X-ray characteristics of jet-associated radio-quiet AGNs across distinct optical/UV to X-ray correlation phases. Quasi-simultaneous optical/UV/X-ray observations of NGC 4051 from May-June 2009, obtained through Swift and XMM-Newton, reveal a temporal dichotomy: a strong optical/UV to X-ray correlation dominates the initial observation phase (before May 27), followed by an optical/UV flare event concurrent with X-ray flux suppression in the latter period. Our multi-method analysis of XMM-Newton data, incorporating short-term X-ray variability assessment, spectral decomposition, and RGS spectral analysis, identifies significant inter-phase X-ray emission disparities. During optical/UV flaring episodes, compared to the correlated phase, we observe: attenuated short-term X-ray variability amplitudes, enhanced soft X-ray absorption, suppressed intrinsic hard X-ray flux, and more prominent RGS emission-line features. Notably, these X-ray characteristics during optical/UV flaring intervals show no statistically significant deviations from pre-flare low-state X-ray emission patterns. These non-synchronous optical/UV-X-ray variations contradict predictions from both reprocessing models, starburst-driven emission scenarios, and the simplistic absorption models. While potential jet-related mechanisms remain ambiguous, our findings demonstrate strong consistency with predictions from the inhomogeneous accretion disk perturbation framework.

astro-ph.HE

Triple systems with bounded matching number: some constructions and exact Tur\'{a}n number

We study the Tur\'{a}n numbers of $3$-graphs avoiding $3$-graphs $F$ and $M_{s+1}^3$, a matching of size $s+1$. We disprove a conjecture of Gerbner, Tompkins, and Zhou [European Journal of Combinatorics, 2025, 127:104155] on $\ex(n,\{F,M^3_{s+1}\})$ for $3$-graph $F$ with $\chi(F)=2$ by constructing infinitely many counterexamples. For this family, we determine the asymptotic Tur\'{a}n number via edge-colored Tur\'{a}n problem. In addition, for the $3$-graph $F_{3,2}$ with edge set $\{123,145,245,345\}$, we determine the exact value of $\ex(n,\{F_{3,2}, M_{s+1}^3\})$ for every integers $s$ and all $n \ge 12s^2$.

math.CO

Large cliques in graphs with forbidden semi-induced structures

In 2022, Holmsen showed that any graph with at least \( c \binom{n}{r} \) \(r\)-cliques but no induced complete $r$-partite graph $K_{2,\ldots, 2}$ must contain a clique of order \(\Omega(c^{2^{r-1}} n)\). In this paper, we study graphs forbidding semi-induced substructures and show that every $n$-vertex graph $G$ containing at least $c\binom{n}{r}$ copies of $K_r$ (for some constant $c>0$) and forbidding semi-induced substructures, related to $K_{2,\ldots, 2}$, must contain a clique of order $\Omega(cn)$. Our result strengthens Holmsen's bound by improving the dependence on $c$ from $c^{2^{r-1}}$ to linear in $c$ with bounded number of forbidden structures. Furthermore, our approach is naturally linked to the notion of VC-dimension.

math.CO

Exact Tur\'{a}n densities in triple systems

In this paper, we prove several new Tur\'{a}n density results for $3$-graphs. We show: $\pi(C_4^3, \mathrm{complement\ of\ } F_5) = 2\sqrt{3} - 3$, $\pi(F_{3,2}, C_5^{3-}) = \frac{2}{9}$, and $\pi(F_{3,2}, \mathrm{induced\ complement\ of\ } F_{3,2}) = \frac{3}{8}$. The first result confirms the conjecture of Shi~[On Tur\'an denisties of small triple graphs, European J. Combin. 52 (2016) 95-102]. The other results give several special non-principal family posed by Mubayi and R\"odl~[On the Tur\'an number of triple systems, J. Combin. Theory A. 100 (2002) 135-152].

math.CO

Tiling $H$ in dense graphs

We determine asymptotically the two extremal constructions for the tiling problem of the $H$-shaped tree. In particular, the first extremal construction is close to the complement of two cliques, in contrast to previously studied bipartite graphs, where the first extremal construction is close to the complement of a single clique. This result refutes one of Lang's conjectures [arXiv:2308.12281], which seeks to generalize the Erd\H{o}s Matching Conjecture.

math.CO