No abstract uploaded!

Let$X$and$Y$be closed subspaces of the Lorentz sequence space$d(v, p)$and the Orlicz sequence space$l$_{$M$}, respectively. It is proved that every bounded linear operator from$X$to$Y$is compact whenever $$p > \beta _M : = \inf \{ q > 0:\inf \{ M(\lambda t)/M(\lambda )t^q :0< \lambda ,t \leqslant 1\} > 0.$$ As an application, the reflexivity of the space of bounded linear operators acting from$d(v, p)$to$l$_{$M$}is characterized.

nthispaperwewillpresentthelocalstabilityanalysisandlocalerrorestimatefor the local discontinuous Galerkin (LDG) method, when solving the time-dependent singularly perturbed problems in one dimensional space with a stationary outflow boundary layer. Based on a general framework on the local stability, we obtain the optimal error estimate out of the local subdomain, which is nearby the outflow boundary point and has the width of O(h log(1/h)), for the semi-discrete LDG scheme and the fully-discrete LDG scheme with the second order explicit Runge–Kutta time-marching. Here h is the maximum mesh length. The numerical experiments are given also.

A birational transformation f: P^n --> Z, where Z is a nonsingular variety of Picard number 1, is called a special birational transformation of type (a, b) if f is given by a linear system of degree a, its inverse is given by a linear system of degree b and the base locus S \subset P^n of f is irreducible and nonsingular. In this paper, we classify special birational transformations of type (2,1). In addition to previous works Alzati-Sierra and Russo on this topic, our proof employs natural C^*-actions on Z in a crucial way. These C^*-actions also relate our result to the problem studied in our previous work on smooth projective varieties with nonzero prolongations.

We reduced the unsolved problem of Evans triangles to the problem of nding rational points on a class of elliptic curves, the twisted Edwards curves En. We proved that the set of all Evans triangles with a given ratio is isomorphic to a quotient group of En(Q). After this, using Sage, we can solve the Evans problem for an amount of cases within the capacity of computer. Even without the help of a computer, we can still obtain a large class of new Evans triangles, and nd an eective way to test if the rank of an Edwards curve is positive or not.