We show that an infinite group G definable in a $1$-h-minimal field admits a strictly K-differentiable structure with respect to which G is a (weak) Lie group, and we show that definable local subgroups sharing the same Lie algebra have the same germ at the identity. We conclude that infinite fields definable in K are definably isomorphic to finite extensions of K and that $1$-dimensional groups definable in K are finite-by-abelian-by-finite. Along the way, we develop the basic theory of definable weak K-manifolds and definable morphisms between them.

Given a family of graphs $\mathcal{F}$ and an integer $r$, we say that a graph is $r$-Ramsey for $\mathcal{F}$ if any $r$-colouring of its edges admits a monochromatic copy of a graph from $\mathcal{F}$. The threshold for the classic Ramsey property, where $\mathcal{F}$ consists of one graph, in the binomial random graph was located in the celebrated work of Rödl and Ruciński.

In this paper, we offer a twofold generalisation to the Rödl–Ruciński theorem. First, we show that the list-colouring version of the property has the same threshold. Second, we extend this result to finite families $\mathcal{F}$, where the threshold statements might also diverge. This also confirms further special cases of the Kohayakawa–Kreuter conjecture. Along the way, we supply a short(-ish), self-contained proof of the $0$-statement of the Rödl–Ruciński theorem.

We obtain a new interpretation of the cohomological Hall algebra $\mathcal {H}_Q$ of a symmetric quiver Q in the context of the theory of vertex algebras. Namely, we show that the graded dual of $\mathcal {H}_Q$ is naturally identified with the underlying vector space of the principal free vertex algebra associated to the Euler form of Q. Properties of that vertex algebra are shown to account for the key results about $\mathcal {H}_Q$. In particular, it has a natural structure of a vertex bialgebra, leading to a new interpretation of the product of $\mathcal {H}_Q$. Moreover, it is isomorphic to the universal enveloping vertex algebra of a certain vertex Lie algebra, which leads to a new interpretation of Donaldson–Thomas invariants of Q (and, in particular, re-proves their positivity). Finally, it is possible to use that vertex algebra to give a new interpretation of CoHA modules made of cohomologies of non-commutative Hilbert schemes.

We characterize the fractional Dehn twist coefficient (FDTC) on the n-stranded braid group as the unique homogeneous quasimorphism to $\mathbb {R}$ of defect at most 1 that equals 1 on the positive full twist and vanishes on the $(n-1)$-stranded braid subgroup. In a different direction, we establish that the slice-Bennequin inequality holds with the FDTC in place of the writhe. In other words, we establish an affine linear lower bound for the smooth slice genus of the closure of a braid in terms of the braid’s FDTC. We also discuss connections between these two seemingly unrelated results. In the appendix, we provide a unifying framework for the slice-Bennequin inequality and its counterpart for the FDTC.

We prove a general formula that relates the parity of the Langlands parameter of a conjugate self-dual discrete series representation of $\operatorname { {GL}}_n$ to the parity of its Jacquet-Langlands image. It gives a generalization of a partial result by Mieda concerning the case of invariant $1/n$ and supercuspidal representations. It also gives a variation of the result on the self-dual case by Prasad and Ramakrishnan.

This work describes a hyperbolic model for cell-cell repulsion with population dynamics. We consider the pressure produced by a population of cells to describe their motion. We assume that cells try to avoid crowded areas and prefer locally empty spaces far away from the carrying capacity. Here, our main goal is to prove the existence of travelling waves with continuous profiles. This article complements our previous results about sharp travelling waves. We conclude the paper with numerical simulations of the PDE problem, illustrating such a result. An application to wound healing also illustrates the importance of travelling waves with a continuous and discontinuous profile.

We present a new explicit formula for the determinant that contains superexponentially fewer terms than the usual Leibniz formula. As an immediate corollary of our formula, we show that the tensor rank of the $n \times n$ determinant tensor is no larger than the $n$-th Bell number, which is much smaller than the previously best-known upper bounds when $n \geq 4$. Over fields of non-zero characteristic we obtain even tighter upper bounds, and we also slightly improve the known lower bounds. In particular, we show that the $4 \times 4$ determinant over ${\mathbb{F}}_2$ has tensor rank exactly equal to $12$. Our results also improve upon the best-known upper bound for the Waring rank of the determinant when $n \geq 17$, and lead to a new family of axis-aligned polytopes that tile ${\mathbb{R}}^n$.

This paper is concerned with the development and analysis of a mathematical model that is motivated by interstitial hydrodynamics and tissue deformation mechanics (poro-elasto-hydrodynamics) within an in-vitro solid tumour. The classical mixture theory is adopted for mass and momentum balance equations for a two-phase system. A main contribution of this study is we treat the physiological transport parameter (i.e., hydraulic resistivity) as anisotropic and heterogeneous, thus the governing system is strongly coupled and non-linear. We derived a weak formulation and then formulated the equivalent fixed-point problem. This enabled us to use the Galerkin method, and the classical results on monotone operators combined with the well-known Schauder and Banach fixed-point theorems to prove the existence and uniqueness of results.

In loving memory of my beloved miniature dachshund Maddie (16 March 2002 – 16 March 2020). We consider nonlocal differential equations with convolution coefficients of the form

\[{-}M\Big(\big(a*(g\circ |u|)\big)(1)\Big)u''(t)=\lambda f\big(t,u(t)\big),\quad t\in(0,1), \]

$g$

$M$

$M$

$f$

Daisies are a special type of hypergraph introduced by Bollobás, Leader and Malvenuto. An $r$-daisy determined by a pair of disjoint sets $K$ and $M$ is the $(r+|K|)$-uniform hypergraph $\{K\cup P\,{:}\, P\in M^{(r)}\}$. Bollobás, Leader and Malvenuto initiated the study of Turán type density problems for daisies. This paper deals with Ramsey numbers of daisies, which are natural generalisations of classical Ramsey numbers. We discuss upper and lower bounds for the Ramsey number of $r$-daisies and also for special cases where the size of the kernel is bounded.

We study the community detection problem on a Gaussian mixture model, in which vertices are divided into $k\geq 2$ distinct communities. The major difference in our model is that the intensities for Gaussian perturbations are different for different entries in the observation matrix, and we do not assume that every community has the same number of vertices. We explicitly find the necessary and sufficient conditions for the exact recovery of the maximum likelihood estimation, which can give a sharp phase transition for the exact recovery even though the Gaussian perturbations are not identically distributed; see Section 7. Applications include the community detection on hypergraphs.

We address the problem of optimal transport with a quadratic cost functional and a constraint on the flux through a constriction along the path. The constriction, conceptually represented by a toll station, limits the flow rate across. We provide a precise formulation which, in addition, is amenable to generalization in higher dimensions. We work out in detail the case of transport in one dimension by proving existence and uniqueness of solution. Under suitable regularity assumptions, we give an explicit construction of the transport plan. Generalization of flux constraints to higher dimensions and possible extensions of the theory are discussed.

A $(k+r)$-uniform hypergraph $H$ on $(k+m)$ vertices is an $(r,m,k)$-daisy if there exists a partition of the vertices $V(H)=K\cup M$ with $|K|=k$, $|M|=m$ such that the set of edges of $H$ is all the $(k+r)$-tuples $K\cup P$, where $P$ is an $r$-tuple of $M$. We obtain an $(r-2)$-iterated exponential lower bound to the Ramsey number of an $(r,m,k)$-daisy for $2$-colours. This matches the order of magnitude of the best lower bounds for the Ramsey number of a complete $r$-graph.

We are interested in the two-dimensional four-constant Riemann problem to the isentropic compressible Euler equations. In terms of the self-similar variables, the governing system is of nonlinear mixed-type and the solution configuration typically contains transonic and small-scale structures. We construct a supersonic-sonic patch along a pseudo-streamline from the supersonic part to a sonic point. This kind of patch appears frequently in the two-dimensional Riemann problem and is a building block for constructing a global solution. To overcome the difficulty caused by the sonic degeneracy, we apply the characteristic decomposition technique to handle the problem in a partial hodograph plane. We establish a regular supersonic solution for the original problem by showing the global one-to-one property of the partial hodograph transformation. The uniform regularity of the solution and the regularity of an associated sonic curve are also discussed.

In a smoothly bounded domain $\Omega \subset \mathbb{R}^n$, $n\ge 1$, this manuscript considers the homogeneous Neumann boundary problem for the chemotaxis system

\begin{eqnarray*} \left \{ \begin{array}{l} u_t = \Delta u - \nabla \cdot (u\nabla v), \\[5pt] v_t = \Delta v + u - \alpha uv, \end{array} \right . \end{eqnarray*}

$\alpha \gt 0$

It is shown that there exists $\delta _\star =\delta _\star (n)\gt 0$ such that for any given $\alpha \ge \frac{1}{\delta _\star }$ and for any suitably regular initial data satisfying $v(\cdot, 0)\le \delta _\star$, this problem admits a unique classical solution that stabilizes to the constant equilibrium $(\frac{1}{|\Omega |}\int _\Omega u(\cdot, 0), \, \frac{1}{\alpha })$ in the large time limit.

We investigate the list packing number of a graph, the least $k$ such that there are always $k$ disjoint proper list-colourings whenever we have lists all of size $k$ associated to the vertices. We are curious how the behaviour of the list packing number contrasts with that of the list chromatic number, particularly in the context of bounded degree graphs. The main question we pursue is whether every graph with maximum degree $\Delta$ has list packing number at most $\Delta +1$. Our results highlight the subtleties of list packing and the barriers to, for example, pursuing a Brooks’-type theorem for the list packing number.

The purpose of the paper is twofold. First, we show that partial-data transmission eigenfunctions associated with a conductive boundary condition vanish locally around a polyhedral or conic corner in $\mathbb{R}^n$, $n=2,3$. Second, we apply the spectral property to the geometrical inverse scattering problem of determining the shape as well as its boundary impedance parameter of a conductive scatterer, independent of its medium content, by a single far-field measurement. We establish several new unique recovery results. The results extend the relevant ones in [26] in two directions: first, we consider a more general geometric setup where both polyhedral and conic corners are investigated, whereas in [26] only polyhedral corners are concerned; second, we significantly relax the regularity assumptions in [26] which is particularly useful for the geometrical inverse problem mentioned above. We develop novel technical strategies to achieve these new results.

The structure of groups in which every element has prime power order (CP-groups) is extensively studied. We first investigate the properties of group $G$ such that each element of $G\setminus N$ has prime power order. It is proved that $N$ is solvable or every non-solvable chief factor $H/K$ of $G$ satisfying $H\leq N$ is isomorphic to $PSL_2(3^f)$ with $f$ a 2-power. This partially answers the question proposed by Lewis in 2023, asking whether $G\cong M_{10}$? Furthermore, we prove that if each element $x\in G\backslash N$ has prime power order and ${\bf C}_G(x)$ is maximal in $G$, then $N$ is solvable. Relying on this, we give the structure of group $G$ with normal subgroup $N$ such that ${\bf C}_G(x)$ is maximal in $G$ for any element $x\in G\setminus N$. Finally, we investigate the structure of a normal subgroup $N$ when the centralizer ${\bf C}_G(x)$ is maximal in $G$ for any element $x\in N\setminus {\bf Z}(N)$, which is a generalization of results of Zhao, Chen, and Guo in 2020, investigating a special case that $N=G$ for our main result. We also provide a new proof for Zhao, Chen, and Guo's results above.

We define duality triples and duality pairs in compactly generated triangulated categories and investigate their properties. This enables us to give an elementary way to determine whether a class is closed under pure subobjects, pure quotients and pure extensions, as well as providing a way to show the existence of approximations. One key ingredient is a new characterization of phantom maps. We then introduce an axiomatic form of Auslander–Gruson–Jensen duality, from which we define dual definable categories, and show that these coincide with symmetric coproduct closed duality pairs. This framework is ubiquitous, encompassing both algebraic triangulated categories and stable homotopy theories. Accordingly, we provide many applications in both settings, with a particular emphasis on silting theory and stratified tensor-triangulated categories.

In this paper, we consider the following PDE-ODE system modelling cancer invasion with slow diffusion and ECM remodelling,

\[ \begin{cases} u_t=\Delta u^m-\chi\nabla\cdot(u\nabla v)-\xi\nabla\cdot(u\nabla\omega)+\mu u(1-u-\omega), \\ v_t=\Delta v+u-v, \\ \omega_t={-}v\omega+\eta \omega(1-u-\omega). \end{cases} \]

$\eta =0$

$\eta >0$

$\eta =0$

$\eta >0$