Permutations that separate close elements

DOI10.1016/J.JCTA.2023.105734MaRDI QIDQ2689006zbMATH OpenOpenAlexFDO

Authors Simon R. Blackburn

Publication date 6 March 2023

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2207.09806

zbMATH Keywords

permutationspacking problemsclash-free

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial optimization (90C27)

Recommendations

• Permutations in which pairs of numbers are not simultaneously close in position and close in size
• On \(k\)-neighbor separated permutations
• On the maximum number of permutations with given maximal or minimal distance
• On a conjecture concerning the permutations of \(\{1,2,\dots,n\}\)
• Permutations in two dimensions that maximally separate neighbors

Cites work

• scientific article; zbMATH DE number 6423657 (Why is no real title available?)
• Cyclic matching sequencibility of graphs
• Permutations in which pairs of numbers are not simultaneously close in position and close in size
• Prolific permutations and permuted packings: downsets containing many large patterns
• The minimum Manhattan distance and minimum jump of permutations
• The wonderful Walecki construction

Cited in

(5)

• Permutations in two dimensions that maximally separate neighbors
• Permutations that separate close elements, and rectangle packings in the torus
• Permutations in which pairs of numbers are not simultaneously close in position and close in size
• Permutations that separate close elements
• Adjoining Almost Disjoint Permutations

This page was built for publication: Permutations that separate close elements

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