About: Hall word

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Hall word Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/c/6KG9kCjhsq

In mathematics, in the areas of group theory and combinatorics, Hall words provide a unique monoid factorisation of the free monoid. They are also totally ordered, and thus provide a total order on the monoid. This is analogous to the better-known case of Lyndon words; in fact, the Lyndon words are a special case, and almost all properties possessed by Lyndon words carry over to Hall words. Hall words are in one-to-one correspondence with Hall trees. These are binary trees; taken together, they form the Hall set. This set is a particular totally ordered subset of a free non-associative algebra, that is, a free magma. In this form, the Hall trees provide a basis for free Lie algebras, and can be used to perform the commutations required by the Poincaré–Birkhoff–Witt theorem used in the cons

Attributes	Values
rdfs:label	Hall word (en)
rdfs:comment	In mathematics, in the areas of group theory and combinatorics, Hall words provide a unique monoid factorisation of the free monoid. They are also totally ordered, and thus provide a total order on the monoid. This is analogous to the better-known case of Lyndon words; in fact, the Lyndon words are a special case, and almost all properties possessed by Lyndon words carry over to Hall words. Hall words are in one-to-one correspondence with Hall trees. These are binary trees; taken together, they form the Hall set. This set is a particular totally ordered subset of a free non-associative algebra, that is, a free magma. In this form, the Hall trees provide a basis for free Lie algebras, and can be used to perform the commutations required by the Poincaré–Birkhoff–Witt theorem used in the cons (en)
dct:subject	Combinatorics on words Formal languages
Wikipage page ID	31782613 (xsd:integer)
Wikipage revision ID	1048560707 (xsd:integer)
Link from a Wikipage to another Wikipage	Monoid factorisation Binary tree Combinatorics on words Commutator Mathematics Markov odometer Möbius function Confluence (abstract rewriting) Lexicographic order Lower central series Combinatorics Commutator collecting process Chen–Fox–Lyndon theorem Hall–Petresco identity Totally ordered Ernst Witt Dirichlet convolution Graded Lie algebra Free magma Universal enveloping algebra Formal languages Marshall Hall (mathematician) Philip Hall Poincaré–Birkhoff–Witt theorem Circular shift Filtration (mathematics) Free Lie algebra Free group Free monoid Group theory Term rewriting system Sequence Kleene star Wilhelm Magnus Necklace polynomial Lyndon word
sameAs	Hall word Hall word
dbp:wikiPageUsesTemplate	dbt:Short_description
has abstract	In mathematics, in the areas of group theory and combinatorics, Hall words provide a unique monoid factorisation of the free monoid. They are also totally ordered, and thus provide a total order on the monoid. This is analogous to the better-known case of Lyndon words; in fact, the Lyndon words are a special case, and almost all properties possessed by Lyndon words carry over to Hall words. Hall words are in one-to-one correspondence with Hall trees. These are binary trees; taken together, they form the Hall set. This set is a particular totally ordered subset of a free non-associative algebra, that is, a free magma. In this form, the Hall trees provide a basis for free Lie algebras, and can be used to perform the commutations required by the Poincaré–Birkhoff–Witt theorem used in the construction of a universal enveloping algebra. As such, this generalizes the same process when done with the Lyndon words. Hall trees can also be used to give a total order to the elements of a group, via the commutator collecting process, which is a special case of the general construction given below. It can be shown that Lazard sets coincide with Hall sets. The historical development runs in reverse order from the above description. The commutator collecting process was described first, in 1934, by Philip Hall and explored in 1937 by Wilhelm Magnus. Hall sets were introduced by Marshall Hall based on work of Philip Hall on groups. Subsequently, Wilhelm Magnus showed that they arise as the graded Lie algebra associated with the filtration on a free group given by the lower central series. This correspondence was motivated by commutator identities in group theory due to Philip Hall and Ernst Witt. (en)
prov:wasDerivedFrom	wikipedia-en:Hall_word?oldid=1048560707&ns=0
page length (characters) of wiki page	15722 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Hall_word
is Link from a Wikipage to another Wikipage of	Morphic word Monoid factorisation Commutator collecting process Universal enveloping algebra Philip Hall Free Lie algebra Free monoid Wilhelm Magnus Lyndon word Hall set
is Wikipage redirect of	Hall set
is foaf:primaryTopic of	wikipedia-en:Hall_word

Faceted Search & Find service v1.17_git147 as of Sep 06 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3331 as of Sep 2 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 50 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software