Permutations in two dimensions that maximally separate neighbors
From MaRDI portal
(Redirected from Publication:1740356)
Abstract: We characterize all permutations on even-by-even grids that maximally separate neighboring vertices. More precisely, let , be positive even integers, let be the grid, let be the metric on , and let be the set of neighbors in . We characterize all permutations of that maximize .
Recommendations
Cites work
- How permutations displace points and stretch intervals.
- scientific article; zbMATH DE number 3584785 (Why is no real title available?)
- Interleaver properties and their applications to the trellis complexity analysis of turbo codes
- On computing the total displacement number via weighted Motzkin paths
- The generating function for total displacement
Cited in
(7)- A duality for permutations
- Permutations that separate close elements
- scientific article; zbMATH DE number 4204350 (Why is no real title available?)
- The maximal length of a k-separator permutation
- On \(k\)-neighbor separated permutations
- scientific article; zbMATH DE number 2192130 (Why is no real title available?)
- Maximizing a sum related to image segmentation evaluation
This page was built for publication: Permutations in two dimensions that maximally separate neighbors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1740356)