Boolean Functions and Permanents of Sylvester Hadamard Matrices

One of the fastest known general techniques for computing permanents is Ryser’s formula. On this note, we show that this formula over Sylvester Hadamard matrices of order <inline-formula><math display="inline"><semantics><msup><mn>2</mn><mi>m</m...

詳細記述

書誌詳細
出版年:Mathematics
第一著者: José Andrés Armario
フォーマット: 論文
言語:英語
出版事項: MDPI AG 2021-01-01
主題:
オンライン・アクセス:https://www.mdpi.com/2227-7390/9/2/177
その他の書誌記述
要約:One of the fastest known general techniques for computing permanents is Ryser’s formula. On this note, we show that this formula over Sylvester Hadamard matrices of order <inline-formula><math display="inline"><semantics><msup><mn>2</mn><mi>m</mi></msup></semantics></math></inline-formula>, <inline-formula><math display="inline"><semantics><msub><mi>H</mi><mi>m</mi></msub></semantics></math></inline-formula>, can be carried out by enumerating <i>m</i>-variable Boolean functions with an arbitrary Walsh spectrum. As a consequence, the quotient <inline-formula><math display="inline"><semantics><mrow><mi>p</mi><mi>e</mi><mi>r</mi><mrow><mo>(</mo><msub><mi>H</mi><mi>m</mi></msub><mo>)</mo></mrow><mo>/</mo><msup><mn>2</mn><msup><mn>2</mn><mi>m</mi></msup></msup></mrow></semantics></math></inline-formula> might be a measure of the “density” of <i>m</i>-variable Boolean functions with high nonlinearity.
ISSN:2227-7390