Related papers: On the equivalence of two stability conditions of …
Representation stability is a theory describing a way in which a sequence of representations of different groups is related, and essentially contains a finite amount of information. Starting with Church-Ellenberg-Farb's theory of…
One of the main reasons for topological persistence being useful in data analysis is that it is backed up by a stability (isometry) property: persistence diagrams of $1$-parameter persistence modules are stable in the sense that the…
We identify two recursively defined polynomial conditions for FI-modules in the literature. We characterize these conditions using homological invariants of FI-modules (namely the local degree and regularity, together with the stable…
We characterize the class of persistence modules indexed over $\mathbb{R}^2$ that are decomposable into summands whose support have the shape of a {\em block}---i.e. a horizontal band, a vertical band, an upper-right quadrant, or a…
We prove two general results concerning spectral sequences of $\mathbf{FI}$-modules. These results can be used to significantly improve stable ranges in a large portion of the stability theorems for $\mathbf{FI}$-modules currently in the…
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…
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…
The groups $\Gamma_{n,s}$ are defined in terms of homotopy equivalences of certain graphs, and are natural generalisations of $\mbox{Out}(F_n)$ and $\mbox{Aut}(F_n)$. They have appeared frequently in the study of free group automorphisms,…
We study asymptotic properties of the modular representation theory of symmetric groups and investigate modular analogs of stabilization phenomena in characteristic zero. The main results are equivalences of categories between certain…
In this paper we introduce and develop the theory of FI-modules. We apply this theory to obtain new theorems about: - the cohomology of the configuration space of n distinct ordered points on an arbitrary (connected, oriented) manifold -…
We present in this paper a rigorous theoretical framework to show stability, convergence and accuracy of improved edge-based and face-based smoothed finite element methods (bESFEM and bFS-FEM) for nearly-incompressible elasticity problems.…
In pursuit of a deeper understanding of Boolean Promise Constraint Satisfaction Problems (PCSPs), we identify a class of problems with restricted structural complexity, which could serve as a promising candidate for complete…
We develop a theory of levels for irreducible representations of symmetric groups of degree $n$ analogous to the theory of levels for finite classical groups. A key property of level is that the level of a character, provided it is not too…
Let $V$ be a complete discrete valued ring of mixed characteristic $(0,p)$, $K$ its field of fractions, $k$ its residue field which is supposed to be perfect. Let $X$ be a separated $k$-scheme of finite type and $Y$ be a smooth open of $X$.…
In this paper, we introduce the notions of motivic representation stability that is an algebraic counterpart of the notion of representation stability. In the process, we also introduce the notion of motivic decomposition for varieties…
We say a representation V of a group G has stability if its multiplicities m^{G}_{V}(\lambda) is dependent only on some equivalence class of \lambda for a sufficiently large parameter \lambda. In this paper, we prove that the restriction of…
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…
This thesis investigates the extent to which the optimal value of a constraint satisfaction problem (CSP) can be approximated by some sentence of fixed point logic with counting (FPC). It is known that, assuming $\mathsf{P} \neq…
In the context of holomorphic families of ${\mathbb P}^k$ endomorphisms, we show that various notions of stability are equivalent. This allows us to both extend and simplify the architecture of the proof of certain results of [BBD]
Consider the polynomial ring in countably infinitely many variables over a field of characteristic zero, together with its natural action of the infinite general linear group G. We study the algebraic and homological properties of finitely…