In this paper, we consider an initial-boundary value problem of Hsieh's equation with conservative nonlinearity. The global unique solvability in the framework of Sobolev is established. In particular, one of our main motivations is to investigate the boundary layer (BL) effect and the convergence rates as the diffusion parameter $\beta$ goes zero. It is shown that the BL-thickness is of the order $O(\beta ^{\gamma })$ with $0<\gamma <\frac {1}{2}$. We need to point out that, different from the previous work on nonconservative form of Hsieh's equations, the conservative nonlinearity $(\psi ^{\beta }\theta ^{\beta })_x$ implies that new nonlinear term $\psi _x^{\beta }\theta ^{\beta }$ needs to be handled. It is important that more regularities on the solution to the limit problem are required to obtain the convergence rates and BL-thickness. It is more difficult for initial-boundary problem due to the lack of boundary conditions (especially, higher-order derivatives) prevents us from applying the integration by part to derive the energy estimates directly. Thus it is more complicated than the case of nonconservative form. Consequently more subtle mathematical analysis needs to be introduced to overcome the difficulties.

A conjecture of Alon, Krivelevich and Sudakov states that, for any graph $F$, there is a constant $c_F \gt 0$ such that if $G$ is an $F$-free graph of maximum degree $\Delta$, then $\chi\!(G) \leqslant c_F \Delta/ \log\!\Delta$. Alon, Krivelevich and Sudakov verified this conjecture for a class of graphs $F$ that includes all bipartite graphs. Moreover, it follows from recent work by Davies, Kang, Pirot and Sereni that if $G$ is $K_{t,t}$-free, then $\chi\!(G) \leqslant (t + o(1)) \Delta/ \log\!\Delta$ as $\Delta \to \infty$. We improve this bound to $(1+o(1)) \Delta/\log\!\Delta$, making the constant factor independent of $t$. We further extend our result to the DP-colouring setting (also known as correspondence colouring), introduced by Dvořák and Postle.

Let M be an irreducible $3$-manifold M with empty or toroidal boundary which has at least one hyperbolic piece in its geometric decomposition, and let A be a finite abelian group. Generalizing work of Sun [20] and of Friedl–Herrmann [7], we prove that there exists a finite cover $M' \to M$ so that A is a direct factor in $H_1(M',{\mathbb Z})$.

The systematic development of coarse-grained (CG) models via the Mori–Zwanzig projector operator formalism requires the explicit description of a deterministic drift term, a dissipative memory term and a random fluctuation term. The memory and fluctuating terms are related by the fluctuation–dissipation relation and are more challenging to sample and describe than the drift term due to complex dependence on space and time. This work proposes a rational basis for a Markovian data-driven approach to approximating the memory and fluctuating terms. We assumed a functional form for the memory kernel and under broad regularity hypothesis, we derived bounds for the error committed in replacing the original term with an approximation obtained by its asymptotic expansions. These error bounds depend on the characteristic time scale of the atomistic model, representing the decay of the autocorrelation function of the fluctuating force; and the characteristic time scale of the CG model, representing the decay of the autocorrelation function of the momenta of the beads. Using appropriate parameters to describe these time scales, we provide a quantitative meaning to the observation that the Markovian approximation improves as they separate. We then proceed to show how the leading-order term of such expansion can be identified with the Markovian approximation usually considered in the CG theory. We also show that, while the error of the approximation involving time can be controlled, the Markovian term usually considered in CG simulations may exhibit significant spatial variation. It follows that assuming a spatially constant memory term is an uncontrolled approximation which should be carefully checked. We complement our analysis with an application to the estimation of the memory in the CG model of a one-dimensional Lennard–Jones chain with different masses and interactions, showing that even for such a simple case, a non-negligible spatial dependence for the memory term exists.

Let G be a complex semisimple Lie group and H a complex closed connected subgroup. Let and be their Lie algebras. We prove that the regular representation of G in $L^2(G/H)$ is tempered if and only if the orthogonal of in contains regular elements by showing simultaneously the equivalence to other striking conditions, such as has a solvable limit algebra.

Let ${\mathbb{G}(n_1,n_2,m)}$ be a uniformly random m-edge subgraph of the complete bipartite graph ${K_{n_1,n_2}}$ with bipartition $(V_1, V_2)$, where $n_i = |V_i|$, $i=1,2$. Given a real number $p \in [0,1]$ such that $d_1 \,{:\!=}\, pn_2$ and $d_2 \,{:\!=}\, pn_1$ are integers, let $\mathbb{R}(n_1,n_2,p)$ be a random subgraph of ${K_{n_1,n_2}}$ with every vertex $v \in V_i$ of degree $d_i$, $i = 1, 2$. In this paper we determine sufficient conditions on $n_1,n_2,p$ and m under which one can embed ${\mathbb{G}(n_1,n_2,m)}$ into $\mathbb{R}(n_1,n_2,p)$ and vice versa with probability tending to 1. In particular, in the balanced case $n_1=n_2$, we show that if $p\gg\log n/n$ and $1 - p \gg \left(\log n/n \right)^{1/4}$, then for some $m\sim pn^2$, asymptotically almost surely one can embed ${\mathbb{G}(n_1,n_2,m)}$ into $\mathbb{R}(n_1,n_2,p)$, while for $p\gg\left(\log^{3} n/n\right)^{1/4}$ and $1-p\gg\log n/n$ the opposite embedding holds. As an extension, we confirm the Kim–Vu Sandwich Conjecture for degrees growing faster than $(n \log n)^{3/4}$.

Using degeneration and Schubert calculus, we consider the problem of computing the number of linear series of given degree d and dimension r on a general curve of genus g satisfying prescribed incidence conditions at n points. We determine these numbers completely for linear series of arbitrary dimension when d is sufficiently large, and for all d when either $r=1$ or $n=r+2$. Our formulas generalise and give new proofs of recent results of Tevelev and of Cela, Pandharipande and Schmitt.

We characterize when a set of simple closed curves in an orientable surface forms a bouquet, in terms of relations between the corresponding Dehn twists.

In a ball $\Omega \subset \mathbb {R}^{n}$ with $n\ge 2$, the chemotaxis system

\[ \left\{ \begin{array}{@{}l} u_t = \nabla \cdot \big( D(u)\nabla u\big) + \nabla\cdot \big(\dfrac{u}{v} \nabla v\big), \\ 0=\Delta v - uv \end{array} \right. \]

$u$

$v$

$D\in C^{3}([0,\infty ))$

$0< D(\xi ) \le {K_D} (\xi +1)^{-\alpha }$

$\xi >0$

${K_D}>0$

$\alpha >0$

$\Omega$

We prove the existence of nontrivial ground state solutions of the critical quasilinear Hénon equation $\displaystyle -\Delta _p u=|x|^{\alpha _1}|u|^{p^{*}(\alpha _1)-2}u-|x|^{\alpha _2}|u|^{p^{*}(\alpha _2)-2}u\ \ {\rm in}\ \mathbb {R}^{N}.$ It is a new problem in the sense that the signs of the coefficients of critical terms are opposite.

In this paper the minimum fundamental gap of a kind of sub-elliptic operator is concerned, we deal with the existence and uniqueness of weak solution for that. We verify that the minimization fundamental gap problem can be achieved by some function, and characterize the optimal function by adopting the differential of eigenvalues.

Let p be a prime number. In the present paper, we prove that the moduli of hyperbolic curves of genus $0$ over an algebraic closure of the field of p-adic numbers may be completely determined by their tempered fundamental groups.

We make the first steps towards generalising the theory of stochastic block models, in the sparse regime, towards a model where the discrete community structure is replaced by an underlying geometry. We consider a geometric random graph over a homogeneous metric space where the probability of two vertices to be connected is an arbitrary function of the distance. We give sufficient conditions under which the locations can be recovered (up to an isomorphism of the space) in the sparse regime. Moreover, we define a geometric counterpart of the model of flow of information on trees, due to Mossel and Peres, in which one considers a branching random walk on a sphere and the goal is to recover the location of the root based on the locations of leaves. We give some sufficient conditions for percolation and for non-percolation of information in this model.

We consider steady states with mass constraint of the fourth-order thin-film equation with van der Waals force in a bounded domain which leads to a singular elliptic equation for the thickness with an unknown pressure term. By studying second-order nonlinear ordinary differential equation,

\begin{equation*}h_{rr}+\frac{1}{r}h_{r}=\frac{1}{\alpha}h^{-\alpha}-p\end{equation*}

Hadwiger’s conjecture asserts that every graph without a $K_t$-minor is $(t-1)$-colourable. It is known that the exact version of Hadwiger’s conjecture does not extend to list colouring, but it has been conjectured by Kawarabayashi and Mohar (2007) that there exists a constant $c$ such that every graph with no $K_t$-minor has list chromatic number at most $ct$. More specifically, they also conjectured that this holds for $c=\frac{3}{2}$.

Refuting the latter conjecture, we show that the maximum list chromatic number of graphs with no $K_t$-minor is at least $(2-o(1))t$, and hence $c \ge 2$ in the above conjecture is necessary. This improves the previous best lower bound by Barát, Joret and Wood (2011), who proved that $c \ge \frac{4}{3}$. Our lower-bound examples are obtained via the probabilistic method.

For a subgraph $G$ of the blow-up of a graph $F$, we let $\delta ^*(G)$ be the smallest minimum degree over all of the bipartite subgraphs of $G$ induced by pairs of parts that correspond to edges of $F$. Johansson proved that if $G$ is a spanning subgraph of the blow-up of $C_3$ with parts of size $n$ and $\delta ^*(G) \ge \frac{2}{3}n + \sqrt{n}$, then $G$ contains $n$ vertex disjoint triangles, and presented the following conjecture of Häggkvist. If $G$ is a spanning subgraph of the blow-up of $C_k$ with parts of size $n$ and $\delta ^*(G) \ge \left(1 + \frac 1k\right)\frac n2 + 1$, then $G$ contains $n$ vertex disjoint copies of $C_k$ such that each $C_k$ intersects each of the $k$ parts exactly once. A similar conjecture was also made by Fischer and the case $k=3$ was proved for large $n$ by Magyar and Martin.

In this paper, we prove the conjecture of Häggkvist asymptotically. We also pose a conjecture which generalises this result by allowing the minimum degree conditions in each bipartite subgraph induced by pairs of parts of $G$ to vary. We support this new conjecture by proving the triangle case. This result generalises Johannson’s result asymptotically.

In this paper, we prove some convexity results associated to orbit projection of noncompact real reductive Lie groups.

In this paper, we consider non-self-adjoint Dirac operators on a finite interval with complex-valued potentials and quasi-periodic boundary conditions. Necessary and sufficient conditions for a set of complex numbers to be the spectrum of the indicated problem are established.