In E & Liu (SIAM J Numer. Anal., 1995), we studied convergence and the structure of the error for several projection methods when the spatial variable was kept continuous (we call this the semi-discrete case). In this paper, we address similar questions for the fully discrete case when the spatial variables are discretized using a staggered grid. We prove that the numerical solution in velocity has full accuracy up to the boundary, despite the fact that there are numerical boundary layers present in the semi-discrete solutions.

In this paper the authors study the hyperbolic geometric flow on Riemann surfaces. This new nonlinear geometric evolution equation was recently introduced by the first two authors, motivated by Einstein equation and Hamilton's Ricci flow. We prove that, for any given initial metric on ² in certain class of metrics, one can always choose suitable initial velocity symmetric tensor such that the solution exists for all time, and the scalar curvature corresponding to the solution metric <i>g</i> _<i>ij</i> keeps uniformly bounded for all time; moreover, if the initial velocity tensor is suitably large", then the solution metric <i>g</i> _<i>ij</i> converges to the flat metric at an algebraic rate. If the initial velocity tensor does not satisfy the condition, then the solution blows up at a finite time, and the scalar curvature <i>R</i>(<i>t</i>, <i>x</i>) goes to positive infinity as (<i>t</i>, <i>x</i>) tends to the blowup points, and a flow with surgery has

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.

MutantXL is an algorithm for solving systems of polynomial equations that was proposed at SCC 2008 and improved in PQC 2008. This article gives an overview over the MutantXL algorithm. It also presents experimental results comparing the behavior of the MutantXL algorithm to the $F_4$ algorithm on HFE and randomly generated multivariate systems. In both cases MutantXL is faster and uses less memory than the Magma's implementation of $F_4$.

No abstract uploaded!