Related papers: Strong stability from vertex-extendability and app…

In this paper on hyperbolic systems of conservation laws in one space dimension, we give a complete picture of stability for all solutions to the Riemann problem which contain only extremal shocks. We study stability of the Riemann problem…

For fixed graphs $H$ and $F$, the \emph{generalized Tur\'an number} $\mathrm{ex}(n,H,F)$ is the maximum possible number of copies of a subgraph $H$ in an $n$-vertex $F$-free graph. This article is a survey of this extremal function whose…

In a ground-breaking paper solving a conjecture of Erd\H{o}s on the number of $n$-vertex graphs not containing a given even cycle, Morris and Saxton \cite{MS} made a broad conjecture on so-called balanced supersaturation property of a…

We study the following generalization of the Tur\'an problem in sparse random graphs. Given graphs $T$ and $H$, let $\mathrm{ex}\big(G(n,p), T, H\big)$ be the random variable that counts the largest number of copies of $T$ in a subgraph of…

We study the long-time behavior an extended Navier-Stokes system in $\R^2$ where the incompressibility constraint is relaxed. This is one of several "reduced models" of Grubb and Solonnikov '89 and was revisited recently (Liu, Liu, Pego…

For positive integers $s,t,r$, let $K_{s,t}^{(r)}$ denote the $r$-uniform hypergraph whose vertex set is the union of pairwise disjoint sets $X,Y_1,\dots,Y_t$, where $|X| = s$ and $|Y_1| = \dots = |Y_t| = r-1$, and whose edge set is…

Strong Beltrami fields have long played a key role in fluid mechanics and magnetohydrodynamics. In particular, they are the kind of stationary solutions of the Euler equations where one has been able to show the existence of vortex…

In the 1980s, Erd\H{o}s and S\'os initiated the study of Tur\'an problems with a uniformity condition on the distribution of edges: the uniform Tur\'an density of a hypergraph $H$ is the infimum over all $d$ for which any sufficiently large…

For a fixed graph $F$, let $ex_F(G)$ denote the size of the largest $F$-free subgraph of $G$. Computing or estimating $ex_F(G)$ for various pairs $F,G$ is one of the central problems in extremal combinatorics. It is thus natural to ask how…

We prove quantitative versions for several results from geometric partial differential equations. Firstly, we obtain a double stability theorem for Serrin's overdetermined problem in spaceforms. Secondly, we prove stability theorems for…

Chao and Yu introduced an entropy method for hypergraph Tur\'an problems, and used it to show that the family of $\lfloor k/2\rfloor$ $k$-uniform tents have Tur\'an density $k!/k^k$. Il'kovi\v{c} and Yan improved this by reducing to a…

We present a systematic study of the regularity phenomena for NIP hypergraphs and connections to the theory of (locally) generically stable measures, providing a model-theoretic hypergraph version of the results from [L. Lov\'asz, B.…

In the present work we suggest a general covariant theory which can be used to study the stability of any physical system treated geometrically. Stability conditions are connected to the magnitude of the deviation vector. This theory is a…

We consider a range of geometric stability problems for hypersurfaces of spaceforms. One of the key results is an estimate relating the distance to a geodesic sphere of an embedded hypersurface with integral norms of the traceless Hessian…

We consider the Tur\'an-type problem of bounding the size of a set $M \subseteq \mathbb{F}_2^n$ that does not contain a linear copy of a given fixed set $N \subseteq \mathbb{F}_2^k$, where $n$ is large compared to $k$. An Erd\H{o}s-Stone…

We generalize and strenghten Ko{\l}odziej's stability theorem. In particular we give sharp stability exponent and treat the case with more singular right hand side of the Monge-Amp\`ere equation.

In the 1980s, Erd\H{o}s and S\'os initiated the study of Tur\'an hypergraph problems with a uniformity condition on the distribution of edges, i.e., determining density thresholds for the existence of a hypergraph H in a host hypergraph…

The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…

In this paper we describe a number of extensions to Razborov's semidefinite flag algebra method. We will begin by showing how to apply the method to significantly improve the upper bounds of edge and vertex Tur\'an density type results for…

We prove a stability version of Harper's cube vertex isoperimetric inequality, showing that subsets of the cube with vertex boundary close to the minimum possible are close to (generalised) Hamming balls. Furthermore, we obtain a local…