# Improved Bounds for Permutation Arrays Under Chebyshev Distance

## TL;DR

This paper introduces new techniques to establish tighter bounds on the maximum size of permutation arrays under the Chebyshev distance, including an exact formula for the case when the distance is 2, aiding error correction in noisy channels.

## Contribution

It provides improved upper and lower bounds for permutation arrays under Chebyshev distance, with a novel precise formula for P(n,2).

## Key findings

- New bounds for P(n,d) established
- Exact formula derived for P(n,2)
- Enhanced understanding of permutation array sizes

## Abstract

Permutation arrays under the Chebyshev metric have been considered for error correction in noisy channels. Let $P(n,d)$ denote the maximum size of any array of permutations on $n$ symbols with pairwise Chebyshev distance $d$. We give new techniques and improved upper and lower bounds on $P(n,d)$, including a precise formula for $P(n,2)$.