Graph Grammars, Insertion Lie Algebras, and Quantum Field Theory
نویسندگان
چکیده
Graph grammars extend the theory of formal languages in order to model distributed parallelism in theoretical computer science. We show here that to certain classes of context-free and context-sensitive graph grammars one can associate a Lie algebra, whose structure is reminiscent of the insertion Lie algebras of quantum field theory. We also show that the Feynman graphs of quantum field theories are graph languages generated by a theory dependent graph grammar.
منابع مشابه
Combinatorics of (perturbative) Quantum Field Theory
We review the structures imposed on perturbative QFT by the fact that its Feynman diagrams provide Hopf and Lie algebras. We emphasize the role which the Hopf algebra plays in renormalization by providing the forest formulas. We exhibit how the associated Lie algebra originates from an operadic operation of graph insertions. Particular emphasis is given to the connection with the Riemann–Hilber...
متن کاملArithmetic Deformation Theory of Lie Algebras
This paper is devoted to deformation theory of graded Lie algebras over Z or Zl with finite dimensional graded pieces. Such deformation problems naturally appear in number theory. In the first part of the paper, we use Schlessinger criteria for functors on Artinian local rings in order to obtain universal deformation rings for deformations of graded Lie algebras and their graded representations...
متن کاملA short survey on pre-Lie algebras
We give an account of fundamental properties of pre-Lie algebras, and provide several examples borrowed from various domains of Mathematics and Physics : Algebra, Combinatorics, Quantum Field Theory and Numerical Analysis.
متن کاملSome properties of nilpotent Lie algebras
In this article, using the definitions of central series and nilpotency in the Lie algebras, we give some results similar to the works of Hulse and Lennox in 1976 and Hekster in 1986. Finally we will prove that every non trivial ideal of a nilpotent Lie algebra nontrivially intersects with the centre of Lie algebra, which is similar to Philip Hall's result in the group theory.
متن کاملDNA computing, insertion of words and left-symmetric algebras
Theoretical computer scientists working on DNA computing have developed models of computation based on the processes of molecular genetics. Much of this work is devoted to the study of biologically motivated operations (“biooperations”) on formal languages. A detailed analysis of families of languages defined by basic bio-operations appears in the work of Daley, Kari and McQuillan [4]. For gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematics in Computer Science
دوره 9 شماره
صفحات -
تاریخ انتشار 2015