Related papers: A Note on Colored Tornheim's Double Series
Perturbative calculations in field theory at finite temperature involve sums over the Matsubara frequencies. Besides the usual difficulties that appear in perturbative computations, these sums give rise to some new obstacles that are…
We give an explicit formula for the shuffle relation in a general double shuffle framework that specializes to double shuffle relations of multiple zeta values and multiple polylogarithms. As an application, we generalize the well-known…
In this paper, we shall study A\'{e}ry-type series in which the central binomial coefficient appears as part of the summand. Let $b_n=4^n/\binom{2n}{n}$. Let $s_1,\dots,s_d$ be positive integers with $s_1\ge 2$. We consider the series…
Bicliques are complements of bipartite graphs; as such each consists of two cliques joined by a number of edges. In this paper we study algebraic aspects of the chromatic polynomials of these graphs. We derive a formula for the chromatic…
We generalize the well-known parity theorem for multiple zeta values (MZV) to functional equations of multiple polylogarithms (MPL). This reproves the parity theorem for MZV with an additional integrality statement, and also provides parity…
If we fix a spanning subgraph $H$ of a graph $G$, we can define a chromatic number of $H$ with respect to $G$ and we show that it coincides with the chromatic number of a double covering of $G$ with co-support $H$. We also find a few…
In this paper, we work out some explicit formulae for double nonlinear Euler sums involving harmonic numbers and alternating harmonic numbers. As applications of these formulae, we give new closed form representations of several quadratic…
We prove an explicit cabling formula for the colored Jones polynomial. As an application we prove the volume conjecture for all zero volume knots and links, i.e. all knots and links that are obtained from the unknot by repeated cabling and…
The purpose of this paper is two-fold. First, we consider the classical Mordell--Tornheim zeta values and their alternating version. It is well-known that these values can be expressed as rational linear combinations of multiple zeta values…
Euler's sum formula and its multi-variable and weighted generalizations form a large class of the identities of multiple zeta values. In this paper we prove a family of identities involving Bernoulli numbers and apply them to obtain…
We prove that the N-colored Jones polynomial for the torus knot T_{s,t} satisfies the second order difference equation, which reduces to the first order difference equation for a case of T_{2,2m+1}. We show that the A-polynomial of the…
It is consistent for every (1 <= n< omega) that (2^omega = omega_n) and there is a function (F:[omega_n]^{< omega}-> omega) such that every finite set can be written at most (2^n-1) ways as the union of two distinct monocolored sets. If GCH…
Recently, a new kind of multiple zeta value level two $T({\bf k})$ (which is called multiple $T$-values) was introduced and studied by Kaneko and Tsumura. In this paper, we define a kind of alternating version of multiple $T$-values, and…
This article gives the foundations of the colored Jones polynomial for singular knots. We extend Masbum and Vogel's algorithm to compute the colored Jones polynomial for any singular knot. We also introduce the tail of the colored Jones…
The chromatic number related to a colouring of facets of certain classes of generalised associahedra is studied. The exact values are obtained for permutohedra, associahedra and simple permutoassociahedra, while lower and upper bounds are…
In this paper, we give a simple proof of the functional relation for the Lerch type Tornheim double zeta function. By using it, we obtain simple proofs of some explicit evaluation formulas for double $L$-values.
The explicit double sum for the associated Laguerre polynomials is derived combinatorially. The moments are described using certain statistics on permutations and permutation tableaux. Another derivation of the double sum is provided using…
We derive closed formulas for the number of $k$-coloured partitions and the number of plane partitions of $n$ in terms of the Bell polynomials.
We show, without using the Four Color Theorem, that for each planar triangulation, the number of its proper vertex colorings by 4 colors is a determinant and thus can be calculated in a polynomial time. In particular, we can efficiently…
In this paper, we introduce iterated integrals associated with colored rooted trees and give proofs for the shuffle relations for $\boldsymbol{p}$-adic finite and $t$-adic symmetric polylogarithms. This method generalizes the theory of the…