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

多米诺在菱形中的最大排列

Maximal Arrangement of Dominos in the Diamond

Dominique Désérable, Rolf Hoffmann, Franciszek Seredyński

AI总结:

本文针对菱形中多米诺的最大排列问题,提出确定性构造规则给出下界,并注入无序性给出上界,在某些情况下上下界重合得到确切数量。

摘要:

“多米诺”是一种特殊实体,由硬二聚体状核心和软外壳组成,并受局部相互作用支配。“软外壳”和“硬核心”意味着外壳可以重叠,而核心在排斥势下作用。与统计物理中的二聚体问题(该问题列出给定 n x n 晶格的所有可能配置数量)不同,本文更适度的目标是为菱形中允许的最大多米诺数量提供上下界。在这个 NP 问题中,提出了一种确定性构造规则,并导致一个次优解 ψ_n 作为下界。随后注入某种无序性,并导致一个上界 ψ_n_upper,该上界是否可达取决于情况。在某些情况下,下界和上界重合,因此 ψ_n = ψ_n_upper 成为最大配置的多米诺确切数量。

英文摘要:

"Dominos" are special entities consisting of a hard dimer-like kernel surrounded by a soft hull and governed by local interactions. "Soft hull" and "hard kernel" mean that the hulls can overlap while the kernel acts under a repulsive potential. Unlike the dimer problem in statistical physics, which lists the number of all possible configurations for a given n x n lattice, the more modest goal herein is to provide lower and upper bounds for the maximum allowed number of dominos in the diamond. In this NP problem, a deterministic construction rule is proposed and leads to a suboptimal solution ψ_n as a lower bound. A certain disorder is then injected and leads to an upper bound ψ_n_upper reachable or not. In some cases, the lower and upper bounds coincide, so ψ_n = ψ_n_upper becomes the exact number of dominos for a maximum configuration.

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

↑