Related papers: New Short Proofs to Some Stability Theorems
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…
We consider the problem of closeness of solutions of an exact and an averaged difference equations on an infinite interval. Appropriate assertions are derived from one special theorem on the stability under constantly acting perturbations.
In this paper, we give a new and short proof of a Theorem on k-hypertournament losing scores due to Zhou et al.[7].
Motivated by Xia-Zhou's recent work on applying symmetry groups to the N-body problem, we will study relative equilibria of the equilateral triangle and the square configurations under $\alpha$-homogeneous and quasi-homogeneous potentials…
In this paper, we prove several new Tur\'{a}n density results for $3$-graphs. We show: $\pi(C_4^3, \mathrm{complement\ of\ } F_5) = 2\sqrt{3} - 3$, $\pi(F_{3,2}, C_5^{3-}) = \frac{2}{9}$, and $\pi(F_{3,2}, \mathrm{induced\ complement\ of\ }…
The extended RPA theories are analyzed from the point of view of the problem of stability of their solutions. Three kinds of such theories are considered: the second RPA and two versions of the quasiparticle-phonon coupling model within the…
Combining two classical notions in extremal combinatorics, the study of Ramsey-Tur\'an theory seeks to determine, for integers $m\le n$ and $p \leq q$, the number $\mathsf{RT}_p(n,K_q,m)$, which is the maximum size of an $n$-vertex…
We introduce a relaxation of stability, called almost sure stability, which is insensitive to perturbations by subsets of Loeb measure $0$ in a non-standard finite group. We show that almost sure stability satisfies a stationarity principle…
In this paper we study the continuous dependence with respect to obstacles for obstacle problems with measure data. This is deeply investigated introducing a suitable type of convergence, which gives stability under very general hypotheses.…
It is well-known that a minimal graph of codimension one is stable, i.e. the second variation of the area functional is non-negative. This is no longer true for higher codimensional minimal graphs. In this note, we prove that a minimal…
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…
We formulate a stable reduction conjecture that extends Deligne-Mumford's stable reduction to higher dimensions and provide a simple proof that it holds in large characteristic, assuming two standard conjectures of the Minimal Model…
In this thesis we study the principle that extremal objects in differential geometry correspond to stable objects in algebraic geometry. In our introduction we survey the most famous instances of this principle with a view towards the…
In 1964, Erd\H{o}s, Hajnal and Moon introduced a saturation version of Tur\'an's classical theorem in extremal graph theory. In particular, they determined the minimum number of edges in a $K_r$-free, $n$-vertex graph with the property that…
Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability…
Some general aspects of nonlinear transport phenomena are discussed on the basis of two kinds of formulations obtained by extending Kubo's perturbational scheme of the density matrix and Zubarev's non-equilibrium statistical operator…
We prove a homological stability theorem for the subgroup of the mapping class group acting as the identity on some fixed portion of the first homology group of the surface. We also prove a similar theorem for the subgroup of the mapping…
The uniform Tur\'an density $\pi_{u}(F)$ of a $3$-uniform hypergraph (or $3$-graph) $F$ is the supremum of all $d$ such that there exist infinitely many $F$-free $3$-graphs $H$ in which every induced subhypergraph on a linearly sized vertex…
Many important problems in combinatorics and other related areas can be phrased in the language of independent sets in hypergraphs. Recently Balogh, Morris and Samotij, and independently Saxton and Thomason developed very general container…
We introduce the following simpler variant of the Tur\'an problem: Given integers $n>k>r\geq 2$ and $m\geq 1$, what is the smallest integer $t$ for which there exists an $r$-uniform hypergraph with $n$ vertices, $t$ edges and $m$ connected…