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

In mathematics, the Cayley configuration space of a over a set of its non-edges , called Cayley parameters, is the set of distances attained by over all its , under some -norm. In other words, each framework of the linkage prescribes a unique set of distances to the non-edges of , so the set of all frameworks can be described by the set of distances attained by any subset of these non-edges. Note that this description may not be a bijection. The motivation for using distance parameters is to define a continuous quadratic branched covering from the configuration space of a linkage to a simpler, often convex, space. Hence, obtaining a framework from a Cayley configuration space of a linkage over some set of non-edges is often a matter of solving quadratic equations.

Property Value
dbo:abstract
  • In mathematics, the Cayley configuration space of a over a set of its non-edges , called Cayley parameters, is the set of distances attained by over all its , under some -norm. In other words, each framework of the linkage prescribes a unique set of distances to the non-edges of , so the set of all frameworks can be described by the set of distances attained by any subset of these non-edges. Note that this description may not be a bijection. The motivation for using distance parameters is to define a continuous quadratic branched covering from the configuration space of a linkage to a simpler, often convex, space. Hence, obtaining a framework from a Cayley configuration space of a linkage over some set of non-edges is often a matter of solving quadratic equations. Cayley configuration spaces have a close relationship to the flattenability and of graphs. (en)
dbo:thumbnail
dbo:wikiPageID
  • 66478194 (xsd:integer)
dbo:wikiPageLength
  • 27704 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1097487513 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
rdfs:comment
  • In mathematics, the Cayley configuration space of a over a set of its non-edges , called Cayley parameters, is the set of distances attained by over all its , under some -norm. In other words, each framework of the linkage prescribes a unique set of distances to the non-edges of , so the set of all frameworks can be described by the set of distances attained by any subset of these non-edges. Note that this description may not be a bijection. The motivation for using distance parameters is to define a continuous quadratic branched covering from the configuration space of a linkage to a simpler, often convex, space. Hence, obtaining a framework from a Cayley configuration space of a linkage over some set of non-edges is often a matter of solving quadratic equations. (en)
rdfs:label
  • Cayley configuration space (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
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