Related papers: Visible Point Partition Identities for Polylogarit…
We compute all the equivariant Euler characteristics of the $\Sigma_n$-poset of partitions of the $n$ element set.
We prove sum formulas for double polylogarithms of Hurwitz type, that is, involving a shifting parameter $b$ in the denominator. These formulas especially imply well-known sum formulas for double zeta values, and sum formulas for double…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…
In the paper, the author elementarily unifies and generalizes eight identities involving the functions $\frac{\pm1}{e^{\pm t}-1}$ and their derivatives. By one of these identities, the author establishes two explicit formulae for computing…
We propose hypergeometric constructions of simultaneous approximations to polylogarithms. These approximations suit for computing the values of polylogarithms and satisfy 4-term Apery-like (polynomial) recursions.
We introduce the concept of paravectors to describe the geometry of points in a three dimensional space. After defining a suitable product of paravectors, we introduce the concepts of biparavectors and triparavectors to describe line…
This paper gives an exposition of well known results on vector partition functions. The exposition is based on works of M. Brion, A. Szenes and M. Vergne and is geared toward explicit computer realizations. In particular, the paper presents…
Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an…
Recently Corteel and Welsh outlined a technique for finding new sum-product identities by using functional relations between generating functions for cylindric partitions and a theorem of Borodin. Here, we extend this framework to include…
The polytope of integer partitions of $n$ is the convex hull of the corresponding $n$-dimensional integer points. Its vertices are of importance because every partition is their convex combination. Computation shows intriguing features of…
The space of polynomials in two real variables with values in a 2-dimensional irreducible module of a dihedral group is studied as a standard module for Dunkl operators. The one-parameter case is considered (omitting the two-parameter case…
Relations among integrals of logarithms, polylogarithms and Euler sums are presented. A unifying element being the introduction of Nielsen's generalized polylogarithms.
Using a specific form of the triple product identity, polygonal number identities are stated. Further number identities are examined that can be considered identities related to modular sets of numbers. The identities can be used to give…
It was observed that hyperlogarithms provide a tool to carry out Feynman integrals. So far, this method has been applied successfully to finite single-scale processes. However, it can be employed in more general situations. We give examples…
Classifying points in high dimensional spaces is a fundamental geometric problem in machine learning. In this paper, we address classifying points in the $d$-dimensional Hilbert polygonal metric. The Hilbert metric is a generalization of…
General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…
By using Cauchy's formula, it is known that Bernoulli numbers and Euler numbers can be represented by the contour integrals \begin{equation*} \begin{aligned} B_n&=\frac{n!}{2\pi i}\oint \frac{z}{e^z-1}\frac{d…
We show new integral representations for dilogarithm and trilogarithm functions on the unit interval. As a consequence, we also prove (1) new integral representations for Apery, Catalan constants, and Legendre chi functions of order 2, 3,…
The sum formula is a basic identity of multiple zeta values that expresses a Riemann zeta value as a homogeneous sum of multiple zeta values of a given dimension. This formula was already known to Euler in the dimension two case,…
An efficient algorithm to enumerate the vertices of a two-dimensional (2D) projection of a polytope, is presented in this paper. The proposed algorithm uses the support function of the polytope to be projected and enumerated for vertices.…