6 problems

Condensed derangement set throughput conjecture. Different condensed derangement sets achieve roughly the same average throughput for $N$ larger than $5$.

A time-invariant prefix code is used for feedback in a scalar linear-quadratic-Gaussian control system, and an achievability argument establishes near-minimum bitrate performance w…

Let $G\in\mathcal{RH}^{m\times m}_\infty$ and let $\mathfrak{C}[\alpha]$ be the set of phase-bounded systems, where $\alpha\in[0,\pi)$. The feedback system $G\#H$ is stable for eve…

Let $\operatorname{MIMO\text{-}ACLR}$ denote the MIMO adjacent-channel leakage ratio defined by … where $B$ is the transmission bandwidth, $S_{\boldsymbol{\theta}}(f)$ is the recei…

Let $T$ be the coherence-block length and let $T_p^*$ denote the optimal training length, with training occupying $T_p^*$ symbols of the coherence block. Optimal training-length co…

Condensed derangement-set conjecture. The same will be the case for large $N$ as well: only a subset of $N-1$ switch matrices need be considered in the scheduling problem to achiev…