arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.13460math.CO
收藏

$n$ -queens配置的数量

The number of $n$-queens configurations

Michael Simkin

摘要:

$n$ -皇后问题是要确定$\mathcal{Q}(n)$,即在$n \times n$板上放置$n$相互不威胁的皇后的方法的数量。我们证明了存在一个常数$α= 1.942 \pm 3 \times 10^{-3}$使得$\mathcal{Q}(n) = ((1 \pm o(1))ne^{-α})^n$ .常数$α$的特征在于作为一个凸优化问题的解决方案,在$\mathcal{P}([-1/2,1/2]^2)$,空间的Borel概率测度的平方。主要的创新是为$n$ -queens配置引入了极限对象,我们称之为queenons。这些在$\mathcal{P}([-1/2,1/2]^2)$中形成凸集。我们定义了一个熵函数来计算近似一个给定的queenon的$n$ -queens配置的数量。上限使用Radhakrishnan和Linial-Luria的熵方法。对于下界,我们描述了一个随机化算法,该算法在预先指定的皇后附近构造一个配置,其熵与上界中的熵相匹配。通过极大化皇后子空间中的(凹)熵函数,得到了$n$ -皇后组态的计数。一路上,我们证明了$n$皇后配置,可以用来研究他们的典型结构的大偏差原则。

英文摘要:

The $n$-queens problem is to determine $\mathcal{Q}(n)$, the number of ways to place $n$ mutually non-threatening queens on an $n \times n$ board. We show that there exists a constant $α= 1.942 \pm 3 \times 10^{-3}$ such that $\mathcal{Q}(n) = ((1 \pm o(1))ne^{-α})^n$. The constant $α$ is characterized as the solution to a convex optimization problem in $\mathcal{P}([-1/2,1/2]^2)$, the space of Borel probability measures on the square. The chief innovation is the introduction of limit objects for $n$-queens configurations, which we call queenons. These form a convex set in $\mathcal{P}([-1/2,1/2]^2)$. We define an entropy function that counts the number of $n$-queens configurations that approximate a given queenon. The upper bound uses the entropy method of Radhakrishnan and Linial--Luria. For the lower bound we describe a randomized algorithm that constructs a configuration near a prespecified queenon and whose entropy matches that found in the upper bound. The enumeration of $n$-queens configurations is then obtained by maximizing the (concave) entropy function in the space of queenons. Along the way we prove a large deviations principle for $n$-queens configurations that can be used to study their typical structure.

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

↑