Realizable Dimension of Periodic Frameworks

Abstract: Belk and Connelly introduced the realizable dimension

e x t r m r d (G)

of a finite graph

G

, which is the minimum nonnegative integer

d

such that every framework

(G, p)

in any dimension admits a framework in

m a t h b b R^{d}

with the same edge lengths. They characterized finite graphs with realizable dimension at most

1

,

2

, or

3

in terms of forbidden minors. In this paper, we consider periodic frameworks and extend the notion to

m a t h b b Z

-symmetric graphs. We give a forbidden minor characterization of

m a t h b b Z

-symmetric graphs with realizable dimension at most

1

or

2

, and show that the characterization can be checked in polynomial time for given quotient

m a t h b b Z

-labelled graphs.

This page was built for publication: Realizable Dimension of Periodic Frameworks