相关论文: Partition functions and graphs: A combinatorial ap…

Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…

Graph partitioning is a key fundamental problem in the area of big graph computation. Previous works do not consider the practical requirements when optimizing the big data analysis in real applications. In this paper, motivated by…

We solve the graph bi-partitioning problem in dense graphs with arbitrary degree distribution using the replica method. We find the cut-size to scale universally with <k^1/2>. In contrast, earlier results studying the problem in graphs with…

Feynman's diagrammatic series is a common language for a formally exact theoretical description of systems of infinitely-many interacting quantum particles, as well as a foundation for precision computational techniques. Here we introduce a…

This paper will describe how combinatorial interpretations can help us understand the algebraic structure of two aspects of perturbative quantum field theory, namely analytic Dyson-Schwinger equations and periods of scalar Feynman graphs.…

The main aim of this paper is twofold: (1) Suggesting a statistical mechanical approach to the calculation of the generating function of restricted integer partition functions which count the number of partitions --- a way of writing an…

We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…

We introduce the notion of combinatorial encoding of continuous dynamical systems and suggest the first examples, which are the most interesting and important, namely, the combinatorial encoding of a Bernoulli process with continuous state…

We find examples of duality among quantum theories that are related to arithmetic functions by identifying distinct Hamiltonians that have identical partition functions at suitably related coupling constants or temperatures. We are led to…

From the standard procedure for constructing Feynman vacuum graphs in $\phi^4$ theory from the generating functional $Z$, we find a relation with sets of certain combinatorial matrices, which allows us to generate the set of all Feynman…

Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…

For any function F(x) having a Taylor expansion we solve the boson normal ordering problem for F[(a*)^r a^s], with r,s positive integers,[a,a*]=1, i.e. we provide exact and explicit expressions for its normal form which has all a's to the…

An important objective for analyzing real-world graphs is to achieve scalable performance on large, streaming graphs. A challenging and relevant example is the graph partition problem. As a combinatorial problem, graph partition is NP-hard,…

We calculate the partition function of a harmonic oscillator with quasi-periodic boundary conditions using the zeta-function method. This work generalizes a previous one by Gibbons and contains the usual bosonic and fermionic oscillators as…

For any given sequence of integers there exists a quantum field theory whose Feynman rules produce that sequence. An example is illustrated for the Stirling numbers. The method employed here offers a new direction in combinatorics and graph…

In this paper we briefly review the main idea of the localization technique and its extension suitable in supersymmetric gauge field theory. We analyze the partition function of the vector multiplets with supercharges and its blocks on the…

The distinguishing number of a graph was introduced by Albertson and Collins as a measure of the amount of symmetry contained in the graph. Tymoczko extended this definition to faithful group actions on sets; taking the set to be the vertex…

In this paper we revisit the work of E.T. Bell concerning partition polynomials in order to introduce the reciprocal partition polynomials. We give their explicit formulas and apply the result to compute closed formulae for some well-known…