Recovery of signals under the condition on RIC and ROC via prior support information

In this paper, the sufficient condition in terms of the RIC and ROC for the stable and robust recovery of signals in both noiseless and noisy settings was established via weighted $l_1$ minimization when there is partial prior information on support of signals. An improved performance guarantee has been derived. We can obtain a less restricted sufficient condition for signal reconstruction and a tighter recovery error bound under some conditions via weighted $l_1$ minimization. When prior support estimate is at least 50% accurate, the sufficient condition is weaker than the analogous condition by standard $l_1$ minimization method, meanwhile the reconstruction error upper bound is provably to be smaller under additional conditions. Furthermore, the sufficient condition is also proved sharp.     

Parametric error bounds for convex approximations of two-stage mixed-integer recourse models with a random second-stage cost vector

We consider two-stage recourse models with integer restrictions in the second stage. These models are typically non-convex and hence, hard to solve. There exist convex approximations of these models with accompanying error bounds. However, it is unclear how these error bounds depend on the distributions of the second-stage cost vector q. In this paper, we derive parametric error bounds whose dependence on the distribution of q is explicit: they scale linearly in the expected value of the ${?}_1$-norm of q.     

Least Wasserstein distance between disjoint shapes with perimeter regularization

We prove the existence of global minimizers to the double minimization problem where $P(E)$ denotes the perimeter of the set E, $W_p$ is the p-Wasserstein distance between Borel probability measures, and $\lambda >0$ is arbitrary. The result holds in all space dimensions, for all $p\in [1,\infty )$, and for all positive λ. This answers a question of Buttazzo, Carlier, and Laborde.     

The Lp dual Minkowski problem for p > 1 and q > 0

General $L_p$ dual curvature measures have recently been introduced by Lutwak, Yang and Zhang [24]. These new measures unify several other geometric measures of the Brunn–Minkowski theory and the dual Brunn–Minkowski theory. $L_p$ dual curvature measures arise from qth dual intrinsic volumes by means of Alexandrov-type variational formulas. Lutwak, Yang and Zhang [24] formulated the $L_p$ dual Minkowski problem, which concerns the characterization of $L_p$ dual curvature measures. In this paper, we solve the existence part of the $L_p$ dual Minkowski problem for $p>1$ and $q>0$, and we also discuss the regularity of the solution.     

Global regularity for a class of 2D generalized tropical climate models

This paper establishes the global existence and regularity of solutions to a two-dimensional (2D) tropical climate model (TCM) with fractional dissipation. The inviscid counterpart of this model was derived by Frierson, Majda and Pauluis [8] as a model for tropical geophysical flows. This model reflects the interaction and coupling among the barotropic mode u, the first baroclinic mode v of the velocity and the temperature θ. The systems with fractional dissipation studied here may arise in the modeling of geophysical circumstances. Mathematically these systems allow simultaneous examination of a family of systems with various levels of regularization. The aim here is the global regularity with the least dissipation. We prove two main results: first, the global regularity of the system with ${(?\mathrm{\Delta })}^{\beta }v$ and ${(?\mathrm{\Delta })}^{\gamma }\theta$ for $\beta >1$ and $\beta +\gamma >\frac{3}{2}$; and second, the global regularity of the system with ${(?\mathrm{\Delta })}^{\beta }v$ for $\beta >\frac{3}{2}$. The proofs of these results are not trivial and the requirements on the fractional indices appear to be optimal. The key tools employed here include the maximal regularity for general fractional heat operators, the Littlewood–Paley decomposition and Besov space techniques, lower bounds involving fractional Laplacian and simultaneous estimates of several coupled quantities.     

Balls,bins, and embeddings of partial k-star designs

Define a $k$-star to be the complete bipartite graph $K_{1,k}$. In a 2014 article, Hoffman and Roberts prove that a partial $k$-star decomposition of $K_n$ can be embedded in a $k$-star decomposition of $K_{n+s}$ where $s$ is at most $7k?4$ if $k$ is odd and $8k?4$ if $k$ is even. In our work, we offer a straightforward construction for embedding partial $k$-star designs and lower these bounds to $3k?2$ and $4k?2$, respectively.     

Gallai’s path decomposition conjecture for triangle-free planar graphs

A path decomposition of a graph $G$ is a collection of edge-disjoint paths of $G$ that covers the edge set of $G$. Gallai (1968) conjectured that every connected graph on $n$ vertices admits a path decomposition of cardinality at most $?(n+1)∕2?$. Gallai’s Conjecture has been verified for many classes of graphs. In particular, Lovász (1968) verified this conjecture for graphs with at most one vertex with even degree, and Pyber (1996) verified it for graphs in which every cycle contains a vertex with odd degree. Recently, Bonamy and Perrett (2016) verified Gallai’s Conjecture for graphs with maximum degree at most 5, and Botler et al. (2017) verified it for graphs with treewidth at most 3. In this paper, we verify Gallai’s Conjecture for triangle-free planar graphs.     

Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations

A decomposition of a multigraph $G$ is a partition of its edges into subgraphs $G\left(1\right),\dots ,G\left(k\right)$. It is called an $r$-factorization if every $G\left(i\right)$ is $r$-regular and spanning. If $G$ is a subgraph of $H$, a decomposition of $G$ is said to be enclosed in a decomposition of $H$ if, for every $1\le i\le k$, $G\left(i\right)$ is a subgraph of $H\left(i\right)$.Feghali and Johnson gave necessary and sufficient conditions for a given decomposition of $\lambda K_n$ to be enclosed in some 2-edge-connected $r$-factorization of $\mu K_m$ for some range of values for the parameters $n$, $m$, $\lambda$, $\mu$, $r$: $r=2$, $\mu >\lambda$ and either $m\ge 2n?1$, or $m=2n?2$ and $\mu =2$ and $\lambda =1$, or $n=3$ and $m=4$. We generalize their result to every $r\ge 2$ and $m\ge 2n?2$. We also give some sufficient conditions for enclosing a given decomposition of $\lambda K_n$ in some 2-edge-connected $r$-factorization of $\mu K_m$ for every $r\ge 3$ and $m>(2?C)n$, where $C$ is a constant that depends only on $r$, $\lambda$ and $\mu$.     

Sobolev homeomorphisms are dense in volume preserving automorphisms

In this paper we prove a weak version of Lusin's theorem for the space of Sobolev-$(1,p)$ volume preserving homeomorphisms on closed and connected n-dimensional manifolds, $n\ge 3$, for $p<n?1$. We also prove that if $p>n$ this result is not true. More precisely, we obtain the density of Sobolev-$(1,p)$ homeomorphisms in the space of volume preserving automorphisms, for the weak topology. Furthermore, the regularization of an automorphism in a uniform ball centered at the identity can be done in a Sobolev-$(1,p)$ ball with the same radius centered at the identity.     

Derangement action digraphs and graphs

A derangement of a set $X$ is a fixed-point-free permutation of $X$. Derangement action digraphs are closely related to group action digraphs introduced by Annexstein, Baumslag and Rosenberg in 1990. For a non-empty set $X$ and a non-empty subset $S$ of derangements of $X$, the derangement action digraph $\overrightarrow{DA}(X,S)$ has vertex set $X$, and an arc from $x$ to $y$ if and only if $y$ is the image of $x$ under the action of some element of $S$, so by definition it is a simple digraph. In common with Cayley graphs and Cayley digraphs, derangement action digraphs may be useful to model networks since the same routing and communication schemes can be implemented at each vertex. We prove that the family of derangement action digraphs contains all Cayley digraphs, all finite vertex-transitive simple graphs, and all finite regular simple graphs of even valency. We determine necessary and sufficient conditions on $S$ under which $\overrightarrow{DA}(X,S)$ may be viewed as a simple undirected graph of valency $\left|S\right|$. We investigate structural and symmetry properties of these digraphs and graphs, pose several open problems, and give many examples.     

Gallai’s path decomposition conjecture for graphs of small maximum degree

Gallai’s path decomposition conjecture states that the edges of any connected graph on $n$ vertices can be decomposed into at most $\frac{n+1}{2}$ paths. We confirm that conjecture for all graphs with maximum degree at most five.     

On the global well-posedness of a class of 2D solutions for the Rosensweig system of ferrofluids

We study a class of 2D solutions of a Bloch–Torrey regularization of the Rosensweig system in the whole space, which arise when the initial data and the external magnetic field are 2D. We prove that such solutions are globally defined if the initial data is in $H^k\left({\mathbb{R}}^2\right),k?1$.     

Atomic decompositions for noncommutative martingales

We prove an atomic type decomposition for the noncommutative martingale Hardy space ${\mathsf{h}}_p$ for all $0<p<2$ by an explicit constructive method using algebraic atoms as building blocks. Using this elementary construction, we obtain a weak form of the atomic decomposition of ${\mathsf{h}}_p$ for all $0<p<1$, and provide a constructive proof of the atomic decomposition for $p=1$ which resolves a main problem on the subject left open for the last twelve years. We also study ${(p,\infty )}_c$-atoms, and show that every ${(p,2)}_c$-atom can be decomposed into a sum of ${(p,\infty )}_c$-atoms; consequently, for every $0<p\le 1$, the ${(p,q)}_c$-atoms lead to the same atomic space for all $2\le q\le \infty$. As applications, we obtain a characterization of the dual space of the noncommutative martingale Hardy space ${\mathsf{h}}_p$ ($0<p<1$) as a noncommutative Lipschitz space via the weak form of the atomic decomposition. Our constructive method can also be applied to prove some sharp martingale inequalities.