This HTML5 document contains 80 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n6	http://dbpedia.org/resource/File:
n11	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
dbpedia-simple	http://simple.dbpedia.org/resource/
n12	http://commons.wikimedia.org/wiki/Special:FilePath/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
dbp	http://dbpedia.org/property/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
gold	http://purl.org/linguistics/gold/
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:Arrangement_of_hyperplanes

rdf:type

dbo:MusicalWork

rdfs:label

Arrangement of hyperplanes

rdfs:comment

In geometry and combinatorics, an arrangement of hyperplanes is an arrangement of a finite set A of hyperplanes in a linear, affine, or projective space S. Questions about a hyperplane arrangement A generally concern geometrical, topological, or other properties of the complement, M(A), which is the set that remains when the hyperplanes are removed from the whole space. One may ask how these properties are related to the arrangement and its intersection semilattice.The intersection semilattice of A, written L(A), is the set of all subspaces that are obtained by intersecting some of the hyperplanes; among these subspaces are S itself, all the individual hyperplanes, all intersections of pairs of hyperplanes, etc. (excluding, in the affine case, the empty set). These intersection subspaces o

foaf:depiction

n12:Arrangement_hyperplans.png

dcterms:subject

dbc:Combinatorics dbc:Discrete_geometry dbc:Oriented_matroids

dbo:wikiPageID

864438

dbo:wikiPageRevisionID

1115076379

dbo:wikiPageWikiLink

dbr:Semilattice n6:Arrangement_hyperplans.png dbr:Linear_space dbr:Convex_polygon dbr:Isomorphic dbr:Triangle dbr:Alexander_Varchenko dbc:Oriented_matroids dbr:Oriented_matroid dbr:Parallelogram dbr:Exterior_algebra dbr:Incidence_algebra dbr:Cohomology dbr:Affine_geometry dbr:Orlik–Solomon_algebra dbr:Polyhedron dbr:Differential_form dbr:Affine_space dbr:American_Mathematical_Society dbr:Matroid dbr:Ranked_poset dbr:Polygon dbr:Codimension dbr:Plane_(mathematics) dbr:De_Rham_cohomology dbr:Smith_normal_form dbr:Complex_number dbr:Semimatroid dbr:Hyperplane dbr:Transactions_of_the_American_Mathematical_Society dbr:Chain_complex dbr:Arrangement_(space_partition) dbr:Polytope dbr:Geometry dbr:Line_(mathematics) dbr:Supersolvable_arrangement dbr:Root_system dbr:Arrangement_of_lines dbr:Euclidean_subspace dbr:Poset dbc:Discrete_geometry dbr:Projective_geometry dbr:Ideal_(ring_theory) dbr:Geometric_lattice dbr:McMullen_problem dbr:Real_projective_space dbr:Simplex dbr:Weyl_group dbr:Combinatorics dbr:Real_number dbr:Tetrahedron dbr:Geometric_semilattice dbc:Combinatorics

owl:sameAs

n11:4RzaH freebase:m.03jlnb dbpedia-simple:Hyperplane_arrangements wikidata:Q4795851

dbp:wikiPageUsesTemplate

dbt:Cite_book dbt:Citation dbt:Harvtxt dbt:Harv dbt:Short_description dbt:Springer

dbo:thumbnail

n12:Arrangement_hyperplans.png?width=300

dbp:id

A/a110700

dbp:title

Arrangement of hyperplanes

dbo:abstract

In geometry and combinatorics, an arrangement of hyperplanes is an arrangement of a finite set A of hyperplanes in a linear, affine, or projective space S. Questions about a hyperplane arrangement A generally concern geometrical, topological, or other properties of the complement, M(A), which is the set that remains when the hyperplanes are removed from the whole space. One may ask how these properties are related to the arrangement and its intersection semilattice.The intersection semilattice of A, written L(A), is the set of all subspaces that are obtained by intersecting some of the hyperplanes; among these subspaces are S itself, all the individual hyperplanes, all intersections of pairs of hyperplanes, etc. (excluding, in the affine case, the empty set). These intersection subspaces of A are also called the flats of A. The intersection semilattice L(A) is partially ordered by reverse inclusion. If the whole space S is 2-dimensional, the hyperplanes are lines; such an arrangement is often called an arrangement of lines. Historically, real arrangements of lines were the first arrangements investigated. If S is 3-dimensional one has an arrangement of planes.

gold:hypernym

dbr:Arrangement

prov:wasDerivedFrom

wikipedia-en:Arrangement_of_hyperplanes?oldid=1115076379&ns=0

dbo:wikiPageLength

12927

foaf:isPrimaryTopicOf

wikipedia-en:Arrangement_of_hyperplanes