A note on permutation regularity

Autor(es)

Hoppen, Carlos ; Kohayakawa, Yoshiharu ; Sampaio, Rudini M.

• Tipo de documento: Artigo Científico
• Fonte: DISCRETE APPLIED MATHEMATICS; v. 160, n. 18, p. 12-pg., 2012-12-01.

Resumo

The existence of a small partition of a combinatorial structure into random-like subparts, a so-called regular partition, has proven to be very useful in the study of extremal problems, and has deep algorithmic consequences. The main result in this direction is the Szemeredi Regularity Lemma in graph theory. In this note, we are concerned with regularity in permutations: we show that every permutation of a sufficiently large set has a regular partition into a small number of intervals. This refines the partition given by Cooper (2006) [10], which required an additional non-interval exceptional class. We also introduce a distance between permutations that plays an important role in the study of convergence of a permutation sequence. (C) 2011 Elsevier B.V. All rights reserved. (AU)

• Processo FAPESP: 07/56496-3 - A análise de estruturas discretas de grandes proporções
• Beneficiário: Carlos Hoppen
• Modalidade de apoio: Bolsas no Brasil - Pós-Doutorado