Compositions into Powers of bb: Asymptotic Enumeration and Parameters

For a fixed integer base $b\geq2$, we consider the number of compositions of $1$ into a given number of powers of $b$ and, related, the maximum number of representations a positive integer can have as an ordered sum of powers of $b$. We study the asymptotic growth of those numbers and give precise asymptotic formulae for them, thereby improving on earlier results of Molteni. Our approach uses generating functions, which we obtain from infinite transfer matrices. With the same techniques the distribution of the largest denominator and the number of distinct parts are investigated

Canonical Trees, Compact Prefix-free Codes and Sums of Unit Fractions: A Probabilistic Analysis

For fixed $t\ge 2$, we consider the class of representations of $1$ as sum of unit fractions whose denominators are powers of $t$ or equivalently the class of canonical compact $t$-ary Huffman codes or equivalently rooted $t$-ary plane "canonical" trees. We study the probabilistic behaviour of the height (limit distribution is shown to be normal), the number of distinct summands (normal distribution), the path length (normal distribution), the width (main term of the expectation and concentration property) and the number of leaves at maximum distance from the root (discrete distribution)

Multi-Base Representations of Integers: Asymptotic Enumeration and Central Limit Theorems

In a multi-base representation of an integer (in contrast to, for example, the binary or decimal representation) the base (or radix) is replaced by products of powers of single bases. The resulting numeral system has desirable properties for fast arithmetic. It is usually redundant, which means that each integer can have multiple different digit expansions, so the natural question for the number of representations arises. In this paper, we provide a general asymptotic formula for the number of such multi-base representations of a positive integer $n$. Moreover, we prove central limit theorems for the sum of digits, the Hamming weight (number of non-zero digits, which is a measure of efficiency) and the occurrences of a fixed digits in a random representation

Single-Photon Switch based on Rydberg Blockade

All-optical switching is a technique in which a gate light pulse changes the transmission of a target light pulse without the detour via electronic signal processing. We take this to the quantum regime, where the incoming gate light pulse contains only one photon on average. The gate pulse is stored as a Rydberg excitation in an ultracold atomic gas using electromagnetically induced transparency. Rydberg blockade suppresses the transmission of the subsequent target pulse. Finally, the stored gate photon can be retrieved. A retrieved photon heralds successful storage. The corresponding postselected subensemble shows an extinction of 0.05. The single-photon switch offers many interesting perspectives ranging from quantum communication to quantum information processing

Unitary equivalence to a truncated Toeplitz operator: analytic symbols

Unlike Toeplitz operators on $H^2$, truncated Toeplitz operators do not have a natural matricial characterization. Consequently, these operators are difficult to study numerically. In this note we provide criteria for a matrix with distinct eigenvalues to be unitarily equivalent to a truncated Toeplitz operator having an analytic symbol. This test is constructive and we illustrate it with several examples. As a byproduct, we also prove that every complex symmetric operator on a Hilbert space of dimension $\leq 3$ is unitarily equivalent to a direct sum of truncated Toeplitz operators.Comment: 15 page