Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “ALGEBRA”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Commutative Algebra Modeling in Materials Science – A Case Study on Metal–Organic Frameworks (MOFs)

Metal-organic frameworks (MOFs) are a class of important crystalline and highly porous materials whose hierarchical geometry and chemistry hinder interpretable predictions in materials properties. Commutative algebra is a branch of abstract algebra that has been rarely applied in data and material sciences. We introduce the first ever commutative algebra modeling and prediction in materials science. Specifically, category-specific commutative algebra (CSCA) is proposed as a new framework for MOF representation and learning. It integrates element-based categorization with multiscale algebraic invariants to encode both local coordination motifs and global network organization of MOFs. These algebraically consistent, chemically aware representations enable compact, interpretable, and data efficient modeling of MOF properties such as Henry’s constants and uptake capacities for common gases. Compared to traditional geometric and graph-based approaches, CSCA achieves comparable or superior predictive accuracy while substantially improving interpretability and stability across data sets. By aligning commutative algebra with the chemical hierarchy, the CSCA establishes a rigorous and generalizable paradigm for understanding structure and property relationships in porous materials and provides a nonlinear algebra-based framework for data-driven material discovery.

Khaemba, Caleb S.↗
DOE OSTI2025

CAML: Commutative Algebra Machine Learning─A Case Study on Protein–Ligand Binding Affinity Prediction

Recently, Suwayyid and Wei introduced commutative algebra as an emerging paradigm for machine learning and data science. In this work, we propose commutative algebra machine learning (CAML) for the prediction of protein−ligand binding affinities. Specifically, we apply persistent Stanley−Reisner theory, a key concept in combinatorial commutative algebra, to the affinity predictions of protein−ligand binding and metalloprotein−ligand binding. We present three new algorithms, i.e., element-specific commutative algebra, category-specific commutative algebra, and commutative algebra on bipartite complexes, to tackle the complexity of data involved in (metallo) protein−ligand complexes. We show that the proposed CAML outperforms other state-of-theart methods in (metallo) protein−ligand binding affinity predictions, indicating the great potential of commutative algebra learning.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Enabling Efficient Sparse Computations using Linear Algebra Aware Compilers

This project developed the LAPIS compiler framework, built on the Multilevel Intermediate Representation (MLIR), to optimize sparse linear algebra operations and support performance portability across diverse architectures. The main innovation of LAPIS is the Kokkos dialect, which allows for lowering codes from a high productivity language to different architectures in an elegant way. The dialect also allows the conversion of lower-level MLIR code to C++ Kokkos code, facilitating the integration of scientific machine learning (SciML) models into applications. To extend LAPIS for distributed memory architectures, a new partition dialect was created to manage the distribution of sparse tensors and express communication patterns for sparse linear algebra operations. This dialect also supports the distributed execution of operators and includes algorithmic optimizations to minimize communication to improve performance. The project also demonstrates that MLIR can enable effective linear algebra-level optimizations, improving performance on different GPUs for both sparse and dense linear algebra kernels. Key applications of LAPIS include sparse linear algebra and graph kernels, TenSQL, a relational database management solution built on GraphBLAS, and the development of subgraph isomorphism and monomorphism kernels, showcasing performance portability. In summary, the LAPIS framework supports productivity, performance, portability, and distributed memory execution, while also enabling linear algebra-level optimizations that are challenging in traditional programming languages, with successful applications ranging from simple sparse linear algebra to complex graph kernels.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The algebraic structure of gravitational scrambling

We introduce a new algebraic framework to describe gravitational scrambling, including the semiclassical limit of any out-of-time-order correlation function that is built out of operator insertions separated by approximately the scrambling time. In two dimensions, the scrambling algebra, which we call a modular-twisted product, is defined in terms of two copies of the Leutheusser-Liu half-sided modular inclusion of von Neumann algebras; these describe early- and late-time operators respectively. In limits where the separation between insertions is taken to be either significantly greater or smaller than the scrambling time, the modular-twisted product reduces, respectively, to free- and tensor-product algebras that were previously studied in [arXiv:2209.10454]. In a sense, the modular-twisted product interpolates between these two products. Including the Hamiltonian in the scrambling algebra leads to a Type II$_\infty$ von Neumann algebra with finite renormalized entropies that interpolate between single-QES and multi-QES phases. We also describe how to generalize the modular-twisted product algebra to higher dimensions, including spatially localized boundary excitations.

FOS: Physical sciences↗
DOE OSTI2025

Analyzing the Quantum Approximate Optimization Algorithm: Ansätze, Symmetries, and Lie Algebras

The quantum approximate optimization algorithm (QAOA) has been proposed as a method to obtain approximate solutions for combinatorial optimization tasks. In this work, we study the underlying algebraic properties of three QAOA ansätze for the maximum-cut problem on connected graphs, while focusing on the generated Lie algebras as well as their invariant subspaces. Specifically, we analyze the standard QAOA ansatz as well as the orbit and multiangle ansätze. We are able to fully characterize the Lie algebras of the multiangle ansatz across arbitrary connected graphs, finding that they only fall into one of just six families. Aside from the cycle and path graphs, the Lie dimensions for every graph are exponentially large in the system size, meaning that multiangle ansätze are extremely prone to exhibiting barren plateaus. Then, a similar quasi-graph-independent Lie-algebraic characterization beyond the multiangle ansatz is impeded as the circuit exhibits additional “hidden” symmetries besides those naturally arising from a certain parity-superselection operator and all automorphisms of the considered graph. Disregarding the “hidden” symmetries, we can upper bound the dimensions of the orbit and the standard Lie algebras, and the dimensions of the associated invariant subspaces are determined via explicit character formulas. To finish, we conjecture that (for most graphs) the standard Lie algebras have only components that are either exponential or that grow, at most, polynomially with the system size. This would imply that the QAOA is either prone to barren plateaus or classically simulable. More generally, our work provides a symmetry framework and tools to analyze any desired variational quantum algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

SODAs: sparse optimization for the discovery of differential and algebraic equations

Differential-algebraic equations (DAEs) integrate ordinary differential equations (ODEs) with algebraic constraints, providing a fundamental framework for developing models of dynamical systems characterized by time-scale separation, conservation laws and physical constraints. While sparse optimization has revolutionized model development by allowing data-driven discovery of parsimonious models from a library of possible equations, existing approaches for dynamical systems assume DAEs can be reduced to ODEs by eliminating variables before model discovery. This assumption limits the applicability of such methods for DAE systems with unknown constraints and time scales. We introduce sparse optimization for differential-algebraic systems (SODAs), a data-driven method for the identification of DAEs in their explicit form. By discovering the algebraic and dynamic components sequentially without prior identification of the algebraic variables, this approach leads to a sequence of convex optimization problems. It has the advantage of discovering interpretable models that preserve the structure of the underlying physical system. To this end, SODAs improves since SODAs is singular numerical stability when handling high correlations between library terms, caused by near-perfect algebraic relationships, by iteratively refining the conditioning of the candidate library. We demonstrate the performance of our method on biological, mechanical and electrical systems, showcasing its robustness to noise in both simulated time series and real-time experimental data.

DAE↗
DOE OSTI2024

Algebraic structures in closed superstring field theory, homotopy transfer, and effective actions

A consistent action for heterotic and type II superstring field theory was recently proposed by Sen. We give an algebraic formulation of this action in terms of certain twisted L ∞ algebra. We further show that Sen’s Wilsonian effective superstring field action can be obtained using homotopy transfer and the effective theory also possesses the algebraic structure of a twisted L ∞ algebra. Published by the American Physical Society 2024

Singh, Ranveer Kumar↗
DOE OSTI2025

Online energy consumption forecast for battery electric buses using a learning-free algebraic method

Accurately predicting the energy consumption plays a vital role in battery electric buses (BEBs) route planning and deployment. Based on the algebraic derivative estimation, we present a novel method to forecast the energy consumption in real time. In contrast to the mainstream machine-learning-based methods, the proposed method does not require access to the historical energy consumption data. It eliminates the time-consuming and computationally expensive offline training. Consequently, its prediction performance is not constrained by the quantity and quality of the training data. Moreover, the method can swiftly adapt to new situations not included in the previous driving cycles, which makes it especially suitable for emerging transport modes, e.g., on-demand transit services. In addition, its online execution only involves algebraic calculations, yielding superior calculation efficiency. Using real-world data, we comprehensively compare the performance of the proposed learning-free algebraic method with multiple representative machine-learning-based methods. Finally, the advantages and limitations of the proposed method are discussed in detail.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

Algebraic ER=EPR and complexity transfer

We propose an algebraic definition of ER=EPR in the G N → 0 limit, which associates bulk spacetime connectivity/disconnectivity to the operator algebraic structure of a quantum gravity system. The new formulation not only includes information on the amount of entanglement, but also more importantly the structure of entanglement. We give an independent definition of a quantum wormhole as part of the proposal. This algebraic version of ER=EPR sheds light on a recent puzzle regarding spacetime disconnectivity in holographic systems with $\mathcal{O}$(1/G N ) entanglement. We discuss the emergence of quantum connectivity in the context of black hole evaporation and further argue that at the Page time, the black hole-radiation system undergoes a transition involving the transfer of an emergent type III 1 subalgebra of high complexity operators from the black hole to radiation. We argue this is a general phenomenon that occurs whenever there is an exchange of dominance between two competing quantum extremal surfaces.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Quantum many-body linear algebra, Hamiltonian moments, and a coupled-cluster inspired framework

Here, we propose a general strategy to develop quantum many-body approximations of primitives in linear algebra algorithms. As a practical example, we introduce a coupled-cluster inspired framework to produce approximate Hamiltonian moments and demonstrate its application in various linear algebra algorithms for ground state estimation. Through numerical examples, we illustrate the difference between the ground-state energies arising from quantum many-body linear algebra and those from the analogous many-body perturbation theory. Our results support the general idea of designing quantum many-body approximations outside of perturbation theory, providing a route to new algorithms and approximations.

Algorithms and data structure↗
DOE OSTI2025

Lie-algebraic classical simulations for quantum computing

The classical simulation of quantum dynamics plays an important role in our understanding of quantum complexity and in the development of quantum technologies. Efficient techniques such as those based on the Gottesman-Knill theorem for Clifford circuits, tensor networks for low entanglement-generating circuits, or Wick's theorem for fermionic Gaussian states have become central tools in quantum computing. In this work, we contribute to this body of knowledge by presenting a framework for classical simulations, dubbed “𝔤-sim”, which is based on the underlying Lie algebraic structure of the dynamical process. When the dimension of the algebra grows at most polynomially in the system size, there exist observables for which the simulation is efficient. Indeed, we show that 𝔤-sim enables new regimes for classical simulations, is able to deal with certain forms of noise in the evolution, as well as can be used to tackle several paradigmatic variational and nonvariational quantum computing tasks. For the former, we perform Lie-algebraic simulations to train and optimize parametrized quantum circuits (thus effectively showing that some variational models can be dequantized), design enhanced parameter initialization strategies, solve tasks of quantum circuit synthesis, and train a quantum-phase classifier. For the latter, we report large-scale noiseless and noisy simulations on benchmark problems. By comparing the limitations of 𝔤-sim and certain Wick's theorem-based simulations, we find that the two methods become inefficient for different types of states or observables, hinting at the existence of distinct, nonequivalent resources for classical simulation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Lie-algebraic Kähler sigma models with U(1) isotropy

We discuss various questions that emerge in connection with the Lie-algebraic deformation of the sigma model in two dimensions. First, we supersymmetrize the original model endowing it with the minimal and extended supersymmetries. Then we derive the general hypercurrent anomaly in both cases. In the latter case this anomaly is one-loop but is somewhat different from the standard expressions one can find in the literature because the target manifold is nonsymmetric. We also show how to introduce the twisted masses and the term, and study the Bogomol’nyi–Prasad–Sommerfield equation for instantons, in particular the value of the topological charge. Then we demonstrate that the second loop in the function of the nonsupersymmetric Lie-algebraic sigma model is due to an infrared effect. To this end we use a supersymmetric regularization. We also conjecture that the above statement is valid for higher loops too, similar to the parallel phenomenon in four-dimensional super-Yang-Mills. In the second part of the paper we develop a special dimensional reduction—namely, starting from the two-dimensional Lie-algebraic model we arrive at a quasi-exactly solvable quantum-mechanical problem of the Lamé type.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

scikit-SUNDAE ((SUN)DIALS Differential Algebraic Equations) [SWR-24-137]

Scikit-SUNDAE provides Python bindings to SUNDIALS integrators. The implicit differential algebraic (IDA) solver and C-based variable-coefficient ordinary differential equations (CVODE) solver are both included. The name SUNDAE combines (SUN)DIALS and DAE, which stands for differential algebraic equations. Solvers specific to DAE problems are not frequently available in Python. An ordinary differential equation (ODE) solver is also included for completeness. ODEs can be categorized as a subset of DAEs (i.e., DAEs with no algebraic constraints). https://pypi.org/project/scikit-sundae

Randall, Corey↗
DOE OSTI2024

Non-chiral vertex operator algebra associated to Lorentzian lattices and Narain CFTs

Frenkel, Lepowsky, and Meurman constructed a vertex operator algebra (VOA) associated to any even, integral, Euclidean lattice. In the language of physics, these are examples of chiral conformal field theories (CFT). In this paper, we define non-chiral vertex operator algebra and some associated notions. We then give a construction of a non-chiral VOA associated to an even, integral, Lorentzian lattice and construct their irreducible modules. We obtain the moduli space of such modular invariant non-chiral CFTs based on even, self-dual Lorentzian lattices of signature (m,n) ( m , n ) assuming the validity of a technical result about automorphisms of the lattice. We finally show that Narain conformal field theories in physics are examples of non-chiral VOA. Our formalism helps us to identify the chiral algebra of Narain CFTs in terms of a particular sublattice and give us the decomposition of its partition function into sum of characters.

Singh, Ranveer Kumar (ORCID:000000026385704X)↗
DOE OSTI2024

Machine Learning meets Algebraic Combinatorics: A Suite of Benchmark Datasets to Accelerate AI for Mathematics Research

The use of benchmark datasets has become an important engine of progress in machine learning (ML) over the past 15 years. Recently there has been growing interest in utilizing machine learning to drive advances in research-level mathematics. However, off-the-shelf solutions often fail to deliver the types of insights required by mathematicians. This suggests the need for new ML methods specifically designed with mathematics in mind. The question then is: what benchmarks should the community use to evaluate these? On the one hand, toy problems such as learning the multiplicative structure of small finite groups have become popular in the mechanistic interpretability community whose perspective on explainability aligns well with the needs of mathematicians. While toy datasets are a useful benchmark for initial work, they lack the scale, complexity, and sophistication of many of the principal objects of study in modern mathematics. To address this, we introduce a new collection of benchmark datasets, Algebraic Combinatorics Benchmarks (ACBench), representing either classic or open problems in algebraic combinatorics, a subfield of mathematics that studies discrete structures arising from abstract algebra. After describing the datasets, we discuss the challenges involved in constructing “good” mathematics benchmarks, describe baseline model performance, and discuss some of the insights these datasets can provide that may be of interest even to those who are not interested in mathematics research itself.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Classification of dynamical Lie algebras generated by spin interactions on undirected graphs

Dynamical Lie algebras (DLAs) are a versatile tool for various topics that span from the expressibility-trainability of variational quantum algorithms (VQAs), to simulation of many body Hamiltonians. Quantum gates and most of the Hamiltonians of interest consist of local interactions; therefore, the analysis of all possible DLAs generated by 1- and 2-local operators is crucial for quantum simulation and VQAs on current hardware. Previously in [R. Wiersema et al ., npj Quantum Inf. 10 , 110 (2024)], we analyzed the DLAs on linear, circular and all-to-all topologies, and obtained results about their dimensions and algebraic structure. Here, in this work, we extend our analysis into any possible hardware topology and provide a classification of all DLAs generated by Pauli strings on any undirected interaction graph. Our results indicate that the DLAs depend solely on whether the connectivity or interaction graph is bipartite or not. In addition, we find that the non-trivial polynomially scaling DLAs appear only on 1D line or circle topologies, and all other DLAs have dimensions scaling exponentially with the system size. Together with the current VQA literature, our results imply that either the majority of VQAs are non-trainable, or we are yet to understand the role of DLAs on the trainability of VQAs.

Algebraic structures↗
DOE OSTI2025

SDA: a symbolic differential algebra package in C++

Truncated Power Series Algebra (TPSA), or Differential Algebra (DA), is a well-established tool in accelerator physics, commonly used for generating high-order maps of dynamic systems, as well as in symplectic tracking, normal form analysis, verified integration, optimization, and fast multipole methods. This package is the first to perform symbolic DA computations, enabling traceability of initial condition contributions and runtime reduction for repeated DA calculations, potentially expanding DA’s applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Algebra of invariants for the Vlasov–Maxwell system

The algebra of invariants for both the relativistic and nonrelativistic multispecies Vlasov–Maxwell system is examined, including the case with a fixed ion background. Invariants and their associated fluxes are obtained directly from the Vlasov–Maxwell system. The invariants are shown to Poisson commute with the Hamiltonian and the rest of the Poisson bracket algebra of invariants is identified. Special attention is given to the role played by the monopole condition, ∇ · B.

Fundamental invariants↗