Nonlinearly modulated dust lattice wave packets in two-dimensional hexagonal dust crystals

The amplitude modulation of dust lattice waves (DLWs) propagating in a two-dimensional hexagonal dust crystal is investigated in a continuum approximation, accounting for the effect of dust charge polarization (dressed interactions). A dusty plasma crystalline configuration with constant dust grain charge and mass is considered. The dispersion relation and the group velocity for DLWs are determined for wave propagation in both longitudinal and transverse directions. The reductive perturbation method is used to derive a (2+1)-dimensional nonlinear Schrodinger equation (NLSE). New expressions for the coefficients of the NLSE are derived and compared, for a Yukawa-type potential energy and for a

Modulated transverse off-plane dust-lattice wave packets in hexagonal two-dimensional dusty plasma crystals

The propagation of nonlinear dust-lattice waves in a two-dimensional hexagonal crystal is investigated. Transverse (off-plane) dust grain oscillatory motion is considered in the form of a backward propagating wave packet whose linear and nonlinear characteristics are investigated. An evolution equation is obtained for the slowly varying amplitude of the first (fundamental) harmonic by making use of a two-dimensional lattice multiple scales technique. An analysis based on the continuum approximation (spatially extended excitations compared to the lattice spacing) shows that wave packets will be modulationally stable and that dark-type envelope solitons (density holes) may occur in the long wavelength region. Evidence is provided of modulational instability and of the occurrence of bright-type envelopes (pulses) at shorter wavelengths. The role of second neighbor interactions is also investigated and is shown to be rather weak in determining the modulational stability region. The effect of dissipation, assumed negligible in the algebra throughout the article, is briefly discussed.

Positive almost Dunford-Pettis operators and their duality

We study some properties of almost Dunford-Pettis operators and we characterize pairs of Banach lattices for which the adjoint of an almost Dunford-Pettis operator inherits the same property and look at conditions under which an operator is almost Dunford-Pettis whenever its adjoint is.

On the spectrum of frequently hypercyclic operators

A bounded linear operator $T$ on a Banach space $X$ is called frequently hypercyclic if there exists $x\in X$ such that the lower density of the set $\{n\in\N:T^nx\in U\}$ is positive for any non-empty open subset $U$ of $X$. Bayart and Grivaux have raised a question whether there is a frequently hypercyclic operator on any separable infinite dimensional Banach space. We prove that the spectrum of a frequently hypercyclic operator has no isolated points. It follows that there are no frequently hypercyclic operators on all complex and on some real hereditarily indecomposable Banach spaces, which provides a negative answer to the above question.

Norm attaining operators and pseudospectrum

It is shown that if $11$, the operator $I+T$ attains its norm. A reflexive Banach space $X$ and a bounded rank one operator $T$ on $X$ are constructed such that $\|I+T\|>1$ and $I+T$ does not attain its norm.

A short proof of existence of disjoint hypercyclic operators

We give a short proof of existence of disjoint hypercyclic tuples of operators of any given length on any separable infinite dimensional Fr\'echet space. Similar argument provides disjoint dual hypercyclic tuples of operators of any length on any infinite dimensional Banach space with separable dual.

Operators, commuting with the Volterra operator, are not weakly supercyclic

We prove that any bounded linear operator on $L_p[0,1]$ for $1\leq p

Real-valued fixed-complexity sphere decoder for high dimensional QAM-MIMO systems

The development of high performance, low computational complexity detection algorithms is a key challenge for real-time Multiple-Input Multiple-Output (MIMO) communication system design. The Fixed-Complexity Sphere Decoder (FSD) algorithm is one of the most promising approaches, enabling quasi-ML decoding accuracy and high performance implementation due to its deterministic, highly parallel structure. However, it suffers from exponential growth in computational complexity as the number of MIMO transmit antennas increases, critically limiting its scalability to larger MIMO system topologies. In this paper, we present a solution to this problem by applying a novel cutting protocol to the decoding tree of a real-valued FSD algorithm. The new Real-valued Fixed-Complexity Sphere Decoder (RFSD) algorithm derived achieves similar quasi-ML decoding performance as FSD, but with an average 70% reduction in computational complexity, as we demonstrate from both theoretical and implementation perspectives for Quadrature Amplitude Modulation (QAM)-MIMO systems.