About: Compact semigroup     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatFormalLanguages, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FCompact_semigroup&invfp=IFP_OFF&sas=SAME_AS_OFF

In mathematics, a compact semigroup is a semigroup in which the sets of solutions to equations can be described by finite sets of equations. The term "compact" here does not refer to any topology on the semigroup. Two systems of equations are equivalent if they have the same set of satisfying assignments. A system of equations if independent if it is not equivalent to a proper subset of itself. A semigroup is compact if every independent system of equations is finite.

AttributesValues
rdf:type
rdfs:label
  • Compact semigroup (en)
rdfs:comment
  • In mathematics, a compact semigroup is a semigroup in which the sets of solutions to equations can be described by finite sets of equations. The term "compact" here does not refer to any topology on the semigroup. Two systems of equations are equivalent if they have the same set of satisfying assignments. A system of equations if independent if it is not equivalent to a proper subset of itself. A semigroup is compact if every independent system of equations is finite. (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • In mathematics, a compact semigroup is a semigroup in which the sets of solutions to equations can be described by finite sets of equations. The term "compact" here does not refer to any topology on the semigroup. Let S be a semigroup and X a finite set of letters. A system of equations is a subset E of the Cartesian product X∗ × X∗ of the free monoid (finite strings) over X with itself. The system E is satisfiable in S if there is a map f from X to S, which extends to a semigroup morphism f from X+ to S, such that for all (u,v) in E we have f(u) = f(v) in S. Such an f is a solution, or satisfying assignment, for the system E. Two systems of equations are equivalent if they have the same set of satisfying assignments. A system of equations if independent if it is not equivalent to a proper subset of itself. A semigroup is compact if every independent system of equations is finite. (en)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software