No abstract uploaded!

Let be a locally compact Hausdorff space. We show that any local -linear map (where" local" is a weaker notion than -linearity) between Banach -modules are" nearly -linear" and" nearly bounded". As an application, a local -linear map between Hilbert -modules is automatically -linear. If, in addition, contains no isolated point, then any -linear map between Hilbert -modules is automatically bounded. Another application is that if a sequence of maps between two Banach spaces" preserve -sequences"(or" preserve ultra- -sequences"), then is bounded for large enough and they have a common bound. Moreover, we will show that if is a bijective" biseparating" linear map from a" full" essential Banach -module into a" full" Hilbert -module (where is another locally compact Hausdorff space), then is" nearly bounded"(in fact, it is automatically bounded if or contains no isolated point) and there exists a homeomorphism such that ( ).

No abstract uploaded!

We characterize probability measure with finite moment of any order in terms of the symmetric difference operators of their Fourier transforms. By using our new characterization, we prove the continuity f (t, v)\in C ((0,\infty), L^ 1_ {2k-2+ }) , where f (t, v)\in C ((0,\infty), L^ 1_ {2k-2+ }) stands for the density of unique measure-valued solution f (t, v)\in C ((0,\infty), L^ 1_ {2k-2+ }) of the Cauchy problem for the homogeneous non-cutoff Boltzmann equation, with Maxwellian molecules, corresponding to a probability measure initial datum f (t, v)\in C ((0,\infty), L^ 1_ {2k-2+ }) satisfying\[\int| v|^{2k-2+ } dF_0 (v)<\infty, 0\leq < 2, k= 2, 3, 4,\cdots\] provided that f (t, v)\in C ((0,\infty), L^ 1_ {2k-2+ }) is not a single Dirac mass.

In this paper, we prove a closed formula for the degree of regularity of the family of HFE- (HFE Minus) multivariate public key cryptosystems over a finite field of size q. The degree of regularity of the polynomial system derived from an HFE- system is less than or equal to \begin{eqnarray*} \frac{(q-1)(\lfloor \log_q(D-1)\rfloor +a)}2 +2 & & \text{if is even and is odd,} \\ \frac{(q-1)(\lfloor \log_q(D-1)\rfloor+a+1)}2 +2 & & \text{otherwise.} \end{eqnarray*} Here q is the base field size, D the degree of the HFE polynomial, r=\lfloor \log_q(D-1)\rfloor +1 and a is the number of removed equations (Minus number). This allows us to present an estimate of the complexity of breaking the HFE Challenge 2: \begin{itemize} \item the complexity to break the HFE Challenge 2 directly using algebraic solvers is about 2^{96}. \end{itemize}