Given partially ordered sets (posets) $(P, \leq _P\!)$ and $(P^{\prime}, \leq _{P^{\prime}}\!)$, we say that $P^{\prime}$ contains a copy of $P$ if for some injective function $f\,:\, P\rightarrow P^{\prime}$ and for any $X, Y\in P$, $X\leq _P Y$ if and only if $f(X)\leq _{P^{\prime}} f(Y)$. For any posets $P$ and $Q$, the poset Ramsey number $R(P,Q)$ is the least positive integer $N$ such that no matter how the elements of an $N$-dimensional Boolean lattice are coloured in blue and red, there is either a copy of $P$ with all blue elements or a copy of $Q$ with all red elements. We focus on a poset Ramsey number $R(P, Q_n)$ for a fixed poset $P$ and an $n$-dimensional Boolean lattice $Q_n$, as $n$ grows large. We show a sharp jump in behaviour of this number as a function of $n$ depending on whether or not $P$ contains a copy of either a poset $V$, that is a poset on elements $A, B, C$ such that $B\gt C$, $A\gt C$, and $A$ and $B$ incomparable, or a poset $\Lambda$, its symmetric counterpart. Specifically, we prove that if $P$ contains a copy of $V$ or $\Lambda$ then $R(P, Q_n) \geq n +\frac{1}{15} \frac{n}{\log n}$. Otherwise $R(P, Q_n) \leq n + c(P)$ for a constant $c(P)$. This gives the first non-marginal improvement of a lower bound on poset Ramsey numbers and as a consequence gives $R(Q_2, Q_n) = n + \Theta \left(\frac{n}{\log n}\right)$.

In this paper, we study the asymptotic profiles of positive solutions for diffusive logistic equations. The aim is to study the sharp effect of linear growth and nonlinear function. Both the classical reaction-diffusion equation and nonlocal dispersal equation are investigated. Our main results reveal that the linear and nonlinear parts of reaction term play quite different roles in the study of positive solutions.

In this paper, we are interested in investigating notions of stability for generalized linear differential equations (GLDEs). Initially, we propose and revisit several definitions of stability and provide a complete characterization of them in terms of upper bounds and asymptotic behaviour of the transition matrix. In addition, we illustrate our stability results for GLDEs to linear periodic systems and linear impulsive differential equations. Finally, we prove that the well-known definitions of uniform asymptotic stability and variational asymptotic stability are equivalent to the global uniform exponential stability introduced in this article.

Random walks on graphs are an essential primitive for many randomised algorithms and stochastic processes. It is natural to ask how much can be gained by running $k$ multiple random walks independently and in parallel. Although the cover time of multiple walks has been investigated for many natural networks, the problem of finding a general characterisation of multiple cover times for worst-case start vertices (posed by Alon, Avin, Koucký, Kozma, Lotker and Tuttle in 2008) remains an open problem. First, we improve and tighten various bounds on the stationary cover time when $k$ random walks start from vertices sampled from the stationary distribution. For example, we prove an unconditional lower bound of $\Omega ((n/k) \log n)$ on the stationary cover time, holding for any $n$-vertex graph $G$ and any $1 \leq k =o(n\log n )$. Secondly, we establish the stationary cover times of multiple walks on several fundamental networks up to constant factors. Thirdly, we present a framework characterising worst-case cover times in terms of stationary cover times and a novel, relaxed notion of mixing time for multiple walks called the partial mixing time. Roughly speaking, the partial mixing time only requires a specific portion of all random walks to be mixed. Using these new concepts, we can establish (or recover) the worst-case cover times for many networks including expanders, preferential attachment graphs, grids, binary trees and hypercubes.

We prove the existence of unbounded solutions of the asymmetric oscillation in the case when each zero of the discriminative function is degenerate. This is the only case that has not been studied in the literature.

For a random binary noncoalescing feedback shift register of width $n$, with all $2^{2^{n-1}}$ possible feedback functions $f$ equally likely, the process of long cycle lengths, scaled by dividing by $N=2^n$, converges in distribution to the same Poisson–Dirichlet limit as holds for random permutations in $\mathcal{S}_N$, with all $N!$ possible permutations equally likely. Such behaviour was conjectured by Golomb, Welch and Goldstein in 1959.

We develop a method based on the Burau matrix to detect conditions on the linking numbers of braid strands. Our main application is to iterated exchanged braids. Unless the braid permutation fixes both braid edge strands, we establish under some fairly generic conditions on the linking numbers a ‘subsymmetry’ property; in particular at most two such braids can be mutually conjugate. As an addition, we prove that the Burau kernel is contained in the commutator subgroup of the pure braid group. We discuss also some properties of the Burau image.

In this paper we introduce and examine the differential subordination of the form

\[ p(z)+zp'(z)\varphi(p(z),zp'(z))\prec h(z),\quad z\in\mathbb{D}:=\{z\in\mathbb{C}:|z|<1\}, \]

$h$

$0\in h(\mathbb {D}).$

Kanai proved powerful results on the stability under quasi-isometries of numerous global properties (including Liouville property) between Riemannian manifolds of bounded geometry. Since his work focuses more on the generality of the spaces considered than on the two-dimensional geometry, Kanai's hypotheses in many cases are not satisfied in the context of Riemann surfaces endowed with the Poincaré metric. In this work we fill that gap for the Liouville property, by proving its stability by quasi-isometries for every Riemann surface (and even Riemannian surfaces with pinched negative curvature). Also, a key result characterizes Riemannian surfaces which are quasi-isometric to $\mathbb {R}$.

This paper studies the magnitude homology of graphs focusing mainly on the relationship between its diagonality and the girth. The magnitude and magnitude homology are formulations of the Euler characteristic and the corresponding homology, respectively, for finite metric spaces, first introduced by Leinster and Hepworth–Willerton. Several authors study them restricting to graphs with path metric, and some properties which are similar to the ordinary homology theory have come to light. However, the whole picture of their behaviour is still unrevealed, and it is expected that they catch some geometric properties of graphs. In this article, we show that the girth of graphs partially determines the magnitude homology, that is, the larger girth a graph has, the more homologies near the diagonal part vanish. Furthermore, applying this result to a typical random graph, we investigate how the diagonality of graphs varies statistically as the edge density increases. In particular, we show that there exists a phase transition phenomenon for the diagonality.

We introduce a Morse theory for posets of Bestvina–Brady type combining matchings and height functions. This theory generalizes Forman's discrete Morse theory for regular CW-complexes and extends previous results on Morse theory for $h$-regular posets to all finite posets. We also develop a relative version of Morse theory which allows us to compare the topology of a poset with that of a given subposet.

We work with polynomial three-dimensional rigid differential systems. Using the Lyapunov constants, we obtain lower bounds for the cyclicity of the known rigid centres on their centre manifolds. Moreover, we obtain an example of a quadratic rigid centre from which is possible to bifurcate 13 limit cycles, which is a new lower bound for three-dimensional quadratic systems.

This paper proves the energy equality for distributional solutions to fractional Navier-Stokes equations, which gives a new proof and covers the classical result of Galdi [Proc. Amer. Math. Soc. 147 (2019), 785–792].

Given a family $\mathcal{F}$ of bipartite graphs, the Zarankiewicz number $z(m,n,\mathcal{F})$ is the maximum number of edges in an $m$ by $n$ bipartite graph $G$ that does not contain any member of $\mathcal{F}$ as a subgraph (such $G$ is called $\mathcal{F}$-free). For $1\leq \beta \lt \alpha \lt 2$, a family $\mathcal{F}$ of bipartite graphs is $(\alpha,\beta )$-smooth if for some $\rho \gt 0$ and every $m\leq n$, $z(m,n,\mathcal{F})=\rho m n^{\alpha -1}+O(n^\beta )$. Motivated by their work on a conjecture of Erdős and Simonovits on compactness and a classic result of Andrásfai, Erdős and Sós, Allen, Keevash, Sudakov and Verstraëte proved that for any $(\alpha,\beta )$-smooth family $\mathcal{F}$, there exists $k_0$ such that for all odd $k\geq k_0$ and sufficiently large $n$, any $n$-vertex $\mathcal{F}\cup \{C_k\}$-free graph with minimum degree at least $\rho (\frac{2n}{5}+o(n))^{\alpha -1}$ is bipartite. In this paper, we strengthen their result by showing that for every real $\delta \gt 0$, there exists $k_0$ such that for all odd $k\geq k_0$ and sufficiently large $n$, any $n$-vertex $\mathcal{F}\cup \{C_k\}$-free graph with minimum degree at least $\delta n^{\alpha -1}$ is bipartite. Furthermore, our result holds under a more relaxed notion of smoothness, which include the families $\mathcal{F}$ consisting of the single graph $K_{s,t}$ when $t\gg s$. We also prove an analogous result for $C_{2\ell }$-free graphs for every $\ell \geq 2$, which complements a result of Keevash, Sudakov and Verstraëte.

The aim of this paper is to determine a bound of the dimension of an irreducible component of the Hilbert scheme of the moduli space of torsion-free sheaves on surfaces. Let X be a nonsingular irreducible complex surface, and let E be a vector bundle of rank n on X. We use the m-elementary transformation of E at a point $x \in X$ to show that there exists an embedding from the Grassmannian variety $\mathbb{G}(E_x,m)$ into the moduli space of torsion-free sheaves $\mathfrak{M}_{X,H}(n;\,c_1,c_2+m)$ which induces an injective morphism from $X \times M_{X,H}(n;\,c_1,c_2)$ to $Hilb_{\, \mathfrak{M}_{X,H}(n;\,c_1,c_2+m)}$.

While the quasilinear isothermal Euler equations are an excellent model for gas pipeline flow, the operation of the pipeline flow with high pressure and small Mach numbers allows us to obtain approximate solutions by a simpler semilinear model. We provide a derivation of the semilinear model that shows that the semilinear model is valid for sufficiently low Mach numbers and sufficiently high pressures. We prove an existence result for continuous solutions of the semilinear model that takes into account lower and upper bounds for the pressure and an upper bound for the magnitude of the Mach number of the gas flow. These state constraints are important both in the operation of gas pipelines and to guarantee that the solution remains in the set where the model is physically valid. We show the constrained exact boundary controllability of the system with the same pressure and Mach number constraints.