Related papers: Flexible stability and nonsoficity
A noncommutative polynomial is stable if it is nonsingular on all tuples of matrices whose imaginary parts are positive definite. In this paper a characterization of stable polynomials is given in terms of strongly stable linear matrix…
A smooth complex quasi-affine algebraic variety $Y$ is flexible if its special group $\SAut (Y)$ of automorphisms (generated by the elements of one-dimensional unipotent subgroups of $\Aut (Y)$) acts transitively on $Y$. An irreducible…
Let $G$ be a finite insoluble group with soluble radical $R(G)$. In this paper we investigate the soluble graph of $G$, which is a natural generalisation of the widely studied commuting graph. Here the vertices are the elements in $G…
We show that if $G$ is a discrete Abelian group and $A \subset G$ has $\|1_A\|_{B(G)} \leq M$ then $A$ is $O(\exp(\pi M))$-stable in the sense of Terry and Wolf.
We prove that graph products of sofic groups are sofic, as are graphs of groups for which vertex groups are sofic and edge groups are amenable.
We show that if $G$ is a countable amenable group, then every stationary non-Gaussian symmetric $\alpha$-stable (S$\alpha$S) process indexed by $G$ is ergodic if and only if it is weakly-mixing, and it is ergodic if and only if its Rosinski…
We prove that if $G=(V,E)$ is an $\omega$-stable (respectively, superstable) graph with $\chi(G)>\aleph_0$ (respectively, $2^{\aleph_0}$) then $G$ contains all the finite subgraphs of the shift graph $\text{Sh}_n(\omega)$ for some $n$. We…
The stability problem of a class of nonlinear switched systems defined on compact sets with state-dependent switching is considered. Instead of the Caratheodory solutions, the general Filippov solutions are studied. This encapsulates…
We investigate various forms of (model-theoretic) stability for hypergraphs and their corresponding strengthenings of the hypergraph regularity lemma with respect to partitions of vertices. On the one hand, we provide a complete…
By working with coefficients in $\mathbb{Z}$ or $\mathbb{R}$, one can define two different notions of stability for a sandpile on a graph. We call a sandpile immutable when these notions agree. Our main results give linear-algebraic…
Finding a non-sofic hyperbolic group will resolve two major problems in geometric group theory: Are there non sofic groups? Are there non residually finite hyperbolic groups? In this paper, we propose a new probabilistic approach to this…
We study the oscillations and stability of self-gravitating cylindrically symmetric fluid systems and collisionless systems. This is done by studying small perturbations to the equilibrium system and finding the normal modes, using methods…
A pair of graphs $(\Gamma,\Sigma)$ is said to be stable if the full automorphism group of $\Gamma\times\Sigma$ is isomorphic to the product of the full automorphism groups of $\Gamma$ and $\Sigma$ and unstable otherwise, where…
We prove that for every complete graph $K_t$, all graphs $G$ with no induced subgraph isomorphic to a subdivision of $K_t$ have a stable subset of size at least $|G|/{\rm polylog}|G|$. This is close to best possible, because for $t\ge 7$,…
We study algebraic properties on a group G such that if the discrete group G has these properties then every locally compact shift continuous topology on G with adjoined zero is either compact, or discrete. We introduce electorally flexible…
We say that a group is anti-solvable if all of its composition factors are non-abelian. We consider a particular family of anti-solvable finite groups containing the simple alternating groups for $n\neq 6$ and all 26 sporadic simple groups.…
We prove that the class of chordal graphs is easily testable in the following sense. There exists a constant $c>0$ such that, if adding/removing at most $\epsilon n^2$ edges to a graph $G$ with $n$ vertices does not make it chordal, then a…
An equilibrium statistical system is known to be stable if the fluctuations of global observables are normal, when their dispersions are proportional to the number of particles, or to the system volume. A general theorem is rigorously…
The stability number of a graph G, denoted by alpha(G), is the cardinality of a maximum stable set, and mu(G) is the cardinality of a maximum matching in G. If alpha(G) + mu(G) equals its order, then G is a Koenig-Egervary graph. We call G…
The stability of a system of $N$ equal sized mutually gravitating spheres resting on each other in a straight line and rotating in inertial space is considered. This is a generalization of the "Euler Resting" configurations previously…