<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-21T04:41:09Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/25406" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/25406</identifier><datestamp>2026-09-24T02:41:20Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Hambleton, Ian</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Mishra, Subhajit</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Mathematics and Statistics</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2020-04-28T04:21:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2020-04-28T04:21:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2020</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/25406</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/18505</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Let F be a free group of finite rank. Given words u, v ∈ F, J.H.C. Whitehead solved the decision problem of finding an automorphism φ ∈ Aut(F), carrying u to v. He used topological methods to produce an algorithm. Higgins and Lyndon gave a very concise proof of the problem based on the works of Rapaport.&#xd;
We provide a detailed account of Higgins and Lyndon’s proof of the peak&#xd;
reduction lemma and the restricted version of Whitehead’s theorem, for cyclic words as well as for sets of cyclic words, with a full explanation of each step. Then, we give an inductive proof of Whitehead’s minimization theorem and describe Whitehead’s decision algorithm.&#xd;
Noticing that Higgins and Lyndon’s work is limited to the cyclic words, we&#xd;
extend their proofs to ordinary words and sets of ordinary words.&#xd;
In the last chapter, we mention an example given by Whitehead to show&#xd;
that the decision problem for finitely generated subgroups is more difficult and outline an approach due to Gersten to overcome this difficulty.&#xd;
We also give an extensive literature survey of Whitehead’s algorithm</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Science (MSc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Whitehead's Decision Problem</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Whitehead's Minimization Problem</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Whitehead's Algorithm</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Automorphisms of Free groups</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Whitehead Minimization Algorithm</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Level Transformation</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Whitehead's Decision Problems for Automorphisms of Free Group</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>