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?$.     

Sharp spectral bounds for complex perturbations of the indefinite Laplacian

We derive quantitative bounds for eigenvalues of complex perturbations of the indefinite Laplacian on the real line. Our results substantially improve existing results even for real potentials. For $L^1$-potentials, we obtain optimal spectral enclosures which accommodate also embedded eigenvalues, while our result for $L^p$-potentials yield sharp spectral bounds on the imaginary parts of eigenvalues of the perturbed operator for all $p\in [1,\infty )$. The sharpness of the results are demonstrated by means of explicit examples.     

Global well-posedness and asymptotic stabilization for chemotaxis system with signal-dependent sensitivity

A fully parabolic chemotaxis system

$u_t=\mathrm{\Delta }u?\mathrm{?}?(u\chi (v)\mathrm{?}v),v_t=\mathrm{\Delta }v?v+u,$

in a smooth bounded domain $\mathrm{\Omega }?{\mathbb{R}}^N$, $N\ge 2$ with homogeneous Neumann boundary conditions is considered, where the non-negative chemotactic sensitivity function χ satisfies $\chi (v)\le \mu {(a+v)}^{?k}$, for some $a\ge 0$ and $k\ge 1$. It is shown that a novel type of weight function can be applied to a weighted energy estimate for $k>1$. Consequently, the range of μ for the global existence and uniform boundedness of classical solutions established by Mizukami and Yokota [23] is enlarged. Moreover, under a convexity assumption on Ω, an asymptotic Lyapunov functional is obtained and used to establish the asymptotic stability of spatially homogeneous equilibrium solutions for $k\ge 1$ under a smallness assumption on μ. In particular, when $\chi (v)=\mu /v$ and $N<8$, it is shown that the spatially homogeneous steady state is a global attractor whenever $\mu \le 1/2$.     

Graphs are (1,Δ+1)-choosable

A graph $G$ is $(k,k^{\prime })$-choosable if the following holds: For any list assignment $L$ which assigns to each vertex $v$ a set $L\left(v\right)$ of $k$ real numbers, and assigns to each edge $e$ a set $L\left(e\right)$ of $k^{\prime }$ real numbers, there is a total weighting $?:V\left(G\right)\cup E\left(G\right)\to R$ such that $?\left(z\right)\in L\left(z\right)$ for $z\in V\cup E$, and ${\sum }_{e\in E\left(u\right)}?\left(e\right)+?\left(u\right)\ne {\sum }_{e\in E\left(v\right)}?\left(e\right)+?\left(v\right)$ for every edge $uv$. This paper proves that if $G$ is a connected graph of maximum degree $\Delta \ge 2$, then $G$ is $(1,\Delta +1)$-choosable.     

On s-hamiltonian line graphs of claw-free graphs

For an integer $s\ge 0$, a graph $G$ is $s$-hamiltonian if for any vertex subset $S?V\left(G\right)$ with $\left|S\right|\le s$, $G?S$ is hamiltonian, and $G$ is $s$-hamiltonian connected if for any vertex subset $S?V\left(G\right)$ with $\left|S\right|\le s$, $G?S$ is hamiltonian connected. Thomassen in 1984 conjectured that every 4-connected line graph is hamiltonian (see Thomassen, 1986), and Ku?zel and Xiong in 2004 conjectured that every 4-connected line graph is hamiltonian connected (see Ryjá?ek and Vrána, 2011). In Broersma and Veldman (1987), Broersma and Veldman raised the characterization problem of $s$-hamiltonian line graphs. In Lai and Shao (2013), it is conjectured that for $s\ge 2$, a line graph $L\left(G\right)$ is $s$-hamiltonian if and only if $L\left(G\right)$ is $(s+2)$-connected. In this paper we prove the following.(i) For an integer $s\ge 2$, the line graph $L\left(G\right)$ of a claw-free graph $G$ is $s$-hamiltonian if and only if $L\left(G\right)$ is $(s+2)$-connected.(ii) The line graph $L\left(G\right)$ of a claw-free graph $G$ is 1-hamiltonian connected if and only if $L\left(G\right)$ is 4-connected.     

H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups

We consider the structure of $H$-free subgraphs of graphs with high minimal degree. We prove that for every $k>m$ there exists an $???(k,m)>0$ so that the following holds. For every graph $H$ with chromatic number $k$ from which one can delete an edge and reduce the chromatic number, and for every graph $G$ on $n>n_0\left(H\right)$ vertices in which all degrees are at least $(1??)n$, any subgraph of $G$ which is $H$-free and contains the maximum number of copies of the complete graph $K_m$ is $(k?1)$-colorable.We also consider several extensions for the case of a general forbidden graph $H$ of a given chromatic number, and for subgraphs maximizing the number of copies of balanced blowups of complete graphs.     

Spanning trees and spanning closed walks with small degrees

Let G be a graph and let f be a positive integer-valued function on $V(G)$. In this paper, we show that if for all $S?V(G)$, $\omega (G?S)<{\sum }_{v\in S}(f(v)?2)+2+\omega (G[S])$, then G has a spanning tree T containing an arbitrary given matching such that for each vertex v, $d_T(v)\le f(v)$, where $\omega (G?S)$ denotes the number of components of $G?S$ and $\omega (G[S])$ denotes the number of components of the induced subgraph $G[S]$ with the vertex set S. This is an improvement of several results. Next, we prove that if for all $S?V(G)$, $\omega (G?S)\le {\sum }_{v\in S}(f(v)?1)+1$, then G admits a spanning closed walk passing through the edges of an arbitrary given matching meeting each vertex v at most $f(v)$ times. This result solves a long-standing conjecture due to Jackson and Wormald (1990).     

On a sum involving the Euler totient function

In this short note, we prove that $\frac{4}{{\pi }^2}xlogx+O\left(x\right)?\sum _{n?x}\phi \left(\left[\frac{x}{n}\right]\right)?\left(\frac{1}{3}+\frac{4}{{\pi }^2}\right)xlogx+O\left(x\right),$ for $x\to \infty$, where $\phi \left(n\right)$ is the Euler totient function and $\left[t\right]$ is the integral part of real $t$. This improves recent results of Bordellès–Heyman–Shparlinski and of Dai–Pan.     

Stability of attractors for the Kirchhoff wave equation with strong damping and critical nonlinearities

The paper investigates longtime dynamics of the Kirchhoff wave equation with strong damping and critical nonlinearities: $u_{tt}?(1+?{\Vert \mathrm{?}u\Vert }^2)\mathrm{\Delta }u?\mathrm{\Delta }{u}_t+h(u_t)+g(u)=f(x)$, with $?\in [0,1]$. The well-posedness and the existence of global and exponential attractors are established, and the stability of the attractors on the perturbation parameter ? is proved for the IBVP of the equation provided that both nonlinearities $h(s)$ and $g(s)$ are of critical growth.     

Sharp upper bounds of the spectral radius of a graph

Let $G$ be a simple connected graph with $n$ vertices and $m$ edges. The spectral radius $\rho \left(G\right)$ of $G$ is the largest eigenvalue of its adjacency matrix. In this paper, we firstly consider the effect on the spectral radius of a graph by removing a vertex, and then as an application of the result, we obtain a new sharp upper bound of $\rho \left(G\right)$ which improves some known bounds: If $\frac{(k?2)(k?3)}{2}\le m?n\le \frac{k(k?3)}{2}$, where $k(3\le k\le n)$ is an integer, then $\rho \left(G\right)\le \sqrt{2m?n?k+\frac{5}{2}+\sqrt{2m?2n+\frac{9}{4}}}.$The equality holds if and only if $G$ is a complete graph $K_n$ or $K_4?e$, where $K_4?e$ is the graph obtained from $K_4$ by deleting some edge $e$.