Feynman Identity: a special case. II

Let (W,S) be a Coxeter system of affine type D, and let TL(W) the corresponding generalized Temperley-Lieb algebra. In this extended abstract we define an infinite dimensional associative algebra made of decorated diagrams which is isomorphic to TL(W). Moreover, we describe an explicit basis for such an algebra of diagrams which is in bijective correspondence with the classical monomial basis of TL(W), indexed by the fully commutative elements of W.

In this paper we use the combinatorics of alcove walks to give a uniform combinatorial formula for Macdonald polynomials for all Lie types. These formulas are generalizations of the formulas of Haglund-Haiman-Loehr for Macdonald polynoimals of type GL(n). At q=0 these formulas specialize to the formula of Schwer for the Macdonald spherical function in terms of positively folded alcove walks and at q=t=0 these formulas specialize to the formula for the Weyl character in terms ...

We give a summary of recent progress on the signed area enumeration of closed walks on planar lattices. Several connections are made with quantum mechanics and statistical mechanics. Explicit combinatorial formulae are proposed which rely on sums labelled by the multicompositions of the length of the walks.

The Gelfand-Kirillov dimension is a well established quantity to classify the growth of infinite dimensional algebras. In this article we introduce the algebraic entropy for path algebras. For the path algebras, Leavitt path algebras and the path algebra of the extended (double) graph, we compare the Gelfand-Kirillov dimension and the entropy. We give a complete classification of path algebras over finite graphs by dimension, Gelfand-Kirillov dimension and algebraic entropy. ...

This is a simple mathematical introduction into Feynman diagram technique, which is a standard physical tool to write perturbative expansions of path integrals near a critical point of the action. I start from a rigorous treatment of a finite dimensional case (which actually belongs more to multivariable calculus than to physics), and then use a simple "dictionary" to translate these results to an infinite dimensional case. The standard methods such as gauge-fixing and Fadd...

In this note, we find a combinatorial identity which is closely related to the multi-dimensional integral $\gamma_{m}$ in the study of divisor functions. As an application, we determine the finite dual of the group algebra of infinite dihedral group.

This paper describes algorithms for the exact symbolic computation of period integrals on moduli spaces $\mathcal{M}_{0,n}$ of curves of genus $0$ with $n$ ordered marked points, and applications to the computation of Feynman integrals.

The Feynman rules assign to every graph an integral which can be written as a function of a scaling parameter L. Assuming L for the process under consideration is very small, so that contributions to the renormalizaton group are small, we can expand the integral and only consider the lowest orders in the scaling. The aim of this article is to determine specific combinations of graphs in a scalar quantum field theory that lead to a remarkable simplification of the first non-tr...

We give a uniform and combinatorial proof of the general identity appearing in the work of He-Nie-Yu on the affine Deligne-Lusztig varieties with finite Coxeter part.

In 2015, the author proved combinatorially character formulas expressing sums of the (formal) dimensions of irreducible representations of symplectic groups, refining some works of Nekrasov and Okounkov, Han, King, and Westbury. In this article, we obtain generalizations of these character formulas, by using a bijection on integer partitions, namely the Littlewood decomposition, for which we prove new properties. As applications, we derive signed generating functions for subs...