Related papers: Flexible stability and nonsoficity

Let $G$ be a finite group. We let $\f{m}(G)$ and $\sig(G)$ denote the number of maximal subgroups of $G$ and the least positive integer $n$ such that $G$ is written as the union of $n$ proper subgroups, respectively. In this paper we…

Let $G$ be a $\{C_4, C_5\}$-free planar graph with a list assignment $L$. Suppose a preferred color is given for some of the vertices. We prove that if all lists have size at least four, then there exists an $L$-coloring respecting at least…

Let $G$ be a group and $H\leqslant G$ a subgroup. The free extension of an $H$-subshift $X$ to $G$ is the $G$-subshift $\widetilde{X}$ whose configurations are those for which the restriction to every coset of $H$ is a configuration from…

Let $G$ be a reductive affine algebraic group, and let $X$ be an affine algebraic $G$-variety. We establish a (poly)stability criterion for points $x\in X$ in terms of intrinsically defined closed subgroups $H_{x}$ of $G$, and relate it…

We extend the methods of geometric invariant theory to actions of non--reductive groups in the case of homomorphisms between decomposable sheaves whose automorphism groups are non--reductive. Given a linearization of the natural action of…

Let $X$ be a smooth projective variety. Define a stable map $f:C\to X$ to be "eventually smoothable" if there is an embedding $X\hookrightarrow\mathbb{P}^N$ such that $(C,f)$ occurs as the limit of a $1$-parameter family of stable maps to…

A sofic approximation to a countable group is a sequence of partial actions on finite sets that asymptotically approximates the action of the group on itself by left-translations. A group is sofic if it admits a sofic approximation. Sofic…

We propose a quantitative notion of permutation stability for finitely generated groups. Our notion is related to, but distinct from, the ``stability rate'' introduced by Becker and Mosheiff (which is valid within the class of finitely…

Several well-known open questions (such as: are all groups sofic/hyperlinear?) have a common form: can all groups be approximated by asymptotic homomorphisms into the symmetric groups $\mathrm{Sym}(n)$ (in the sofic case) or the finite…

Given a finitely generated group $G$, we are interested in common geometric properties of all graphs of faithful actions of $G$. In this article we focus on their growth. We say that a group $G$ has a Schreier growth gap $f(n)$ if every…

A scalar field theory with a $\chi^\dag\chi\phi$ interaction is known to be unstable. Yet it has been used frequently without any sign of instability in standard text book examples and research articles. In order to reconcile these…

For any smooth projective variety $X$ of dimension $n$ over an algebraically closed field $k$ of characteristic $p>0$ with $\mu(\Omega^1_X)>0$. If ${\rm T}^{\ell}(\Omega^1_X)$ ($0<\ell<n(p-1)$) are semi-stable, then the sheaf $B^1_X$ of…

Our previous paper shows that the (vertex) spanning tree degree enumerator polynomial of a connected graph $G$ is a real stable polynomial (id est is non-zero if all variables have positive imaginary parts) if and only if $G$ is…

An ISK4 in a graph G is an induced subgraph of G that is isomorphic to a subdivision of K4 (the complete graph on four vertices). A wheel is a graph that consists of a chordless cycle, together with a vertex that has at least three…

This article began as a study of the structure of infinite permutation groups G in which point stabilisers are finite and all infinite normal subgroups are transitive. That led to two variations. One is the generalisation in which point…

A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and…

In this article I study the variation of Selmer groups in families of modular Galois representations that are congruent modulo a fixed prime $p \geq 5$. Motivated by analogies with Goldfeld's conjecture on ranks in quadratic twist families…

The stability number alpha(G) of a graph G is the cardinality of a maximum stable set in G, xi(G) denotes the size of core(G), where core(G) is the intersection of all maximum stable sets of G. In this paper we prove that for a graph G…

The nonlinear filtering equation is said to be stable if it ``forgets'' the initial condition. It is known that the filter might be unstable even if the signal is an ergodic Markov chain. In general, the filtering stability requires…

For a finite group $G$, let $\sigma(G)$ be the number of subgroups of $G$ and $\sigma_\iota(G)$ the number of isomorphism types of subgroups of $G$. Let $L=L_r(p^e)$ denote a simple group of Lie type, rank $r$, over a field of order $p^e$…