Related papers: Exact formula for 1-lower run overpartitions
We obtain exact, simple and very compact expressions for the linearization coefficients of the products of orthogonal polynomials; both the conventional Clebsch-Gordan-type and the modified version. The expressions are general depending…
In this paper, we establish the first variational formula and its Euler-Lagrange equation for the total $2p$-th mean curvature functional $\mathcal {M}_{2p}$ of a submanifold $M^n$ in a general Riemannian manifold $N^{n+m}$ for…
We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1) First we show that…
In this note we consider several kind of partition functions of one-dimensional models with nearest - neighbor interactions $I_n, n\in \mathbf{Z}$ and spin values $\pm 1$. We derive systems of recursive equations for each kind of such…
We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.
Integrals for the product of unitary-matrix elements over the U(n) group will be discussed. A group-theoretical formula is available to convert them into a multiple sum, but unfortunately the sums are often tedious to compute. In this…
A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…
This paper presents an iterative scheme that converges to the solution of a pseudo-monotone variational inequality problem in the setting of $\mathbb{R}^{n}$. Traditional methods often require projections onto the feasible set…
We outline a method of calculation of partition functions of orientable manifolds with fluctuating metric and perform the calculation for the specific case of the unit interval.
In this paper we study a max-min $k$-partition problem on a weighted graph, that could model a robust $k$-coalition formation. We settle the computational complexity of this problem as complete for class $\Sigma_2^P$. This hardness holds…
We present a program to calculate the total cross section for top-quark pair production in hadronic collisions. The program takes into account recent theoretical developments such as approximate next-to-next-to-leading order perturbative…
We present a new general algorithm for calculating arbitrary jet cross sections in arbitrary scattering processes to next-to-leading accuracy in perturbative QCD. The algorithm is based on the subtraction method. The key ingredients are new…
MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…
I illustrate a general formalism based upon the subtraction method for the calculation of next-to-leading order QCD cross sections for any number of jets in any type of hard collisions. I discuss the implementation of this formalism in a…
Consider an ordinary generating function $\sum_{k=0}^{\infty}c_kx^k$, of an integer sequence of some combinatorial relevance, and assume that it admits a closed form $C(x)$. Various instances are known where the corresponding truncated sum…
Exterior power operations on the higher $K$-groups of a quasi-compact scheme have recently been constructed by Taelman and the authors by purely algebraic means. In this paper, we prove two formulae that help to compute these operations.…
In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…
An M-partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so…
We develop a simple and intuitive identity for calculating expectations of weighted $k$-fold sums over particles in branching processes, generalising the well-known many-to-one lemma.
This article presents two methods, in parallel, of solving more complex integrals, among which is the Poisson's integral, in order to emphasize the obvious advantages of a new method of integration, which uses the supermathematics circular…