English
Related papers

Related papers: Reduction of su(N) loop tensors to trees

200 papers

We develop a pure spinor worldline formalism for computing tree-level scattering amplitudes in 11D supergravity. Focusing first on the 4-point amplitude, we demonstrate that our prescription is consistent with BRST symmetry and gauge…

High Energy Physics - Theory · Physics 2025-12-11 Max Guillen , Marcelo dos Santos , Eggon Viana

Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has already been successfully developed to handle unordered trees.…

Discrete Mathematics · Computer Science 2022-05-13 Florian Ingels , Romain Azaïs

We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that…

Formal Languages and Automata Theory · Computer Science 2015-04-30 Zoltán Fülöp , Heiko Vogler

The theory and computation of tensors with different tensor products play increasingly important roles in scientific computing and machine learning. Different products aim to preserve different algebraic properties from the matrix algebra,…

The main goal of this paper is to study the topological properties of tensors in tree-based Tucker format. These formats include the Tucker format and the Hierarchical Tucker format. A property of the so-called minimal subspaces is used for…

Numerical Analysis · Mathematics 2019-09-11 Antonio Falco , Wolfgang Hackbusch , Anthony Nouy

Neural networks with tree-based sentence encoders have shown better results on many downstream tasks. Most of existing tree-based encoders adopt syntactic parsing trees as the explicit structure prior. To study the effectiveness of…

Computation and Language · Computer Science 2018-08-30 Haoyue Shi , Hao Zhou , Jiaze Chen , Lei Li

We apply so-called tree straight-line programs to the problem of lossless compression of binary trees. We derive upper bound on the maximal pointwise redundancy (or worst-case redundancy) that improve previous bounds obtained by Zhang,…

Information Theory · Computer Science 2017-02-01 Danny Hucke , Markus Lohrey

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…

High Energy Physics - Phenomenology · Physics 2010-01-07 T. Diakonidis , J. Fleischer , T. Riemann , J. B. Tausk

Let K be the product O(n_1) x O(n_2) x ... x O(n_r) of orthogonal groups. Let V the r-fold tensor product of defining representations of each orthogonal factor. We compute a stable formula for the dimension of the K-invariant algebra of…

Representation Theory · Mathematics 2012-09-25 Lauren Kelly Williams

The perturbative approach to quantum field theories has made it possible to obtain incredibly accurate theoretical predictions in high-energy physics. Although various techniques have been developed to boost the efficiency of these…

High Energy Physics - Phenomenology · Physics 2021-05-05 Selomit Ramirez-Uribe , Roger J. Hernandez-Pinto , German Rodrigo , German F. R. Sborlini , William J. Torres Bobadilla

By a tensor we mean an element of a tensor product of vector spaces over a field. Up to a choice of bases in factors of tensor products, every tensor may be coordinatized, that is, represented as an array consisting of numbers. This note is…

Functional Analysis · Mathematics 2019-01-11 R. N. Gumerov , A. S. Sharafutdinov

The purpose of this article is to show how the isotropy subgroup of leaf permutations on binary trees can be used to systematically identify tree-informative invariants relevant to models of phylogenetic evolution. In the quartet case, we…

Quantitative Methods · Quantitative Biology 2012-04-24 J G Sumner , P D Jarvis

Employing a recent technology of tree surgery we prove a ``deletion-constriction'' formula for products of rooted spanning trees on weighted directed graphs that generalizes deletion-contraction on undirected graphs. The formula implies…

Combinatorics · Mathematics 2024-07-24 Matteo Polettini , Pedro E. Harunari , Sara Dal Cengio , Vivien Lecomte

An explicit perturbative solution to all orders is given for a general class of nonlinear differential equations. This solution is written as a sum indexed by rooted trees and uses the Green function of a linearization of the equations. The…

Pattern Formation and Solitons · Physics 2007-05-23 Stephanie Rossano , Christian Brouder

We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…

Probability · Mathematics 2018-06-20 Olivier Hénard , Pascal Maillard

The structure of r-fold tensor products of irreducible tame representations of the inductive limit U(\infty) of unitary groups U(n) are are described, versions of contragredient representations and invariants are realized on…

Mathematical Physics · Physics 2015-06-26 R. Michael Howe , Tuong Ton-That

We here give a first indication that there exists a Seiberg-Witten curve for SU(N) Seiberg-Witten theory with matter transforming in the totally antisymmetric rank three tensor representation. We present a derivation of the leading order…

High Energy Physics - Theory · Physics 2016-09-06 Henric Rhedin

We present a supersymmetric recursion relation for tree-level scattering amplitudes in N=4 super Yang-Mills. Using this recursion relation, we prove that the tree-level S-matrix of the maximally supersymmetric theory is covariant under dual…

High Energy Physics - Theory · Physics 2008-12-30 Andreas Brandhuber , Paul Heslop , Gabriele Travaglini

We introduce forest straight-line programs (FSLPs) as a compressed representation of unranked ordered node-labelled trees. FSLPs are based on the operations of forest algebra and generalize tree straight-line programs. We compare the…

Data Structures and Algorithms · Computer Science 2018-02-16 Adrià Gascón , Markus Lohrey , Sebastian Maneth , Carl Philipp Reh , Kurt Sieber

The translational invariant formulation of the coupled-cluster method is presented here at the complete SUB(2) level for a system of nucleons treated as bosons. The correlation amplitudes are solution of a non-linear coupled system of…

Nuclear Theory · Physics 2009-10-30 R. Guardiola , I. Moliner , J. Navarro , M. Portesi