arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2207.09806math.CO
收藏

分隔封闭元素的排列

Permutations that separate close elements

Simon R. Blackburn

摘要:

设$n$是一个固定的整数,其中$n\geq 2$。对于$i,j\in\mathbb{Z}_n$,将$||i,j||_n$定义为在一个周期中写入$\mathbb{Z}_n$的元素时$i$和$j$之间的距离。所以是$||i,j||_n=\min\{(i-j)\bmod n,(j-i)\bmod n\}$。对于正整数$s$和$k$,置换$π:\mathbb{Z}_n\rightarrow\mathbb{Z}_n$是\emph{$(s,k)$-clash-free},如果$||π(i),π(j)||_n\geq k$每当$||i,j||_n<s$与$i\not=j$。因此,$(s,k)$ -无冲突置换$π$可以被认为是将$\mathbb{Z}_n$的每一个接近的元素对移动到大距离处的一个对。更几何地,$(s,k)$ -无冲突置换的存在等价于$n\times n$环面上的一组$n$非重叠$s\times k$矩形的存在,其中心具有不同的整数$x$ -坐标和不同的整数$y$ -坐标。对于具有$k<n$的正整数$n$和$k$,令$σ(n,k)$为$s$的最大值,使得存在$\mathbb{Z}_n$上的$(s,k)$ -无冲突置换。在最近的一篇论文中,Mammoliti和Simpson证明了\[ \lfloor (n-1)/k\rfloor-1\leq σ(n,k)\leq \lfloor (n-1)/k\rfloor \]对所有整数$n$和$k$都有$k<n$。通过用$s=\lfloor (n-1)/k\rfloor-1$在$\mathbb{Z}_n$上显式构造一个$(s,k)$ -无冲突置换,证明了这一猜想.事实上,这个构造被用来建立一个更一般的Mammoliti和Simpson猜想,其中对于某个固定整数$r$,我们要求环面上的每个点都包含在至多$r$矩形的内部。

英文摘要:

Let $n$ be a fixed integer with $n\geq 2$. For $i,j\in\mathbb{Z}_n$, define $||i,j||_n$ to be the distance between $i$ and $j$ when the elements of $\mathbb{Z}_n$ are written in a cycle. So $||i,j||_n=\min\{(i-j)\bmod n,(j-i)\bmod n\}$. For positive integers $s$ and $k$, the permutation $π:\mathbb{Z}_n\rightarrow\mathbb{Z}_n$ is \emph{$(s,k)$-clash-free} if $||π(i),π(j)||_n\geq k$ whenever $||i,j||_n<s$ with $i\not=j$. So an $(s,k)$-clash-free permutation $π$ can be thought of as moving every close pair of elements of $\mathbb{Z}_n$ to a pair at large distance. More geometrically, the existence of an $(s,k)$-clash-free permutation is equivalent to the existence of a set of $n$ non-overlapping $s\times k$ rectangles on an $n\times n$ torus, whose centres have distinct integer $x$-coordinates and distinct integer $y$-coordinates. For positive integers $n$ and $k$ with $k<n$, let $σ(n,k)$ be the largest value of $s$ such that an $(s,k)$-clash-free permutation on $\mathbb{Z}_n$ exists. In a recent paper, Mammoliti and Simpson conjectured that \[ \lfloor (n-1)/k\rfloor-1\leq σ(n,k)\leq \lfloor (n-1)/k\rfloor \] for all integers $n$ and $k$ with $k<n$. The paper establishes this conjecture, by explicitly constructing an $(s,k)$-clash-free permutation on $\mathbb{Z}_n$ with $s=\lfloor (n-1)/k\rfloor-1$. Indeed, this construction is used to establish a more general conjecture of Mammoliti and Simpson, where for some fixed integer $r$ we require every point on the torus to be contained in the interior of at most $r$ rectangles.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑