The minimum Manhattan distance and minimum jump of permutations

DOI10.1016/j.jcta.2018.09.002zbMath1400.05007arXiv1706.01557OpenAlexW2963312138MaRDI QIDQ1621428

Cheyne Homberger, Simon R. Blackburn, Peter M. Winkler

Publication date: 8 November 2018

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

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

zbMATH Keywords

permutationsasymptotic enumerationManhattan distance

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (4)

On the poset of non-attacking King permutations ⋮ Counting king permutations on the cylinder ⋮ Permutations that separate close elements ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Exponential polynomials, Stirling numbers, and evaluation of some gamma integrals
• Prolific permutations and permuted packings: downsets containing many large patterns
• Combinatorics of Permutations
• Counting Fixed-Length Permutation Patterns
• Note on Runs of Consecutive Elements

This page was built for publication: The minimum Manhattan distance and minimum jump of permutations