๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Symbolic computation with fermions

โœ Scribed by D.I. Hughes


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
368 KB
Volume
10
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 ferminns. The Dirae 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.


๐Ÿ“œ SIMILAR VOLUMES


Symbolic computation in structural engin
โœ M.N. Pavloviฤ‡ ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 164 KB

Nowadays computers can perform symbolic calculations--in addition to mere numerical computations for which they were originally designed--and this opens up exciting possibilities in structural engineering and mechanics. Until relatively recently, this computer-algebra option was hardly exploited exc

Symbolic computation of longitudinal imp
โœ Bin Hu; Peter Eberhard ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 158 KB

Wave propagation due to longitudinal impacts on thin rods is a classical problem of mechanics, but only few completely analytical results for longitudinal wave propagation are available in literature. In this paper, it is shown that even such complicated impact problems can nowadays be solved using

A Preliminary Study of the Burgers Equat
โœ Russell G. Derickson; Roger A. Pielke Sr. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 204 KB

A novel approach based on recursive symbolic computation is introduced for the approximate analytic solution of the Burgers equation. Once obtained, appropriate numerical values can be inserted into the symbolic solution to explore parametric variations. The solution is valid for both inviscid and v

Fermionic Quantum Computation
โœ Sergey B. Bravyi; Alexei Yu. Kitaev ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 153 KB

We define a model of quantum computation with local fermionic modes (LFMs)-sites which can be either empty or occupied by a fermion. With the standard correspondence between the Foch space of m LFMs and the Hilbert space of m qubits, simulation of one fermionic gate takes O(m) qubit gates and vice v

Computable symbolic dynamics
โœ Douglas Cenzer; S. Ali Dashti; Jonathan L. F. King ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 149 KB

## Abstract We investigate computable subshifts and the connection with effective symbolic dynamics. It is shown that a decidable ฮ ^0^~1~ class __P__ is a subshift if and only if there exists a computable function __F__ mapping 2^โ„•^ to 2^โ„•^ such that __P__ is the set of itineraries of elements of 2

Symbolic Computation and Differential Eq
โœ John Carminati; Khai Vu ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 296 KB

In this paper we discuss the package DESOLV written for the algebraic computing system MAPLE. DESOLV has routines which will systematically obtain with considerably flexibility, all resulting integrability conditions for any system of linear, coupled, partial differential equations. It also contains