Excluded permutation matrices and the Stanley-Wilf conjecture

Authors:
Adam Marcus;Gábor Tardos
Affiliations:
Alfréd Rényi Institute, 1364 Budapest Pf.127, Hungary;Alfréd Rényi Institute, 1364 Budapest Pf.127, Hungary
Venue:
Journal of Combinatorial Theory Series A
Year:
2004

Citing 8
Cited 32

The maximum number of unit distances in a convex n-gon

Journal of Combinatorial Theory Series A
An extremal problem on sparse 0-1 matrices

SIAM Journal on Discrete Mathematics
Davenport-Schnizel theory of matrices

Discrete Mathematics
The solution of a conjecture of Stanley and Wilf for all layered patterns

Journal of Combinatorial Theory Series A
On the number of permutations avoiding a given pattern

Journal of Combinatorial Theory Series A
Counting pattern-free set partitions I: a generalization of Stirling numbers of the second kind

European Journal of Combinatorics
Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences

European Journal of Combinatorics
On 0-1 matrices and small excluded submatrices

Journal of Combinatorial Theory Series A

Extremal problems for ordered hypergraphs: small patterns and some enumeration

Discrete Applied Mathematics
Forbidden patterns and unit distances

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
On 0-1 matrices and small excluded submatrices

Journal of Combinatorial Theory Series A
Hereditary properties of partitions, ordered graphs and ordered hypergraphs

European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics
New records in Stanley-Wilf limits

European Journal of Combinatorics
On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation

Random Structures & Algorithms
Note: On linear forbidden submatrices

Journal of Combinatorial Theory Series A
On constants in the Füredi--Hajnal and the Stanley--Wilf conjecture

Journal of Combinatorial Theory Series A
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Restricted k-ary words and functional equations

Discrete Applied Mathematics
On grids in topological graphs

Proceedings of the twenty-fifth annual symposium on Computational geometry
Growing at a perfect speed

Combinatorics, Probability and Computing
Note: Extremal functions of forbidden double permutation matrices

Journal of Combinatorial Theory Series A
Pattern Matching for 321-Avoiding Permutations

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations

Journal of the ACM (JACM)
On nonlinear forbidden 0-1 matrices: a refutation of a Füredi-Hajnal conjecture

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Applications of forbidden 0-1 matrices to search tree and path compression-based data structures

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Shadows of ordered graphs

Journal of Combinatorial Theory Series A
The structure of almost all graphs in a hereditary property

Journal of Combinatorial Theory Series B
Low Distortion Maps Between Point Sets

SIAM Journal on Computing
Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts

Journal of Combinatorial Theory Series A
On the structure and composition of forbidden sequences, with geometric applications

Proceedings of the twenty-seventh annual symposium on Computational geometry
Grid classes and partial well order

Journal of Combinatorial Theory Series A
Origins of Nonlinearity in Davenport-Schinzel Sequences

SIAM Journal on Discrete Mathematics
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
A note on permutation regularity

Discrete Applied Mathematics
Avoidance of boxed mesh patterns on permutations

Discrete Applied Mathematics
Longest common separable pattern among permutations

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Set systems and families of permutations with small traces

European Journal of Combinatorics
A probabilistic approach to consecutive pattern avoiding in permutations

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper examines the extremal problem of how many 1-entries an n × n 0-1 matrix can have that avoids a certain fixed submatrix P. For any permutation matrix P we prove a linear bound, settling a conjecture of Zoltán Füredi and Péter Hajnal (Discrete Math. 103(1992) 233). Due to the work of Martin Klazar (D. Krob, A.A. Mikhalev, A.V. Mikhalev (Eds.), Formal Power Series and Algebraics Combinatorics, Springer, Berlin, 2000, pp. 250-255), this also settles the conjecture of Stanley and Wilf on the number of n -permutations avoiding a fixed permutation and a related conjecture of Alon and Friedgut (J. Combin Theory Ser A 89(2000) 133).