Asymptotic behavior and blow-up of solutions for infinitely degenerate semilinear parabolic equations with logarithmic nonlinearity

In this paper, we study the initial-boundary value problem for infinitely degenerate semilinear parabolic equations with logarithmic nonlinearity $u_t?{△}_{X}u=u\log ?|u|$, where $X=(X_1,X_2,?,X_m)$ is an infinitely degenerate system of vector fields, and ${△}_X:={\sum }_{j=1}^m{X}_j^2$ is an infinitely degenerate elliptic operator. Using potential well method, we first prove the invariance of some sets and vacuum isolating of solutions. Then, by the Galerkin method and the logarithmic Sobolev inequality, we obtain the global existence and blow-up at +∞ of solutions with low initial energy or critical initial energy, and we also discuss the asymptotic behavior of the solutions.     

A variant of the Stanley depth for multisets

We define and study a variant of the Stanley depth which we call total depth for partially ordered sets (posets). This total depth is the most natural variant of Stanley depth from $?S_k?$ – the poset of nonempty subsets of $\{1,2,\dots ,k\}$ ordered by inclusion – to any finite poset. In particular, the total depth can be defined for the poset of nonempty submultisets of a multiset ordered by inclusion, which corresponds to a product of chains with the bottom element deleted. We show that the total depth agrees with Stanley depth for $?S_k?$ but not for such posets in general. We also prove that the total depth of the product of chains ${\mathit{n}}^k$ with the bottom element deleted is $(n?1)?k∕2?$, which generalizes a result of Biró, Howard, Keller, Trotter, and Young (2010). Further, we provide upper and lower bounds for a general multiset and find the total depth for any multiset with at most five distinct elements. In addition, we can determine the total depth for any multiset with $k$ distinct elements if we know all the interval partitions of $?S_k?$.     

Group-invariant solutions for the Ricci curvature equation and the Einstein equation

We consider the pseudo-Euclidean space $({\mathbb{R}}^n,g)$, $n\ge 3$, with coordinates $x=(x_1,\dots ,x_n)$ and metric $g_{ij}={\delta }_{ij}{?}_i$, ${?}_i=\pm 1$, where at least one ${?}_i$ is positive, and also tensors of the form $A={\sum }_{i,j}{A}_{ij}d{x}_{i}d{x}_j$, such that $A_{ij}$ are differentiable functions of x. For such tensors, we use Lie point symmetries to find metrics $\stackrel{￣}{g}=\frac{1}{u^2}g$ that solve the Ricci curvature and the Einstein equations. We provide a large class of group-invariant solutions and examples of complete metrics $\stackrel{￣}{g}$ defined globally in ${\mathbb{R}}^n$. As consequences, for certain functions $\stackrel{￣}{K}$, we show complete metrics $\stackrel{￣}{g}$, conformal to the pseudo-Euclidean metric g, whose scalar curvature is $\stackrel{￣}{K}$.     

Common values of a class of linear recurrences

Let $\left(a_n\right),\left(b_n\right)$ be linear recursive sequences of integers with characteristic polynomials $A\left(X\right),B\left(X\right)\in \mathbb{Z}\left[X\right]$ respectively. Assume that $A\left(X\right)$ has a dominating and simple real root $\alpha$, while $B\left(X\right)$ has a pair of conjugate complex dominating and simple roots $\beta ,\stackrel{?}{\beta }$. Assume further that $\alpha ,\beta ,\alpha /\beta$ and $\stackrel{?}{\beta }/\beta$ are not roots of unity and $\delta =log\left|\beta \right|/log\left|\alpha \right|\in \mathbb{Q}$. Then there are effectively computable constants $c_0,c_1>0$ such that the inequality $|a_n?b_m|>{\left|a_n\right|}^{1?\left(c_0{log}^{2}n\right)/n}$holds for all $n,m\in {\mathbb{Z}}_{\ge 0}^2$ with $max\{n,m\}>c_1$. We present $c_0$ explicitly.     

The survival probability of critical and subcritical branching processes in finite state space Markovian environment

Let ${\left(Z_n\right)}_{n\ge 0}$ be a branching process in a random environment defined by a Markov chain ${\left(X_n\right)}_{n\ge 0}$ with values in a finite state space $\mathbb{X}$. Let ${\mathbb{P}}_i$ be the probability law generated by the trajectories of ${\left(X_n\right)}_{n\ge 0}$ starting at $X_0=i\in \mathbb{X}.$ We study the asymptotic behaviour of the joint survival probability ${\mathbb{P}}_i\left(Z_n>0,X_n=j\right)$, $j\in \mathbb{X}$ as $n\to +\infty$ in the critical and strongly, intermediate and weakly subcritical cases.     

Nonlinear equivalence of Banach spaces based on Birkhoff-James orthogonality

A Banach space X is said to be isomorphic to another Y with respect to the structure of Birkhoff-James orthogonality, denoted by $X{～}_{BJ}Y$, if there exists a (possibly nonlinear) bijection between X and Y that preserves Birkhoff-James orthogonality in both directions. It is shown that $X?Y$ if either X or Y is finite dimensional and $X{～}_{BJ}Y$, and that ${?}_p{?}_{BJ}{?}_q$ if $1<p<q<\infty$. Moreover, if H is a Hilbert space with $\dim ?H\ge 3$ and $H{～}_{BJ}X$, then $H=X$. In the two-dimensional case, it turns out that ${?}_{p,q}^2{～}_{BJ}{?}_2^2$, which indicates that nonlinear Birkhoff-James orthogonality preservers between Banach spaces are not necessarily scalar multiples of isometric isomorphisms.     

Refined basic couplings and Wasserstein-type distances for SDEs with Lévy noises

We establish the exponential convergence with respect to the $L^1$-Wasserstein distance and the total variation for the semigroup corresponding to the stochastic differential equation $d{X}_t=d{Z}_t+b\left(X_t\right)dt,$where ${\left(Z_t\right)}_{t\ge 0}$ is a pure jump Lévy process whose Lévy measure $\nu$ fulfills $\underset{x\in {\mathbb{R}}^d,\left|x\right|\le {\kappa }_0}{inf}[\nu \wedge ({\delta }_{x}1\nu )]\left({\mathbb{R}}^d\right)>0$for some constant ${\kappa }_0>0$, and the drift term $b$ satisfies that for any $x,y\in {\mathbb{R}}^d$, $〈b\left(x\right)?b\left(y\right),x?y〉\le \left\{\begin{array}{cc}{\Phi }_1\left(\right|x?y\left|\right)|x?y|,\hfill & |x?y|<l_0;\hfill \\ ?K_2|x?y{|}^2,\hfill & |x?y|\ge l_0\hfill \end{array}\right.$with some positive constants $K_2,l_0$ and positive measurable function ${\Phi }_1$. The method is based on the refined basic coupling for Lévy jump processes. As a byproduct, we obtain sufficient conditions for the strong ergodicity of the process ${\left(X_t\right)}_{t\ge 0}$.     

Efficient counting of degree sequences

We present formulas to count the set $D_0\left(n\right)$ of degree sequences of simple graphs of order $n$, the set $D\left(n\right)$ of degree sequences of those graphs with no isolated vertices, and the set $D_{k\text{\_}con}\left(n\right)$ of degree sequences of those graphs that are $k$-connected for fixed $k$. The formulas all use a function of Barnes and Savage and the associated dynamic programming algorithms all run in time polynomial in $n$ and are asymptotically faster than previous known algorithms for these problems. We also show that $\left|D\left(n\right)\right|$ and $\left|D_{1\text{\_}con}\left(n\right)\right|$ are asymptotically equivalent but $\left|D\left(n\right)\right|$ and $\left|D_0\left(n\right)\right|$ as well as $\left|D\left(n\right)\right|$ and $\left|D_{k\text{\_}con}\left(n\right)\right|$ with fixed $k\ge 2$ are asymptotically inequivalent. Finally, we explain why we are unable to obtain the absolute asymptotic orders of these functions from their formulas.     

Separable discrete functions: Recognition and sufficient conditions

A discrete function of $n$ variables is a mapping $g:X_1\times \dots \times X_n\to A$, where $X_1,\dots ,X_n$, and $A$ are arbitrary finite sets. Function $g$ is called separable if there exist $n$ functions $g_i:X_i\to A$ for $i=1,\dots ,n$, such that for every input $x_1,\dots ,x_n$ the function $g(x_1,\dots ,x_n)$ takes one of the values $g_1\left(x_1\right),\dots ,g_n\left(x_n\right)$. Given a discrete function $g$, it is an interesting problem to ask whether $g$ is separable or not. Although this seems to be a very basic problem concerning discrete functions, the complexity of recognition of separable discrete functions of $n$ variables is known only for $n=2$. In this paper we will show that a slightly more general recognition problem, when $g$ is not fully but only partially defined, is NP-complete for $n\ge 3$. We will then use this result to show that the recognition of fully defined separable discrete functions is NP-complete for $n\ge 4$.The general recognition problem contains the above mentioned special case for $n=2$. This case is well-studied in the context of game theory, where (separable) discrete functions of $n$ variables are referred to as (assignable) $n$-person game forms. There is a known sufficient condition for assignability (separability) of two-person game forms (discrete functions of two variables) called (weak) total tightness of a game form. This property can be tested in polynomial time, and can be easily generalized both to higher dimension and to partially defined functions. We will prove in this paper that weak total tightness implies separability for (partially defined) discrete functions of $n$ variables for any $n$, thus generalizing the above result known for $n=2$. Our proof is constructive. Using a graph-based discrete algorithm we show how for a given weakly totally tight (partially defined) discrete function $g$ of $n$ variables one can construct separating functions $g_1,\dots ,g_n$ in polynomial time with respect to the size of the input function.     

Higher Laplacians on pseudo-Hermitian symmetric spaces

One of the most fundamental operators studied in geometric analysis is the classical Laplace–Beltrami operator. On pseudo-Hermitian manifolds, higher Laplacians $L_m$ are defined for each positive integer m, where $L_1$ coincides with the Laplace–Beltrami operator. Despite their natural definition, these higher Laplacians have not yet been studied in detail. In this paper, we consider the setting of simple pseudo-Hermitian symmetric spaces, i.e., let $X=G/H$ be a symmetric space for a real simple Lie group G, equipped with a G-invariant complex structure. We show that the higher Laplacians $L_1,L_3,\dots ,L_{2r?1}$ form a set of algebraically independent generators for the algebra ${\mathbb{D}}_G(X)$ of G-invariant differential operators on X, where r denotes the rank of X. For higher rank, this is the first instance of a set of generators for ${\mathbb{D}}_G(X)$ defined explicitly in purely geometric terms, and confirms a conjecture of Engli? and Peetre, originally stated in 1996 for the class of Hermitian symmetric spaces.     

Lengths of involutions in finite Coxeter groups

Let W be a finite Coxeter group and X a subset of W. The length polynomial $L_{W,X}(t)$ is defined by $L_{W,X}(t)={\sum }_{x\in X}{t}^{?(x)}$, where ? is the length function on W. If $X=\{x\in W:x^2=1\}$ then we call $L_{W,X}(t)$ the involution length polynomial of W. In this article we derive expressions for the length polynomial where X is any conjugacy class of involutions, and the involution length polynomial, in any finite Coxeter group W. In particular, these results correct errors in [11] for the involution length polynomials of Coxeter groups of type $B_n$ and $D_n$. Moreover, we give a counterexample to a unimodality conjecture stated in [11].     

A new blow-up criterion for the 2D full compressible Navier–Stokes equations without heat conduction in a bounded domain

This paper is to derive a new blow-up criterion for the 2D full compressible Navier–Stokes equations without heat conduction in terms of the density $\rho$ and the pressure $P$. More precisely, it indicates that in a bounded domain the strong solution exists globally if the norm $\left|\right|\rho {\left|\right|}_{L^{\infty }(0,t;L^{\infty })}+\left|\right|P{\left|\right|}_{L^{p_0}(0,t;L^{\infty })}<\infty$ for some constant  $p_0$ satisfying $1<p_0\le 2$. The boundary condition is imposed as a Navier-slip boundary one and the initial vacuum is permitted. Our result extends previous one which is stated as $\left|\right|\rho {\left|\right|}_{L^{\infty }(0,t;L^{\infty })}+\left|\right|P{\left|\right|}_{L^{\infty }(0,t;L^{\infty })}<\infty$.     

Fractional chromatic numbers of tensor products of three graphs

The tensor product $(G_1,G_2,G_3)$ of graphs $G_1$, $G_2$ and $G_3$ is defined by $V(G_1,G_2,G_3)=V\left(G_1\right)\times V\left(G_2\right)\times V\left(G_3\right)$and $E(G_1,G_2,G_3)=\left\{\left((u_1,u_2,u_3),(v_1,v_2,v_3)\right):\left|\{i:(u_i,v_i)\in E\left(G_i\right)\}\right|\ge 2\right\}.$Let ${\chi }_f\left(G\right)$ be the fractional chromatic number of a graph $G$. In this paper, we prove that if one of the three graphs $G_1$, $G_2$ and $G_3$ is a circular clique, ${\chi }_f(G_1,G_2,G_3)=min\{{\chi }_f\left(G_1\right){\chi }_f\left(G_2\right),{\chi }_f\left(G_1\right){\chi }_f\left(G_3\right),{\chi }_f\left(G_2\right){\chi }_f\left(G_3\right)\}.$