A graph and metric on the class of finitely presented groups.












2












$begingroup$


Pick some countably infinite set $Y$. Call two finitely presented groups $G_1$ and $G_2$ presentation related if for some finite $X subseteq Y$,



$G_1 cong F{X} / H$ and $G_2 cong F{X} / langle H cup {h} rangle$
for some $h in F{X} setminus H$ and $H le F{X}$



or



$G_1 cong F{X} / H$ and $G_2 cong F{X cup {y}} / i(H)$ for some $y in Y$ and $H le F{X}$ where $i: F{X} mapsto F{X cup {x}}$ is the natural injection induced by the inclusion of sets.



Also, as two isomorphic groups always have identical presentations, it makes sense to define that two isomorphic groups are trivially presentation related.



We now have a graph on the finitely presented groups where there is an edge between two nodes/groups if those groups are (non-trivially) presentation related.



This also gives a metric by shortest paths / geodesic distance.



Is this construction useful? (Answer to comment: ) Or more directly, is this construction known and/or used in research mathematics?



Given the problem of putting a natural metric on the class of finitely presented groups, I believe many mathematicians would come up with something substantially similar to this.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Useful for what? Your question is too broad.
    $endgroup$
    – Martin Brandenburg
    Jul 10 '15 at 22:09






  • 1




    $begingroup$
    I haven't seen the construction you give. The distance to the trivial group in your graph is called the weight of a group, which has been studied, and it seems that the distance to a free group is equal to the minimum number of relations. Like many things that haven't been studied, it's hard to tell whether it's useful without first finding out what you can say about it.
    $endgroup$
    – Jim Belk
    Jul 11 '15 at 2:17


















2












$begingroup$


Pick some countably infinite set $Y$. Call two finitely presented groups $G_1$ and $G_2$ presentation related if for some finite $X subseteq Y$,



$G_1 cong F{X} / H$ and $G_2 cong F{X} / langle H cup {h} rangle$
for some $h in F{X} setminus H$ and $H le F{X}$



or



$G_1 cong F{X} / H$ and $G_2 cong F{X cup {y}} / i(H)$ for some $y in Y$ and $H le F{X}$ where $i: F{X} mapsto F{X cup {x}}$ is the natural injection induced by the inclusion of sets.



Also, as two isomorphic groups always have identical presentations, it makes sense to define that two isomorphic groups are trivially presentation related.



We now have a graph on the finitely presented groups where there is an edge between two nodes/groups if those groups are (non-trivially) presentation related.



This also gives a metric by shortest paths / geodesic distance.



Is this construction useful? (Answer to comment: ) Or more directly, is this construction known and/or used in research mathematics?



Given the problem of putting a natural metric on the class of finitely presented groups, I believe many mathematicians would come up with something substantially similar to this.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Useful for what? Your question is too broad.
    $endgroup$
    – Martin Brandenburg
    Jul 10 '15 at 22:09






  • 1




    $begingroup$
    I haven't seen the construction you give. The distance to the trivial group in your graph is called the weight of a group, which has been studied, and it seems that the distance to a free group is equal to the minimum number of relations. Like many things that haven't been studied, it's hard to tell whether it's useful without first finding out what you can say about it.
    $endgroup$
    – Jim Belk
    Jul 11 '15 at 2:17
















2












2








2





$begingroup$


Pick some countably infinite set $Y$. Call two finitely presented groups $G_1$ and $G_2$ presentation related if for some finite $X subseteq Y$,



$G_1 cong F{X} / H$ and $G_2 cong F{X} / langle H cup {h} rangle$
for some $h in F{X} setminus H$ and $H le F{X}$



or



$G_1 cong F{X} / H$ and $G_2 cong F{X cup {y}} / i(H)$ for some $y in Y$ and $H le F{X}$ where $i: F{X} mapsto F{X cup {x}}$ is the natural injection induced by the inclusion of sets.



Also, as two isomorphic groups always have identical presentations, it makes sense to define that two isomorphic groups are trivially presentation related.



We now have a graph on the finitely presented groups where there is an edge between two nodes/groups if those groups are (non-trivially) presentation related.



This also gives a metric by shortest paths / geodesic distance.



Is this construction useful? (Answer to comment: ) Or more directly, is this construction known and/or used in research mathematics?



Given the problem of putting a natural metric on the class of finitely presented groups, I believe many mathematicians would come up with something substantially similar to this.










share|cite|improve this question











$endgroup$




Pick some countably infinite set $Y$. Call two finitely presented groups $G_1$ and $G_2$ presentation related if for some finite $X subseteq Y$,



$G_1 cong F{X} / H$ and $G_2 cong F{X} / langle H cup {h} rangle$
for some $h in F{X} setminus H$ and $H le F{X}$



or



$G_1 cong F{X} / H$ and $G_2 cong F{X cup {y}} / i(H)$ for some $y in Y$ and $H le F{X}$ where $i: F{X} mapsto F{X cup {x}}$ is the natural injection induced by the inclusion of sets.



Also, as two isomorphic groups always have identical presentations, it makes sense to define that two isomorphic groups are trivially presentation related.



We now have a graph on the finitely presented groups where there is an edge between two nodes/groups if those groups are (non-trivially) presentation related.



This also gives a metric by shortest paths / geodesic distance.



Is this construction useful? (Answer to comment: ) Or more directly, is this construction known and/or used in research mathematics?



Given the problem of putting a natural metric on the class of finitely presented groups, I believe many mathematicians would come up with something substantially similar to this.







group-theory measure-theory graph-theory group-presentation






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 3 '18 at 1:24









Shaun

9,246113684




9,246113684










asked Jul 10 '15 at 22:04









ThoralfSkolemThoralfSkolem

1,133615




1,133615












  • $begingroup$
    Useful for what? Your question is too broad.
    $endgroup$
    – Martin Brandenburg
    Jul 10 '15 at 22:09






  • 1




    $begingroup$
    I haven't seen the construction you give. The distance to the trivial group in your graph is called the weight of a group, which has been studied, and it seems that the distance to a free group is equal to the minimum number of relations. Like many things that haven't been studied, it's hard to tell whether it's useful without first finding out what you can say about it.
    $endgroup$
    – Jim Belk
    Jul 11 '15 at 2:17




















  • $begingroup$
    Useful for what? Your question is too broad.
    $endgroup$
    – Martin Brandenburg
    Jul 10 '15 at 22:09






  • 1




    $begingroup$
    I haven't seen the construction you give. The distance to the trivial group in your graph is called the weight of a group, which has been studied, and it seems that the distance to a free group is equal to the minimum number of relations. Like many things that haven't been studied, it's hard to tell whether it's useful without first finding out what you can say about it.
    $endgroup$
    – Jim Belk
    Jul 11 '15 at 2:17


















$begingroup$
Useful for what? Your question is too broad.
$endgroup$
– Martin Brandenburg
Jul 10 '15 at 22:09




$begingroup$
Useful for what? Your question is too broad.
$endgroup$
– Martin Brandenburg
Jul 10 '15 at 22:09




1




1




$begingroup$
I haven't seen the construction you give. The distance to the trivial group in your graph is called the weight of a group, which has been studied, and it seems that the distance to a free group is equal to the minimum number of relations. Like many things that haven't been studied, it's hard to tell whether it's useful without first finding out what you can say about it.
$endgroup$
– Jim Belk
Jul 11 '15 at 2:17






$begingroup$
I haven't seen the construction you give. The distance to the trivial group in your graph is called the weight of a group, which has been studied, and it seems that the distance to a free group is equal to the minimum number of relations. Like many things that haven't been studied, it's hard to tell whether it's useful without first finding out what you can say about it.
$endgroup$
– Jim Belk
Jul 11 '15 at 2:17












0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1356906%2fa-graph-and-metric-on-the-class-of-finitely-presented-groups%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1356906%2fa-graph-and-metric-on-the-class-of-finitely-presented-groups%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

How to change which sound is reproduced for terminal bell?

Can I use Tabulator js library in my java Spring + Thymeleaf project?

Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents