English
Related papers

Related papers: A Note on Colored Tornheim's Double Series

200 papers

In the paper, the authors provide four alternative proofs of an explicit formula for computing Bernoulli numbers in terms of Stirling numbers of the second kind.

Number Theory · Mathematics 2014-09-05 Bai-Ni Guo , Feng Qi

The vertex coloring problem to find chromatic numbers is known to be unsolvable in polynomial time. Although various algorithms have been proposed to efficiently compute chromatic numbers, they tend to take an enormous amount of time for…

Combinatorics · Mathematics 2025-07-03 Yayoi Abe , Auna Setoh , Gen Yoneda

Let $B(m, n)$ be the number of ways to colour a $2m \times 2n$ grid in black and white so that, in each row and each column, half of the cells are white and half are black. Bhattacharya conjectured that the exponent of $2$ in the prime…

Combinatorics · Mathematics 2025-05-01 Nikolai Beluhov

We use the methods developed in our papers on moments and divisor correlations to derive heuristically the conjectural ratios formula for two zetas over two zetas.

Number Theory · Mathematics 2016-11-23 Brian Conrey , Jonathan P. Keating

We give a rigorous proof of the colored HOMFLY-PT polynomials of the trefoil knot, the figure-eight knot and twist knots. For the trefoil knot and the figure-eight knot, it is expressed by a single sum, and for a twist knot, it is expressed…

Geometric Topology · Mathematics 2021-07-20 Kenichi Kawagoe

For each prime p > 7 we obtain the expression for an upper bound on the minimum number of colors needed to non-trivially color T(2, p), the torus knots of type (2, p), modulo p. This expression is t + 2 l -1 where t and l are extracted from…

Geometric Topology · Mathematics 2012-08-13 Louis Kauffman , Pedro Lopes

In this article, we consider a collection of geometric problems involving points colored by two colors (red and blue), referred to as bichromatic problems. The motivation behind studying these problems is two fold; (i) these problems appear…

Computational Geometry · Computer Science 2016-10-04 Sayan Bandyapadhyay , Aritra Banik

We define finite multiple zeta values (FMZVs) associated with some combinatorial objects, which we call 2-colored rooted trees, and prove that FMZVs associated with 2-colored rooted trees satisfying certain mild assumptions can be written…

Number Theory · Mathematics 2016-09-30 Masataka Ono

In this paper, we define a parametric variant of generalized Euler sums and call them the (alternating) parametric Euler $T$-sums. By using the contour integration method and residue theorem, we establish several explicit formulae for the…

Number Theory · Mathematics 2022-03-29 Ce Xu , Lu Yan

We give a signed puzzle rule to compute Schubert coefficients. The rule is based on a careful analysis of Knutson's recurrence arXiv:math/0306304. We use the rule to prove polynomiality of the sums of Schubert coefficients with bounded…

Combinatorics · Mathematics 2025-04-25 Igor Pak , Colleen Robichaux

In this paper we compute the values of the p-adic multiple polylogarithms of depth two at roots of unity. Our method is to solve the fundamental differential equation satisfied by the crystalline frobenius morphism using rigid analytic…

Number Theory · Mathematics 2013-02-27 Sinan Unver

In this work, we investigate the arithmetic properties of $p_{1,5^k}(n)$, which counts 2-color partitions of $n$ where one of the colors appears only in parts that are multiples of $5^k$. By constructing generating functions for…

Number Theory · Mathematics 2025-03-14 Shivashankar C. , HemanthKumar B. , D. S. Gireesh

This paper studies increasing trees on $n$ labeled vertices, in which labels increase from the root to the leaves. It is known that the number of binary increasing trees coincides with the number of alternating permutations (Euler numbers).…

Combinatorics · Mathematics 2026-01-13 Medet Jumadildayev

A method of Feynman diagrams summation, based on using Schwinger-Dyson equations and Ward identities, is verified by calculating some four-loop diagrams in N=1 supersymmetric electrodynamics, regularized by higher derivatives. In…

High Energy Physics - Theory · Physics 2009-11-11 A. B. Pimenov , K. V. Stepanyantz

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

Numerical Analysis · Mathematics 2023-09-18 Bor Plestenjak , Michiel E. Hochstenbach

It is known that the Ehrhart polynomials of cross-polytopes, as well as of pyramids over them, have positive coefficients. We give a combinatorial proof of this fact by showing that a scaled version of the Ehrhart polynomials are generating…

Combinatorics · Mathematics 2025-12-10 Krishna Menon , Emil Verkama

We derive exact and sharp lower bounds for the number of monochromatic generalized Schur triples $(x,y,x+ay)$ whose entries are from the set $\{1,\dots,n\}$, subject to a coloring with two different colors. Previously, only asymptotic…

Combinatorics · Mathematics 2020-10-13 Christoph Koutschan , Elaine Wong

We propose a version of the volume conjecture that would relate a certain limit of the colored Jones polynomials of a knot to the volume function defined by a representation of the fundamental group of the knot complement to the special…

Geometric Topology · Mathematics 2011-11-09 Hitoshi Murakami

[Inserted by J. Maurice Rojas] We give a formula for the number of complex roots of a generic system of two polynomial equations in two unknowns. The formula is completely combinatorial, ultimately depending just on the convex hull of the…

History and Overview · Mathematics 2007-05-23 Ferdinand Minding

We survey various results and conjectures concerning multiple polylogarithms and the multiple zeta function. Among the results, we announce our resolution of several conjectures on multiple zeta values. We also provide a new integral…

Classical Analysis and ODEs · Mathematics 2007-06-13 Douglas Bowman , David M. Bradley