Enumerating word maps in finite groups

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Chlebus Bogdan S.; Cocke William; Ho Meng Che (TURBO)

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF GROUP THEORY Year:2024 | Volume:13 | Issue:3 Page(s): 307-318

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Enumerating word maps in finite groups

Author(s)

Chlebus Bogdan S. | Cocke William | Ho Meng Che (TURBO) | Issue Writer Certificate

Keywords

Word maps

relatively free groups

Algorithms on groups

Amit--Ashurst conjecture

Abstract

We consider Word maps over finite groups. An $n$-variable word $w$ is an element of the free group on $n$-symbols. For any group $G$, a word $w$ induces a map from $G^n\mapsto G$ where $(g_1,\ldots,g_n)\mapsto w(g_1,\ldots,g_n)$. We observe that many groups have Word maps that decompose into components. Such a decomposition facilitates a recursive approach to studying Word maps. Building on this observation, and combining it with relevant properties of the Word maps, allows us to develop an algorithm to calculate representatives of all the Word maps over a finite group. Given these representatives, we can calculate Word maps with specific properties over a given group, or show that such maps do not exist. In particular, we have computed an explicit a word on $A_5$ such that only generating tuples are nontrivial in its image. We also discuss how our algorithm could be used to computationally address many open questions about Word maps. Promising directions of potential applications include Amit's conjecture, questions of chirality and rationality, and the search for multilinear maps over a group. We conclude with open questions regarding these problems.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans