Davenport-Schnizel theory of matrices
Discrete Mathematics
Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps
Journal of Combinatorial Theory Series A
Excluded permutation matrices and the Stanley-Wilf conjecture
Journal of Combinatorial Theory Series A
New records in Stanley-Wilf limits
European Journal of Combinatorics
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
Journal of Combinatorial Theory Series A
Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
Journal of Combinatorial Theory Series A
Hi-index | 0.00 |
For a given permutation matrix P, let f"P(n) be the maximum number of 1-entries in an nxn(0,1)-matrix avoiding P and let S"P(n) be the set of all nxn permutation matrices avoiding P. The Furedi-Hajnal conjecture asserts that c"P:=lim"n"-"~f"P(n)/n is finite, while the Stanley-Wilf conjecture asserts that s"P:=lim"n"-"~|S"P(n)|n is finite. In 2004, Marcus and Tardos proved the Furedi-Hajnal conjecture, which together with the reduction introduced by Klazar in 2000 proves the Stanley-Wilf conjecture. We focus on the values of the Stanley-Wilf limit (s"P) and the Furedi-Hajnal limit (c"P). We improve the reduction and obtain s"P=