Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a2a7a1119b4b2308

Jump to content

Talk:Nielsen transformation

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 3 years ago by Seaneberhard in topic Generating sets of size d + 1 {\displaystyle d+1}

Ordered Sets (and the Word Problem)

[edit]

I have changed the sets into ordered sets. The Neilsen transformation does not make sense in an unordered set, as .

Also, I am sceptical about the section entitled "word problem". Surely this section is discussing the isomorphism problem?!? —Preceding unsigned comment added by 130.209.6.40 (talk) 12:51, 4 May 2010 (UTC)Reply

Generating sets of size

[edit]

The footnote to the page states that in a finite -generated group, all generating sets of size are equivalent. Is this really true? It does not seem obvious. What is obvious is that any two generating sets of size are equivalent as generating sets of size (extending by the trivial element). Sean Eberhard (talk) 12:42, 26 June 2023 (UTC)Reply