No abstract uploaded!

Given a Lagrangian sphere in a symplectic 4–manifold $(M, \omega)$ with $b^{+}=1$, we find embedded symplectic surfaces intersecting it minimally. When the Kodaira dimension  $\kappa$ of $(M,\omega)$ is $-\infty$, this minimal intersection property turns out to be very powerful for both the uniqueness and existence problems of Lagrangian spheres. On the uniqueness side, for a symplectic rational manifold and any class which is not characteristic, we show that homologous Lagrangian spheres are smoothly isotopic, and when the Euler number is less than 8, we generalize Hind and Evans’ Hamiltonian uniqueness in the monotone case. On the existence side, when  $\kappa=-\infty$, we give a characterization of classes represented by Lagrangian spheres, which enables us to describe the non-Torelli part of the symplectic mapping class group.

We introduce a new troubled-cell indicator for the discontinuous Galerkin (DG) methods for solving hyperbolic conservation laws. This indicator can be defined on unstructured meshes for high order DG methods and depends only on data from the target cell and its immediate neighbors. It is able to identify shocks without PDE sensitive parameters to tune. Extensive one- and two-dimensional simulations on the hyperbolic systems of Euler equations indicate the good performance of this new troubled-cell indicator coupled with a simple minmod-type TVD limiter for the Runge-Kutta DG (RKDG) methods.

Many discrete integrable systems exhibit the Laurent phenomenon. In this paper, we investigate three integrable systems: the Somos-4 recurrence, the Somos-5 recurrence, and a system related to so-called A_1 A_1-system, whose general solutions are derived in terms of Hankel determinant. As a result, we directly confirm that they satisfy the Laurent property. Additionally, it is shown that the Somos-5 recurrence can be viewed as a specified Backlund transformation of the Somos-4 recurrence. Related topics about Somos polynomials are also studied.

In this paper, we introduce a new method to avoid zero reductions in Gröbner basis computation. We call this method LASyz, which stands for Lineal Algebra to compute Syzygies. LASyz uses exhaustively the information of both principal syzygies and non-trivial syzygies to avoid zero reductions. All computation is done using linear algebra techniques. LASyz is easy to understand and implement. The method does not require to compute Gröbner bases of subsequences of generators incrementally and it imposes no restrictions on the reductions allowed. We provide a complete theoretical foundation for the LASyz method and we describe an algorithm to compute Gröbner bases for zero dimensional ideals based on this foundation. A qualitative comparison with similar algorithms is provided and the performance of the algorithm is illustrated with experimental data.