Cover Image

The Syntax and Semantics of einsum

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wenig, Maurice, Rump, Paul G., Blacher, Mark, Giesen, Joachim
Format:	Preprint
Published:	2025
Subjects:	Programming Languages Machine Learning Mathematical Software Symbolic Computation F.2.2; I.1.2; I.1.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Integer Polynomial Factorization by Recombination of Real Factors: Re-evaluating an Old Technique in Modern Era
by: Iravanian, Shahriar
Published: (2024)

Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections
by: Eberly, Wayne, et al.
Published: (2007)

Dynamic Boolean Synthesis with Zero-suppressed Decision Diagrams
by: Lin, Yi, et al.
Published: (2025)

Certification of the QR factor R, and of lattice basis reducedness
by: Villard, Gilles
Published: (2007)

A Symbolic Computing Perspective on Software Systems
by: Norman, Arthur C., et al.
Published: (2024)

Instruction and Solution Probabilities as Heuristics for Inductive Programming
by: McDaid, Edward, et al.
Published: (2025)

Non-minimality of minimal telescopers explained by residues
by: Chen, Shaoshi, et al.
Published: (2025)

Power Series Composition in Near-Linear Time
by: Kinoshita, Yasunori, et al.
Published: (2024)

Data Verification is the Future of Quantum Computing Copilots
by: Song, Junhao, et al.
Published: (2026)

Performant Dynamically Typed E-Graphs in Pure Julia
by: Cheli, Alessandro, et al.
Published: (2024)

Polynomial Bounds of CFLOBDDs against BDDs
by: Zhi, Xusheng, et al.
Published: (2024)

Summa Summarum: Moessner's Theorem without Dynamic Programming
by: Danvy, Olivier
Published: (2024)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
by: de Rezende, Susanna F., et al.
Published: (2019)

Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
by: de Rezende, Susanna F., et al.
Published: (2026)

Test Case Features as Hyper-heuristics for Inductive Programming
by: McDaid, Edward, et al.
Published: (2024)

Inductive First-Order Formula Synthesis by ASP: A Case Study in Invariant Inference
by: Yang, Ziyi, et al.
Published: (2026)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
by: Conneryd, Jonas, et al.
Published: (2025)

On bounded depth proofs for Tseitin formulas on the grid; revisited
by: Håstad, Johan, et al.
Published: (2022)

Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients
by: de Rezende, Susanna F., et al.
Published: (2024)

Supercritical Tradeoffs for Monotone Circuits
by: Göös, Mika, et al.
Published: (2024)

Normalization of Quaternionic Polynomials in Coordinate-Free Quaternionic Variables in Conjugate-Alternating Order
by: Li, Hongbo, et al.
Published: (2025)

Evaluating LLM-driven User-Intent Formalization for Verification-Aware Languages
by: Lahiri, Shuvendu K.
Published: (2024)

Scattered Forest Search: Smarter Code Space Exploration with LLMs
by: Light, Jonathan, et al.
Published: (2024)

Computing with Hypergeometric-Type Terms
by: Tabuguia, Bertrand Teguia
Published: (2024)

Positivity certificates for linear recurrences
by: Ibrahim, Alaa, et al.
Published: (2023)

Separating Variables in Bivariate Polynomial Ideals: the Local Case
by: Buchacher, Manfred
Published: (2024)

Verifying First-Order Temporal Properties of Infinite-State Systems via Timers and Rankings
by: Lotan, Raz, et al.
Published: (2026)

Proving Cutoff Bounds for Safety Properties in First-Order Logic
by: Lotan, Raz, et al.
Published: (2024)

Implicit Rankings for Verifying Liveness Properties in First-Order Logic
by: Lotan, Raz, et al.
Published: (2024)

Neural Theorem Proving for Verification Conditions: A Real-World Benchmark
by: Xu, Qiyuan, et al.
Published: (2026)

Complete Reduction for Derivatives in a Transcendental Liouvillian Extension
by: Chen, Shaoshi, et al.
Published: (2026)

Complete Reduction for Derivatives in a Primitive Tower
by: Du, Hao, et al.
Published: (2025)

Recent Developments in Real Quantifier Elimination and Cylindrical Algebraic Decomposition
by: England, Matthew
Published: (2024)

Evaluating the Limitations of Local LLMs in Solving Complex Programming Challenges
by: Matotek, Kadin, et al.
Published: (2025)

Deciding One to One property of Boolean maps: Condition and algorithm in terms of implicants
by: Sule, Virendra
Published: (2023)

Complex reflection groups as differential Galois groups
by: Arreche, Carlos E., et al.
Published: (2024)

The Effect of State Representation on LLM Agent Behavior in Dynamic Routing Games
by: Goodyear, Lyle, et al.
Published: (2025)

Problems from Optimization and Computational Algebra Equivalent to Hilbert's Nullstellensatz
by: Bläser, Markus, et al.
Published: (2025)

Leveraging Test Driven Development with Large Language Models for Reliable and Verifiable Spreadsheet Code Generation: A Research Framework
by: Thorne, Simon, et al.
Published: (2025)

Smith normal forms of bivariate polynomial matrices
by: Lu, Dong, et al.
Published: (2025)