Representation and factorization theorems for almost-Lp-spaces

We extend the notions of $p$-convexity and $p$-concavity for Banach ideals of measurable functions following an asymptotic procedure. We prove a representation theorem for the spaces satisfying both properties as the one that works for the classical case: each almost $p$-convex and almost $p$-concave space is order isomorphic to an almost-$L^p$-space. The class of almost-$L^p$-spaces contains, in particular, direct sums of (infinitely many) $L^p$-spaces with different norms, that are not in general $p$-convex – nor $p$-concave –. We also analyze in this context the extension of the Maurey–Rosenthal factorization theorem that works for $p$-concave operators acting in $p$-convex spaces. In this way we provide factorization results that allow to deal with more general factorization spaces than $L^p$-spaces.     

Trilinear Lp estimates with applications to the Cauchy problem for the Hartree-type equation

In this paper, $L^p$ estimates for a trilinear operator associated with the Hartree type nonlinearity are proved. Moreover, as application of these estimates, it is proved that after a linear transformation, the Cauchy problem for the Hartree-type equation becomes locally well posed in the Bessel potential and homogeneous Besov spaces under certain regularity assumptions on the initial data. This notion of well-posedness and the functional framework to solve the equation were firstly proposed by Y. Zhou.     

Energy conservation for the weak solutions to the ideal inhomogeneous magnetohydrodynamic equations in a bounded domain

In this paper, we prove the energy conservation for the weak solutions of the three-dimensional ideal inhomogeneous magnetohydrodynamic (MHD) equations in a bounded domain. Two types of sufficient conditions on the regularity of the weak solutions are provided to ensure the energy conservation. Due to the presence of the boundary, we need to impose the boundedness in $L^p$ and the continuity in $L^{\frac{p}{p-2}}$ for the velocity and magnetic fields near the boundary.     

On Hr(curl,Ω) estimates for a Maxwell type system in convex domains

In bounded convex domains, the regularity of a vector field u with its $\mathrm{div}\mathbf{u}$, $\mathrm{curl}\mathbf{u}$ in $L^r$ space and the tangential component or the normal component of u over the boundary in $L^r$ space, is established for $1<r<\infty$. As an application, we derive an $H^r(\mathrm{curl},\mathrm{\Omega })$ estimate for solutions to a Maxwell type system with an inhomogeneous boundary condition in convex domains. In contrast to the well-posed region of r in the space $H^r(\mathrm{curl},\mathrm{\Omega })$ for the Maxwell type system in Lipschitz domains given by Kar and Sini (2016) [16], we extend the well-posed region to be optimal.     

On the symbol-pair distances of repeated-root constacyclic codes of length 2ps

Let $p$ be an odd prime, and $\lambda$ be a nonzero element of the finite field ${\mathbb{F}}_{p^m}$. The $\lambda$-constacyclic codes of length $2p^s$ over ${\mathbb{F}}_{p^m}$ are classified as the ideals of quotient ring $\frac{{\mathbb{F}}_{p^m}\left[x\right]}{〈x^{2p^s}?\lambda 〉}$ in terms of their generator polynomials. Based on these generator polynomials, the symbol-pair distances of all such $\lambda$-constacyclic codes of length $2p^s$ are obtained in this paper. As an application, all MDS symbol-pair constacyclic codes of length $2p^s$ over ${\mathbb{F}}_{p^m}$ are established, which produce many new MDS symbol-pair codes with good parameters.     

On the Hamming distances of repeated-root constacyclic codes of length 4ps

Let $p$ be an odd prime, $s$, $m$ be positive integers, $\gamma ,\lambda$ be nonzero elements of the finite field ${\mathbb{F}}_{p^m}$ such that ${\gamma }^{p^s}=\lambda$. In this paper, we show that, for any positive integer $\eta$, the Hamming distances of all repeated-root $\lambda$-constacyclic codes of length $\eta p^s$ can be determined by those of certain simple-root $\gamma$-constacyclic codes of length $\eta$. Using this result, Hamming distances of all constacyclic codes of length $4p^s$ are obtained. As an application, we identify all MDS $\lambda$-constacyclic codes of length $4p^s$.     

Dilations of semigroups on von Neumann algebras and noncommutative Lp-spaces

We prove that any weak* continuous semigroup ${(T_t)}_{t?0}$ of factorizable Markov maps acting on a von Neumann algebra M equipped with a normal faithful state can be dilated by a group of Markov ?-automorphisms analogous to the case of a single factorizable Markov operator, which is an optimal result. We also give a version of this result for strongly continuous semigroups of operators acting on noncommutative ${\mathrm{L}}^p$-spaces and examples of semigroups to which the results of this paper can be applied. Our results imply the boundedness of the McIntosh's ${\mathrm{H}}^{\infty }$ functional calculus of the generators of these semigroups on the associated noncommutative ${\mathrm{L}}^p$-spaces generalising some previous work from Junge, Le Merdy and Xu. Finally, we also give concrete dilations for Poisson semigroups which are even new in the case of ${\mathbb{R}}^n$.     

Cardinality constrained connected balanced partitions of trees under different criteria

In this paper we study the problem of partitioning a tree with $n$ weighted vertices into $p$ connected components. For each component, we measure its gap, that is, the difference between the maximum and the minimum weight of its vertices, with the aim of minimizing the sum of such differences. We present an $O\left(n^3{p}^2\right)$ time and $O\left(n^{3}p\right)$ space algorithm for this problem. Then, we generalize it, requiring a minimum of $ϵ\ge 1$ nodes in each connected component, and provide an $O\left(n^3{p}^2{ϵ}^2\right)$ time and $O\left(n^{3}pϵ\right)$ space algorithm to solve this new problem version. We provide a refinement of our analysis involving the topology of the tree and an improvement of the algorithms for the special case in which the weights of the vertices have a heap structure. All presented algorithms can be straightforwardly extended to other similar objective functions. Actually, for the problem of minimizing the maximum gap with a minimum number of nodes in each component, we propose an algorithm which is independent of $ϵ$ and requires $O(n^{2}logn{p}^2)$ time and $O\left(n^{2}p\right)$ space.     

Existence of strong minimizers for the Griffith static fracture model in dimension two

We consider the Griffith fracture model in two spatial dimensions, and prove existence of strong minimizers, with closed jump set and continuously differentiable deformation fields. One key ingredient, which is the object of the present paper, is a generalization to the vectorial situation of the decay estimate by De Giorgi, Carriero, and Leaci. This is based on replacing the coarea formula by a method to approximate $SB{D}^p$ functions with small jump set by Sobolev functions, and is restricted to two dimensions. The other two ingredients will appear in companion papers and consist respectively in regularity results for vectorial elliptic problems of the elasticity type and in a method to approximate in energy $GSB{D}^p$ functions by $SB{V}^p$ ones.     

Vector-valued nonstationary Gabor frames

As an extension of Gabor frames, nonstationary Gabor (NSG) frames were recently introduced in adaptive signal analysis. They allow for efficient reconstruction with flexible sampling and varying window functions. In this paper we generalize the notion of NSG frames from $L^2(\mathbb{R})$ to the vector-valued Hilbert space $L^2(\mathbb{R},{\mathbb{C}}^L)$, and investigate the resulting vector-valued NSG frames. We derive a Walnut's representation of the mixed frame operator, and provide some necessary/sufficient conditions for a vector-valued NSG system to be a frame for $L^2(\mathbb{R},{\mathbb{C}}^L)$. Furthermore, we show the existence of painless vector-valued NSG frames, and of vector-valued NSG frames with fast decaying window functions.