Related papers: Characterizing partition functions of the vertex m…
Rational algebraic curves have been intensively studied in the last decades, both from the theoretical and applied point of view. In applications (e.g. level curves, linear homotopy deformation, geometric constructions in computer aided…
Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
There has been substantial interest in estimating the value of a graph parameter, i.e., of a real-valued function defined on the set of finite graphs, by querying a randomly sampled substructure whose size is independent of the size of the…
A hypergraph is said to be $1$-Sperner if for every two hyperedges the smallest of their two set differences is of size one. We present several applications of $1$-Sperner hypergraphs and their structure to graphs. In particular, we…
We give a complete structural characterisation of the map the positive branch of a one-way pattern implements. We start with the representation of the positive branch in terms of the phase map decomposition, which is then further analysed…
We characterize the bipartite graphs that minimize the (first-degree based) entropy, among all bipartite graphs of given size, or given size and (upper bound on the) order. The extremal graphs turn out to be complete bipartite graphs, or…
In this article, we calculated the refined topological vertex for the one parameter case using the Jack symmetric functions. Also, we obtain the partition function for elliptic N=2 models, the results coincide with those of Nekrasov…
Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…
The power graph of a group is the simple graph whose vertices are the group elements and two vertices are adjacent whenever one of them is a positive power of the other. We characterize the finite nilpotent groups whose power graphs have…
In this paper we relate the partition function to the max-statistics of random variables. In particular, we provide a novel framework for approximating and bounding the partition function using MAP inference on randomly perturbed models. As…
We consider the restriction of interval exchange transformations to algebraic number fields, which leads to maps on lattices. We characterize renormalizability arithmetically, and study its relationships with a geometrical quantity that we…
The aim of this short note is to draw attention to a method by which the partition function and marginal probabilities for a certain class of random fields on complete graphs can be computed in polynomial time. This class includes Ising…
Marginal models involve restrictions on the conditional and marginal association structure of a set of categorical variables. They generalize log-linear models for contingency tables, which are the fundamental tools for modelling the…
This article presents a simple characterization for entangled vectors in a finite dimensional Hilbert space $H$. The characterization is in terms of the coefficients of an expansion of the vector relative to an orthonormal basis for $H$.…
We present a general, rigorous theory of partition function zeros for lattice spin models depending on one complex parameter. First, we formulate a set of natural assumptions which are verified for a large class of spin models in a…
In this note, we consider the six-vertex model with domain wall boundary conditions, defined on a $M\times M$ lattice, in the inhomogeneous case where the partition function depends on 2M inhomogeneities $\lambda_j$ and $\mu_k$. For a…
We consider the $\Pi$-free Deletion problem parameterized by the size of a vertex cover, for a range of graph properties $\Pi$. Given an input graph $G$, this problem asks whether there is a subset of at most $k$ vertices whose removal…
Vertex similarity is a major problem in network science with a wide range of applications. In this work we provide novel perspectives on finding (dis)similar vertices within a network and across two networks with the same number of vertices…