Related papers: Stability of higher-dimensional interval decomposa…

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…

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…

We consider the Tur\'an-type problem of bounding the size of a set $M \subseteq \mathbb{F}_2^n$ that does not contain a linear copy of a given fixed set $N \subseteq \mathbb{F}_2^k$, where $n$ is large compared to $k$. An Erd\H{o}s-Stone…

We investigate a two-dimensional transmission model consisting of a wave equation and a Kirchhoff plate equation with dynamical boundary controls under geometric conditions. The two equations are coupled through transmission conditions…

We study pairs $(f, \Gamma)$ consisting of a non-Archimedean rational function $f$ and a finite set of vertices $\Gamma$ in the Berkovich projective line, under a certain stability hypothesis. We prove that stability can always be attained…

Let $N$ be a normal subgroup of a group $G$. An $N$-module $Q$ is $G$-stable provided that $Q$ is equivalent to the twist $Q^g$ of $Q$ by $g$, for every $g\in G$. If the action of $N$ on $Q$ extends to an action of $G$ on $Q$, $Q$ is…

We prove stability estimates for the Brunn-Minkowski inequality for convex sets. Unlike existing stability results, our estimates improve as the dimension grows. Our results are equivalent to a thin shell bound, which is one of the central…

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…

In this paper, we prove several stability theorems for multiplicities of naturally defined representations of symmetric groups. The first such theorem states that if we consider the diagonal action of the symmetric group $S_{m+r}$ on $k$…

In this paper we introduce the notion of the stability of a sequence of modules over Hecke algebras. We prove that a finitely generated consistent sequence associated with Hecke algebras is representation stable.

We investigate the existence of sufficient local conditions under which poset representations decompose as direct sums of indecomposables from a given class. In our work, the indexing poset is the product of two totally ordered sets,…

In this work, we propose a new invariant for $2$D persistence modules called the compressed multiplicity and show that it generalizes the notions of the dimension vector and the rank invariant. In addition, for a $2$D persistence module…

A persistence module with $m$ discrete parameters is a diagram of vector spaces indexed by the poset $\mathbb{N}^m$. If we are only interested in the large scale behavior of such a diagram, then we can consider two diagrams equivalent if…

In this article we establish two fundamental results for the sublevel set persistent homology for stationary processes indexed by the positive integers. The first is a strong law of large numbers for the persistence diagram (treated as a…

The concept of edit distance, which dates back to the 1960s in the context of comparing word strings, has since found numerous applications with various adaptations in computer science, computational biology, and applied topology. By…

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…

This short note establishes explicit and broadly applicable relationships between persistence-based distances computed locally and globally. In particular, we show that the bottleneck distance between two zigzag persistence modules…

Revising Nekhoroshev's geometry of resonances, we provide a fully constructive and quantitative proof of Nekhoroshev's theorem for steep Hamiltonian systems proving, in particular, that the exponential stability exponent can be taken to be…

We address the stability problem for linear switching systems with mode-dependent restrictions on the switching intervals. Their lengths can be bounded as from below (the guaranteed dwell-time) as from above. The upper bounds make this…

We prove that the irreducible decomposition of the permutation representation of GL(n,q) on GL(n,q)/GL(n-m,q) stabilizes for large n. We deduce, as a consequence, a representation stability theorem for finitely generated VIC-modules.