Binary linear codes via 4D discrete Ihara-Selberg function (Q1733566)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7040245
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Binary linear codes via 4D discrete Ihara-Selberg function |
scientific article; zbMATH DE number 7040245 |
Statements
Binary linear codes via 4D discrete Ihara-Selberg function (English)
0 references
21 March 2019
0 references
Summary: We express the weight enumerator of each binary linear code, in particular the Ising partition function of an arbitrary finite graph, as a formal infinite product. An analogous result was obtained by Feynman and Sherman in the beginning of the 1960's for the special case of the Ising partition function of the planar graphs. A product expression is an important step towards understanding the logarithm of the Ising partition function, for general graphs and in particular for the cubic 3D lattices.
0 references
graph polynomial
0 references
hyper-matrix
0 references
hyper-determinant
0 references
Bass' theorem
0 references
Ising partition function
0 references
binary linear code
0 references
weight enumerator
0 references
discrete Ihara-Selberg function
0 references
0 references
0 references
0.88200253
0 references
0.8779361
0 references
0 references
0.87334895
0 references
0.87006295
0 references
0 references
0 references
0.8616405
0 references
