Abstract
We study , the size of the largest subset of the set of all permutations with minimum Kendall -distance . Using a combination of group theory and integer programming, we reduced the upper bound of from to for all primes . In special cases where is equal to and we reduced the upper bound of by and , respectively.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.