Related papers: Higher-order generalizations of stability and arit…
Periodic orbits for the classical $\phi^4$ theory on the one dimensional lattice are systematically constructed by extending the normal modes of the harmonic theory, for periodic, fixed and free boundary conditions. Through the process, we…
In this paper, we develop a modified proof strategy for homological stability of linear groups, with the general linear groups serving as a primary example. Our arguments are more direct than those in the classical works of Quillen and…
We discuss the higher order stabilization of the coefficients of the colored Jones polynomial. In particular, we find an expression for the second stable sequence of the colored Jones polynomial of a certain class of knots. We also…
Algorithmic stability is a central concept in statistics and learning theory that measures how sensitive an algorithm's output is to small changes in the training data. Stability plays a crucial role in understanding generalization,…
A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…
Using the language of twisted skew-commutative algebras, we define \emph{secondary representation stability}, a stability pattern in the {\it unstable} homology of spaces that are representation stable in the sense of Church, Ellenberg, and…
Given a family of groups admitting a braided monoidal structure (satisfying mild assumptions) we construct a family of spaces on which the groups act and whose connectivity yields, via a classical argument of Quillen, homological stability…
In this paper, we introduce a notion of stable coarse algebras for metric spaces with bounded geometry, and formulate the twisted coarse Baum--Connes conjecture with respect to stable coarse algebras. We prove permanence properties of this…
The paper presents methods of eigenvalue localisation of regular matrix polynomials, in particular, stability of matrix polynomials is investigated. For this aim a stronger notion of hyperstability is introduced and widely discussed. Matrix…
We reconsider both the global and local stability of solutions of continuously evolving dynamical systems from a geometric perspective. We clarify that an unambiguous definition of stability generally requires the choice of additional…
Let a sequence $(P_n)$ of polynomials in one complex variable satisfy a recurre ce relation with length growing slowlier than linearly. It is shown that $(P_n) $ is an orthonormal basis in $L^2_{\mu}$ for some measure $\mu$ on $\C$, if and…
We explore a notion of pseudofinite dimension, introduced by Hrushovski and Wagner, on an infinite ultraproduct of finite structures. Certain conditions on pseudofinite dimension are identified that guarantee simplicity or supersimplicity…
We combine the fundamental results of Breuillard, Green, and Tao on the structure of approximate groups, together with "tame" arithmetic regularity methods based on work of the authors and Terry, to give a structure theorem for finite…
We prove that the family of largest cuts in the binomial random graph exhibits the following stability property: If $1/n \ll p = 1-\Omega(1)$, then, with high probability, there is a set of $n - o(n)$ vertices that is partitioned in the…
We prove that uniform second order growth, tilt stability, and strong metric regularity of the limiting subdifferential --- three notions that have appeared in entirely different settings --- are all essentially equivalent for any…
Any arrangement of hyperplanes in general position in $P^n$ can be regarded as a divisor with normal crossing. We study the bundles of logarithmic 1-forms corresponding to such divisors` from the point of view of classification of vector…
We introduce a unified geometric framework for domains satisfying a geometric normal property (C-GNP) relative to a strictly convex set \(C\). Under the fundamental assumption that the source \(f\) is supported within the core \(C\), we…
Deriving generalization bounds for stable algorithms is a classical question in learning theory taking its roots in the early works by Vapnik and Chervonenkis (1974) and Rogers and Wagner (1978). In a series of recent breakthrough papers by…
We introduce the notion of "type" of a tableau, that allows us to define new families of tableaux including both balanced and standard Young tableaux. We use these new objects to describe the set of reduced decompositions of any…
We study uniform stability of discrete groups, Lie groups and Lie algebras in the rank metric, and the connections between uniform stability of these objects. We prove that semisimple Lie algebras are far from being flexibly…