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.

We propose an approach to find constant curvature metrics on triangulated closed 3-manifolds using a finite dimensional variational method whose energy function is the volume. The concept of an angle structure on a tetrahedron and on a triangulated closed 3-manifold is introduced following the work of Casson, Murakami and Rivin. It is proved by A. Kitaev and the author that any closed 3-manifold has a triangulation supporting an angle structure. The moduli space of all angle structures on a triangulated 3-manifold is a bounded open convex polytope in a Euclidean space. The volume of an angle structure is defined. Both the angle structure and the volume are natural generalizations of tetrahedra in the constant sectional curvature spaces and their volume. It is shown that the volume functional can be extended continuously to the compact closure of the moduli space. In particular, the maximum point of the

The existence of a discrete travelling wave is proved for the relaxing scheme. The main idea is to change the original scheme such that the resulting scheme is monotonic to which Jennings' result can be applied. The equivalence of the resulting scheme and the original one is shown when = 1 q. The u-component of the discrete travelling wave thus obtained is a discrete shock for a monotone conservative difference scheme, which approximates the corresponding conservation law.

Let Q be an acyclic quiver and s be a sequence with elements in the vertex set Q_0. We describe an induced sequence of simple (backward) tilting in the bounded derived category D(Q), starting from the standard heart H_Q = modkQ and ending at another heart H_s in D(Q). Then we show that s is a green mutation sequence if and only if every heart in this simple tilting sequence is greater than or equal to HQ[−1]; it is maximal if and only if H_s = H_Q[−1]. This provides a categorical way to understand green mutations. Further, fix a Coxeter element c in the Coxeter group W_Q of Q, which is admissible with respect to the orientation of Q. We prove that the sequence \tilde{w} induced by a c-sortable word w is a green mutation sequence. As a consequence, we obtain a bijection between c-sortable words and finite torsion classes in H_Q. As byproducts, the interpretations of inversions, descents and cover reflections of a c-sortable word w are given in terms of the combinatorics of green mutations.

In this paper, we present a new algorithm to solve algebraically the following lattice-related problems: 1) the small integer solution (SIS) problem under the condition: if the solution is bounded by an integer β in l_∞ norm, which we call a bounded SIS (BSIS) problem, and if the difference between the row dimension n and the column dimension m of the corresponding basis matrix is relatively small with respect the row dimension m; 2) the learning with errors (LWE) problems under the condition: if the errors are bounded - the errors do not span the whole prime finite field F_q but a fixed known subset of size D (D < q), which we call a learning with bounded errors (LWBE) problem. We will show that we can solve these problems with polynomial complexity.