Related papers: Binary linear codes via 4D discrete Ihara-Selberg …
A method is proposed for exactly calculating the partition function of a rectangular Ising lattice with the presence of a uniform external field. This approach is based on the method of the transfer matrix developed about seventy years ago…
We compute the supersymmetric partition function on L(r,1)xS^1, the lens space index, for 4d gauge theories related by supersymmetric dualities and involving non simply-connected groups. This computation is sensitive to the global…
A positive function (conductivity) on the edges of a graph induces the Dirichlet-to- Neumann map between boundary values of harmonic functions. The inverse conductivity problem is to find the conductivity from the Dirichlet-to-Neumann map.…
We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it.…
We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell$-complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell$. This concept generalizes…
We continue our analysis of bad theories, focusing on quiver theories with bad unitary and special unitary gauge groups in three dimensions. By extending the dualization algorithm we prove that the partition function of bad linear quivers…
The divisor theory of graphs views a finite connected graph $G$ as a discrete version of a Riemann surface. Divisors on $G$ are formal integral combinations of the vertices of $G$, and linear equivalence of divisors is determined by the…
We find that all Feynman integrals (FIs), having any number of loops, can be completely determined once linear relations between FIs are provided. Therefore, FIs computation is conceptually changed to a linear algebraic problem. Examples up…
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. We show that for {\em every} code, the ratio of its list decoding radius to its minimum distance…
In these expository notes, we describe some features of the multiplicative coalescent and its connection with random graphs and minimum spanning trees. We use Pitman's proof of Cayley's formula, which proceeds via a calculation of the…
Due to some practical applications, linear complementary dual (LCD) codes and self-orthogonal codes have attracted wide attention in recent years. In this paper, we use simplicial complexes for construction of an infinite family of binary…
We introduce a novel algorithm for decoding binary linear codes by linear programming. We build on the LP decoding algorithm of Feldman et al. and introduce a post-processing step that solves a second linear program that reweights the…
We consider the Ising model on a cylindrical lattice of L columns, with fixed-spin boundary conditions on the top and bottom rows. The spontaneous magnetization can be written in terms of partition functions on this lattice. We show how we…
Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…
For a weight function in the unit disk which is the modulus of a finite product of powers of Blaschke factors, we give a canonical representation for the reproducing kernel of the corresponding weighted Bergman space in terms of the values…
We show that the partition function of all classical spin models, including all discrete Standard Statistical Models and all abelian discrete Lattice Gauge Theories (LGTs), can be expressed as a special instance of the partition function of…
In this paper, we first introduce the extended binary representation of non-binary codes, which corresponds to a covering graph of the bipartite graph associated with the non-binary code. Then we show that non-binary codewords correspond to…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
We present a short proof of the Kac-Ward formula for the partition function of the Ising model on planar graphs.
We identify a partition-theoretic generalization of Riemann zeta function and the equally positive integer-indexed harmonic sums at infinity, to obtain the generating function and the integral representations of the latter. The special…