Graph Connectivity, Partial Words, and a Theorem of Fine and Wilf II

The applet below provides an implementation of our algorithm in Java. This page may not function correctly if you do not have Java Runtime Environment v1.4.2 and the latest Java Plugin.

Enter number of holes h, and periods p and q. p should not divide q.

Get Java Now!


Acknowledgement: This material is based upon work supported by the National Science Foundation under Grant No. DMS-0452020.
Disclaimer: Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.


Valid XHTML 1.0! Valid CSS!