Related papers: Finite-Graph-Cover-Based Analysis of Factor Graphs…
It was recently conjectured that the permanent of a ${P}$-lifting $\theta^{\uparrow{P}}$ of a matrix $\theta$ of degree $M$ is less than or equal to the $M$th power of the permanent perm$(\theta)$, i.e.,…
We consider the Bethe ansatz solution of integrable models interacting through factorized $S$-matrices based on the central extention of the $\bf{su}(2|2)$ symmetry. The respective $\bf{su}(2|2)$ $R$-matrix is explicitly related to that of…
The singularity degree of a semidefinite programming problem is the smallest number of facial reduction steps to make the problem strictly feasible. We introduce two new graph parameters, called the singularity degree and the nondegenerate…
Let $S$ be a semigroup, let $n\in\mathbb{N}$ be a positive natural number, let $A,B\subseteq S$, let $\mathcal{U},\mathcal{V}\in\beta S$ and let let $\mathcal{F}\subseteq\{f:S^{n}\rightarrow S\}$. We say that $A$ is $\mathcal{F}$-finitely…
The Fueter-Sce theorem is one of the most important results in hypercomplex analysis, providing a two-step procedure for constructing axially monogenic functions starting from holomorphic functions of one variable. In the first step, the…
We study a combinatorial property of subsets in finite groups that is analogous to the notion of independence in graphs. Given a group $G$ and a non-empty subset $A\subset G$, we define a (right) $s$-factor as a subset $B\subset G$…
The study of Finite Size Effects in Quantum Field Theory allows the extraction of precious perturbative and non-perturbative information. The use of scaling functions can connect the particle content (scattering theory formulation) of a QFT…
We study a log-gas on a network (a finite, simple graph) confined in a bounded subset of a local field (i.e. R, C, Q_{p} the field of p-adic numbers). In this gas, a log-Coulomb interaction between two charged particles occurs only when the…
Combinatorial optimization problems are ubiquitous in science and engineering. Still, learning-based approaches to accelerate combinatorial optimization often require solving a large number of difficult instances to collect training data,…
Recent inapproximability results of Sly (2010), together with an approximation algorithm presented by Weitz (2006) establish a beautiful picture for the computational complexity of approximating the partition function of the hard-core…
The concept of spin ice can be extended to a general graph. We study the degeneracy of spin ice graph on arbitrary interaction structures via graph theory. Via the mapping of spin ices to the Ising model, we clarify whether the inverse…
For a graph class $\mathcal{G}$, we define the $\mathcal{G}$-modular cardinality of a graph $G$ as the minimum size of a vertex partition of $G$ into modules that each induces a graph in $\mathcal{G}$. This generalizes other module-based…
A graph $G$ is $[a,b]$-covered if for each edge $e$ of $G$ there is an $[a,b]$-factor containing it. For $a=b=1$, an $[a,b]$-covered graph is a matching covered graph. The structural theory of matching covered graphs constitutes a…
A fractional matching of a graph $G$ is a function $f:E(G)\rightarrow [0, 1]$ such that for any $v\in V(G)$, $\sum_{e\in E_{G}(v)}f(e)\leq1$, where $E_{G}(v)=\{e\in E(G): e~ \mbox{is incident with} ~v~\mbox{in}~G\}$.The fractional matching…
We consider partitioned graphs, by which we mean finite strongly connected directed graphs with a partitioned edge set $ {\mathcal E} ={\mathcal E}^- \cup{\mathcal E}^+$. With additionally given a relation $\mathcal R$ between the edges in…
We introduce a new paradigm for finite precision iterative decoding on low-density parity-check codes over the Binary Symmetric channel. The messages take values from a finite alphabet, and unlike traditional quantized decoders which are…
The formulation and resolution of integrable lattice statistical models in a quantum group covariant way is the subject of this review. The Bethe Ansatz turns to be remarkably useful to implement quantum group symmetries and to provide…
While graphs and abstract data structures can be large and complex, practical instances are often regular or highly structured. If the instance has sufficient structure, we might hope to compress the object into a more succinct…
In an earlier publication, the last two authors showed that a finite-dimensional module for a quantum affine algebra of type $A$ whose $q$-factorization graph is totally ordered is prime. In this paper, we continue the investigation of the…
The 2-switch-degree of $G$ is the number of distinct 2-switches acting on a graph $G$. In this work we study structural properties of the 2-switch-degree, with a focus on split graphs. Our approach is motivated by the Tyshkevich…