How balanced can permutations be?

DOI10.1007/S00493-024-00127-XMaRDI QIDQ6999747zbMATH OpenFDO

Authors Nir Lavee, Nathan Linial

Publication date 8 April 2025

Published in Combinatorica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00493-024-00127-X

zbMATH Keywords

balanced permutationscombinatorial designspermutation patterns

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) General theory for finite permutation groups (20B05) Symmetric groups (20B30)

Cites work

• A Central Limit Theorem for Vincular Permutation Patterns
• A combinatorial problem in geometry.
• Counting Small Permutation Patterns
• Flag algebras
• How unproportional must a graph be?
• scientific article; zbMATH DE number 4027516 (Why is no real title available?)
• scientific article; zbMATH DE number 3314813 (Why is no real title available?)
• scientific article; zbMATH DE number 7765381 (Why is no real title available?)
• Improving bounds on packing densities of 4-point permutations
• Large networks and graph limits
• Limits of permutation sequences
• On packing densities of permutations
• On the asymptotic statistics of the number of occurrences of multiple permutation patterns
• Patterns in random permutations
• Probabilistic construction of proportional graphs
• Quasi-random graphs
• Quasirandom permutations
• Quasirandom permutations are characterized by 4-point densities
• The inducibility of graphs
• The patterns of permutations

Cited in

(1)

• Counting permutation patterns with multidimensional trees

This page was built for publication: How balanced can permutations be?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6999747)