On the least common multiple of qq-binomial coefficients

In this paper, we prove the following identity \lcm({n\brack 0}_q,{n\brack 1}_q,...,{n\brack n}_q) =\frac{\lcm([1]_q,[2]_q,...,[n+1]_q)}{[n+1]_q}, where ${n\brack k}_q$ denotes the $q$-binomial coefficient and $[n]_q=\frac{1-q^n}{1-q}$. This result is a $q$-analogue of an identity of Farhi [Amer. Math. Monthly, November (2009)].Comment: 5 page

Hemodynamic evaluation using four-dimensional flow magnetic resonance imaging for a patient with multichanneled aortic dissection

The hemodynamic function of multichanneled aortic dissection (MCAD) requires close monitoring and effective management to avoid potentially catastrophic sequelae. This report describes a 47-year-old man who underwent endovascular repair based on findings from four-dimensional (4D) flow magnetic resonance imaging of an MCAD. The acquired 4D flow data revealed complex, bidirectional flow patterns in the false lumens and accelerated blood flow in the compressed true lumen. The collapsed abdominal true lumen expanded unsatisfactorily after primary tear repair, which required further remodeling with bare stents. This case study demonstrates that hemodynamic analysis using 4D flow magnetic resonance imaging can help understand the complex pathologic changes of MCAD

Visualisation of Origins, Destinations and Flows with OD Maps

We present a new technique for the visual exploration of origins (O) and destinations (D) arranged in geographic space. Previous attempts to map the flows between origins and destinations have suffered from problems of occlusion usually requiring some form of generalisation, such as aggregation or flow density estimation before they can be visualized. This can lead to loss of detail or the introduction of arbitrary artefacts in the visual representation. Here, we propose mapping OD vectors as cells rather than lines, comparable with the process of constructing OD matrices, but unlike the OD matrix, we preserve the spatial layout of all origin and destination locations by constructing a gridded two‐level spatial treemap. The result is a set of spatially ordered small multiples upon which any arbitrary geographic data may be projected. Using a hash grid spatial data structure, we explore the characteristics of the technique through a software prototype that allows interactive query and visualisation of 105‐106 simulated and recorded OD vectors. The technique is illustrated using US county to county migration and commuting statistics

Optimal transfer of an unknown state via a bipartite operation

A fundamental task in quantum information science is to transfer an unknown state from particle $A$ to particle $B$ (often in remote space locations) by using a bipartite quantum operation $\mathcal{E}^{AB}$. We suggest the power of $\mathcal{E}^{AB}$ for quantum state transfer (QST) to be the maximal average probability of QST over the initial states of particle $B$ and the identifications of the state vectors between $A$ and $B$. We find the QST power of a bipartite quantum operations satisfies four desired properties between two $d$-dimensional Hilbert spaces. When $A$ and $B$ are qubits, the analytical expressions of the QST power is given. In particular, we obtain the exact results of the QST power for a general two-qubit unitary transformation.Comment: 6 pages, 1 figur

Anomalous quantum glass of bosons in a random potential in two dimensions

We present a quantum Monte Carlo study of the "quantum glass" phase of the 2D Bose-Hubbard model with random potentials at filling $\rho=1$. In the narrow region between the Mott and superfluid phases the compressibility has the form $\kappa \sim {\rm exp}(-b/T^\alpha)+c$ with $\alpha <1$ and $c$ vanishing or very small. Thus, at $T=0$ the system is either incompressible (a Mott glass) or nearly incompressible (a Mott-glass-like anomalous Bose glass). At stronger disorder, where a glass reappears from the superfluid, we find a conventional highly compressible Bose glass. On a path connecting these states, away from the superfluid at larger Hubbard repulsion, a change of the disorder strength by only $10\%$ changes the low-temperature compressibility by more than four orders of magnitude, lending support to two types of glass states separated by a phase transition or a sharp cross-over.Comment: Published version including supplementary material, 11 pages total, 15 figure

Two novel nonlinear companding schemes with iterative receiver to reduce PAPR in multi-carrier modulation systems

Companding transform is an efficient and simple method to reduce the Peak-to-Average Power Ratio (PAPR) for Multi-Carrier Modulation (MCM) systems. But if the MCM signal is only simply operated by inverse companding transform at the receiver, the resultant spectrum may exhibit severe in-band and out-of-band radiation of the distortion components, and considerable peak regrowth by excessive channel noises etc. In order to prevent these problems from occurring, in this paper, two novel nonlinear companding schemes with a iterative receiver are proposed to reduce the PAPR. By transforming the amplitude or power of the original MCM signals into uniform distributed signals, the novel schemes can effectively reduce PAPR for different modulation formats and sub-carrier sizes. Despite moderate complexity increasing at the receiver, but it is especially suitable to be combined with iterative channel estimation. Computer simulation results show that the proposed schemes can offer good system performances without any bandwidth expansion

Factors of sums and alternating sums involving binomial coefficients and powers of integers

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer $r$, there holds {align*} \sum_{k=0}^{n_1}\epsilon^k (2k+1)^{2r+1}\prod_{i=1}^{m} {n_i+n_{i+1}+1\choose n_i-k} \equiv 0 \mod (n_1+n_m+1){n_1+n_m\choose n_1}, {align*} and conjecture that for any nonnegative integer $r$ and positive integer $s$ such that $r+s$ is odd, $$\sum_{k=0}^{n}\epsilon ^k (2k+1)^{r}({2n\choose n-k}-{2n\choose n-k-1})^{s} \equiv 0 \mod{{2n\choose n}},$$ where $\epsilon=\pm 1$.Comment: 14 pages, to appear in Int. J. Number Theor