Title	How to Count Euclidean Embeddings of Rigid Graphs
Creator	Schicho, Josef
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2016-08-09T09:01
Description	For a fixed rigid graph, Euclidean embeddings can be considered as solutions of a system of algebraic equations with parameters (the lengths of the edges). The number of complex solutions does not depend on the parameters, as long as they are chosen generically. We present an algorithm for computing this number.
Extent	46 minutes
Subject	Mathematics; Algebraic geometry; Computer science; Applied computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Johannes Kepler University of Linz
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2017-06-17
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0348322
URI	http://hdl.handle.net/2429/62005
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos