相关论文: The algebraic structure of Dyson--Schwinger equati…
We discuss a general combinatorial framework for operator ordering problems by applying it to the normal ordering of the powers and exponential of the boson number operator. The solution of the problem is given in terms of Bell and Stirling…
We present the Hopf algebra of renormalization and introduce the renormalization group equation in this framework. Some linear Schwinger--Dyson equations are studied, and exact solutions are presented. Then we study the Schwinger--Dyson…
We consider the combinatorial Dyson-Schwinger equation X=B^+(P(X)) in the non-commutative Connes-KreimerHopf algebra of planar rooted trees H, where B^+ is the operator of grafting on a root, and P a formal series. The unique solution X of…
We review the current status of nonperturbative studies of gauge field theory using the Dyson-Schwinger equation formalism and its application to hadronic physics. We begin with an introduction to the formalism and a discussion of…
The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…
Given an associative multiplication in matrix algebra compatible with the usual one or, in other words, linear deformation of matrix algebra, we construct a solution to the classical Yang-Baxter equation. We also develop a theory of such…
This paper is about the combinatorics of finite point configurations in the tropical projective space or, dually, of arrangements of finitely many tropical hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be…
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon,…
In this paper we study root multiplicities of rank 2 hyperbolic Kac-Moody algebras using the combinatorics of Dyck paths.
In this paper we describe the right-sided combinatorial Hopf structure of three Hopf algebras appearing in the context of renormalization in quantum field theory: the non-commutative version of the Fa\`a di Bruno Hopf algebra, the…
Graphs which generalize the simple or affine Dynkin diagrams are introduced. Each diagram defines a bilinear form on a root system and thus a reflection group. We present some properties of these groups and of their natural "Coxeter…
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…
Two-dimensional quadratic algebras are generalizations of Lie algebras that include the symmetry algebras of 2nd order superintegrable systems in 2 dimensions as special cases. The superintegrable systems are exactly solvable physical…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call…
We construct multiplicative renormalization for the Epstein--Glaser renormalization scheme in perturbative Algebraic Quantum Field Theory: To this end, we fully combine the Connes--Kreimer renormalization framework with the Epstein--Glaser…
A problem concerning the shift of roots of a system of homogeneous algebraic equations is investigated. Its conservation and decomposition of a multiple root into simple roots are discussed.
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.…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
Recently, Kenyon and Wilson introduced Dyck tilings, which are certain tilings of the region between two Dyck paths. The enumeration of Dyck tilings is related with hook formulas for forests and the combinatorics of Hermite polynomials. The…