English
Related papers

Related papers: Combinatorial Physics, Normal Order and Model Feyn…

200 papers

In this paper, we give a general framework for the Boltzmann generation of colored objects belonging to combinatorial constructible classes. We propose an intuitive notion called profiled objects which allows the sampling of size-colored…

Discrete Mathematics · Computer Science 2009-11-17 Olivier Bodini , Alice Jacquot

This paper makes a combinatorial study of the two monoids and the two types of tableaux that arise from the two possible generalizations of the Patience Sorting algorithm from permutations (or standard words) to words. For both types of…

Combinatorics · Mathematics 2018-01-18 Alan J. Cain , António Malheiro , Fábio M. Silva

We describe how to cancel (when this is desirable) all tadpole and more generally all cephalopod Feynman diagrams in generic interacting scalar field theories to all orders in perturbation theory. This cancelation reduces the number of…

High Energy Physics - Theory · Physics 2015-10-12 Dimitri P. Skliros

We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…

Combinatorics · Mathematics 2020-10-13 Mirko D'Ovidio , Anna Chiara Lai , Paola Loreti

We reconsider a scenario in which photons and other gauge fields appear as the composite vector bosons made of the fermion pairs that may happen with or without spontaneous violation of Lorentz invariance. The class of composite models for…

High Energy Physics - Phenomenology · Physics 2021-04-14 J. L. Chkareuli

We introduce a generalization of the Dobinski relation through which we define a family of Bell-type numbers and polynomials. For all these sequences we find the weight function of the moment problem and give their generating functions. We…

Quantum Physics · Physics 2009-11-11 P Blasiak , A Horzela , K A Penson , A I Solomon

The Rooted Maps Theory, a branch of the Theory of Homology, is shown to be a powerful tool for investigating the topological properties of Feynman diagrams, related to the single particle propagator in the quantum many-body systems. The…

Nuclear Theory · Physics 2017-07-13 A. Prunotto , W. M. Alberico , P. Czerski

Machine learning on graphs, especially using graph neural networks (GNNs), has seen a surge in interest due to the wide availability of graph data across a broad spectrum of disciplines, from life to social and engineering sciences. Despite…

We classify the unitary, renormalizable, Lorentz violating quantum field theories of interacting scalars and fermions, obtained improving the behavior of Feynman diagrams by means of higher space derivatives. Higher time derivatives are not…

High Energy Physics - Theory · Physics 2008-11-26 Damiano Anselmi , Milenko Halat

A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…

Combinatorics · Mathematics 2026-03-12 Juliann Geraci , Alexander B. Kunin , Alexandra Seceleanu

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…

Mathematical Physics · Physics 2020-05-12 Erick Ramon Castro , Itzhak Roditi

In this talk we discuss mathematical structures associated to Feynman graphs. Feynman graphs are the backbone of calculations in perturbative quantum field theory. The mathematical structures -- apart from being of interest in their own…

Mathematical Physics · Physics 2009-12-23 Christian Bogner , Stefan Weinzierl

This paper establishes a novel combinatorial framework at the intersection of Lie theory and algebraic combinatorics, based on a generalization of the Kostant game. We begin by reviewing the foundations of root systems, the classification…

Combinatorics · Mathematics 2026-02-06 Juan Sebastián Cortés-Cruz

Ordering the collection of states of a given automaton starting from an order of the underlying alphabet is a natural move towards a computational treatment of the language accepted by the automaton. Along this path, Wheeler \emph{graphs}…

Formal Languages and Automata Theory · Computer Science 2021-06-14 Giovanna D'Agostino , Davide Martincigh , Alberto Policriti

The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…

Geometric Topology · Mathematics 2016-01-14 Arnaud Mortier

We consider finite iterated generalized harmonic sums weighted by the binomial $\binom{2k}{k}$ in numerators and denominators. A large class of these functions emerges in the calculation of massive Feynman diagrams with local operator…

High Energy Physics - Theory · Physics 2015-06-22 J. Ablinger , J. Blümlein , C. G. Raab , C. Schneider

I review the formalism, Feynman rules, and combinatorics that constrain a field to propagate ``classically", strictly in tree diagrams, either by itself, or interacting with other, purely quantum fields. The perturbation theory is…

High Energy Physics - Theory · Physics 2026-02-03 Dimitrios Metaxas

We study classically unstable string type configurations and compute the renormalized vacuum polarization energies that arise from fermion fluctuations in a 2+1 dimensional analog of the standard model. We then search for a minimum of the…

High Energy Physics - Theory · Physics 2008-11-26 N. Graham , M. Quandt , O. Schroeder , H. Weigel

Bosonic colored group field theory is considered. Focusing first on dimension four, namely the colored Ooguri group field model, the main properties of Feynman graphs are studied. This leads to a theorem on optimal perturbative bounds of…

High Energy Physics - Theory · Physics 2010-12-15 Joseph Ben Geloun , Jacques Magnen , Vincent Rivasseau

Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…

Combinatorics · Mathematics 2025-03-05 David Serena , William J Buchanan