SYMBOLIC COMPUTATION WITH FERMIONS

被引:1
|
作者
HUGHES, DI [1 ]
机构
[1] UNIV CAMBRIDGE,DEPT APPL MATH & THEORET PHYS,CAMBRIDGE CB3 9EW,ENGLAND
关键词
D O I
10.1016/S0747-7171(08)80164-2
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A set of REDUCE routines for manipulating operators which anticommute amongst themselves is described. These routines have applications in theories such as supergravity where anticommuting operators are used to represent fermions. The Dirac bracket of the supersymmetry constraints arising in a quantum cosmological model based on N=1 supergravity coupled to a massless scalar multiplet is calculated as an example. © 1990, Academic Press Limited. All rights reserved.
引用
收藏
页码:657 / 664
页数:8
相关论文
共 50 条
  • [1] SYMBOLIC COMPUTATION
    不详
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 1985, 1 (01) : 1 - 6
  • [2] Symbolic WCET Computation
    Ballabriga, Clement
    Forget, Julien
    Lipari, Giuseppe
    [J]. ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2018, 17 (02)
  • [3] Methodologies of Symbolic Computation
    Davenport, James
    [J]. ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION (AISC 2018), 2018, 11110 : 19 - 33
  • [4] Symbolic computation packages
    Bramley, R
    [J]. IEEE COMPUTATIONAL SCIENCE & ENGINEERING, 1997, 4 (01): : 89 - 89
  • [5] On the Complexity of Symbolic Computation
    van der Hoeven, Joris
    [J]. PROCEEDINGS OF THE 2022 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, ISSAC 2022, 2022, : 3 - 12
  • [6] SYMBOLIC MATHEMATICAL COMPUTATION
    WOLFRAM, S
    [J]. COMMUNICATIONS OF THE ACM, 1985, 28 (04) : 390 - 394
  • [7] SYMBOLIC COMPUTATION AND CHEMISTRY
    BALABAN, AT
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1985, 203 : 68 - 79
  • [8] The value of symbolic computation
    Tabor, W
    [J]. ECOLOGICAL PSYCHOLOGY, 2002, 14 (1-2) : 21 - 51
  • [9] Symbolic computation with sequences
    M. Petkovšek
    [J]. Programming and Computer Software, 2006, 32 : 65 - 70
  • [10] Symbolic computation with sequences
    Petkovsek, M
    [J]. PROGRAMMING AND COMPUTER SOFTWARE, 2006, 32 (02) : 65 - 70