Searcharxiv⌕ Search

arXiv subjects

Jun Lan

Publications and source records attributed to Jun Lan.

57 records · Page 4Linked to original sources

On t-relaxed coloring of complete multi-partite graphs

Let $G$ be a graph and $t$ a nonnegative integer. Suppose $f$ is a mapping from the vertex set of $G$ to $\{1,2,\dots, k\}$. If, for any vertex $u$ of $G$, the number of neighbors $v$ of $u$ with $f(v)=f(u)$ is less than or equal to $t$, then $f$ is called a $t$-relaxed $k$-coloring of $G$. And $G$ is said to be $(k,t)$-colorable. The $t$-relaxed chromatic number of $G$, denote by $χ_t(G)$, is defined as the minimum integer $k$ such that $G$ is $(k,t)$-colorable. A set $S$ of vertices in $G$ is $t$-sparse if $S$ induces a graph with a maximum degree of at most $t$. Thus $G$ is $(k,t)$-colorable if and only if the vertex set of $G$ can be partitioned into $k$ $t$-sparse sets. It was proved by Belmonte, Lampis and Mitsou (2017) that the problem of deciding if a complete multi-partite graph is $(k,t)$-colorable is NP-complete. In this paper, we first give tight lower and up bounds for the $t$-relaxed chromatic number of complete multi-partite graphs. And then we design an algorithm to compute maximum $t$-sparse sets of complete multi-partite graphs running in $O((t+1)^2)$ time. Applying this algorithm, we show that the greedy algorithm for $χ_t(G)$ is $2$-approximate and runs in $O(tn)$ time steps (where $n$ is the vertex number of $G$). In particular, we prove that for $t\in \{1,2,3,4,5,6\}$, the greedy algorithm produces an optimal $t$-relaxed coloring of a complete multi-partite graph. While, for $t\ge 7$, examples are given to illustrate that the greedy strategy does not always construct an optimal $t$-relaxed coloring.

math.CO↗

Acoustic Multifunctional Logic Gates and Amplifier based on Passive Parity-Time Symmetry

Acoustic analogue computation and signal processing are of great significance, however, it's challenging to realize the acoustic computing devices because of their limitations of single function and complex structure. In this paper, an acoustic multifunctional device, which can gate or amplify acoustic waves without resorting to altering the frequency and structure using a passive acoustic parity-time (PT)-symmetric metamaterial, is realized theoretically and experimentally. The metamaterial is constructed by five lossless-loss periodically distributed media which are modulated to achieve the passive PT symmetry. At the coherent perfect absorber (CPA)-emitter point in the broken PT-symmetric phase, the logic gates (AND, OR, XOR and NOT) and small signal amplifier are realized in a single system by adjusting the phase and amplitude differences between two incoming beams, respectively. This work provides a new route for the connection between the PT symmetry and the acoustic metamaterial, which has great potential applications in acoustic modulation and acoustic multifunctional device.

physics.class-ph↗

Bidirectional acoustic negative refraction based on a pair of metasurfaces with both local and global PT-symmetries

Negative refraction plays an important role in acoustic wave manipulation and imaging. However, conventional systems based on acoustic metamaterials suffer from the limits induced by loss-related and resolution issues. In this work, a parity-time (PT)-symmetric system is introduced to realize loss-free bidirectional acoustic negative refraction. The system is composed of a pair of locally PT-symmetric multi-layer metasurfaces sandwiching a region of free space, which also forms a global PT-symmetry. The property of bidirectional negative refraction, which is rare for regular PT-symmetric structures, is related to the coexistence of amplification and absorption in the locally PT-symmetric metasurfaces at their PT broken phases. Such metasurfaces can freely switch their states between coherent perfect absorber (CPA) and amplifier depending on the direction of incidence. Our results provide a new physical mechanism for realizing bidirectional functions in PT-symmetric systems.

physics.app-ph↗