arXiv subjects

Qiuli Li

Publications and source records attributed to Qiuli Li.

13 recordsLinked to original sources

arXiv2026

N\'eel-order-dependent transverse transport in noncoplanar antiferromagnet $\text{MnTe}_{2}$

Antiferromagnets hold appealing potential in next-generation spintronic devices with higher frequency and scalability, thanks to their alternating spin orientations that cancel out net magnetization. However, the lack of a nonzero magnetization makes the detection of the magnetic configuration of antiferromagnet difficult, hampering the applications of antiferromagnets. Here, we report a new transverse transport effect in noncoplanar antiferromagnet $\text{MnTe}_{2}$. This effect is antisymmetric in both magnetic field and N\'eel order, but symmetric in its two indices. It can be understood in terms of the contribution induced by both magnetic field and geometric quantities, as confirmed by our theoretical calculations. Our discovery of a new N\'eel-order-dependent transverse transport effect provides opportunities to the advancing antiferromagnetic spintronics.

cond-mat.mtrl-sci↗

arXiv2026

Nonlinear Hall quantum oscillations to probe topological Brown-Zak fermions in graphene moir\'e systems

Due to the deep connection with the quantum geometry of electronic Bloch wavefunctions, the second-order nonlinear Hall effect (NLHE) has been an attractive topic since its proposal. However, studies on NLHE under a magnetic field have been lacking. Given that quantum oscillations in the linear response regime have been proven to be useful tools in investigating electronic systems, searching for quantum oscillations in NLHE is of great interest and is expected to provide new avenues to unveil rich quantum geometric properties of novel quasiparticles. Here, we propose a new type of NLHE quantum oscillations and experimentally probe it in graphene moir\'e systems. It stems from the alternation of the dominant NLHE mechanisms with recurring Bloch states under magnetic field, which enables sensitive detection of Brown-Zak fermions, giving an onset field as low as 0.5 T. Most importantly, when the commensurability condition is satisfied, the nonlinear transport of Brown-Zak fermions is mainly governed by quantum geometric contributions. Our findings not only establish a new type of quantum oscillations, but also demonstrate the first experimental detection of the topological nature of Brown-Zak fermions, shedding light on the exploration of novel topological quasiparticles.

cond-mat.mes-hall↗

arXiv2025

On minimal k-factor-critical planar graphs

A graph of order $n$ is said to be \emph{$k$-factor-critical} ($0\leq k <n$) if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is \emph{minimal} if $G-e$ is not $k$-factor-critical for any edge $e$ in $G$. Favaron and Shi posed the conjecture that every minimal $k$-factor-critical graph is of minimum degree $k+1$ in 1998. In this paper, we confirm the conjecture for planar graphs.

math.CO↗

arXiv2024

Persistent but weak magnetic field at Moon's midlife revealed by Chang'e-5 basalt

The evolution of the lunar magnetic field can reveal the Moon's interior structure, thermal history, and surface environment. The mid-to-late stage evolution of the lunar magnetic field is poorly constrained, and thus the existence of a long-lived lunar dynamo remains controversial. The Chang'e-5 mission returned the heretofore youngest mare basalts from Oceanus Procellarum uniquely positioned at mid-latitude. We recovered weak paleointensities of 2-4 uT from the Chang'e-5 basalt clasts at 2 billion years ago, attestting to the longevity of a lunar dynamo until at least the Moon's midlife. This paleomagnetic result implies the existence of thermal convection in the lunar deep interior at the lunar mid-stage which may have supplied mantle heat flux for the young volcanism.

physics.geo-ph↗

arXiv2024

A Distance Similarity-based Genetic Optimization Algorithm for Satellite Ground Network Planning Considering Feeding Mode

With the rapid development of the satellite industry, the information transmission network based on communication satellites has gradually become a major and important part of the future satellite ground integration network. However, the low transmission efficiency of the satellite data relay back mission has become a problem that is currently constraining the construction of the system and needs to be solved urgently. Effectively planning the task of satellite ground networking by reasonably scheduling resources is crucial for the efficient transmission of task data. In this paper, we hope to provide a task execution scheme that maximizes the profit of the networking task for satellite ground network planning considering feeding mode (SGNPFM). To solve the SGNPFM problem, a mixed-integer planning model with the objective of maximizing the gain of the link-building task is constructed, which considers various constraints of the satellite in the feed-switching mode. Based on the problem characteristics, we propose a distance similarity-based genetic optimization algorithm (DSGA), which considers the state characteristics between the tasks and introduces a weighted Euclidean distance method to determine the similarity between the tasks. To obtain more high-quality solutions, different similarity evaluation methods are designed to assist the algorithm in intelligently screening individuals.

cs.NE↗

arXiv2024

On the Generalized Harmonic Measure

The axiomatization of harmonic measure theory is established, including the generalized maximum principle, Harnack inequality and Harnack principle. As the applications of the established theory, Dahlberg's theory is generalized. The theory provides an interpretation from the measure theory view point of the elliptic equation theory.

math.FA↗

arXiv2023

The minimum degree of minimal $k$-factor-critical claw-free graphs*

A graph $G$ of order $n$ is said to be $k$-factor-critical for integers $1\leq k< n$, if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph is minimal if for every edge, the deletion of it results in a graph that is not $k$-factor-critical. In 1998, O. Favaron and M. Shi conjectured that every minimal $k$-factor-critical graph has minimum degree $k+1$. In this paper, we confirm the conjecture for minimal $k$-factor-critical claw-free graphs. Moreover, we show that every minimal $k$-factor-critical claw-free graph $G$ has at least $\frac{k-1}{2k}|V(G)|$ vertices of degree $k+1$ in the case of $(k+1)$-connected, yielding further evidence for S. Norine and R. Thomas' conjecture on the minimum degree of minimal bricks when $k=2$.

math.CO↗

arXiv2022

Ancient and recent collisions revealed by phosphate minerals in the Chelyabinsk meteorite

The collision history of asteroids is an important archive of inner Solar System evolution. Evidence for these collisions is brought to Earth by meteorites, which can preserve impact-reset radioisotope mineral ages. However, as meteorites often preserve numerous mineral ages, their interpretation is controversial. Here, we combine analysis of phosphate U-Pb ages and mineral microtextures to construct a collision history for the highly shocked Chelyabinsk meteorite. We show that phosphate U-Pb ages in the meteorite are independent of thermal history at macro-to-microscales, correlating instead with phosphate microtexture. Isotopic data from pristine phosphate domains is largely concordant, whereas fracture-damaged domains universally display discordance. Combining both populations best constrains upper (4,473 +/- 11 Ma) and lower intercept (-9 +/- 55 Ma, i.e., within error of the present day) U-Pb ages for Chelyabinsk phosphates. We conclude that all phosphate U-Pb ages were completely reset during an ancient high energy collision. Fracture-damaged phosphate domains experienced further Pb-loss during mild collisional heating in the geologically recent past, and must be targeted to properly constrain a lower intercept age. Targeting textural sub-populations of phosphate grains can significantly improve the calculation and interpretation of U-Pb ages, permitting more robust reconstruction of both ancient and recent asteroidal collision histories.

astro-ph.EP↗

arXiv2017

On the anti-Kelulé problem of cubic graphs

An edge set $S$ of a connected graph $G$ is called an anti-Kekulé set if $G-S$ is connected and has no perfect matchings, where $G-S$ denotes the subgraph obtained by deleting all edges in $S$ from $G$. The anti-Kekulé number of a graph $G$, denoted by $ak(G)$, is the cardinality of a smallest anti-Kekulé set of $G$. It is NP-complete to find the smallest anti-Kekulé set of a graph. In this paper, we show that the anti-Kekulé number of a 2-connected cubic graph is either 3 or 4, and the anti-Kekulé number of a connected cubic bipartite graph is always equal to 4. Furthermore, a polynomial time algorithm is given to find all smallest anti-Kekulé sets of a connected cubic graph.

math.CO↗

arXiv2016

Classification of 2-extendable bipartite and cubic non-bipartite vertex-transitive graphs

In \cite{Chan95}, the authors classified the 2-extendable abelian Cayley graphs and posed the problem of characterizing all 2-extendable Cayley graphs. We first show that a connected bipartite Cayley (vertex-transitive) graph is 2-extendable if and only if it is not a cycle. It is known that a non-bipartite Cayley (vertex-transitive) graph is 2-extendable when it is of minimum degree at least five \cite{sun}. We next classify all 2-extendable cubic non-bipartite Cayley graphs and obtain that: a cubic non-bipartite Cayley graph with girth $g$ is 2-extendable if and only if $g\geq 4$ and it doesn't isomorphic to $Z_{4n}(1,4n-1,2n)$ or $Z_{4n+2}(2,4n,2n+1)$ with $n\geq 2$. Indeed, we prove a more stronger result that a cubic non-bipartite vertex-transitive graph with girth $g$ is 2-extendable if and only if $g\geq 4$ and it doesn't isomorphic to $Z_{4n}(1,4n-1,2n)$ or $Z_{4n+2}(2,4n,2n+1)$ with $n\geq 2$ or the Petersen graph.

math.CO↗

arXiv2015

Matching preclusion for vertex-transitive networks

In interconnection networks, matching preclusion is a measure of robustness when there is a link failure. Let $G$ be a graph of even order. The matching preclusion number $mp(G)$ is defined as the minimum number of edges whose deletion results in a subgraph without perfect matchings. Many interconnection networks are super matched, that is, their optimal matching preclusion sets are precisely those induced by a single vertex. In this paper, we obtain general results of vertex-transitive graphs including many known networks. A $k$-regular connected vertex-transitive graph has matching preclusion number $k$ and is super matched except for six classes of graphs. From this many previous results can be directly obtained and matching preclusion for some other networks, such as folded $k$-cubes, Hamming graphs and halved $k$-cubes, are derived.

math.CO↗

arXiv2014

Fullerenes with the maximum Clar number

The Clar number of a fullerene is the maximum number of independent resonant hexagons in the fullerene. It is known that the Clar number of a fullerene with n vertices is bounded above by [n/6]-2. We find that there are no fullerenes whose order n is congruent to 2 modulo 6 attaining this bound. In other words, the Clar number for a fullerene whose order n is congruent to 2 modulo 6 is bounded above by [n/6]-3. Moreover, we show that two experimentally produced fullerenes C80:1 (D5d) and C80:2 (D2) attain this bound. Finally, we present a graph-theoretical characterization for fullerenes, whose order n is congruent to 2 (respectively, 4) modulo 6, achieving the maximum Clar number [n/6]-3 (respectively, [n/6]-2).

math.CO↗

arXiv2010

On the restricted matching of graphs in surfaces

A connected graph $G$ with at least $2m+2n+2$ vertices is said to have property $E(m,n)$ if, for any two disjoint matchings $M$ and $N$ of size $m$ and $n$ respectively, $G$ has a perfect matching $F$ such that $M\subseteq F$ and $N\cap F=\varnothing$. In particular, a graph with $E(m,0)$ is $m$-extendable. Let $μ(Σ)$ be the smallest integer $k$ such that no graphs embedded on a surface $Σ$ are $k$-extendable. Aldred and Plummer have proved that no graphs embedded on the surfaces $Σ$ such as the sphere, the projective plane, the torus, and the Klein bottle are $E(μ(Σ)-1,1)$. In this paper, we show that this result always holds for any surface. Furthermore, we obtain that if a graph $G$ embedded on a surface has sufficiently many vertices, then $G$ has no property $E(k-1,1)$ for each integer $k\geq 4$, which implies that $G$ is not $k$-extendable. In the case of $k=4$, we get immediately a main result that Aldred et al. recently obtained.

math.CO↗