Related papers: A Note on Colored Tornheim's Double Series
Although the P\'olya enumeration theorem has been used extensively for decades, an optimized, purely numerical algorithm for calculating its coefficients is not readily available. We present such an algorithm for finding the number of…
The Murnaghan-Nakayama rule expresses the product of a Schur function with a Newton power sum in the basis of Schur functions. We establish a version of the Murnaghan-Nakayama rule for Schubert polynomials and a version for the quantum…
Quickly convergent series are given to compute polyzeta numbers. The formula involves an intricate combination of (generalized) polylogarithms at 1/2. However, the combinatorics has a very simple geometric interpretation: it corresponds…
We conjecture formulae of the colored superpolynomials for a class of twist knots $K_p$ where p denotes the number of full twists. The validity of the formulae is checked by applying differentials and taking special limits. Using the…
We prove an old conjecture of Erd{\H o}s and Graham on sums of unit fractions: There exists a constant $b>0$ such that if we $r$-color the integers in $2,b^r]$, then there exists a monochromatic set $S$ such that $\sum_{n \in S} 1/n=1$.
We use a result on mixed Tate motives due to Goncharov (arXiv:alg-geom/9601021) to show that the symbol of an arbitrary one-loop 2m-gon integral in 2m dimensions may be read off directly from its Feynman parameterization. The algorithm…
Let $P(G,\lambda)$ denote the number of proper vertex colorings of $G$ with $\lambda$ colors. The chromatic polynomial $P(C_n,\lambda)$ for the cycle graph $C_n$ is well-known as $$P(C_n,\lambda) = (\lambda-1)^n+(-1)^n(\lambda-1)$$ for all…
We study quasipolynomials enumerating proper colorings, nowhere-zero tensions, and nowhere-zero flows in an arbitrary CW-complex $X$, generalizing the chromatic, tension and flow polynomials of a graph. Our colorings, tensions and flows may…
We study Dohmen--P\"onitz--Tittmann's bivariate chromatic polynomial $c_\Gamma(k,l)$ which counts all $(k+l)$-colorings of a graph $\Gamma$ such that adjacent vertices get different colors if they are $\le k$. Our first contribution is an…
We consider the problem of $2$-coloring geometric hypergraphs. Specifically, we show that there is a constant $m$ such that any finite set of points in the plane $\mathcal{S} \subset {\mathbb R}^2$ can be $2$-colored such that every…
In the paper, the author finds an explicit formula for computing Bernoulli numbers of the second kind in terms of Stirling numbers of the first kind.
We give explicit evaluations of the linear and non-linear Euler sums of hyperharmonic numbers $h_{n}^{\left( r\right) }$ with reciprocal binomial coefficients. These evaluations enable us to extend closed form formula of Euler sums of…
We explicitly prove the quantum modularity of partial theta series with even or odd periodic coefficients. As an application, we show that the Kontsevich-Zagier series $\mathscr{F}_t(q)$ which matches (at a root of unity) the colored Jones…
We prove the cyclic sum formulas for certain two-parameter multiple series. These are new and non-trivial generalizations of the cyclic sum formulas for multiple zeta values and multiple zeta-star values.
In this paper we present a new family of identities for Euler sums and integrals of polylogarithms by using the methods of generating function and integral representations of series. Then we apply it to obtain the closed forms of all…
Recently, Nayaka and Naika (2022) proved several congruences modulo $16$ and $32$ for $t$-colored overpartitions with $t=5,7,11$ and $13$. We extend their list using an algorithmic technique.
We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…
A typical formula of multiple zeta values is the sum formula which expresses a Riemann zeta value as a sum of all multiple zeta values of fixed weight and depth. Recently weighted sum formulas, which are weighted analogues of the sum…
We devise an explicit method for computing combinatorial formulae for Hadamard products of certain rational generating functions. The latter arise naturally when studying so-called ask zeta functions of direct sums of modules of matrices or…
We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…