Related papers: Stable forking and imaginaries

In this article, we provide a modified argument for proving conditional stability for inverse problems of determining spatially varying functions in evolution equations by Carleman estimates. Our method needs not any cut-off procedures and…

Floquet's Theorem is a celebrated result in the theory of ordinary differential equations. Essentially, the theorem states that, when studying a linear differential system with $T$-periodic coefficients, we can apply a, possibly complex,…

We prove that in a theory $T$ stable over a predicate $P$, for any $\lambda > |T|$, there is a $\lambda$-prime model over any complete set A with a $\lambda$-saturated $P$-part.

We prove a stability version of the Pr\'ekopa-Leindler inequality.

We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…

We prove in this note a stabilized version of a conjecture on $\A^1$-connectedness. For the stabilized version of this conjecture, we introduce the notion of stable $\A^1$-connectedness, which is can be seen as the stabilization of…

We establish several results regarding dividing and forking in NTP2 theories. We show that dividing is the same as array-dividing. Combining it with existence of strictly invariant sequences we deduce that forking satisfies the chain…

We give sufficient conditions such that the exponential stability of the linearization of a non-linear system implies that the non-linear system is (locally) exponentially stable. One of these conditions is that the non-linear system is…

We derive a sufficient condition for stability in probability of an equilibrium of a randomly perturbed map in ${\mathbb R}^d$. This condition can be used to stabilize weakly unstable equilibria by random forcing. Analytical results on…

We state some widely satisfied hypotheses, depending only on two functions $g$ and $h$, under which the composition of a stable algorithm for $g$ and a stable algorithm for $h$ is a stable algorithm for the composition $g \circ h$.

We develop a new notion of independence suggested by Scanlon (th-independence). We prove that in a large class of theories (which includes all simple theories) this notion has many of the properties needed for an adequate geometric…

An equilibrium statistical system is known to be stable if the fluctuations of global observables are normal, when their dispersions are proportional to the number of particles, or to the system volume. A general theorem is rigorously…

G{\"o}del's second incompleteness theorem forbids to prove, in a given theory U, the consistency of many theories-in particular, of the theory U itself-as well as it forbids to prove the normalization property for these theories, since this…

Given an infinitesimal perturbation of a discrete-time finite Markov chain, we seek the states that are stable despite the perturbation, \textit{i.e.} the states whose weights in the stationary distributions can be bounded away from $0$ as…

Let $T$ be a theory. If $T$ eliminates $\exists^\infty$, it need not follow that $T^{eq}$ eliminates $\exists^\infty$, as shown by the example of the $p$-adics. We give a criterion to determine whether $T^{eq}$ eliminates $\exists^\infty$.…

We use simple spectral perturbation theory to show that the positive partial transpose property is stable under bounded perturbations of the Hamiltonian, for equilibrium states in infinite dimensions. The result holds provided the…

Let $K$ be a complete discrete valuation field of characteristic $(0, p)$ with perfect residue field, and let $T$ be an integral $\mathbb{Z}_p$-representation of $\mathrm{Gal}(\overline{K}/K)$. A theorem of T. Liu says that if $T/p^n T$ is…

By changing variables in a suitable way and using dominated convergence methods, this note gives a short proof of Stirling's formula and its refinement.

Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…

We present sufficient conditions for topological stability of continuous functions $f:\mathbb{R}\to\mathbb{R}$ having finitely many local extrema with respect to averagings by discrete measures with finite supports.