Mixed Volume Techniques for Embeddings of Laman Graphs

Details Mixed Volume Techniques for Embeddings of Laman Graphs Mixed Volume Techniques for Embeddings of Laman Graphs

2008-05-27

arxiv.org/abs/0805.4120v2

Mathematics

Combinatorics

Thorough revision of the first version. (13 pages, 4 figures)

Scientific paper

Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the viewpoint of Bernstein's Theorem. The focus of the paper is to provide the methods to study the mixed volume of suitable systems of polynomial equations obtained from the edge length constraints. While in most cases the resulting bounds are weaker than the best known bounds on the number of embeddings, for some classes of graphs the bounds are tight.

Affiliated with

Also associated with

No associations

Rating

Mixed Volume Techniques for Embeddings of Laman Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Mixed Volume Techniques for Embeddings of Laman Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mixed Volume Techniques for Embeddings of Laman Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-273688