Densities in large permutations and parameter testing

A classical theorem of Erdos, Lovasz and Spencer asserts that the densities of connected subgraphs in large graphs are independent. We prove an analogue of this theorem for permutations and we then apply the methods used in the proof to give an example of a finitely approximable permutation parameter that is not finitely forcible. The latter answers a question posed by two of the authors and Moreira and Sampaio.

[1]  Yoshiharu Kohayakawa,et al.  Property testing and parameter testing for permutations , 2010, SODA '10.

[2]  V. Rödl,et al.  On graphs with small subgraphs of large chromatic number , 1985, Graphs Comb..

[3]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[4]  Yoshiharu Kohayakawa,et al.  Testing permutation properties through subpermutations , 2011, Theor. Comput. Sci..

[5]  M. Atkinson,et al.  The enumeration of simple permutations. , 2003, math/0304213.

[6]  Oleg Pikhurko,et al.  Quasirandom permutations are characterized by 4-point densities , 2012, 1205.3074.

[7]  László Lovász,et al.  Limits of dense graph sequences , 2004, J. Comb. Theory B.

[8]  V. Sós,et al.  Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics , 2012 .

[9]  B. Szegedy,et al.  Szemerédi’s Lemma for the Analyst , 2007 .

[10]  Noga Alon,et al.  Every monotone graph property is testable , 2005, STOC '05.

[11]  B. Szegedy,et al.  Testing properties of graphs and functions , 2008, 0803.1248.

[12]  Rudini Menezes Sampaio,et al.  Limits of permutation sequences , 2011, J. Comb. Theory, Ser. B.

[13]  Y. Kohayakawa,et al.  Limits of permutation sequences through permutation regularity , 2011, 1106.1663.

[14]  P. Erdos,et al.  Strong Independence of Graphcopy Functions , 1979 .

[15]  V. Sós,et al.  Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.

[16]  Daniel Král,et al.  Hereditary properties of permutations are strongly testable , 2012, SODA.

[17]  László Lovász,et al.  Graph limits and parameter testing , 2006, STOC '06.

[18]  Luca Trevisan,et al.  Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..

[19]  Karol Borsuk.  Drei Sätze über die n-dimensionale euklidische Sphäre , 1933 .

[20]  J. Spencer,et al.  Strong independence of graph copy functions , 1978 .

[21]  Noga Alon,et al.  A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.

[22]  Walter Stromquist,et al.  Packing Rates Of Measures And A Conjecture For The Packing Density Of 2413 , 2010 .

[23]  Daniel Král,et al.  Finitely forcible graphons and permutons , 2015, J. Comb. Theory, Ser. B.