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.

A graph $H$ is common if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is asymptotically minimised by the random colouring. Burr and Rosta, extending a famous conjecture of Erdős, conjectured that every graph is common. The conjectures of Erdős and of Burr and Rosta were disproved by Thomason and by Sidorenko, respectively, in the late 1980s. Collecting new examples of common graphs had not seen much progress since then, although very recently a few more graphs were verified to be common by the flag algebra method or the recent progress on Sidorenko’s conjecture. Our contribution here is to provide several new classes of tripartite common graphs. The first example is the class of so-called triangle trees, which generalises two theorems by Sidorenko and answers a question of Jagger, Šťovíček, and Thomason from 1996. We also prove that, somewhat surprisingly, given any tree $T$, there exists a triangle tree such that the graph obtained by adding $T$ as a pendant tree is still common. Furthermore, we show that adding arbitrarily many apex vertices to any connected bipartite graph on at most $5$ vertices yields a common graph.

In this paper, we prove the well-known Erdős–Lax inequality [4] in a sharpened form. As a consequence, another widely used inequality due to Ankeny and Rivlin [1] gets sharpened. These results may be useful in various applications that required the Erdős–Lax and the Ankeny–Rivlin inequalities.

It is standard in chemistry to represent a sequence of reactions by a single overall reaction, often called a complex reaction in contrast to an elementary reaction. Photosynthesis $6 \text{CO}_2+6 \text{H}_2\text{O} \longrightarrow \text{C}_6\text{H}_{12}\text{O}_6 + 6 \text{O}_2$ is an example of such complex reaction. We introduce a mathematical operation that corresponds to summing two chemical reactions. Specifically, we define an associative and non-communicative operation on the product space ${\mathbb{N}}_0^n\times {\mathbb{N}}_0^n$ (representing the reactant and the product of a chemical reaction, respectively). The operation models the overall effect of two reactions happening in succession, one after the other. We study the algebraic properties of the operation and apply the results to stochastic reaction networks (RNs), in particular to reachability of states, and to reduction of RNs.

We calculate the extension groups between simple modules of pro-p-Iwahori Hecke algebras.

This article deals with kinetic Fokker–Planck equations with essentially bounded coefficients. A weak Harnack inequality for nonnegative super-solutions is derived by considering their log-transform and adapting an argument due to S. N. Kružkov (1963). Such a result rests on a new weak Poincaré inequality sharing similarities with the one introduced by W. Wang and L. Zhang in a series of works about ultraparabolic equations (2009, 2011, 2017). This functional inequality is combined with a classical covering argument recently adapted by L. Silvestre and the second author (2020) to kinetic equations.

We show that the diameter of a uniformly drawn spanning tree of a simple connected graph on n vertices with minimal degree linear in n is typically of order $\sqrt{n}$. A byproduct of our proof, which is of independent interest, is that on such graphs the Cheeger constant and the spectral gap are comparable.