About: Bohemian matrices

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

A Bohemian matrix family is a set of matrices whosefree entries come from a single discrete, usually finite population, denoted here by P. That is, each entry of any matrix from this particular Bohemian matrix family must be an element of P. Such a matrix is called a Bohemian matrix. Bohemian matrices can have other structures as well, such as being a Toeplitz matrix or an upper Hessenberg matrix. Usually, only one Bohemian matrix family with a fixed population P is studied at a time, and so one can classify any given matrix as being Bohemian or not, without significant ambiguity.

thumbnail
Property Value
dbo:abstract
  • A Bohemian matrix family is a set of matrices whosefree entries come from a single discrete, usually finite population, denoted here by P. That is, each entry of any matrix from this particular Bohemian matrix family must be an element of P. Such a matrix is called a Bohemian matrix. Bohemian matrices can have other structures as well, such as being a Toeplitz matrix or an upper Hessenberg matrix. Usually, only one Bohemian matrix family with a fixed population P is studied at a time, and so one can classify any given matrix as being Bohemian or not, without significant ambiguity. (en)
dbo:thumbnail
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 70199765 (xsd:integer)
dbo:wikiPageLength
  • 16279 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1121150291 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • A Bohemian matrix family is a set of matrices whosefree entries come from a single discrete, usually finite population, denoted here by P. That is, each entry of any matrix from this particular Bohemian matrix family must be an element of P. Such a matrix is called a Bohemian matrix. Bohemian matrices can have other structures as well, such as being a Toeplitz matrix or an upper Hessenberg matrix. Usually, only one Bohemian matrix family with a fixed population P is studied at a time, and so one can classify any given matrix as being Bohemian or not, without significant ambiguity. (en)
rdfs:label
  • Bohemian matrices (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License