Related papers: On partition functions for 3-graphs

Following the lead of Stanley and Gessel, we consider a morphism which associates to an acyclic directed graph (or a poset) a quasi-symmetric function. The latter is naturally defined as multivariate generating series of non-decreasing…

Building on previous work by Cameron et al. in [3], we give a recurrence for computing the number of acyclic orientations of complete $k$-partite graphs, which can be implemented to obtain a dynamic programming algorithm running in time…

A cyclic subgroup graph of a group $G$ is a graph whose vertices are cyclic subgroups of $G$ and two distinct vertices $H_1$ and $H_2$ are adjacent if $H_1\leq H_2$, and there is no subgroup $K$ such that $H_1<K<H_2$. M.T\u{a}rn\u{a}uceanu…

In this paper we study division algebras over the function fields of curves over $\Q_p$. The first and main tool is to view these fields as function fields over nonsingular $S$ which are projective of relative dimension 1 over the $p$ adic…

We propose a novel fermionic model on the graphs. The Dirac operator of the model consists of deformed incidence matrices on the graph and the partition function is given by the inverse of the graph zeta function. We find that the…

The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…

The \textit{boxicity} (\textit{cubicity}) of an undirected graph $\Gamma$ is the smallest non-negative integer $k$ such that $\Gamma$ can be represented as the intersection graph of axis-parallel rectangular boxes (unit cubes) in…

This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…

We define phylogenetic projective toric model of a trivalent graph as a generalization of a binary symmetric model of a trivalent phylogenetic tree. Generators of the pro- jective coordinate ring of the models of graphs with one cycle are…

We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of this function. We achieve this combinatorial characterization…

Consider a graph $\Gamma$. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic vertex cutset, then it…

Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several well-known eigenvalue bounds. In this work we…

This paper is a significant part of a general project aimed to classify all irreducible representations of finite quasi-simple groups over an algebraically closed field, in which the image of at least one element is represented by an almost…

A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…

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…

We characterize which graph parameters are partition functions of a vertex model over an algebraically closed field of characteristic 0 (in the sense of de la Harpe and Jones). We moreover characterize when the vertex model can be taken so…

A seminal technique of theoretical physics called Wick's theorem interprets the Gaussian matrix integral of the products of the trace of powers of Hermitian matrices as the number of labelled maps with a given degree sequence, sorted by…

We introduce topological invariants of semi-decompositions (e.g. filtrations, semi-group actions, multi-valued dynamical systems, combinatorial dynamical systems) on a topological space to analyze semi-decompositions from a dynamical…

We study isometric representations of product systems of correspondences over the semigroup $\mathbb{N}^k$ which are minimal dilations of finite dimensional, fully coisometric representations. We show the existence of a unique minimal…

In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…