二参数矩阵的哈夫曼数
Hafnian of two-parameter matrices
AI总结:
本文提出一种高效计算二参数矩阵哈夫曼数的方法,通过子矩阵的哈夫曼数乘积公式,用于计算具有两种边权的图的完美匹配总权重,特别讨论了托普利茨矩阵的两种特殊情况。
摘要:
哈夫曼数最初出现在量子场论中,其在无向加权图的邻接矩阵中的哈夫曼数等于该图所有完美匹配权重总和。一般情况下,哈夫曼数的计算复杂度较高。本文提出一种高效方法,用于精确计算二参数矩阵的哈夫曼数。在图论中,该方法用于计算边权仅取两种值的图的完美匹配总权重。该方法基于将两个矩阵之和的哈夫曼数通过其子矩阵哈夫曼数乘积的公式表达。应用该方法的必要条件是能够计算某些图中k边匹配的数量。本文详细考虑了两种特殊情况,使用托普利茨矩阵作为二参数矩阵。作为示例,本文提出对OEIS中某些序列的新解释,并提供新的分析公式来计算特定线性弦图的匹配数。
英文摘要:
The concept of the hafnian first appeared in the works on quantum field theory by E. R. Caianiello. However, it also has an important combinatorial property: the hafnian of the adjacency matrix of an undirected weighted graph is equal to the total sum of the weights of perfect matchings in this graph. In general, the use of the hafnian is limited by the complexity of its computation. In this paper, we present an efficient method for the exact calculation of the hafnian of two-parameter matrices. In terms of graphs, we count the total sum of the weights of perfect matchings in graphs whose edge weights take only two values. This method is based on the formula expressing the hafnian of a sum of two matrices through the product of the hafnians of their submatrices. The necessary condition for the application of this method is the possibility to count the number of k-edge matchings in some graphs. We consider two special cases in detail using a Toeplitz matrix as the two-parameter matrix. As an example, we propose a new interpretation of some of the sequences from the On-Line Encyclopedia of Integer Sequences and then provide new analytical formulas to count the number of certain linear chord diagrams.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。