28,163 research outputs found
Sums of products of binomial coefficients mod 2 and 2-regular sequences
Wu showed that certain sums of products of binomial coefficients modulo 2 are
given by the run length transforms of several famous linear recurrence
sequences, such as the positive integers, the Fibonacci numbers, the extended
Lucas numbers, and Narayana's cows sequence. In this paper we show that the run
length transform of such sequences are 2-regular sequences. This allows us to
obtain Wu's results and some new ones using the computer program Walnut,
eliminating the need for long technical proofs.Comment: 16 page
Nested (inverse) binomial sums and new iterated integrals for massive Feynman diagrams
Nested sums containing binomial coefficients occur in the computation of
massive operator matrix elements. Their associated iterated integrals lead to
alphabets including radicals, for which we determined a suitable basis. We
discuss algorithms for converting between sum and integral representations,
mainly relying on the Mellin transform. To aid the conversion we worked out
dedicated rewrite rules, based on which also some general patterns emerging in
the process can be obtained.Comment: 13 pages LATEX, one style file, Proceedings of Loops and Legs in
Quantum Field Theory -- LL2014,27 April 2014 -- 02 May 2014 Weimar, German
Iterated Binomial Sums and their Associated Iterated Integrals
We consider finite iterated generalized harmonic sums weighted by the
binomial in numerators and denominators. A large class of these
functions emerges in the calculation of massive Feynman diagrams with local
operator insertions starting at 3-loop order in the coupling constant and
extends the classes of the nested harmonic, generalized harmonic and cyclotomic
sums. The binomially weighted sums are associated by the Mellin transform to
iterated integrals over square-root valued alphabets. The values of the sums
for and the iterated integrals at lead to new
constants, extending the set of special numbers given by the multiple zeta
values, the cyclotomic zeta values and special constants which emerge in the
limit of generalized harmonic sums. We develop
algorithms to obtain the Mellin representations of these sums in a systematic
way. They are of importance for the derivation of the asymptotic expansion of
these sums and their analytic continuation to . The
associated convolution relations are derived for real parameters and can
therefore be used in a wider context, as e.g. for multi-scale processes. We
also derive algorithms to transform iterated integrals over root-valued
alphabets into binomial sums. Using generating functions we study a few aspects
of infinite (inverse) binomial sums.Comment: 62 pages Latex, 1 style fil
A Continuous Analogue of Lattice Path Enumeration: Part II
Here are exhibited some additional results about the continuous binomial
coefficients as introduced by L. Cano and R. Diaz in [1].Comment: second versio
Cyclic derangements
A classic problem in enumerative combinatorics is to count the number of
derangements, that is, permutations with no fixed point. Inspired by a recent
generalization to facet derangements of the hypercube by Gordon and McMahon, we
generalize this problem to enumerating derangements in the wreath product of
any finite cyclic group with the symmetric group. We also give q- and (q,
t)-analogs for cyclic derangements, generalizing results of Brenti and Gessel.Comment: 14 page
- …