Related papers: On the evaluation of Matsubara sums
We develop a general finite-alphabet framework for Euler-type sums based on the notion of a monoidal alphabet. An alphabet of summand letters is called monoidal when it is closed under pointwise multiplication, thereby inducing the usual…
A traditional Nordhaus-Gaddum problem for a graph parameter $\beta$ is to find a (tight) upper or lower bound on the sum or product of $\beta(G)$ and $\beta(\bar{G})$ (where $\bar{G}$ denotes the complement of $G$). An $r$-decomposition…
If $G$ is a strongly connected finite directed graph, the set $\mathcal{T}G$ of rooted directed spanning trees of $G$ is naturally equipped with a structure of directed graph: there is a directed edge from any spanning tree to any other…
We introduce a general multisummability theory of formal power series in Carleman ultraholomorphic classes. The finitely many levels of summation are determined by pairwise comparable, nonequivalent weight sequences admitting nonzero…
Motivated in part by combinatorial applications to certain sum-product phenomena, we introduce unimodular graphs over finite fields and, more generally, over finite valuation rings. We compute the spectrum of the unimodular graphs, by using…
This paper describes algorithms to deal with nested symbolic sums over combinations of harmonic series, binomial coefficients and denominators. In addition it treats Mellin transforms and the inverse Mellin transformation for functions that…
Let $V$ be an infinite-dimensional vector space over a field. In a previous article, we have shown that every endomorphism of $V$ splits into the sum of four square-zero ones but also into the sum of four idempotent ones. Here, we study…
A graph G on n vertices is said to be extendable if G can be modified to form a new graph H on more than n vertices, while preserving the degrees of the vertices common to G and H. The added vertices all have the same degree and we define…
Symbolic summation as an active research topic of symbolic computation provides efficient algorithmic tools for evaluating and simplifying different types of sums arising from mathematics, computer science, physics and other areas. Most of…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
A general method to express in terms of Gauss sums the number of rational points of subschemes of projective schemes over finite fields is applied to the image of the triple embedding $\mathbb{P}^1\hookrightarrow\mathbb{P}^3$. As a…
By closely following a construction by Ganelius, we construct Faber rational functions that allow us to derive tight and explicit bounds on Zolotarev numbers. We use our results to bound the singular values of matrices, including…
Ohno's relation states that a certain sum, which we call an Ohno type sum, of multiple zeta values remains unchanged if we replace the base index by its dual index. In view of Oyama's theorem concerning Ohno type sums of finite and…
A rational homogeneous (of degree one) positive real matrix-valued function is presented as the Schur complement of a block of the linear pencil with positive semidefinite matrix coefficients. The partial derivative numerators of a rational…
We find exact identities for sums of the form \begin{equation*}\label{eq:convsumabs} \sum_{\stackrel{n_1+n_2 = n}{n_1 \in \mathbb{Z} \setminus \{ 0, n \} }} Q(n_1,n_2) \sigma_{-r_1}(n_1) \sigma_{-r_2}(n_2), \end{equation*} where…
The isovector axial vector form factors of $N \rightarrow \Delta$ transition are calculated by employing Light-cone QCD sum rules. The analytical results are analysed by both the conventional method, and also by a Monte Carlo based approach…
Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…
We study the form of the Turaev-Viro partition function Z(M) for different 3-manifolds with boundary. We show that for $S^2$ boundaries Z(M) factorizes into a term which contains the boundary dependence and another which depends only on the…
For any $m,n\in\mathbb{N}$ we first give new proofs for the following well known combinatorial identities \begin{equation*} S_n(m)=\sum\limits_{k=1}^n\binom{n}{k}\frac{(-1)^{k-1}}{k^m}=\sum\limits_{n\geq r_1\geq r_2\geq...\geq r_m\geq…
This paper develops an approach to the evaluation of quadratic Euler sums that involve harmonic numbers. The approach is based on simple integral computations of polyloga- rithms. By using the approach, we establish some relations between…