English
Related papers

Related papers: Flexible stability and nonsoficity

200 papers

The word stable is used to describe a situation when mathematical objects that almost satisfy an equation are close to objects satisfying it exactly. We study operator-algebraic forms of stability for unitary representations of groups and…

Operator Algebras · Mathematics 2025-09-22 Mikael de la Salle

We introduce the normalising graph of a group and study the connectivity of the normalising and permuting graphs of a group when the group is finite and soluble. In particular, we classify finite soluble groups with disconnected normalising…

Group Theory · Mathematics 2025-01-14 Eoghan Farrell , Chris Parker

The Erd\H{o}s-Simonovits stability theorem is one of the most widely used theorems in extremal graph theory. We obtain an Erd\H{o}s-Simonovits type stability theorem in multi-partite graphs. Different from the Erd\H{o}s-Simonovits stability…

Combinatorics · Mathematics 2026-01-14 Wanfang Chen , Changhong Lu , Long-Tu Yuan

We prove that there exist finitely generated, stably finite algebras which are non linear sofic. This was left open by Arzhantseva and P\u{a}unescu in 2017.

Rings and Algebras · Mathematics 2023-08-16 Be'eri Greenfeld

An $S$-ring (Schur ring) is called separable with respect to a class of $S$-rings $\mathcal{K}$ if it is determined up to isomorphism in $\mathcal{K}$ only by the tensor of its structure constants. An abelian group is said to be separable…

Combinatorics · Mathematics 2019-01-01 Grigory Ryabov

We consider the existence and stability of static configurations of a scalar field in a five dimensional spacetime in which the extra spatial dimension is compactified on an $S^1/Z_2$ orbifold. For a wide class of potentials with multiple…

High Energy Physics - Phenomenology · Physics 2008-11-26 Manuel Toharia , Mark Trodden

A square (0,1)-matrix X of order n > 0 is called fully indecomposable if there exists no integer k with 0 < k < n, such that X has a k by n-k zero submatrix. A stable set of a graph G is a subset of pairwise nonadjacent vertices. The…

Combinatorics · Mathematics 2007-05-23 Vadim E. Levit , Eugen Mandrescu

In this paper, we introduce the following concept which generalizes known definitions of multiplicative and additive $D$-stability, Schur $D$-stability, $H$-stability, $D$-hyperbolicity and many others. Given a subset ${\mathfrak D} \subset…

Spectral Theory · Mathematics 2018-06-06 Olga Y. Kushel

We show stable ergodicity of a class of conservative diffeomorphisms which do not have any hyperbolic invariant subbundle. Moreover the uniqueness of SRB measures for non-conservative $C^1$ perturbations of such diffeomorphisms. This class…

Dynamical Systems · Mathematics 2007-05-23 Ali Tahzibi

We determine the stability conditions for a radially symmetric noncommutative scalar soliton at finite noncommutivity parameter $\theta$. We find an intriguing relationship between the stability and existence conditions for all level-1…

High Energy Physics - Theory · Physics 2010-02-03 Mark G. Jackson

A bar-joint framework $(G,p)$ in $\mathbb{R}^d$ is rigid if the only edge-length preserving continuous motions of the vertices arise from isometries of $\mathbb{R}^d$. It is known that, when $(G,p)$ is generic, its rigidity depends only on…

Combinatorics · Mathematics 2023-03-27 Georg Grasegger , Hakan Guler , Bill Jackson , Anthony Nixon

If $G$ is an omega-stable group with a normal definable subgroup $H$, then the Sylow-$2$-subgroups of $G/H$ are the images of the Sylow-$2$-subgroups of $G$.

Group Theory · Mathematics 2007-05-23 Bruno Poizat , Frank Olaf Wagner

A planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in…

Metric Geometry · Mathematics 2015-01-05 Jinsong Liu , Ze Zhou

The stability number of a graph $G$, denoted as $\alpha(G)$, is the maximum size of an independent (stable) set in $G$. Semidefinite programming (SDP) methods, which originated from Lov\'asz's theta number and expanded through…

Optimization and Control · Mathematics 2025-09-11 Luis Felipe Vargas , Juan C. Vera , Peter J. C. Dickinson

We introduce and systematically study linear sofic groups and linear sofic algebras. This generalizes amenable and LEF groups and algebras. We prove that a group is linear sofic if and only if its group algebra is linear sofic. We show that…

Group Theory · Mathematics 2013-01-01 Goulnara Arzhantseva , Liviu Paunescu

A polynomial $f(x)$ over a field $K$ is said to be stable if all its iterates are irreducible over $K$. L. Danielson and B. Fein have shown that over a large class of fields $K$, if $f(x)$ is an irreducible monic binomial, then it is stable…

Number Theory · Mathematics 2022-12-21 Mohamed Ayad , Boualem Benseba , Mohamed Madi

The Fourier dimension is not in general stable under finite unions of sets. Moreover, the stability of the Fourier dimension on particular pairs of sets is independent from the stability of the compact Fourier dimension.

Classical Analysis and ODEs · Mathematics 2016-06-08 Fredrik Ekström

Let X be a coherent configuration associated with a transitive group G. In terms of the intersection numbers of X, a necessary condition for the point stabilizer of G to be a TI-subgroup, is established. Furthermore, under this condition, X…

Combinatorics · Mathematics 2018-11-30 Gang Chen , Ilia Ponomarenko

Let G be a finite solvable permutation group. Then modulo a possibly trivial normal elementary abelian 3-subgroup, some set-stabilizer in G is a 2-group.

Group Theory · Mathematics 2025-07-01 David Gluck

Let $\mathbf{\Gamma} = (V,E)$ be a (non-trivial) finite graph with $\lambda: E \rightarrow \mathbb{R}_{+}$, an edge labelling of $\mathbf{\Gamma}$. Let $\rho : V\rightarrow \mathbb{R}^{2}$ be a map which preserves the edge labelling. The…

Combinatorics · Mathematics 2019-11-15 Arindam Biswas