Let$X$(-ϱ$B$^{$m$}×$C$^{$n$}be a compact set over the unit sphere ϱ$B$^{$m$}such that for each$z$∈ϱ$B$^{$m$}the fiber$X$_{$z$}={ω∈$C$^{$n$};($z, ω$)∈$X$} is the closure of a completely circled pseudoconvex domain in$C$^{$n$}. The polynomial hull $$\hat X$$ of$X$is described in terms of the Perron-Bremermann function for the homogeneous defining function of$X$. Moreover, for each point ($z$_{0},$w$_{0})∈Int $$\hat X$$ there exists a smooth up to the boundary analytic disc$F$:Δ→$B$^{$m$}×$C$^{$n$}with the boundary in$X$such that$F$(0)=($z$_{0},$w$_{0}).

In this paper we introduce Coleff–Herrera residue currents defined by systems of c-holomorphic functions and prove a Lelong–Poincaré and a Cauchy-type formula as well as the transformation law for these currents.

There are few techniques available for testing whether or not a family of parametric times series models fits a set of data reasonably well without serious restrictions on the forms of alternative models. In this paper, we consider generalised likelihood ratio tests of whether or not the spectral density function of a stationary time series admits certain parametric forms. We propose a bias correction method for the generalised likelihood ratio test of Fan et al. (2001). In particular, our methods can be applied to test whether or not a residual series is white noise. Sampling properties of the proposed tests are established. A bootstrap approach is proposed for estimating the null distribution of the test statistics. Simulation studies investigate the accuracy of the proposed bootstrap estimate and compare the power of the various ways of constructing the generalised likelihood ratio tests as well as some classic methods like

We use the learning with errors (LWE) problem to build a new simple and provably secure key exchange scheme. The basic idea of the construction can be viewed as certain extension of Diffie-Hellman problem with errors. The mathematical structure behind comes from the commutativity of computing a bilinear form in two different ways due to the associativity of the matrix multiplications: (x^t \times A)\times y = x^t \times (A\times y), where x,y are column vectors and A is a square matrix. We show that our new schemes are more efficient in terms of communication and computation complexity compared with key exchange schemes or key transport schemes via encryption schemes based on the LWE problem. Furthermore, we extend our scheme to the ring learning with errors (RLWE) problem, resulting in small key size and better efficiency.

We prove that Mark Gross’ [8] topological Calabi-Yau compactifications can be made into symplectic compactifications. To prove this we develop a method to construct singular Lagrangian 3-torus fibrations over certain a priori given integral affine manifolds with singularities, which we call simple. This produces pairs of compact symplectic 6-manifolds homeomorphic to mirror pairs of Calabi-Yau 3-folds together with Lagrangian fibrations whose underlying integral affine structures are dual.