About: Supersolvable arrangement

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

In mathematics, a supersolvable arrangement is a hyperplane arrangement which has a maximal flag with only modular elements. Equivalently, the intersection semilattice of the arrangement is a supersolvable lattice, in the sense of Richard P. Stanley. As shown by Hiroaki Terao, a complex hyperplane arrangement is supersolvable if and only if its complement is fiber-type. Examples include arrangements associated with Coxeter groups of type A and B. It is known that the of a supersolvable arrangement is a Koszul algebra; whether the converse is true is an open problem.

Property Value
dbo:abstract
  • In mathematics, a supersolvable arrangement is a hyperplane arrangement which has a maximal flag with only modular elements. Equivalently, the intersection semilattice of the arrangement is a supersolvable lattice, in the sense of Richard P. Stanley. As shown by Hiroaki Terao, a complex hyperplane arrangement is supersolvable if and only if its complement is fiber-type. Examples include arrangements associated with Coxeter groups of type A and B. It is known that the of a supersolvable arrangement is a Koszul algebra; whether the converse is true is an open problem. (en)
dbo:wikiPageID
  • 21620407 (xsd:integer)
dbo:wikiPageLength
  • 1689 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1042075092 (xsd:integer)
dbo:wikiPageWikiLink
dct:subject
gold:hypernym
rdf:type
rdfs:comment
  • In mathematics, a supersolvable arrangement is a hyperplane arrangement which has a maximal flag with only modular elements. Equivalently, the intersection semilattice of the arrangement is a supersolvable lattice, in the sense of Richard P. Stanley. As shown by Hiroaki Terao, a complex hyperplane arrangement is supersolvable if and only if its complement is fiber-type. Examples include arrangements associated with Coxeter groups of type A and B. It is known that the of a supersolvable arrangement is a Koszul algebra; whether the converse is true is an open problem. (en)
rdfs:label
  • Supersolvable arrangement (en)
owl:sameAs
prov:wasDerivedFrom
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