|
Diskretnyi Analiz i Issledovanie Operatsii, 2008, Volume 15, Issue 5, Pages 3–5
(Mi da545)
|
|
|
|
This article is cited in 7 scientific papers (total in 7 papers)
Multidimensional permanents in enumrative problems
S. V. Avgustinovich Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Abstract:
A permanent is an effective tool that can be used for solving a series of enumerative combinatorial problems. This theory is well-developed [1, 3] and has many applications. In this paper a problem of calculation of the number of 1-perfect binary codes is reduced to calculation of a generalized permanent of a specially constructed multidimensional matrix. Bibl. 3.
Keywords:
permanent, perfect code, multidimensional matrix.
Received: 20.03.2008
Citation:
S. V. Avgustinovich, “Multidimensional permanents in enumrative problems”, Diskretn. Anal. Issled. Oper., 15:5 (2008), 3–5; J. Appl. Industr. Math., 4:1 (2010), 19–20
Linking options:
https://www.mathnet.ru/eng/da545 https://www.mathnet.ru/eng/da/v15/i5/p3
|
|