Vince Vatter

Mailing Address:
Department of Mathematics
University of Florida
PO Box 118105
Gainesville FL 32611
(Please send packages to 358 Little Hall, Gainesville FL 32611.)

Email: vatter at ufl dot edu

Office:
412 Little Hall
Phone:
(352) 392-0281 x-245

Current Teaching

• Fall 2011: Elementary Differential Equations (University of Florida)
• Fall 2011: Sets and Logic (University of Florida)

Upcoming Conferences and Seminars

• UF Colloquia, link coming soon, generally 4:05–4:55 on Mondays in the Atrium
• UF Combinatorics Seminar, generally 4:05–4:55 on Tuesdays in 368 Little Hall
• UF Logic Seminar, generally 12:50–1:40 in 305 Little Hall
• Clemson Mini-Conference on Discrete Mathematics and Algorithms, October 27 and 28, 2011
• Canadian Mathematical Society Winter Meeting, Toronto, December 10–12, 2001

Publications and Preprints

• Geometric grid classes of permutations
  Transactions of the American Mathematical Society, to appear.
  With Michael Albert, Mike Atkinson, Mathilde Bouvel, and Nik Ruškuc.
• Finding regular insertion encodings for permutation classes
  Journal of Symbolic Computation, 47 (2012), 259–265.
  
• Counting (3+1)-avoiding permutations
  European Journal of Combinatorics, 33 (2012), 49–61.
  With Mike Atkinson and Bruce Sagan.
• On points drawn from a circle
  Electronic Journal of Combinatorics, 18 (1) (2011), P223, 10 pp.
  With Steve Waton.
• Small permutation classes
  Proceedings of the London Mathematical Society, 103 (2011), 879–921.
  
• Subclasses of the separable permutations
  Bulletin of the London Mathematical Society, 43 (2011), 859–870.
  With Michael Albert and Mike Atkinson.
• Simple extensions of combinatorial structures
  Mathematika, 57 (2011), 193–214.
  With Robert Brignall and Nik Ruškuc.
• On partial well-order for monotone grid classes of permutations
  Order, 28 (2011), 193–199.
  With Steve Waton.
• Maximal independent sets and separating covers
  American Mathematical Monthly, 118 (2011), 418–423.
• On convex permutations
  Discrete Mathematics, 311 (2011), 715–722.
  With Michael Albert, Steve Linton, Nik Ruškuc, and Steve Waton.
• Small configurations in simple permutations
  European Journal of Combinatorics, 31 (2010), 1781–1784.
• Permutation classes of every growth rate above 2.48188
  Mathematika, 56 (2010), 182–192.
  
• 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.
• 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.
• Profile classes and partial well-order for permutations
  Electronic Journal of Combinatorics, 9 (2) (2003), #R17, 30 pp.
  With Maximillian Murphy.
• 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

• INSENC (Maple), for counting permutation classes with regular insertion encodings.
• POPSTACKS (Maple), for counting permutations sortable by k pop stacks in parallel.
• COMPBUILDER (Maple), for reconstructing compositions.
• WILFPLUS (Maple), for counting restricted permutations.
• FINLABEL (Maple), for finding finitely labeled generating trees isomorphic to pattern avoidance trees (in other words, also for counting restricted permutations).

Past Conferences and Seminars

• Permutation Patterns 2010, 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
• Combinatorics Seminar at Dartmouth, Spring 2010

Past Teaching

• Spring 2011: Introduction to Combinatorics II (University of Florida)
• Fall 2010: Introduction to Combinatorics I (University of Florida)
• Fall 2010: Analytic Geometry and Calculus III (University of Florida)
• Winter 2010: Calculus of Functions of One and Several Variables, Sections 1 & 2 (Dartmouth College)
• Fall 2009: Algebraic Combinatorics (Dartmouth College)
• 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: Calculus II, sections 15–17 (Rutgers University)
• Summer 2004: Linear Optimization, section H6 (Rutgers University)
• Spring 2004: Calculus I, sections 29–31 (Rutgers University)
• Fall 2003: Calculus II, sections 10–12 (Rutgers University)

Unpublications, notes, etc.

• Working with ranges in Maple
• Of pancakes, mice and men, a short semi-popular bit on pancake sorting and gene sequences.
  With Colva Roney-Dougal.
• How to make slides from handwritten notes using potrace
• 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-2008 distribution
• Problems and Conjectures presented at the Fifth International Conference on Permutation Patterns (University of St Andrews, June 11–15, 2007).
• Unofficial conference proceedings of Permutation Patterns 2006
• 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.
• Official score from the 2^nd vs. 4^th year bowling competition, Rutgers, Spring 2003.

Grants

“Any time Detroit scores more than 100 points and holds the other team below 100 points, they almost always win.” - Doug Collins.