53 citations · 218 across the 50 of their papers we have counts for
5 papers · 1 filter
Enumeration schemes for restricted permutations
Vincent Vatter
Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more p…
A Proof of the Loehr-Warrington Amazing TEN to the Power n Conjecture
Shalosh B. Ekhad, Vince Vatter, Doron Zeilberger
We prove, via 30 seconds of Maple computation, that there are 10^n words in the alphabet {3,-2} of length 5n, sum 0, and such that every factor that sums to 0 and that starts with…
The Möbius function of the composition poset
Bruce Sagan, Vincent Vatter
We determine the Möbius function of the poset of compositions of an integer. In fact we give two proofs of this formula, one using an involution and one involving discrete Morse th…
Problems and Conjectures presented at the Third International Conference on Permutation Patterns, University of Florida, March 7-11, 2005
Murray Elder, Vince Vatter
We recount problems, questions and conjectures that arose during a problem session of the Third International Conference on Permutation Patterns, University of Florida, March 7-11,…
Maximal and Maximum Independent Sets In Graphs With At Most r Cycles
Bruce E. Sagan, V. Vatter
Let m(G) denote the number of maximal independent sets of vertices in a graph G and let c(n,r) be the maximum value of m(G) over all connected graphs with n vertices and at most r…