Related papers: Binary linear codes via 4D discrete Ihara-Selberg …
We use a tensor unfolding technique to prove a new identifiability result for discrete bipartite graphical models, which have a bipartite graph between an observed and a latent layer. This model family includes popular models such as…
The relation between the 2d Ising partition function and spin network evaluations, reflecting a bulk-boundary duality between the 2d Ising model and 3d quantum gravity, promises an exchange of results and methods between statistical physics…
A classical method of constructing a linear code over $\gf(q)$ with a $t$-design is to use the incidence matrix of the $t$-design as a generator matrix over $\gf(q)$ of the code. This approach has been extensively investigated in the…
In this article, we define a doubling procedure for the bialgebra of specified Feynman graphs introduced in a previous paper \cite {DMB}. This is the vector space generated by the pairs $(\bar \Gamma, \bar \gamma)$ where $\bar \Gamma$ is a…
Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured…
We introduce the new concept of computation coding. Similar to how rate-distortion theory is concerned with the lossy compression of data, computation coding deals with the lossy computation of functions. Particularizing to linear…
We develop a formal group--theoretic framework for the Riemann zeta function by treating its Euler product as an element of the multiplicative formal group $\widehat{\mathbb{G}}_m$ and its logarithm as the associated formal group logarithm.…
We construct dual formulation of linearised gravity in first order tetrad formalism in arbitrary dimensions within the path integral framework following the standard duality algorithm making use of the global shift symmetry of the tetrad…
Linear codes are considered over the ring $\mathbb{Z}_4+v\mathbb{Z}_4$, where $v^2=v$. Gray weight, Gray maps for linear codes are defined and MacWilliams identity for the Gray weight enumerator is given. Self-dual codes, construction of…
We give a complexity dichotomy for the problem of computing the partition function of a weighted Boolean constraint satisfaction problem. Such a problem is parameterized by a set of rational-valued functions, which generalize constraints.…
Firstly, we give a formula on the generalized Hamming weight of linear codes constructed generically by defining sets. Secondly, by choosing properly the defining set we obtain a class of cyclotomic linear codes and then present two…
We show that the n-fold integrals $\chi^{(n)}$ of the magnetic susceptibility of the Ising model, as well as various other n-fold integrals of the "Ising class", or n-fold integrals from enumerative combinatorics, like lattice Green…
Partition functions are an important research object in combinatorics and mathematical physics [Barvinok, 2016]. In this work, we consider the partition function of the Ising antiferromagnet on random regular graphs and characterize its…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
When it comes to partial numerical verification of the Riemann Hypothesis, one crucial part is to verify the completeness of a list of pre-computed zeros. Turing developed such a method, based on an explicit version of a theorem of…
Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of two-weight and three-weight linear codes are presented and their…
We propose a method to study the second-order critical lines of classical spin-$S$ Ising models on two-dimensional lattices in a crystal or splitting field, using an exact expression for the bare mass of the underlying field theory.…
A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…
In this paper, we present a construction of linear codes over $\f_{2^t}$ from Boolean functions, which is a generalization of Ding's method \cite[Theorem 9]{Ding15}. Based on this construction, we give two classes of linear codes…
Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial $t$-designs have been attracted lots of research interest for decades. The interplay between coding theory and $t$-designs has…