Related papers: Higher-order generalizations of stability and arit…

The $U^2$ norm gives a useful measure of quasirandomness for real- or complex-valued functions defined on finite (or, more generally, locally compact) groups. A simple Fourier-analytic argument yields an inverse theorem, which shows that a…

In this paper, we introduce fundamental notions of homotopy theory, including homotopy excision and the Freudenthal suspension theorem. We then explore framed cobordism and its connection to stable homotopy groups of spheres through the…

In the first edition of Classification Theory, the second author characterized the stable theories in terms of saturation of ultrapowers. Prior to this theorem, stability had already been defined in terms of counting types, and the unstable…

We give a complete and detailed proof of Harer's stability theorem for the homology of mapping class groups of surfaces, with the best stability range presently known. This theorem and its proof have seen several improvements since Harer's…

The purpose of this paper is to study stable representations of partially ordered sets (posets) and compare it to the well known theory for quivers. In particular, we prove that every indecomposable representation of a poset of finite type…

We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…

We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…

A well-known property of unordered configuration spaces of points (in an open, connected manifold) is that their homology stabilises as the number of points increases. We generalise this result to moduli spaces of submanifolds of higher…

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

We propose a way to organise the subject of ``higher-order homological stability'', in the context of a graded $E_2$-algebra $\mathbf{R}$, along the same lines that the chromatic perspective organises stable homotopy theory. From this point…

For a fixed algebraic variety $X$, curve class $\alpha \in N_1(X)$, and genus $g \in \mathbb N$, we consider the sequence of $S_n$ representations obtained from the homology of the Kontsevich space of stable maps to $X$, $\bar…

In recent years, attempts to generalize lattice gauge theories to model topological order have been carried out through the so called $2$-gauge theories. These have opened the door to interesting new models and new topological phases which…

Secondary homological stability is a recently discovered stability pattern for the homology of a sequence of spaces exhibiting homological stability in a range where homological stability does not hold. We prove secondary homological…

The study of resonances (and well-posedness) for complex systems under time-periodic loading is of broad interest in application. The work of Galdi et al.~(2014) connects asymptotic stability of solutions to an unforced Cauchy problem to…

A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly by…

Generalization analyses of deep learning typically assume that the training converges to a fixed point. But, recent results indicate that in practice, the weights of deep neural networks optimized with stochastic gradient descent often…

We prove a new kind of homological stability theorem for automorphism groups of finitely-generated projective modules over Dedekind domains, which takes into account all possible stabilisation maps between these, rather than only…

The stability of persistence diagrams is among the most important results in applied and computational topology. Most results in the literature phrase stability in terms of the bottleneck distance between diagrams and the $\infty$-norm of…

We prove a homological stability theorem for congruence subgroups of symplectic groups. From this theorem, we deduce a generalization of a theorem of Borel showing that certain homology groups of a congruence subgroup do not depend on the…

A folk theorem says higher order arithmetic has the proof theoretic strength of set theory with limited power set. This paper makes the theorem precise in terms of several axiom system based on ZF.