Related papers: Stable Torsion Length
We characterise the simplicity of metric ultraproducts of a family of metric groups. We also present several new examples of simple groups, such as metric ultraproducts of finite and infinite symmetric groups, linear groups, and interval…
*by a standard (one-tape) Turing machine. It is well-known that the word problem for hyperbolic groups, whence in particular for free groups, can be solved in linear time. However, these algorithms run on machines more complicated than a…
We discuss the decomposability of torsion-free abelian groups. We show that among computable groups of finite rank this property is $\Sigma^0_3$-complete. However, when we consider groups of infinite rank, it becomes $\Sigma^1_1$-complete,…
Palindromes are those reduced words of free products of groups that coincide with their reverse words. We prove that a free product of groups $G$ has infinite palindromic width, provided that $G$ is not the free product of two cyclic groups…
We give an algorithm for finding the index of a positive outer automorphism of the free group, and prove the algorithm exits in a finite time.
Contraction analysis is a stability theory for nonlinear systems where stability is defined incrementally between two arbitrary trajectories. It provides an alternative framework in which to study uncertain interconnections or systems with…
A stable filter has the property that it asymptotically `forgets' initial perturbations. As a result of this property, it is possible to construct approximations of such filters whose errors remain small in time, in other words…
This paper provides a preparatory introduction to torsors, written with a view toward later applications in the author's work. Rather than aiming at a comprehensive survey, the exposition focuses on those aspects of torsors that are most…
The dynamical stability of the iterates during training plays a key role in determining the minima obtained by optimization algorithms. For example, stable solutions of gradient descent (GD) correspond to flat minima, which have been…
Howie and Duncan observed that a word in a free product with length at least two and which is not a proper power can be decomposed as a product of two cyclic subwords each of which is uniquely positioned. Using this property, they proved…
The algebraic stability theorem for $\mathbb{R}$-persistence modules is a fundamental result in topological data analysis. We present a stability theorem for $n$-dimensional rectangle decomposable persistence modules up to a constant…
We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…
We investigate the properties of word lengths of elements from a three-reflection symmetric generating set of the dihedral group $D_n$. Specifically, we provide the upper bound $\lambda_1(D_n,S) \leq \lfloor\frac{n}{2}\rfloor + 1$ for a…
The paper is devoted to the study of free objects in the variety of Steiner loops and of the combinatorial structures behind them, focusing on their automorphism groups. We prove that all automorphisms are tame and the automorphism group is…
We say that a countable discrete group $\Gamma$ satisfies the invariant von Neumann subalgebras rigidity (ISR) property if every $\Gamma$- invariant von Neumann subalgebra $\mathcal{M}$ in $L(\Gamma)$ is of the form $L(\Lambda)$ for some…
A popular method for selecting the number of clusters is based on stability arguments: one chooses the number of clusters such that the corresponding clustering results are "most stable". In recent years, a series of papers has analyzed the…
Let $w$ be a word in a free group. A few years ago, Magee and the first named author discovered that the stable commutator length (scl) of $w$, a well-known topological invariant, can also be defined in terms of certain Fourier coefficients…
The existence of a fundamental length (or fundamental time) has been conjectured in many contexts. However, the "stability of physical theories principle" seems to be the one that provides, through the tools of algebraic deformation theory,…
Formal explainability guarantees the rigor of computed explanations, and so it is paramount in domains where rigor is critical, including those deemed high-risk. Unfortunately, since its inception formal explainability has been hampered by…
Let $\Lambda$ be an artinian ring. Generalizing the Loewy length, we propose the layer length associated with a torsion theory, which is a new measure for finitely generated $\Lambda$-modules.