A short proof of a conjecture of Erd\"os proved by Moreira, Richter and Robertson

We give a short proof of a sumset conjecture of Erd\"os, recently proved by Moreira, Richter and Robertson: every subset of the integers of positive density contains the sum of two infinite sets. The proof is written in the framework of classical ergodic theory.Comment: Made some small correction

Ergodic seminorms for commuting transformations and applications

Recently, T. Tao gave a finitary proof a convergence theorem for multiple averages with several commuting transformations and soon later, T. Austin gave an ergodic proof of the same result. Although we give here one more proof of the same theorem, this is not the main goal of this paper. Our main concern is to provide some tools for the case of several commuting transformations, similar to the tools successfully used in the case of a single transformation, with the idea that they will be useful in the solution of other problems

Deterministic Capacity of MIMO Relay Networks

The deterministic capacity of a relay network is the capacity of a network when relays are restricted to transmitting \emph{reliable} information, that is, (asymptotically) deterministic function of the source message. In this paper it is shown that the deterministic capacity of a number of MIMO relay networks can be found in the low power regime where \SNR\to0. This is accomplished through deriving single letter upper bounds and finding the limit of these as \SNR\to0. The advantage of this technique is that it overcomes the difficulty of finding optimum distributions for mutual information.Comment: Submitted to IEEE Transactions on Information Theor

Variations on topological recurrence

Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects in topological dynamics. We describe relations between recurrence in different sorts of systems, study ways to formulate finite versions of recurrence, and describe connections to combinatorial problems. In particular, we show that sets of Bohr recurrence (meaning sets of recurrence for rotations) suffice for recurrence in nilsystems. Additionally, we prove an extension of this property for multiple recurrence in affine systems