Related papers: Codes on graphs: Duality and MacWilliams identitie…
Dantzig and Eaves claimed that fundamental duality theorems of linear programming were a trivial consequence of Fourier elimination. Another property of Fourier elimination is considered here, regarding the existence of implicit equalities…
Quantum LDPC codes have attracted intense interest due to their advantageous properties for realizing efficient fault-tolerant quantum computing. In particular, sheaf codes represent a novel framework that encompasses all well-known good…
Recently a notion of self-duality for differential equations of maximal cuts was introduced, which states that there should be a basis in which the matrix for an {\epsilon}-factorised differential equation is persymmetric. It was observed…
The setting is the representation theory of a simply connected, semisimple algebraic group over a field of positive characteristic. There is a natural transformation from the wall-crossing functor to the identity functor. The kernel of this…
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…
A well known theorem due to Kasteleyn states that the partition function of an Ising model on an arbitrary planar graph can be represented as the Pfaffian of a skew-symmetric matrix associated to the graph. This results both embodies the…
The focus of Part I of this monograph has been on both the fundamental properties, graph topologies, and spectral representations of graphs. Part II embarks on these concepts to address the algorithmic and practical issues centered round…
In this paper a wide family of identifying codes over regular Cayley graphs of degree four which are built over finite Abelian groups is presented. Some of the codes in this construction are also perfect. The graphs considered include some…
Given a partition ${\mathcal V}=(V_1, \ldots,V_m)$ of the vertex set of a graph $G$, an {\em independent transversal} (IT) is an independent set in $G$ that contains one vertex from each $V_i$. A {\em fractional IT} is a non-negative real…
We consider the task of representing signals supported on graph bundles, which are generalizations of product graphs that allow for "twists" in the product structure. Leveraging the localized product structure of a graph bundle, we…
We analyze two-particle renormalizations within many-fermion perturbation expansion. We show that present diagrammatic theories suffer from lack of a direct diagrammatic control over the physical two-particle functions. To rectify this we…
A natural generalization of a regular (or equitable) partition of a graph, which makes sense also for non-regular graphs, is the so-called weight-regular partition, which gives to each vertex $u\in V$ a weight that equals the corresponding…
We discuss an interesting duality known to occur for certain complex reflection groups, namely the duality groups. Our main construction yields a concrete, representation theoretic realisation of this duality. This allows us to naturally…
We generalize our picture in [arXiv:0904.1744], and consider a pure abelian gauge theory on a four-manifold with nonlocal operators of every codimension arbitrarily and simultaneously inserted. We explicitly show that (i) the theory enjoys…
Many signals on Cartesian product graphs appear in the real world, such as digital images, sensor observation time series, and movie ratings on Netflix. These signals are "multi-dimensional" and have directional characteristics along each…
We define an invariant of graphs embedded in a three-manifold and a partition function for 2-complexes embedded in a triangulated four-manifold by specifying the values of variables in the Turaev-Viro and Crane-Yetter state sum models. In…
We investigate two types of boundedness criteria for bilinear Fourier multiplier operators with symbols with bounded partial derivatives of all (or sufficiently many) orders. Theorems of the first type explicitly prescribe only a certain…
We interpret the symmetrized weight enumerator of linear codes over finite commutative Frobenius rings as a summation over multisets and thereby provide a new proof of the MacWilliams identity for the symmetrized weight enumerator. The…
In this paper we develop a theory of Fourier-like transforms on the space of stable graphs. In particular, we introduce a duality theory of stable graphs. As an application, we derive the holomorphic anomaly equations for general…
Past few years have seen an extensive use of RAM chips with wide I/O data (e.g. 16, 32, 64 bits) in computer memory systems. These chips are highly vulnerable to a special type of byte error, called an $m$-spotty byte error, which can be…