We describe the potential functions for N= 4B supersymmetric quantum mechanics with D (2, 1; ) symmetry.

Recent proposals for implementation of kernel-based nonparametric curve estimators are seen to be faster than naive direct implementations by factors up into the hundreds. The main ideas behind the two different approaches are made clear. Careful speed comparisons in a variety of settings and using a variety of machines and software are done. Various issues on computational accuracy and stability are also discussed. Our speed tests show that the fast methods are as fast or somewhat faster than methods traditionally considered very fast, such as LOWESS and smoothing splines.

For systems of hyperbolic conservation laws, a new Glimm functional was recently constructed when the linearly degenerate manifold in each characteristic field is either the whole space or it consists of a finitely many smooth and transversal manifolds of codimension one. This new functional leads to the neat consistency and convergence rate estimation of the Glimm scheme. In this paper, by the motivation of the result in Ref. 2, we show that the corresponding new Glimm functional can be constructed for general systems only under the strict hyperbolicity assumption.

Let G = (V, E) be a locally finite graph, whose measure μ(x) has positive lower bound, and Δ be the usual graph Laplacian. Applying the mountain-pass theorem due to Ambrosetti and Rabinowitz (1973), we establish existence results for some nonlinear equations, namely Δu + hu = f(x, u), x ∈ V. In particular, we prove that if h and f satisfy certain assumptions, then the above-mentioned equation has strictly positive solutions. Also, we consider existence of positive solutions of the perturbed equation Δu + hu = f(x, u) + ϵg. Similar problems have been extensively studied on the Euclidean space as well as on Riemannian manifolds.

We apply internal perturbation [3] to the matrix-type cryptosystems [C_n] and HM constructed in [9]. Using small instances of these variants, we investigate the existence of linearization equations and degree 2 equations that could be used in a XL attack. Our results indicate that these new variants may be suitable for use in practical implementations. We propose a specific instance for practical implementation, and estimate its performance and security.