Related papers: Reduction of Multiple Harmonic Sums and Harmonic P…

We determine, by hierarchy, dependencies between higher order linear symmetries which occur when generating them using recursion operators. Thus, we deduce a formula which gives the number of independent generalized symmetries (basis) of…

Utilizing spectral residues of parameterized, recursively defined sequences, we develop a general method for generating identities of composition sums. Specific results are obtained by focusing on coefficient sequences of solutions of first…

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

We consider the bar complex of a monomial non-unital associative algebra $A=k \langle X \rangle / (w_1,...,w_t)$. It splits as a direct sum of complexes $B_w$, defined for any fixed monomial $w=x_1...x_n \in A$. We give a simple argument,…

For $b>1$ and $\alpha\beta$ a string of two digits in base $b$, let $K_1$ be the subsum of the harmonic series with only those integers having exactly one occurrence of $\alpha\beta$. We obtain a theoretical representation of such $K_1$…

This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave)…

Analogous to the sl(n) case, we address the computation of the index of seaweed subalgebras of sp(2n) by introducing graphical representations called symplectic meanders. Formulas for the algebra's index may be computed by counting the…

Any rational number can be factored into a product of several rationals whose sum vanishes. This simple but nontrivial fact was suggested as a problem on a maths olympiad for high-school students. We completely solve similar questions in…

In this paper we study restricted sum formulas involving alternating Euler sums which are defined by \zeta(s_1,...,s_{d};\epsilon_1,...,\epsilon_d)=\sum_{n_1>...>n_d\ge 1}\frac{\epsilon_1^{n_1}... \epsilon_{d}^{n_d}}{n_1^{s_1}...…

We introduce derivations on the algebra of multiple harmonic q-series and show that they generate linear relations among the q-series which contain the derivation relations for a q-analogue of multiple zeta values due to Bradley. As a…

Let $k \leq n$ be nonnegative integers and let $\lambda$ be a partition of $k$. S. Griffin recently introduced a quotient $R_{n,\lambda}$ of the polynomial ring $\mathbb{Q}[x_1, \dots, x_n]$ in $n$ variables which simultaneously generalizes…

We offer several new summation identities involving harmonic numbers, odd harmonic numbers, and Fibonacci numbers. Our results are derived using three different approaches: partial summation, polynomial identities and binomial…

We present explicit formulas for the following family of parametric binomial sums involving harmonic numbers for $p=0,1,2$ and $|t|\leq1$. $$ \sum_{k=1}^{\infty}\frac{H_{k-1}t^k}{k^p\binom{n+k}{k}}\quad \mbox{and}\quad…

In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…

We introduce an algebra which describes the multiplication structure of a family of q-series containing a q-analogue of multiple zeta values. The double shuffle relations are formulated in our framework. They contain a q-analogue of…

We define Boolean algebras in the linear context and study its symmetric powers. We give explicit formulae for products in symmetric Boolean algebras of various dimensions. We formulate symmetric forms of the inclusion-exclusion principle.

Enumerating all solutions of a relational algebra equation is a natural and powerful operation which, when added as a query language primitive to the nested relational algebra, yields a query language for nested relational databases,…

Multiple elliptic polylogarithms can be written as (multiple) integrals of products of basic hypergeometric functions. The latter are computable, to arbitrary precision, using a q-difference equation and q-contiguous relations.

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

We first introduce the Hamming distance between two strings. Then, we apply this concept to the representations of whole numbers in base n for all positive integers n > 2. We claim that a simple formula exists for the sum of all Hamming…