Alexander Burstein

Home

Research

Teaching

Personal

This page is outdated. I no longer work at Iowa State.
The updated version of this page is at
http://www.alexanderburstein.com/papers.html

Curriculum Vitae 

Papers

 Published

  1. Alexander Burstein, Isaiah Lankham, Patience sorting and barred pattern avoidance, extended abstract, in Proceedings of the 18th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2006), June 2006, San Diego, CA.
  2. Alexander Burstein, Sergi Elizalde, Toufik Mansour, Restricted Dumont permutations, Dyck paths and noncrossing partitions, Discrete Math. 306 (2006), no. 22, 2851-2869. Extended abstract in Proceedings of the 18th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2006), June 2006, San Diego, CA.
  3. Alexander Burstein, Isaiah Lankham, A geometric form for the extended patience sorting algorithm, Adv. Appl. Math. 36 (2006), no. 2, 106-117.
  4. Alexander Burstein, Isaiah Lankham, Combinatorics of patience sorting piles, Séminaire Lotharingien de Combinatoire 54A (2006), Article B54Ab, 19 pp. Extended abstract in Proceedings of the 17th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2005), June 2005, University of Messina, Italy.
  5. Alexander Burstein, Restricted Dumont permutations, Ann. Combin. 9 (2005), no. 3, 269-280.
  6. Alexander Burstein, Sergey Kitaev, On unavoidable sets of word patterns, SIAM J. Discrete Math. 19 (2005), no. 2, 371-381.
  7. Alexander Burstein, Peter Hästö, Toufik Mansour, Packing patterns into words, Electron. J. Combin. 9(2) (2002-2003), #R20.
  8. Alexander Burstein, Toufik Mansour, Words restricted by 3-letter generalized multipermutation patterns, Ann. Combin. 7 (2003), no. 1, 1-14.
  9. Alexander Burstein, Toufik Mansour, Counting occurrences of some subword patterns, Discrete Math. and Theor. Comp. Sci. 6(1) (2003), 1-12.
  10. Alexander Burstein, Toufik Mansour, Words restricted by patterns with at most 2 distinct letters, Electron. J. Combin. 9(2) (2002-2003), #R3.
  11. Alexander Burstein, Sylvie Corteel, Alexander Postnikov, Carla D. Savage, A lattice path approach to counting partitions with minimum rank t, Discrete Math. 249 (2002), no. 1-3, 31-39.
  12. Alexander Burstein, Herbert S. Wilf, On cyclic strings without long constant blocks, Fibonacci Quart. 35 (1997), no. 3, 240-247.

 Accepted

  1. Alexander Burstein, On some properties of permutation tableaux, to appear in Ann. Combin. 11 (2007).
  2. Alexander Burstein, Walter Stromquist, Dumont permutations of the third kind, extended abstract, to appear in Proceedings of the 19th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2007), July 2007, Tianjin, China.

 Submitted

  1. Alexander Burstein, Peter Hästö, Packing sets of patterns.

 In preparation

  1. Alexander Burstein, Isaiah Lankham, Patience sorting on words and lexicographic arrays.
  2. Alexander Burstein, Isaiah Lankham, Stratifiability of patience sorting piles.
  3. Alexander Burstein, Sergey Kitaev, Partially ordered generalized patterns and their combinatorial interpretations.

Other 

  1. Alexander Burstein, Enumeration of words with forbidden patterns, Ph.D. thesis, University of Pennsylvania, 1998.

Conference talks and posters

  1. Patience sorting and barred pattern avoidance, FPSAC'06, June 2006, University of California, San Diego, CA.
  2. Restricted Dumont permutations, Dyck paths and noncrossing partitions, FPSAC'06, June 2006, University of California, San Diego, CA.
  3. On some properties of permutation tableaux, PP'06, June 2006, Reykjavik University, Iceland.
  4. Combinatorics of patience sorting piles, poster, FPSAC'05, June 2005, University of Messina, Italy. (with Isaiah Lankham)
  5. Non-intersecting patience sorting shadow diagrams and barred permutation patterns, talk, Workshop on Permutation Patterns, May 2005, University of Haifa, Israel. (with Isaiah Lankham)
  6. A geometric form for the extended patience sorting algorithm, talk, PP'05, March 2005, University of Florida. (with Isaiah Lankham)
  7. Partially ordered generalized patterns and their combinatorial interpretations, talk, PP'05, March 2005, University of Florida. (with Sergey Kitaev)
  8. Restricted Dumont permutations, talk, PP'04, June 2004, Malaspina University-College, Canada. (with Toufik Mansour)
  9. Packing patterns into words, talk, PP'03, February 2003, University of Otago, New Zealand. (with Toufik Mansour)
  10. Words restricted by patterns with at most 2 distinct letters, poster, FPSAC'02, July 2002, University of Melbourne, Australia. (with Toufik Mansour)
  11. A lattice path approach to counting partitions with minimum rank t, talk, The George Washington University Combinatorics Seminar (1999).
  12. Enumeration of words with forbidden patterns, talk, 1998 and 1999 AMS Joint Meetings, MIT Combinatorics Seminar (1998), Temple University Combinatorics Seminar (1997).
  © Alexander Burstein, 2003-2005.