Unsolved problem in mathematics
Is every group sofic?
Two balls of radius 2 in the Cayley graph of the dihedral group . Both balls contain 7 of the 8 group elements and are isomorphic as edge-colored graphs. Furthermore, for any radius and , we can use the approximating graph as the full Cayley graph itself, where the set of all vertices satisfies . Since all 8 vertices have isomorphic -balls (by the vertex-transitivity of Cayley graphs), is sofic.

In mathematics, a sofic group is a group whose Cayley graph is an initially subamenable graph, or equivalently a subgroup of an ultraproduct of finite-rank symmetric groups such that every two elements of the group have distance 1.[1] They were introduced by Gromov (1999) as a common generalization of amenable and residually finite groups. The name "sofic", from the Hebrew word סופי meaning "finite", was later applied by Weiss (2000), following Weiss's earlier use of the same word to indicate a generalization of finiteness in sofic subshifts.

The class of sofic groups is closed under the operations of taking subgroups, extensions by amenable groups, and free products. A finitely generated group is sofic if it is the limit of a sequence of sofic groups. The limit of a sequence of amenable groups (that is, an initially subamenable group) is necessarily sofic, but there exist sofic groups that are not initially subamenable groups.[2]

As Gromov proved, Sofic groups are surjunctive.[1] That is, they obey a form of the Garden of Eden theorem for cellular automata defined over the group (dynamical systems whose states are mappings from the group to a finite set and whose state transitions are translation-invariant and continuous) stating that every injective automaton is surjective and therefore also reversible.[3]

Notes

edit
  1. ^ a b Ceccherini-Silberstein & Coornaert (2010) p. 276
  2. ^ Cornulier (2011).
  3. ^ Ceccherini-Silberstein & Coornaert (2010) p. 56

References

edit
  • Ceccherini-Silberstein, Tullio; Coornaert, Michel (2010), Cellular Automata and Groups, Springer Monographs in Mathematics, Springer-Verlag, doi:10.1007/978-3-642-14034-1, ISBN 978-3-642-14033-4, MR 2683112, Zbl 1218.37004.
  • Cornulier, Yves (2011), "A sofic group away from amenable groups", Mathematische Annalen, 350 (2): 269–275, arXiv:0906.3374, doi:10.1007/s00208-010-0557-8, MR 2794910, S2CID 12966793, Zbl 1247.20039.
  • Gromov, M. (1999), "Endomorphisms of symbolic algebraic varieties", Journal of the European Mathematical Society, 1 (2): 109–197, doi:10.1007/PL00011162, MR 1694588, Zbl 0998.14001.
  • Weiss, Benjamin (2000), "Sofic groups and dynamical systems" (PDF), Sankhyā, Series A, 62 (3): 350–359, MR 1803462, Zbl 1148.37302.

📚 Artikel Terkait di Wikipedia

Sofic

"finite". It may refer to: Sofic subshift, a shift space whose forbidden words form a regular language Sofic group, a group whose Cayley graph is an initially

Shift space

most widely studied shift spaces are the subshifts of finite type and the sofic shifts. In the classical framework a shift space is any subset Λ {\displaystyle

Benjamin Weiss

theory of amenable groups (with Don Ornstein), mean dimension (with Elon Lindenstrauss), introduction of sofic subshifts and sofic groups. The road coloring

Surjunctive group

surjunctive groups include all locally residually finite groups, all free groups, all subgroups of surjunctive groups, all abelian groups, all sofic groups, and

Sofic Tower

The Sofic Tower or Thisofic Tower, originally named as Zone IIA Tower or Zone IIA HCMC, is a complex building in Ho Chi Minh City, Vietnam. At its completion

Mikhael Gromov (mathematician)

Russian-French mathematician known for his work in geometry, analysis and group theory. He is a permanent member of Institut des Hautes Études Scientifiques

Special Forces Group (Japan)

operator was an observer at the Special Operations Forces Industry Conference (SOFIC) 2018 exercises in Florida. King Abdullah II of Jordan visited Japan and

Garden of Eden (cellular automaton)

group. A weaker form of the Garden of Eden theorem asserts that every injective cellular automaton is surjective. It can be proven for sofic groups using