We study transport in quantum systems consisting of a finite array of N identical single-channel scatterers. A general expression of the S matrix in terms of the individual-element data obtained recently for potential scattering is rederived in this wider context. It shows in particular how the band spectrum of the infinite periodic system arises in the limit N. We illustrate the result on two kinds of examples. The first are serial graphs obtained by chaining loops or T-junctions. Another example concerns geometric scatterers where the individual element consists of a surface with a pair of leads; we show that apart from the resonances coming from the decoupled-surface eigenvalues, such scatterers exhibit the high-energy behavior typical for the interaction for the physically interesting couplings.

Largescale multiple testing with correlated test statistics arises frequently in much scientific research. Incorporating correlation information in approximating the false discovery proportion (FDP) has attracted increasing attention in recent years. When the covariance matrix of test statistics is known, Fan and his colleagues provided an accurate approximation of the FDP under arbitrary dependence structure and some sparsity assumption. However, the covariance matrix is often unknown in many applications and such dependence information must be estimated before approximating the FDP. The estimation accuracy can greatly affect the FDP approximation. In the current paper, we study theoretically the effect of unknown dependence on the testing procedure and establish a general framework such that the FDP can be well approximated. The effects of unknown dependence on approximating the FDP are in the

The main goal of this paper is to prove the following two conjectures for genus up to two: 1. Witten's conjecture on the relations between higher spin curves and Gelfand--Dickey hierarchy. 2. Virasoro conjecture for target manifolds with conformal semisimple Frobenius manifolds. The main technique used in the proof is the invariance of tautological equations under loop group action.

We present a generalized learning with errors (LWE) problem, which is essentially a simple and direct extension of the original LWE problem to the case of matrices. Then we use this new version of LWE problem, which we call matrix LWE problem to build new cryptographic schemes, which include a new scalable key distribution scheme, a new key exchanges scheme and a new simple identity-based encryption scheme.

We derive asymptotic expansion for the spectrum of Hamiltonians with a strong attractive interaction supported by a smooth surface in R 3, either infinite and asymptotically planar, or compact and closed. Its second term is found to be determined by a Schrdinger type operator with an effective potential expressed in terms of the interaction support curvatures.