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.