We study the Newton polygon jumping locus of a Mumford family in char p. Our main result says that, under a mild assumption on p, the jumping locus consists of only supersingular points and its cardinality is equal to (p^r − 1)(g − 1), where r is the degree of the defining field of the base curve of a Mumford family in char p and g is the genus of the curve. The underlying technique is the p-adic Hodge theory.

No abstract uploaded!

In this paper we connect Calderón and Zygmund’s notion of Lp-differentiability (Calderón and Zygmund, Proc Natl Acad Sci USA 46:1385–1389, 1960) with some recent characterizations of Sobolev spaces via the asymptotics of non-local functionals due to Bourgain, Brezis, and Mironescu (Optimal Control and Partial Differential Equations, pp. 439–455, 2001). We show how the results of the former can be generalized to the setting of the latter, while the latter results can be strengthened in the spirit of the former. As a consequence of these results we give several new characterizations of Sobolev spaces, a novel condition for whether a function of bounded variation is in the Sobolev space W1,1, and complete the proof of a characterization of the Sobolev spaces recently claimed in (Leoni and Spector, J Funct Anal 261:2926–2958, 2011; Leoni and Spector, J Funct Anal 266:1106–1114, 2014).

Evolution occurs in populations of reproducing individuals. The structure of a population can affect which traits evolve 1, 2. Understanding evolutionary game dynamics in structured populations remains difficult. Mathematical results are known for special structures in which all individuals have the same number of neighbours 3, 4, 5, 6, 7, 8. The general case, in which the number of neighbours can vary, has remained open. For arbitrary selection intensity, the problem is in a computational complexity class that suggests there is no efficient algorithm 9. Whether a simple solution for weak selection exists has remained unanswered. Here we provide a solution for weak selection that applies to any graph or network. Our method relies on calculating the coalescence times 10, 11 of random walks 12. We evaluate large numbers of diverse population structures for their propensity to favour cooperation. We study how small

We consider numerical boundary conditions for high order finite difference schemes for solving convection-diffusion equations on arbitrary geometry. The two main difficulties for numerical boundary conditions in such situations are: (1) the wide stencil of the high order finite difference operator requires special treatment for a few ghost points near the boundary; (2) the physical boundary may not coincide with grid points in a Cartesian mesh and may intersect with the mesh in an arbitrary fashion. For purely convection equations, the so-called inverse Lax-Wendroff procedure, in which we convert the normal derivatives into the time derivatives and tangential derivatives along the physical boundary by using the equations, have been quite successful. In this paper, we extend this methodology to convection-diffusion equations. It turns out that this extension is non-trivial, because totally different boundary treatments are needed for the diffusion-dominated and the convection-dominated regimes. We design a careful combination of the boundary treatments for the two regimes and obtain a stable and accurate boundary condition for general convection-diffusion equations. We provide extensive numerical tests for one- and two-dimensional problems involving both scalar equations and systems, including the compressible Navier-Stokes equations, to demonstrate the good performance of our numerical boundary conditions.