Skip to main content
archive Search
Submit Donate Log in

Press Enter to search · Advanced search

Symbolic Computation

  • New submissions
  • Cross-lists

See recent articles

Showing new listings for Monday, 16 November 2026

Total of 2 entries
Showing up to 2000 entries per page: fewer | more | all

New submissions (showing 1 of 1 entries)

[1] arXiv:2611.17359 [pdf, html, other]
Title: fieldsmith: Automated symbolic derivation in classical field theory and gauge theory from LaTeX input
Nikola Mirkov
Comments: 40 pages
Subjects: Symbolic Computation (cs.SC); High Energy Physics - Theory (hep-th)

We present fieldsmith, an open-source Python library for the automated derivation of analytical results in classical field theory, and non-abelian gauge theories. A Lagrangian is entered the way it is written on a blackboard, in LaTeX index notation, and the library produces and verifies Euler-Lagrange equations (of arbitrary derivative order, on flat or curved backgrounds), Noether currents and identities, canonical and Hilbert energy-momentum tensors, canonical momenta and Hamiltonians, local Poisson brackets and a Dirac-Bergmann constraint analysis with degree-of-freedom counting, linearised wave equations and dispersion relations, gauge-covariant derivatives and field strengths for products of unitary groups, and mass spectra after spontaneous symmetry breaking. A fitting routine translates component-level output back into covariant index notation, and a grading module checks students' submitted field equations, identities and conserved currents. The implementation is a compact (about 2,700 lines) layer on top of SymPy: tensors are stored by components with labelled, variance-aware slots, and every statement is established by exact symbolic computation rather than pattern matching. This document is the companion guide to the library. It explains the intent and design, describes the algorithms, and then works through eighteen self-checking examples, ranging from the Klein-Gordon field to the BPST instanton and the 't Hooft-Polyakov monopole, each preceded by the background physics needed to follow it. The examples double as a compact introduction to classical field theory and gauge theory as seen through a computational lens. We are explicit about the limitations of the approach.

Cross submissions (showing 1 of 1 entries)

[2] arXiv:2611.17737 (cross-list from cs.PL) [pdf, html, other]
Title: Super-Analysis for Aggressive yet Scalable Compiler Optimization
Amirali Ebrahimzadeh, Amir Shaikhha
Subjects: Programming Languages (cs.PL); Symbolic Computation (cs.SC)

Aggressive compiler optimization today occupies two distant extremes. Conventional optimizers run in milliseconds but reason through ad-hoc heuristics that miss opportunities; superoptimizers synthesize faster code but take hours, confining them to small kernels and offline use. We introduce solver-based super-analysis, a middle ground that uses expensive SMT-based analysis while transformations remain conventional, avoiding program synthesis entirely. The key argument for super-analysis is that conventional compilers have rich transformation rules, but proving them to be safe requires complex reasoning: proving a safety check dead often needs facts from three independent LLVM analyses simultaneously, a conjunctive entailment problem suited to an SMT solver, not to any single dataflow pass.
We instantiate super-analysis in ODeSSy, an LLVM pass that proves sanitizer traps and native-language safety checks unreachable and removes them. One mechanism serves four frontend languages and yields speedups in each, including a 3.78x speedup for a GEMM implemented in Julia. A further solver-based optimization, guard synthesis, handles checks that are not dead for every input: the solver synthesizes a cheap invariant safety guard under which a fast check-free loop is cloned, speeding up a Swift Base64 encoder by 1.44x and a Julia LZ77 compressor by 4.01x. Compared with Souper, the synthesizing superoptimizer for LLVM, ODeSSy removes more safety checks in significantly less time, making it viable as an online compiler pass.

Total of 2 entries
Showing up to 2000 entries per page: fewer | more | all
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)