Related papers: Higher-order generalizations of stability and arit…
The aim of this paper is to prove characterization theorems for higher order derivations. Among others we prove that the system defining higher order derivations is stable. Further characterization theorems in the spirit of N.~G.~de Bruijn…
Our approach to higher order Fourier analysis is to study the ultra product of finite (or compact) Abelian groups on which a new algebraic theory appears. This theory has consequences on finite (or compact) groups usually in the form of…
The densities of small linear structures (such as arithmetic progressions) in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by…
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.…
A sequence of representations \(V_n\) of the symmetric group \(S_n\) is called representation (multiplicity) stable if, after some \(n\), the irreducible decomposition of \(V_n\) stabilizes. In particular, Church, Ellenburg and Farb (2015)…
We prove a general homological stability theorem for certain families of groups equipped with product maps, followed by two theorems of a new kind that give information about the last two homology groups outside the stable range. (These…
Fourier matrices naturally appear in many applications and their stability is closely tied to performance guarantees of algorithms. The starting point of this article is a result that characterizes properties of an exponential system on a…
A theorem of Waldspurger states that the Fourier transform of a stable distribution on the Lie algebra of a simply-connected semisimple group $G$ over a p-adic field, is again stable. We generalize this theorem to representations whose…
Previous work of the second author and Wolf showed that given a set $A\subseteq \mathbb{F}_p^n$ of bounded $\textrm{VC}_2$-dimension, there is a high rank quadratic factor $\mathcal{B}$ of bounded complexity such that $A$ is approximately…
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem…
We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…
This paper discusses a general and useful stability principle which, roughly speaking, says that given a uniformly continuous function defined on an arbitrary metric space, if the function is bounded on the constraint set and we slightly…
We present a theorem that allows to simplify linear stability analysis of periodic and quasiperiodic nonlinear regimes in N-particle mechanical systems (both conservative and dissipative) with different kinds of discrete symmetry. This…
We present a method which provides a unified framework for most stability theorems that have been proved in graph and hypergraph theory. Our main result reduces stability for a large class of hypergraph problems to the simpler question of…
We provide a uniform approach to obtain sufficient criteria for a (higher order) fixed point of a given bracket structure on a manifold to be stable under deformations. Examples of bracket structures include Lie algebroids, Lie…
We give a new proof of the NIP arithmetic regularity lemma for finite groups (due to the authors and Pillay), which describes the approximate structure of "NIP sets" in finite groups, i.e., subsets whose collection of left translates has…
In this paper we give characterizations of the super-stable theories, in terms of an external property called representation. In the sense of the representation property, the mentioned class of first-order theories can be regarded as "not…
When the distribution of a random (N) sum of independent copies of a r.v X is of the same type as that of X we say that X is N-sum stable. In this paper we consider a generalization of stability of geometric sums by studying distributions…
Church-Ellenberg-Farb used the language of FI-modules to prove that the cohomology of certain sequences of hyperplane arrangements with S_n-actions satisfies representation stability. Here we lift their results to the level of the…
Stable subgroups and the Morse boundary are two systematic approaches to collect and study the hyperbolic aspects of finitely generated groups. In this paper we unify and generalize these strategies by viewing any geodesic metric space as a…