Summer 2009 :: Algorithmic Combinatorics on Words REU

UNCG Campus and Greensboro,
NC Information

"Algorithmic Combinatorics on Partial Words" by Francine Blanchet-Sadri, Chapman&Hall/CRC Press 2008.

The tutorial Preliminaries on Partial Words by Dr. Francine Blanchet-Sadri is available.

The powerpoint presentation entitled Basic XHTML and CSS by Margaret Moorefield is available.

The LaTeX Tutorial by Stephanie Rednour and Robert Misior is available.

The Beamer Tutorial by Charles T. Batts is available.

Photo Album
week 1 week 2 week 3 week 4

week 5 week 6 week 7 week 8

For a detailed account of a specific week, click on the week number.

Week 1	orientation, preliminaries on partial words, description of problems, creation of teams, team meetings, technical writing
Week 2	LaTeX tutorial, team meetings, technical writing
Week 3	basic XHTML and CSS, team meetings, technical writing
Week 4	team meetings, technical writing
Week 5	initial student presentations, team meetings, technical writing
Week 6	team meetings, technical writing, guest speaker Naomi Brownstein
Week 7	Beamer tutorial, team meetings, technical writing
Week 8	team meetings, technical writing, final student presentations

	Emily Allen
	Robert Mercas

	Aleksandar Chakarov Bard College
	Bob Chen Harvey Mudd College
	Ilkyoo Choi Carnegie Mellon University
	Jane Kim Columbia University
	John Lensmire University of Minnesota-Twin Cities
	Jarett Schwartz Princeton University
	William Severa Wilkes Honors College of Florida Atlantic University
	Sean Simmons The University of Texas at Austin
	Slater Stich Princeton University
	Amelia Tebbe St. Mary's College of Maryland
	Amy Veprauskas Bryn Mawr College
	Eric Weissenstein Rensselaer Polytechnic Institute

Book Chapter

F. Blanchet-Sadri, Brandon Blakeley, Josh Gunter, Sean Simmons and Eric Weissenstein, “Classifying All Avoidable Sets of Partial Words of Size Two.” in C. Martin-Vide (Ed.), Scientific Applications of Language Methods, Ch. 2, Imperial College Press, London, 2010, pp 59-101.

Papers and Websites

F. Blanchet-Sadri, Emily Allen and John Lensmire, “On counting unbordered partial words with two holes.”
F. Blanchet-Sadri, Bob Chen and Aleksandar Chakarov, “Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three.” in C. S. Iliopoulos and W. F. Smyth (Eds.), IWOCA 2010, 21st International Workshop on Combinatorial Algorithms, July 26-28, 2010, London, United Kingdom, Lecture Notes in Computer Science, Vol. 6460, Springer-Verlag, Berlin, Heidelberg, 2011, 43-55.
F. Blanchet-Sadri, Bob Chen and Aleksandar Chakarov, “Number of Holes in Unavoidable Sets of Partial Words I.” Journal of Discrete Algorithms, Vol. 14, 2012, pp 55-64.
F. Blanchet-Sadri, Ilkyoo Choi and Robert Mercas, “Avoiding large squares in partial words.” Theoretical Computer Science, Vol. 412, 2011, pp 3752-3758.
F. Blanchet-Sadri, Jane Kim, Robert Mercas, William Severa and Sean Simmons, “Abelian square-free partial words.” in A.-H. Dediu, H. Fernau and C. Martin-Vide (Eds.), LATA 2010, 4th International Conference on Language and Automata Theory and Applications, May 24-28, 2010, Trier, Germany, Lecture Notes in Computer Science, Vol. 6031, Springer-Verlag, Berlin, Heidelberg, 2010, pp 94-105.
F. Blanchet-Sadri, Jarett Schwartz, Slater Stich and Benjamin Wyatt, “Binary De Brujin partial words with one hole.” in J. Kratochvil et al. (Eds.), TAMC 2010, 7th Annual Conference on Theory and Applications of Models of Computation, June 7-11, 2010, Prague, Czech Republic, Lecture Notes in Computer Science, Vol. 6108, Springer-Verlag, Berlin, Heidelberg, 2010, pp 128-138.
F. Blanchet-Sadri, Robert Mercas, Sean Simmons and Eric Weissenstein, “Avoidable binary patterns in partial words.” in A.-H. Dediu, H. Fernau and C. Martin-Vide (Eds.), LATA 2010, 4th International Conference on Language and Automata Theory and Applications, May 24-28, 2010, Trier, Germany, Lecture Notes in Computer Science, Vol. 6031, Springer-Verlag, Berlin, Heidelberg, 2010, pp 106-117.
F. Blanchet-Sadri, Robert Mercas, Sean Simmons and Eric Weissenstein, “Avoidable binary patterns in partial words.” Acta Informatica, Vol. 48, No. 1, 2011, pp 25-41 ("Erratum to: Avoidable binary patterns in partial words." Acta Informatica, Vol. 49, No. 1, 2012, pp 53-54).
F. Blanchet-Sadri, Sean Simmons, Amelia Tebbe and Amy Veprauskas, “Abelian Periods, Partial Words, and a Theorem of Fine and Wilf.” RAIRO-Theoretical Informatics and Applications, Vol. 47, 2013, pp 215-234.
F. Blanchet-Sadri, Amelia Tebbe and Amy Veprauskas, “Fine and Wilf's Theorem for Abelian Periods in Partial Words.” in JM 2010, 13iemes Journees Montoises d'Informatique Theorique, September 6-10, 2010, Amiens, France.

Honors

Sean Simmons won a Goldwater Scholarship for the 2009-2010 academic year.
Sean Simmons was awarded the Greg Mellen Memorial Cryptography Scholarship in 2009.
William Severa was named a Fredrick and Kathrine Bigony Scholar in 2009.
Jarett Schwartz was awarded the Shapiro Prize for Academic Excellence in 2009 (given to approximately 25 students in the sophomore class at Princeton University).
Jarett Schwartz received a Fulbright Grant for 2011-2012 in the Czech Republic.
Jarett Schwartz won a Graduate Research Fellowship from the National Science Foundation in 2011.
Bob Chen won an Honorable Mention for the Graduate Research Fellowship competition of the National Science Foundation in 2011.
Slater Stich won an Honorable Mention for the Graduate Research Fellowship competition of the National Science Foundation in 2011.
Slater Stich won a Graduate Research Fellowship from the National Science Foundation in 2012.
Slater Stich won an NDSEG National Defense Science & Engineering Graduate Fellowship from the Department of Defense in 2012.

Presentations

	F. Blanchet-Sadri, “Periods and binary partial words,” 7th International Conference on Words, Salerno, Italy, September 18, 2009 (joint work with Brian Shirey).
	F. Blanchet-Sadri, “The three-squares lemma for partial words with one hole,” College of Nyíregyháza, Nyíregyháza, Hungary, September 22, 2009 (joint work with Robert Mercas and Kristen Wetzler).
	Eric Weissenstein, “Avoidable binary patterns in partial words,” 4th International Conference on Language and Automata Theory and Applications, Trier, Germany, May 24, 2010 (joint work with F. Blanchet-Sadri, Robert Mercas and Sean Simmons).
Eric Weissenstein presenting the paper entitled “Avoidable binary patterns in partial words,” at the 4th International Conference on Language and Automata Theory and Applications, Trier, Germany, May 24, 2010.
	Robert Mercas, “Abelian square-free partial words,” 4th International Conference on Language and Automata Theory and Applications, Trier, Germany, May 24, 2010 (joint work with F. Blanchet-Sadri, Jane Kim, William Severa and Sean Simmons).
Robert Mercas presenting the paper entitled “Abelian square-free partial words,” at the 4th International Conference on Language and Automata Theory and Applications, Trier, Germany, May 24, 2010.
From left to right, Sean Simmons, F. Blanchet-Sadri, Robert Mercas, William Severa, Jane Kim, and Eric Weissenstein attending the 4th International Conference on Language and Automata Theory and Applications, Trier, Germany, from May 24 to May 28, 2010.
	Benjamin Wyatt, “Binary de Bruijn partial words with one hole,” 7th Annual Conference on Theory and Applications of Models of Computation, Prague, Czech Republic, June 9, 2010 (joint work with F. Blanchet-Sadri, Jarett Schwartz and Slater Stich).
Benjamin Wyatt presenting the paper entitled “Binary de Bruijn partial words with one hole,” at the 7th Annual Conference on Theory and Applications of Models of Computation, Prague, Czech Republic, June 9, 2010.
From left to right, Benjamin Wyatt, Slater Stich, and Jarett Schwartz attending the 7th Annual Conference on Theory and Applications of Models of Computation, Prague, Czech Republic, from June 7 to June 11, 2010.
	Emily Allen, “Counting bordered partial words by critical positions,” SIAM Conference on Discrete Mathematics, Austin, Texas, June 16, 2010 (joint work with F. Blanchet-Sadri and John Lensmire).
Emily Allen presenting the paper entitled “Counting bordered partial words by critical positions,” at the SIAM Conference on Discrete Mathematics, Austin, Texas, June 16, 2010.
From left to right, Emily Allen, Gautam Sisodia, and Travis Mandel attending the SIAM Conference on Discrete Mathematics, Austin, Texas, from June 14 to June 17, 2010.
	F. Blanchet-Sadri, “Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three,” 21st International Workshop on Combinatorial Algorithms, London, United Kingdom, July 28, 2010 (joint work with Bob Chen and Aleksandar Chakarov).
	Amelia Tebbe, “Fine and Wilf's Theorem for Abelian Periods in Partial Words,” 13iemes Journees Montoises d'Informatique Theorique, Amiens, France, September 7, 2010 (joint work with F. Blanchet-Sadri and Amy Veprauskas).
Amelia Tebbe presenting the paper entitled “Fine and Wilf's theorem for abelian periods in partial words,” at the 13iemes Journees Montoises d'Informatique Theorique, Amiens, France, September 7, 2010.
From left to right, Amelia Tebbe and Amy Veprauskas attending the 13iemes Journees Montoises d'Informatique Theorique, Amiens, France, from September 6 to September 10, 2010.

Conferences

F. Blanchet-Sadri was invited for a visit at the University of Debrecen and College of Nyíregyháza, Hungary, September 2009.

F. Blanchet-Sadri chaired a session for the 4th International Conference on Language and Automata Theory and Applications, Trier, Germany, May 28, 2010.

T-shirt designed by the participants of Summer 2009