Time operators and shift representation of dynamical systems

We introduce and characterise time operators for unilateral shifts and exact endomorphisms. The associated shift representation of evolution is related to the spectral representation by a generalized Fourier transform. We illustrate the results for a simple exact system, namely the Renyi map.

Cohomology of Banach algebras of operators and geometry of Banach spaces.

In the paper we give an exposition of the major results concerning the relation between first order cohomology of Banach algebras of operators on a Banach space with coefficients in specified modules and the geometry of the underlying Banach space. In particular we shall compare the properties weak amenability and amenability for Banach algebras A(X), the approximable operators on a Banach space X. Whereas amenability is a local property of the Banach space X, weak amenability is often the consequence of properties of large scale geometry.

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.

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.

Hypercyclic tuples of operators on $C^n$ and $R^n$

A tuple $(T_1,\dots,T_n)$ of continuous linear operators on a topological vector space $X$ is called hypercyclic if there is $x\in X$ such that the the orbit of $x$ under the action of the semigroup generated by $T_1,\dots,T_n$ is dense in $X$. This concept was introduced by N.~Feldman, who have raised 7 questions on hypercyclic tuples. We answer those 4 of them, which can be dealt with on the level of operators on finite dimensional spaces. In
particular, we prove that the minimal cardinality of a hypercyclic tuple of operators on $\C^n$ (respectively, on $\R^n$) is $n+1$ (respectively, $\frac n2+\frac{5+(-1)^n}{4}$), that there are non-diagonalizable tuples of operators on $\R^2$ which possess an orbit being neither dense nor nowhere dense and construct a hypercyclic 6-tuple of operators on $\C^3$ such that every operator commuting with each member of the tuple is non-cyclic.

Operators for Similarity Search: Semantics, Techniques and Usage Scenarios

This book provides a comprehensive tutorial on similarity operators. The authors systematically survey the set of similarity operators, primarily focusing on their semantics, while also touching upon mechanisms for processing them effectively.

The book starts off by providing introductory material on similarity search systems, highlighting the central role of similarity operators in such systems. This is followed by a systematic categorized overview of the variety of similarity operators that have been proposed in literature over the last two decades, including advanced operators such as RkNN, Reverse k-Ranks, Skyline k-Groups and K-N-Match. Since indexing is a core technology in the practical implementation of similarity operators, various indexing mechanisms are summarized. Finally, current research challenges are outlined, so as to enable interested readers to identify potential directions for future investigations.

In summary, this book offers a comprehensive overview of the field of similarity search operators, allowing readers to understand the area of similarity operators as it stands today, and in addition providing them with the background needed to understand recent novel approaches.

Spectrally bounded operators from von Neumann algebras

We prove that every unital spectrally bounded operator from a properly infinite von Neumann algebra onto a semisimple Banach algebra is a Jordan homomorphism.

Scheduling and Platforming Trains at Busy Complex Stations

We consider the problem of train planning or scheduling for large, busy, complex train stations, which are common in Europe and elsewhere, though not in North America. We develop the constraints and objectives for this problem, but these are too computationally complex to solve by standard combinatorial search or integer programming methods. Also, the problem is somewhat political in nature, that is, it does not have a clear objective function because it involves multiple train operators with conflicting interests. We therefore develop scheduling heuristics analogous to those successfully adopted by train planners using ''manual'' methods. We tested the model and algorithms by applying to a typical large station that exhibits most of the complexities found in practice. The results compare well with those found by traditional methods, and take account of cost and preference trade-offs not handled by those methods. With successive refinements, the algorithm eventually took only a few seconds to run, the time depending on the version of the algorithm and the scheduling problem. The scheduling models and algorithms developed and tested here can be used on their own, or as key components for a more general system for train scheduling for a rail line or network.Train scheduling for a busy station includes ensuring that there are no conflicts between several hundred trains per day going in and out of the station on intersecting paths from multiple in-lines and out-lines to multiple platforms, while ensuring that each train is allowed at least its minimum required headways, dwell time, turnaround time and trip time. This has to be done while minimizing (costs of) deviations from desired times, platforms or lines, allowing for conflicts due to through-platforms, dead-end platforms, multiple sub-platforms, and possible constraints due to infrastructure, safety or business policy.

Entanglement between collective operators in a linear harmonic chain

We investigate entanglement between collective operators of two blocks of oscillators in an infinite linear harmonic chain. These operators are defined as averages over local operators (individual oscillators) in the blocks. On the one hand, this approach of "physical blocks" meets realistic experimental conditions, where measurement apparatuses do not interact with single oscillators but rather with a whole bunch of them, i.e., where in contrast to usually studied "mathematical blocks" not every possible measurement is allowed. On the other, this formalism naturally allows the generalization to blocks which may consist of several noncontiguous regions. We quantify entanglement between the collective operators by a measure based on the Peres-Horodecki criterion and show how it can be extracted and transferred to two qubits. Entanglement between two blocks is found even in the case where none of the oscillators from one block is entangled with an oscillator from the other, showing genuine bipartite entanglement between collective operators. Allowing the blocks to consist of a periodic sequence of subblocks, we verify that entanglement scales at most with the total boundary region. We also apply the approach of collective operators to scalar quantum field theory.