Ni Lu | Searcharxiv

arXiv2026

Non-Hermitian Mosaic Maryland model

We introduce the non-Hermitian mosaic Maryland model, where a discrete modulation period and a non-Hermitian phase are incorporated into the potential, rendering the originally exactly solvable system generally non-integrable. This model provides a unique platform to investigate how structural modulation governs localization in complex quasiperiodic potentials. Using Avila's global theory, we analytically derive the exact Lyapunov exponent and obtain explicit formulas for the complex mobility edges. Remarkably, for modulation periods kappa >= 2, the system intrinsically hosts kappa-1 robust extended bands that persist independently of the potential strength and non-Hermiticity. We further characterize the topological nature of these phases via the spectral winding number. Unlike the standard Maryland model, the mosaic modulation induces mobility edges, and the resulting phase transitions are continuous, reflecting the non-integrable nature of the system. Numerical calculations of the inverse participation ratio and fractal dimension confirm the analytical predictions for the asymptotic form of the mobility edges in the large non-Hermiticity limit. This work establishes structural design as a powerful degree of freedom for engineering wave transport and enhancing the robustness of extended states in non-Hermitian systems.

cond-mat.dis-nn↗

arXiv2022

The crossing number of the complete 4-partite graph $K_{1,1,m,n}$

Let $\textrm{cr}(G)$ denote the crossing number of a graph $G$. The well-known Zarankiewicz's conjecture (ZC) asserted $\textrm{cr}(K_{m,n})$ in 1954. In 1971, Harborth gave a conjecture (HC) on $\textrm{cr}(K_{x_1,...,x_n})$. HC on $K_{1,m,n}$ is verified if ZC is true by Ho et al. in 2021. In this paper, we showed the following results: If both $m$ and $n$ are even, then \[\textrm{cr}(K_{1,1,m,n})\geq \frac{1}{2}(\textrm{cr}(K_{m+1,n+3})+\textrm{cr}(K_{m+3,n+1})-mn-\frac{1}{4}(m^2+n^2));\] If both $m$ and $n$ are odd, then \[\textrm{cr}(K_{1,1,m,n})\geq \frac{1}{2}(\textrm{cr}(K_{1,m+1,n+1})+\textrm{cr}(K_{2,m,n})-\frac{1}{4}(m+1)(n+1)+1);\] If $m$ is even and $n$ is odd, then \begin{equation}\nonumber \begin{split} \textrm{cr}(K_{1,1,m,n})&\geq \frac{1}{4}(\textrm{cr}(K_{m+1,n+2})+\textrm{cr}(K_{m+3,n+2})+2\textrm{cr}(K_{2,m,n}) \\&-m(n+1)-\frac{1}{4}(n+1)^2). \end{split} \end{equation} The lower bounds in our result imply that if both $m$ and $n$ are even and ZC is true, then HC on $K_{1,1,m,n}$ holds; if at least one of $m$ and $n$ is odd and both ZC and HC on $K_{2,m,n}$ are true, then HC on $K_{1,1,m,n}$ holds.

math.CO↗