Related papers: Groups with arbitrarily poor permutation stability

In a 1937 paper B.H. Neumann constructed an uncountable family of $2$-generated groups. We prove that all of his groups are permutation stable by analyzing the structure of their invariant random subgroups.

In group sequential designs, where several data looks are conducted for early stopping, we generally assume the vector of test statistics from the sequential analyses follows (at least approximately or asymptotially) a multivariate normal…

We present an standard constraints generation algorithm to find an explicit set whose robustness is equal to the robustness of the feasible solution set of a combinatorial optimization problem with cost uncertainty. Computational experience…

This paper considers the problem of robust stability for a class of uncertain nonlinear quantum systems subject to unknown perturbations in the system Hamiltonian. The nominal system is a linear quantum system defined by a linear vector of…

We develop a general theory of local stability up to belonging to an ideal (e.g. having measure zero). From a model-theoretic perspective, we prove a stationarity principle for almost stable formulas in this sense, and build a topological…

Motivated by data on coauthorships in scientific publications, we analyze a team formation process that generalizes matching models and network formation models, allowing for overlapping teams of heterogeneous size. We apply different…

We study the problem of realizing families of subgroups as the set of stabilizers of configurations from a subshift of finite type (SFT). This problem generalizes both the existence of strongly and weakly aperiodic SFTs. We show that a…

If matrices almost satisfying a group relation are close to matrices exactly satisfying the relation, then we say that a group is matricially stable. Here "almost" and "close" are in terms of the Hilbert-Schmidt norm. Using tracial 2-norm…

Let $G$ be a finite group and let $p$ be a prime. In this paper, we study the structure of finite groups with a large number of $p$-regular conjugacy classes or, equivalently, a large number of irreducible $p$-modular representations. We…

Informed by our understanding of the tt-geometry of permutation modules, we investigate the proper definition of the `stable permutation category' of a finite group. Then we prove that this category decomposes over cyclic and generalized…

Randomly-assembled dynamical systems are theoretically predicted to be unstable upon crossing a critical threshold of complexity, as first shown by May. Yet, empirical complex systems exhibit remarkable stability, indicating the presence of…

Let $G$ be a finite permutation group of degree $n$ and let ${\rm ifix}(G)$ be the involution fixity of $G$, which is the maximum number of fixed points of an involution. In this paper we study the involution fixity of almost simple…

This is a review of group entropy and its application to permutation complexity. Specifically we revisit a new approach to the notion of complexity in time serie analysis, based on both permutation entropy and group entropy. As a result,…

The problem of how to obtain quasi-classical states for quantum groups is examined. A measure of quantum indeterminacy is proposed, which involves expectation values of some natural quantum group operators. It is shown that within any…

We prove that if $G$ is a finitely generated group and $Z$ is a uniformly recurrent subgroup of $G$ then there exists a minimal system $(X,G)$ with $Z$ as its stability system. This answers a query of Glasner and Weiss \cite{GW} in the case…

In this paper we discuss the adjoint stabilised finite element method introduced in, E. Burman, Stabilized finite element methods for nonsymmetric, noncoercive and ill-posed problems. Part I: elliptic equations, SIAM Journal on Scientific…

We investigate the statistical stability of a class of dynamical systems semi-conjugate to pre-piecewise \textit{convex or expanding} maps with countably many branches. These systems naturally arise in the study of transformations with…

In this paper we study the preservation of strong stability of strongly continuous semigroups on Hilbert spaces. In particular, we study a situation where the generator of the semigroup has a finite number of spectral points on the…

We study computational questions related with the stability of discrete-time linear switching systems with switching sequences constrained by an automaton. We first present a decidable sufficient condition for their boundedness when the…

We investigate a family of distributions having a property of stability-under-addition, provided that the number $\nu$ of added-up random variables in the random sum is also a random variable. We call the corresponding property a…