Interior regularity criteria for suitable weak solutions of the Navier-Stokes equations

We present new interior regularity criteria for suitable weak solutions of the 3-D Navier-Stokes equations: a suitable weak solution is regular near an interior point $z$ if either the scaled $L^{p,q}_{x,t}$-norm of the velocity with $3/p+2/q\leq 2$, $1\leq q\leq \infty$, or the $L^{p,q}_{x,t}$-norm of the vorticity with $3/p+2/q\leq 3$, $1 \leq q < \infty$, or the $L^{p,q}_{x,t}$-norm of the gradient of the vorticity with $3/p+2/q\leq 4$, $1 \leq q$, $1 \leq p$, is sufficiently small near $z$

A geometric condition implying energy equality for solutions of 3D Navier-Stokes equation

We prove that every weak solution $u$ to the 3D Navier-Stokes equation that belongs to the class $L^3L^{9/2}$ and \n u belongs to $L^3L^{9/5}$ localy away from a 1/2-H\"{o}lder continuous curve in time satisfies the generalized energy equality. In particular every such solution is suitable.Comment: 10 page

Conflict-Free Coloring of Planar Graphs

A conflict-free k-coloring of a graph assigns one of k different colors to some of the vertices such that, for every vertex v, there is a color that is assigned to exactly one vertex among v and v's neighbors. Such colorings have applications in wireless networking, robotics, and geometry, and are well-studied in graph theory. Here we study the natural problem of the conflict-free chromatic number chi_CF(G) (the smallest k for which conflict-free k-colorings exist). We provide results both for closed neighborhoods N[v], for which a vertex v is a member of its neighborhood, and for open neighborhoods N(v), for which vertex v is not a member of its neighborhood. For closed neighborhoods, we prove the conflict-free variant of the famous Hadwiger Conjecture: If an arbitrary graph G does not contain K_{k+1} as a minor, then chi_CF(G) <= k. For planar graphs, we obtain a tight worst-case bound: three colors are sometimes necessary and always sufficient. We also give a complete characterization of the computational complexity of conflict-free coloring. Deciding whether chi_CF(G)<= 1 is NP-complete for planar graphs G, but polynomial for outerplanar graphs. Furthermore, deciding whether chi_CF(G)<= 2 is NP-complete for planar graphs G, but always true for outerplanar graphs. For the bicriteria problem of minimizing the number of colored vertices subject to a given bound k on the number of colors, we give a full algorithmic characterization in terms of complexity and approximation for outerplanar and planar graphs. For open neighborhoods, we show that every planar bipartite graph has a conflict-free coloring with at most four colors; on the other hand, we prove that for k in {1,2,3}, it is NP-complete to decide whether a planar bipartite graph has a conflict-free k-coloring. Moreover, we establish that any general} planar graph has a conflict-free coloring with at most eight colors.Comment: 30 pages, 17 figures; full version (to appear in SIAM Journal on Discrete Mathematics) of extended abstract that appears in Proceeedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pp. 1951-196

Lack of uniqueness for weak solutions of the incompressible porous media equation

In this work we consider weak solutions of the incompressible 2-D porous media equation. By using the approach of De Lellis-Sz\'ekelyhidi we prove non-uniqueness for solutions in $L^\infty$ in space and time.Comment: 23 pages, 2 fugure

Local ecosystem feedbacks and critical transitions in the climate

Global and regional climate models, such as those used in IPCC assessments, are the best tools available for climate predictions. Such models typically account for large-scale land-atmosphere feedbacks. However, these models omit local vegetationenvironment 5 feedbacks that are crucial for critical transitions in ecosystems. Here, we reveal the hypothesis that, if the balance of feedbacks is positive at all scales, local vegetation-environment feedbacks may trigger a cascade of amplifying effects, propagating from local to large scale, possibly leading to critical transitions in the largescale climate. We call for linking local ecosystem feedbacks with large-scale land10 atmosphere feedbacks in global and regional climate models in order to yield climate predictions that we are more confident about

Global Production Increased by Spatial Heterogeneity in a Population Dynamics Model

Spatial and temporal heterogeneity are often described as important factors having a strong impact on biodiversity. The effect of heterogeneity is in most cases analyzed by the response of biotic interactions such as competition of predation. It may also modify intrinsic population properties such as growth rate. Most of the studies are theoretic since it is often difficult to manipulate spatial heterogeneity in practice. Despite the large number of studies dealing with this topics, it is still difficult to understand how the heterogeneity affects populations dynamics. On the basis of a very simple model, this paper aims to explicitly provide a simple mechanism which can explain why spatial heterogeneity may be a favorable factor for production.We consider a two patch model and a logistic growth is assumed on each patch. A general condition on the migration rates and the local subpopulation growth rates is provided under which the total carrying capacity is higher than the sum of the local carrying capacities, which is not intuitive. As we illustrate, this result is robust under stochastic perturbations