Almost solutions of equations in permutations.
From MaRDI portal
\(\varepsilon\)-solutionsapproximate solutions of equationsequations in symmetric groupsnormalized Hamming metricresidually finite groupsroots of permutationssofic groupssystems of equations
General theory for finite permutation groups (20B05) Symmetric groups (20B30) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Algebraic geometry over groups; equations over groups (20F70)
Abstract: We will say that the permutations f_1,...,f_n is an e-solution of an equation if the normalized Hamming distance between its l.h.p. and r.h.p. is less than e. We give a sufficient conditions when near to an e-solution exists an exact solution and some examples when there does not exist such a solution.
Recommendations
- Constraint metric approximations and equations in groups
- Systems of equations in free groups which are approximated in the class of finite Abelian groups of s-periodic permutations of positive integers.
- Approximations of groups, characterizations of sofic groups, and equations over groups
- On the universality of systems of words in permutation groups
- Equations in unknown permutations
Cited in
(26)- Stability of group relations under small Hilbert-Schmidt perturbations
- Constraint metric approximations and equations in groups
- \(C^\ast\)-stability of discrete groups
- Stability for product groups and property \(( \tau )\)
- Group stability and property (T)
- Almost commuting permutations are near commuting permutations
- Uncountably many permutation stable groups
- Systems of equations in free groups which are approximated in the class of finite Abelian groups of s-periodic permutations of positive integers.
- Infinitely presented permutation stable groups and invariant random subgroups of metabelian groups
- Approximations of groups, characterizations of sofic groups, and equations over groups
- Symbolic solution of certain problems in permutations
- Stability of approximate group actions: uniform and probabilistic
- Virtually free groups are stable in permutations
- Testability in group theory
- Flexible Hilbert-Schmidt stability versus hyperlinearity for property (T) groups
- Local permutation stability
- Free metabelian groups are permutation stable
- Characters of diagonal products and Hilbert-Schmidt stability
- Rank-stability of polynomial equations
- Geometric structures in group theory. Abstracts from the workshop held February 9--14, 2025
- Optimal linear sofic approximations of countable groups
- Stability of homomorphisms, coverings and cocycles. I: Equivalence
- Surface groups are flexibly stable
- Stability of homomorphisms, coverings and cocycles. II: Examples, applications and open problems
- Local Hilbert-Schmidt stability
- On L^1-approximation of groups
This page was built for publication: Almost solutions of equations in permutations.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026963)
