Related papers: Characterizing partition functions of the vertex m…
We prove a complete complexity classification theorem for the planar eight-vertex model. For every parameter setting in ${\mathbb C}$ for the eight-vertex model, the partition function is either (1) computable in P-time for every graph, or…
We characterize meromorphic function fields closed by partial derivatives in n variables.
The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the sum of weights of edges joining different sets is optimized. In this paper we simplify a known…
Characteristic modes of a spherical shell are found analytically as spherical harmonics normalized to radiate unitary power and to fulfill specific boundary conditions. The presented closed-form formulas lead to a proposal of precise…
This article investigates the properties of order-divisor graphs associated with finite groups. An order-divisor graph of a finite group is an undirected graph in which the set of vertices includes all elements of the group, and two…
One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After "normalization," a sum of products has a natural graphical representation, called a normal…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
The cut-rank of a set $X$ of vertices in a graph $G$ is defined as the rank of the $ X \times (V(G)\setminus X)$ matrix over the binary field whose $(i,j)$-entry is $1$ if the vertex $i$ in $X$ is adjacent to the vertex $j$ in…
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…
We provide a characterization of the finite dimensionality of vector spaces in terms of the right-sided invertibility of linear operators on them.
In this note we characterize, within the framework of the theory of finite set, those categories of graphs that are {\em algebraic universal} in the sense that every concrete category embeds in them. The proof of the characterization is…
Arboricity is a graph parameter akin to chromatic number, in that it seeks to partition the vertices into the smallest number of sparse subgraphs. Where for the chromatic number we are partitioning the vertices into independent sets, for…
For a generic value of the central charge, we prove the holomorphic factorization of partition functions for free superconformal fields which are defined on a compact Riemann surface without boundary. The partition functions are viewed as…
Let $\mathbb{F}_q$ be a finite field with $q$ elements, $n\geq2$ a positive integer, $\mathbb{V}_0$ a $n$-dimensional vector space over $\mathbb{F}_q$ and $\mathbb{T}_0$ the set of all linear functionals from $\mathbb{V}_0$ to…
Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input to these problems is a family of sets over a finite universe and the goal is to cover the elements of the…
This text surveys different probabilistic aspects of a model which is used to describe the evolution of an object that falls apart randomly as time passes. Each point of view yields useful techniques to establish properties of such random…
We derive determinant expressions for domain wall partition functions of level-1 affine so(n) vertex models, n >= 4, at discrete values of the crossing parameter lambda = m pi / 2(n-3), m in Z, in the critical regime.
We interpret the subgraph centrality as the partition function of a network. The entropy, the internal energy and the Helmholtz free energy are defined for networks and molecular graphs on the basis of graph spectral theory. Various…
With the advent of the big data, graph are processed in an iterative manner, which incrementally described in the form of graph in big data applications. Most currently, graph processing methods treat the underlying map data as black boxes.…
We apply persistent homology to the task of discovering and characterizing phase transitions, using lattice spin models from statistical physics for working examples. Persistence images provide a useful representation of the homological…