11,839 research outputs found
The entanglement dynamics of interacting qubits embedded in a spin environment with Dzyaloshinsky-Moriya term
We investigate the entanglement dynamics of two interacting qubits in a spin
environment, which is described by an XY model with Dzyaloshinsky-Moriya (DM)
interaction. The competing effects of environmental noise and interqubit
coupling on entanglement generation for various system parameters are studied.
We find that the entanglement generation is suppressed remarkably in
weak-coupling region at quantum critical point (QCP). However, the suppression
of the entanglement generation at QCP can be compensated both by increasing the
DM interaction and by decreasing the anisotropy of the spin chain. Beyond the
weak-coupling region, there exist resonance peaks of concurrence when the
system-bath coupling equals to external magnetic field. We attribute the
presence of resonance peaks to the flat band of the self-Hamiltonian. These
peaks are highly sensitive to anisotropy parameter and DM interaction.Comment: 8 pages, 9 figure
A Sharp upper bound for the spectral radius of a nonnegative matrix and applications
In this paper, we obtain a sharp upper bound for the spectral radius of a
nonnegative matrix. This result is used to present upper bounds for the
adjacency spectral radius, the Laplacian spectral radius, the signless
Laplacian spectral radius, the distance spectral radius, the distance Laplacian
spectral radius, the distance signless Laplacian spectral radius of a graph or
a digraph. These results are new or generalize some known results.Comment: 16 pages in Czechoslovak Math. J., 2016. arXiv admin note: text
overlap with arXiv:1507.0705
Indecomposable representations and oscillator realizations of the exceptional Lie algebra G_2
In this paper various representations of the exceptional Lie algebra G_2 are
investigated in a purely algebraic manner, and multi-boson/multi-fermion
realizations are obtained. Matrix elements of the master representation, which
is defined on the space of the universal enveloping algebra of G_2, are
explicitly determined. From this master representation, different
indecomposable representations defined on invariant subspaces or quotient
spaces with respect to these invariant subspaces are discussed. Especially, the
elementary representations of G_2 are investigated in detail, and the
corresponding six-boson realization is given. After obtaining explicit forms of
all twelve extremal vectors of the elementary representation with the highest
weight {\Lambda}, all representations with their respective highest weights
related to {\Lambda} are systematically discussed. For one of these
representations the corresponding five-boson realization is constructed.
Moreover, a new three-fermion realization from the fundamental representation
(0,1) of G_2 is constructed also.Comment: 29 pages, 4 figure
SLT-Resolution for the Well-Founded Semantics
Global SLS-resolution and SLG-resolution are two representative mechanisms
for top-down evaluation of the well-founded semantics of general logic
programs. Global SLS-resolution is linear for query evaluation but suffers from
infinite loops and redundant computations. In contrast, SLG-resolution resolves
infinite loops and redundant computations by means of tabling, but it is not
linear. The principal disadvantage of a non-linear approach is that it cannot
be implemented using a simple, efficient stack-based memory structure nor can
it be easily extended to handle some strictly sequential operators such as cuts
in Prolog.
In this paper, we present a linear tabling method, called SLT-resolution, for
top-down evaluation of the well-founded semantics. SLT-resolution is a
substantial extension of SLDNF-resolution with tabling. Its main features
include: (1) It resolves infinite loops and redundant computations while
preserving the linearity. (2) It is terminating, and sound and complete w.r.t.
the well-founded semantics for programs with the bounded-term-size property
with non-floundering queries. Its time complexity is comparable with
SLG-resolution and polynomial for function-free logic programs. (3) Because of
its linearity for query evaluation, SLT-resolution bridges the gap between the
well-founded semantics and standard Prolog implementation techniques. It can be
implemented by an extension to any existing Prolog abstract machines such as
WAM or ATOAM.Comment: Slight modificatio
- …