Vince Vatter
Mailing Address:
Department of Mathematics
Dartmouth College
6188 Kemeny Hall
Hanover, NH 03755-3551
Office:
314 Kemeny Hall
Phone:
(603) 367-3507
Upcoming Conferences
- Permutation Patterns 2010, to be held at Dartmouth College, August 9–13, 2010
- SIAM Conference on Discrete Mathematics, June 14–17, 2010 in Austin, Texas
- From A=B to Z=60, a conference in honor of Doron Zeilberger's 60th birthday, May 27 and 28, 2010
Teaching
- Summer 2009: Topics in Algebra (Dartmouth College)
- Spring 2009: Current Problems in Combinatorics (Dartmouth College)
- Winter 2009: Calculus of Functions of One and Several Variables, Section 2 (Dartmouth College)
- Fall 2008: Calculus of Functions of One and Several Variables, Sections 2 & 3 (Dartmouth College)
- Summer 2005: Combinatorics, section E1 (Rutgers University)
- Fall 2004: Calc II, sections 15–17 (Rutgers University)
- Summer 2004: Linear Optimization, section H6 (Rutgers University)
- Spring 2004: Calc I, sections 29–31 (Rutgers University)
- Fall 2003: Calc II, sections 10–12 (Rutgers University)
Publications and Preprints
- Simple extensions of combinatorial structures
With Robert Brignall and Nik Ruškuc. - Maximal independent sets and separating families, or, the surprising circularity of R. Honsberger's Mathematical Gems III
- On partial well-order for monotone grid classes of permutations
With Steve Waton. - Finding regular insertion encodings for permutation classes
- Small configurations in simple permutations
- Small permutation classes
- On convex permutations
With Michael Albert, Steve Linton, Nik Ruškuc, and Steve Waton. - On points drawn from a circle
Advances in Applied Mathematics, to appear.
With Steve Waton. - Permutation classes of every growth rate above 2.48188
Mathematika, to appear.
- Counting 1324, 4231-avoiding permutations
Electronic Journal of Combinatorics, 16 (1) (2009), #R135, 9 pp.
With Michael Albert and Mike Atkinson. - Almost avoiding permutations
Discrete Mathematics, 309 (2009), 6626–6631.
With Robert Brignall, Shalosh B. Ekhad, and Rebecca Smith. - The enumeration of permutations sortable by pop stacks in parallel
Information Processing Letters, 109 (2009), 626–629.
With Rebecca Smith. - A sharp bound for the reconstruction of partitions
Electronic Journal of Combinatorics 15 (2008), #N23, 4 pp.
- Reconstructing
compositions
Discrete Mathematics, 308 (2008), 1524–1530. - Simple permutations: decidability and unavoidable substructures
Theoretical Computer Science 391 (2008), 150–163.
With Robert Brignall and Nik Ruškuc. - Simple permutations and algebraic generating functions
Journal of Combinatorial Theory, Series A 115 (2008), 423–441.
With Robert Brignall and Sophie Huczynska.
- Decomposing simple permutations, with enumerative consequences
Combinatorica, 28 (2008), 385–400.
With Robert Brignall and Sophie Huczynska.
- Enumeration schemes for restricted permutations
Combinatorics, Probability and Computing 17 (2008), 137–159.
- Grid classes and the Fibonacci dichotomy for restricted permutations
Electronic Journal of Combinatorics 13 (2006), #R54, 14 pp.
With Sophie Huczynska.
- The Möbius function of a composition poset
Journal of Algebraic Combinatorics, 24 (2006), 117–136.
With Bruce Sagan. - Finitely labeled generating trees and restricted permutations
Journal of Symbolic Computation, 41 (2006), 559–572. - Maximal and maximum independent sets in graphs with at most r cycles
Journal of Graph Theory, 53 (2006), 283–314.
With Bruce Sagan. - Maximal independent sets in graphs with at most r cycles
Journal of Graph Theory, 53 (2006), 270–282.
With Goh Chee Ying, Koh Khee Meng, and Bruce Sagan. - Profile classes and partial well-order for permutations
Electronic Journal of Combinatorics 9 (2) (2003), #R17, 30 pp.
With Maximillian Murphy. - Bounding quantities related to the packing density of 1 (ℓ+1 )ℓ… 2
Advances in Applied Mathematics, 33 (2004), 633–653.
With Martin Hildebrand and Bruce Sagan. - Permutations avoiding two patterns of length three
Electronic Journal of Combinatorics 9 (2) (2003), #R6, 19 pp. - Pattern frequency sequences and internal zeros
Advances in Applied Mathematics 28 (2002), 395–420.
With Miklós Bóna and Bruce Sagan.
Programs
- POPSTACKS, for counting permutations sortable by k pop stacks in parallel.
- COMPBUILDER, for reconstructing compositions.
- WILFPLUS, for counting restricted permutations.
- FINLABEL, for finding finitely labeled generating trees isomorphic to pattern avoidance trees (in other words, also for counting restricted permutations).
Unpublications, notes, etc.
- A short bit on the Maple Logic package, with instructions on how to convert Maple boolean expressions to DIMACS format.
- Installing the mathabx fonts on a Mac running the MacTeX-2007 distribution.
- Problems and Conjectures presented at the Fifth International Conference on Permutation Patterns (University of St Andrews, June 11–15, 2007).
- A proof of the Loehr-Warrington amazing TEN to the power n conjecture
With Shalosh B. Ekhad and Doron Zeilberger. - Problems and Conjectures presented
at the Third International Conference on Permutation Patterns (University
of Florida, March 7–11, 2005)
With Murray Elder. - An RSS feed for Doron Zeilberger's opinions (updated nightly).
- Official score from the 2nd vs. 4th year bowling competition, Rutgers, Spring 2003.