[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/120694.120727acmconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
Article
Free access

Symbolic simplification of tensor expressions using symmetries, dummy indices and identities

Published: 01 June 1991 Publication History
First page of PDF

References

[1]
L.D.Landau and E.M.Lifshitz, Field Theory, (Moscow, Nauka, 1973, in Russian); J.A.Schouten, Tensor analysis for physicist, (Oxford, 1951).
[2]
A.Tr tm, Sy p. Math., (1973) 139; F.W.Hehl et ~1., t~ev. Mod. Phys., 48 (1976) 393; Yu.N.Obukhov and P.I.Pronin, Acts Physics Polonica, B19 (1988)341.
[3]
A.Erdelyi et al., Higher transcendental functions, (N.Y., MacGraw-Hill, 1953); Handbook of mathematical functions, ed. by M.Abramowitz and I.A.Stegun, (1964).
[4]
A.Ya.Rodionov and A.Yu.Taranov, Lecture Notes in Comp. Sci., 378, (Proceeding of EURO- CAL'87, 1989), p. 192.
[5]
V.A.Ilyin et al., the talk on IV International conference on computer algebra in physical research, (Dubna 1990, 22-26 May, USSR).
[6]
M.A.Naimark, Theory of group representation, (Moscow, Nauk~, 1976, ~n Russian).
[7]
B.Buchburger, @.E.Collins and R.Loos, Computer Algebra - symbolic and algebraic computation, (second edition, Springer, 1983).
[8]
A.C.He~.rn, REDUCE USER'S MANUAL, version 3.3, (The Rand publication CP78, Rev. 7.87, 1987).

Cited By

View all
  • (2017)Riemann Tensor Polynomial Canonicalization by Graph Algebra ExtensionProceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation10.1145/3087604.3087625(269-276)Online publication date: 23-Jul-2017

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
ISSAC '91: Proceedings of the 1991 international symposium on Symbolic and algebraic computation
June 1991
468 pages
ISBN:0897914376
DOI:10.1145/120694
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1991

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

ISSAC 91
Sponsor:

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)39
  • Downloads (Last 6 weeks)4
Reflects downloads up to 18 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2017)Riemann Tensor Polynomial Canonicalization by Graph Algebra ExtensionProceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation10.1145/3087604.3087625(269-276)Online publication date: 23-Jul-2017

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media