Related papers: Higher-order generalizations of stability and arit…
We consider the following property of a first order theory T with a distinguished unary predicate P: every model of the theory of P occurs as the P-part of some model of T. We call this property the Gaifman property. Gaifman conjectured…
We prove Farber's conjecture on the stable topological complexity of configuration spaces of graphs. The conjecture follows from a general lower bound derived from recent insights into the topological complexity of aspherical spaces. Our…
The algebraic stability theorem for $\mathbb{R}$-persistence modules is a fundamental result in topological data analysis. We present a stability theorem for $n$-dimensional rectangle decomposable persistence modules up to a constant…
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
Let $\alpha(\mathbb{F}_q^d,p)$ denote the maximum size of a general position set in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^2,p)$ up to polylogarithmic factors for all possible…
We propose a quantitative notion of permutation stability for finitely generated groups. Our notion is related to, but distinct from, the ``stability rate'' introduced by Becker and Mosheiff (which is valid within the class of finitely…
In a recent article Facchini and Finocchiaro considered a natural pretorsion theory in the category of preordered sets inducing a corresponding stable category. In the present work we propose an alternative construction of the stable…
We prove a slope 1 stability range for the homology of the symplectic, orthogonal and unitary groups with respect to the hyperbolic form, over any fields other than $F_2$, improving the known range by a factor 2 in the case of finite…
For a finitely generated group, there are two recent generalizations of the notion of a quasiconvex subgroup of a word-hyperbolic group, namely a stable subgroup and a Morse or strongly quasiconvex subgroup. Durham and Taylor defined…
We prove a motivic stabilization result for the cohomology of the local systems on configuration spaces of varieties over $\mathbb{C}$ attached to character polynomials. Our approach interprets the stabilization as a probabilistic…
A regular partition $\mathcal{P}$ for a $3$-uniform hypergraph $H=(V,E)$ consists of a partition $V=V_1\cup \ldots \cup V_t$ and for each $ij\in {[t]\choose 2}$, a partition $K_2[V_i,V_j]=P_{ij}^1\cup \ldots \cup P_{ij}^{\ell}$, such that…
We exhibit a connection between geometric stability theory and the classification of unstable structures at the level of simplicity and the $\mathrm{NSOP}_{1}$-$\mathrm{SOP}_{3}$ gap. Particularly, we introduce generic expansions $T^{R}$ of…
We study the stability of randomized Taylor schemes for ODEs. We consider three notions of probabilistic stability: asymptotic stability, mean-square stability, and stability in probability. We prove fundamental properties of the…
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…
We extend the notion of numerical stability of finite difference approximations to include hyperbolic systems that are first order in time and second order in space, such as those that appear in Numerical Relativity. By analyzing the symbol…
A family of sets is called union-closed if whenever $A$ and $B$ are sets of the family, so is $A\cup B$. The long-standing union-closed conjecture states that if a family of subsets of $[n]$ is union-closed, some element appears in at least…
We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…
We say that an algorithm is stable if small changes in the input result in small changes in the output. This kind of algorithm stability is particularly relevant when analyzing and visualizing time-varying data. Stability in general plays…
We show that if the rotation set of a homeomorphism of the torus is stable under small perturbations of the dynamics, then it is a convex polygon with rational vertices. We also show that such homeomorphisms are $C^0$-generic and have…
We show that a derivator is stable if and only if homotopy finite limits and homotopy finite colimits commute, if and only if homotopy finite limit functors have right adjoints, and if and only if homotopy finite colimit functors have left…