In this paper, we constrain four time-dependent dark energy (TDDE) models by using the Type Ia supernovae (SNe Ia), baryonic acoustic oscillations (B…

In this paper, we mainly investigate the nonuniform sampling for random signals which are bandlimited in the linear canonical transform (LCT) domain.…

An edge-colored graph $G$, where adjacent edges may have the same color, is {\it rainbow connected} if every two vertices of $G$ are connected by a p…

A path $P$ in an edge-colored graph $G$ is a \emph{proper path} if no two adjacent edges of $P$ are colored with the same color. The graph $G$ is \em…

A tree $T$ in an edge-colored graph is a \emph{proper tree} if any two adjacent edges of $T$ are colored with different colors. Let $G$ be a graph of…

An edge-colored graph $G$ is \emph{conflict-free connected} if, between each pair of distinct vertices, there exists a path containing a color used o…

The planar Tur\'an number of a given graph $F$, denoted $ex_{_\mathcal{P}}(n,F)$, is the maximum number of edges in a planar graph on $n$ vertices wi…

Recent experimental progress in prolonging the coherence time of a quantum system prompts us to explore the behavior of quantum entanglement at the b…

Let $G$ be a nontrivial connected graph with an edge-coloring $c:E(G)\rightarrow \{1,2,\ldots,q\},$ $q\in \mathbb{N}$, where adjacent edges may be co…

Based on the obtained exact results we systematically study the quench dynamics of a one-dimensional spin-1/2 transverse field Ising model with zero-…

The two photon transition of $\bar{c}c$ quarkonia are studied within a covariant approach based on the consistent truncation scheme of the quantum ch…

An edge-colored graph $G$ is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection n…

Nodal line in parameter space, at which the energy gap closes up, can either be the boundary separating two topological quantum phases or two convent…

A path in a vertex-colored graph is called a \emph{vertex-monochromatic path} if its internal vertices have the same color. A vertex-coloring of a gr…

The {\em rainbow vertex-connection number}, $rvc(G)$, of a connected graph $G$ is the minimum number of colors needed to color its vertices such that…

Cloud radio access network (C-RAN) has become a promising network architecture to support the massive data traffic in the next generation cellular ne…

Naturalness of warping is gaining extensive attention in image stitching. Recent warps such as SPHP, AANAP and GSP, use a global similarity to effect…

In this paper, we investigate the angular momentum independence of the entropy sum and product for rotating black holes based on the first law of thermodynamics and a mathematical lemma related to Vandermonde determinant. The advantage of the method…

In this paper, we investigate the angular momentum independence of the entropy sum and product for AdS rotating black holes based on the first law of…

Our study in this paper has generalized our discussions in ref.[16] to general rotating Kaluza-Klein black holes, including the charged case, which is not discussed in ref.[16]. We have investigated the angular momentum-independence of the entropy s…

Based on a mathematical lemma related to the Vandermonde determinant and two theorems derived from the first law of black hole thermodynamics, we inv…

The discovery of novel topological phase advances our knowledge of nature and stimulates the development of applications. In non-Hermitian topologica…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account