Related papers: An Explicit Expression of Generating Function for …

Recently a nice work about the understanding of one-loop integrals has been done in [1] using the tricks of the projective space language associated to their Feynman parametrization. We find this language is also very suitable to deal with…

We perform a recursive reduction of one-loop $n$-point rank $R$ tensor Feynman integrals [in short: $(n,R)$-integrals] for $n\leq 6$ with $R\leq n$ by representing $(n,R)$-integrals in terms of $(n,R-1)$- and $(n-1,R-1)$-integrals. We use…

We perform a complete analytical reduction of general one-loop Feynman integrals with five and six external legs for tensors up to rank R=3 and 4, respectively. An elegant formalism with extensive use of signed minors is developed for the…

We describe a new, convenient, recursive tensor integral reduction scheme for one-loop $n$-point Feynman integrals. The reduction is based on the algebraic Davydychev-Tarasov formalism where the tensors are represented by scalars with…

Starting from the general definition of a one-loop tensor N-point function, we use its Feynman parametrization to calculate the UV-divergent part of an arbitrary tensor coefficient in the framework of dimensional regularization. In contrast…

As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces:…

We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator…

We study generating functions in the context of Rota-Baxter algebras. We show that exponential generating functions can be naturally viewed in a very special case of complete free commutative Rota-Baxter algebras. This allows us to use free…

We set up a new, flexible approach for the tensor reduction of one-loop Feynman integrals. The 5-point tensor integrals up to rank R=5 are expressed by 4-point tensor integrals of rank R-1, such that the appearance of the inverse 5-point…

We completely generalize previous results related to the counting of connected Feynman diagrams. We use a generating function approach, which encodes the Wick contraction combinatorics of the respective connected diagrams. Exact solutions…

We prove a recursion formula for generating functions of certain renormalizations of *-moments of the DT(\delta_0,1)-operator T, involving an operation \odot on formal power series and a transformation E that converts \odot to usual…

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…

Several new relationships between hypergeometric functions are found by comparing results for Feynman integrals calculated using different methods. A new expression for the one-loop propagator-type integral with arbitrary masses and…

In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…

We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and…

A \Def{composition} of a positive integer $n$ is a $k$-tuple $(\l_1, \l_2, \dots, \l_k) \in \Z_{> 0}^k$ such that $n = \l_1 + \l_2 + \dots + \l_k$. Our goal is to enumerate those compositions whose parts $\l_1, \l_2, \dots, \l_k$ avoid a…

We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…

We derive an evolution equation for the generating functional which accounts for processes for both gluon emission and recombination. In terms of color dipoles, the kernel of this equation describes evolution as a classical branching…

Uhlenbeck proved that a set of simple elements generates the group of rational loops in GL(n,C) that satisfy the U(n)-reality condition. For an arbitrary complex reductive group, a choice of representation defines a notion of rationality…

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…