Search NASA⌕ Search

SEARCH · Search NASA

Results for “Polytopes”

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

Statistics of base polytopes in F-theory

We propose a new statistical ensemble of toric bases for elliptic Calabi-Yaus used in F-theory models, by focusing on only the convex hull of the base, i.e., the base polytope. This physically motivated coarse-graining greatly simplifies the combinatorial complexity of the part of the 4d F-theory landscape with toric bases. We develop a Monte Carlo approach that randomly samples the base polytopes within fixed boxes, with proper statistical weights. We first apply the algorithm to the set of 2d base polytopes, generating an enlarged set of toric 2d bases that include certain types of codimension-two (4,6) points, and we validate our approach against exact numbers. We then explore the set of 3d base polytopes which fit in a set of “maximal” 3d boxes, and estimate the total number of inequivalent 3d base polytopes to be 10 85 –10 90 . We provide statistical data such as the distribution of non-Higgsable gauge groups on these bases. Amusingly, a similar method can also be applied to generate reflexive polytopes in various dimensions. In both the reflexive and base polytope cases, the number of relevant polytopes obeys a Gaussian distribution as a function of the number of vertices, which can be understood in terms of other results on random polytopes in the math literature.

Differential and algebraic geometry↗
DOE OSTI2023

Reducing Conservativeness of Polytopic Linear-Parameter-Varying Robust Vehicle Sideslip Angle Observer Through Minimum-Area Convex Quadrilateral Design

The polytopic linear-parameter-varying (LPV) method has become increasingly popular for designing intelligent control and estimation systems for ground vehicles, particularly for the vehicle sideslip angle observer. In vehicle lateral dynamics, the vehicle longitudinal velocity-induced nonlinearities are conventionally outer-approximated with polytopes such as rectangles or triangles to obtain a polytopic LPV system. Yet, such polytopic approximations tend to be conservative and may lead to inadequate observer performance. To address this issue, a minimum-area convex quadrilateral construction is proposed in this paper to reduce design conservatism. The suggested design is demonstrated through the synthesis of an LPV H ∞ robust vehicle sideslip angle observer. Furthermore, a dSPACE-ASM simulation study is conducted to demonstrate the effectiveness and the advantage of the proposed polytopic construction over a baseline approach.

Zhou, Xingyu↗
DOE OSTI2026

A variational mimetic finite difference method for elliptic interface problems on non-matching polytopal meshes with geometric interface inconsistencies

A new variational mimetic finite difference method for elliptic interface problems with perfect and imperfect thermal contacts on non-matching polytopal meshes with geometric interface inconsistencies is developed and analyzed theoretically and numerically. The method is defined on multiple non-matching submeshes with gaps and overlaps along their interfaces. The discrete equations are derived from a minimization problem for the augmented Dirichlet functional. For a perfect thermal contact, the functional uses a modified mimetic gradient with extended stencil which couples unknowns from both sides of an interface, as well as penalty terms to enforce weak continuity of temperature across the interface. The method leads to a symmetric positive definite matrix for any scaling of the penalty terms. For an imperfect thermal contact, the Dirichlet functional is supplemented with a quadratic jump term along the interface related to the interface thermal resistance. We prove that the method conserves the total heat flux across each interface. In conclusion, the obtained results are verified with numerical experiments showing convergence in the discrete L 2 and L ∞ norms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

New Calabi–Yau manifolds from genetic algorithms

Calabi–Yau manifolds can be obtained as hypersurfaces in toric varieties built from reflexive polytopes. We generate reflexive polytopes in various dimensions using a genetic algorithm. As a proof of principle, we demonstrate that our algorithm reproduces the full set of reflexive polytopes in two and three dimensions, and in four dimensions with a small number of vertices and points. Motivated by this result, we construct five-dimensional reflexive polytopes with the lowest number of vertices and points. By calculating the normal form of the polytopes, we establish that many of these are not in existing datasets and therefore give rise to new Calabi–Yau four-folds. In some instances, the Hodge numbers we compute are new as well.

Astronomy & Astrophysics↗
DOE OSTI2023

The 𝑚=2 amplituhedron and the hypersimplex: Signs, clusters, tilings, Eulerian numbers

The hypersimplex Δ <#comment/> k + 1 , n \Delta _{k+1,n} is the image of the positive Grassmannian G r k + 1 , n ≥ <#comment/> 0 Gr^{\geq 0}_{k+1,n} under the moment map. It is a polytope of dimension n − <#comment/> 1 n-1 in R n \mathbb {R}^n . Meanwhile, the amplituhedron A n , k , 2 ( Z ) \mathcal {A}_{n,k,2}(Z) is the projection of the positive Grassmannian G r k , n ≥ <#comment/> 0 Gr^{\geq 0}_{k,n} into the Grassmannian G r k , k + 2 Gr_{k,k+2} under a map Z ~ <#comment/> \tilde {Z} induced by a positive matrix Z ∈ <#comment/> M a t n , k + 2 > 0 Z\in Mat_{n,k+2}^{>0} . Introduced in the context of scattering amplitudes , it is not a polytope, and has full dimension 2 k 2k inside G r k , k + 2 Gr_{k,k+2} . Nevertheless, there seem to be remarkable connections between these two objects via T-duality , as conjectured by Łukowski, Parisi, and Williams [Int. Math. Res. Not. (2023)]. In this paper we use ideas from oriented matroid theory, total positivity, and the geometry of the hypersimplex and positroid polytopes to obtain a deeper understanding of the amplituhedron. We show that the inequalities cutting out positroid polytopes —images of positroid cells of G r k + 1 , n ≥ <#comment/> 0 Gr^{\geq 0}_{k+1,n} under the moment map—translate into sign conditions characterizing the T-dual Grasstopes —images of positroid cells of G r k , n ≥ <#comment/> 0 Gr^{\geq 0}_{k,n} under Z ~ <#comment/> \tilde {Z} . Moreover, we subdivide the amplituhedron into chambers , just as the hypersimplex can be subdivided into simplices, with both chambers and simplices enumerated by the Eulerian numbers. We use these properties to prove the main conjecture of Łukowski, Parisi, and Williams [Int. Math. Res. Not. (2023)]: a collection of positroid polytopes is a tiling of the hypersimplex if and only if the collection of T-dual Grasstopes is a tiling of the amplituhedron A n , k , 2 ( Z ) \mathcal {A}_{n,k,2}(Z) for all Z Z . Moreover, we prove Arkani-Hamed–Thomas–Trnka’s conjectural sign-flip characterization of A n , k , 2 \mathcal {A}_{n,k,2} , and Łukowski–Parisi–Spradlin–Volovich’s conjectures on m = 2 m=2 cluster adjacency and on positroid tiles for A n , k , 2 \mathcal {A}_{n,k,2} (images of 2 k 2k -dimensional positroid cells which map injectively into A n , k , 2 \mathcal {A}_{n,k,2} ). Finally, we introduce new cluster structures in the amplituhedron.

Parisi, Matteo↗
DOE OSTI2023

Architecture-Preserving Provable Repair of Deep Neural Networks

Deep neural networks (DNNs) are becoming increasingly important components of software, and are considered the state-of-the-art solution for a number of problems, such as image recognition. However, DNNs are far from infallible, and incorrect behavior of DNNs can have disastrous real-world consequences. This paper addresses the problem of architecture-preserving V-polytope provable repair of DNNs. A V-polytope defines a convex bounded polytope using its vertex representation. V-polytope provable repair guarantees that the repaired DNN satisfies the given specification on the infinite set of points in the given V-polytope. An architecture-preserving repair only modifies the parameters of the DNN, without modifying its architecture. The repair has the flexibility to modify multiple layers of the DNN, and runs in polynomial time. It supports DNNs with activation functions that have some linear pieces, as well as fully-connected, convolutional, pooling and residual layers. To the best our knowledge, this is the first provable repair approach that has all of these features. We implement our approach in a tool called APRNN. Using MNIST, ImageNet, and ACAS Xu DNNs, we show that it has better efficiency, scalability, and generalization compared to PRDNN and REASSURE, prior provable repair methods that are not architecture preserving.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Cosmohedra

It has been a long-standing challenge to find a geometric object underlying the cosmological wavefunction for Tr(ϕ 3 ) theory, generalizing associahedra and surfacehedra for scattering amplitudes. In this note, we describe a new class of polytopes — “cosmohedra” — that provide a natural solution to this problem. The faces of associahedra capture the combinatorics of non-overlapping chords of the momentum polygon, reflecting all partial factorizations of amplitudes. Cosmohedra are far richer — instead of non-overlapping chords, their faces capture the “russian doll” structure of non-overlapping subpolygons that determine the wavefunction. We show that cosmohedra are intimately related to associahedra, obtained by “blowing up” faces of the associahedron in a simple way. We give a full combinatorial description of cosmohedron faces and their factorization properties, and provide an explicit realization in terms of facet inequalities that further “shave” the facet inequalities of the associahedron. We also discuss a novel way for computing the wavefunction from cosmohedron geometry that extends the usual connection with polytope canonical forms. We illustrate cosmohedra with examples at tree-level and one loop; the close connection to surfacehedra suggests the generalization to all loop orders. Moving beyond the wavefunction, we briefly describe “cosmological correlahedra” for full correlators, which are one higher-dimensional polytopes, interpolating between associahedra and cosmohedra on opposite facets in an extra direction associated with the total energy. We speculate on how the existence of cosmohedra might suggest a “stringy” formulation for the cosmological wavefunction/correlators, generalizing the way in which the Minkowski sum decomposition of associahedra naturally extend particle to string amplitudes.

Scattering Amplitudes↗
DOE OSTI2026

Large deformations of Tr(Φ 3 ) and the world at infinity

The amplitudes of the non-linear sigma model can be obtained from those of Tr(Φ 3 ) theory by sending the kinematic (Mandelstam) variables to infinity in a certain direction. In this paper we characterize the behavior of Tr(Φ 3 ) amplitudes under a general class of large kinematic shifts called g-vector shifts. The objects that live in this world at infinity retain certain key amplitude-like properties, most notably factorization, and admit descriptions in terms of polytopes, but they are not generally amplitudes of any cognizable theory. We identify particular g-vector shifts that lead at infinity to mixed amplitudes involving two pions and any number of scalars, allowing us to provide polytopal descriptions of these amplitudes.

effective field theories↗
DOE OSTI2023

Cooperative chemical adsorption of acid gases in functionalized metal-organic frameworks

A system and method for acid gas separations using porous frameworks of metal atoms coordinatively bound to polytopic linkers that are functionalized with basic nitrogen ligands that expose nitrogen atoms to the pore volumes forming adsorption sites. Adjacent basic nitrogen ligands on the metal-organic framework can form an ammonium from one ligand and a carbamate from the other. The formation of one ammonium carbamate pair influences the formation of ammonium carbamate on adjacent adsorption sites. Adsorption of acid gas at the adsorption sites form covalently linked aggregates of more than one ammonium carbamate ion pair. The acid gas adsorption isotherm can be tuned to match the step position with the partial pressure of acid gas in the gas mixture stream through manipulation of the metal-ligand bond strength by selection of the ligand, metal and polytopic linker materials.

Long, Jeffrey R.↗
DOE OSTI2024

Numerical integration in the virtual element method with the scaled boundary cubature scheme

Abstract The virtual element method (VEM) is a stabilized Galerkin method on meshes that consist of arbitrary (convex and nonconvex) polygonal and polyhedral elements. A crucial ingredient in the implementation of low‐ and high‐order VEM is the numerical integration of monomials and nonpolynomial functions over such elements. In this article, we apply the recently proposed scaled boundary cubature (SBC) scheme to compute the weak form integrals in various virtual element formulations over polygonal and polyhedral meshes. In doing so, we demonstrate the flexibility of the approach and the accuracy that it delivers on a broad suite of boundary‐value problems in 2D and 3D over polytopes with affine faces as well as on elements with curved boundaries. In addition, the use of the SBC scheme is exemplified in an enriched Poisson formulation of the VEM in which weakly singular functions are required to be integrated. This study establishes the SBC method as a simple, accurate and efficient integration scheme for use in the VEM.

Chin, Eric B.↗
DOE OSTI2024

Arbitrary Order Virtual Element Methods for High‐Order Phase‐Field Modeling of Dynamic Fracture

ABSTRACT Accurate modeling of fracture nucleation and propagation in brittle and ductile materials subjected to dynamic loading is important in predicting material damage and failure under extreme conditions. Phase‐field fracture models have garnered a lot of attention in recent years due to their success in representing damage and fracture processes in a wide class of materials and under a variety of loading conditions. Second‐order phase‐field fracture models are by far the most popular among researchers (and increasingly, among practitioners), but fourth‐order models have started to gain broader acceptance since their more recent introduction. The exact solution corresponding to these high‐order phase‐field fracture models has higher regularity. Thus, numerical solutions of the model equations can achieve improved accuracy and higher spatial convergence rates. In this work, we develop a virtual element framework for the high‐order phase‐field model of dynamic fracture. The virtual element method (VEM) can be regarded as a generalization of the classical finite element method. In addition to many other desirable characteristics, the VEM allows computing on polytopal meshes. Here, we use ‐conforming virtual elements and the generalized‐ time integration method for the momentum balance equation, and adopt ‐conforming virtual elements for the high‐order phase‐field equation. We verify our virtual element framework using classical quasi‐static benchmark problems and demonstrate its capabilities with the aid of numerical simulations of dynamic fracture in brittle materials.

42 ENGINEERING↗
DOE OSTI2024

Cosmology meets cohomology

The cosmological polytope and bootstrap programs have revealed interesting connections between positive geometries, modern on-shell methods and bootstrap principles studied in the amplitudes community with the wavefunction of the Universe in toy models of FRW cosmologies. To compute these FRW correlators, one often faces integrals that are too difficult to evaluate by direct integration. Borrowing from the Feynman integral community, the method of (canonical) differential equations provides an efficient alternative for evaluating these integrals. Moreover, we further develop our geometric understanding of these integrals by describing the associated relative twisted cohomology. Leveraging recent progress in our understanding of relative twisted cohomology in the Feynman integral community, we give an algorithm to predict the basis size and simplify the computation of the differential equations satisfied by FRW correlators.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Hidden zeros of the cosmological wavefunction

Motivated by the recent discovery of hidden zeros in particle and string amplitudes, we characterize zeros of individual graph contributions to the cosmological wavefunction of a scalar field theory. We demonstrate that these contributions factorize near these zeros for all tree graphs and provide evidence that this extends to loop graphs as well. We explicitly construct polytopal realizations of the relevant graph associahedra and show that the cosmological zeros have natural geometric and physical interpretations. As a byproduct, we establish an equivalence between the wavefunction coefficients of chain graphs and flat-space Tr(ϕ 3 ) amplitudes, enabling us to leverage the cosmological zeros to uncover the recently discovered hidden zeros of colored amplitudes.

Cosmological models↗
DOE OSTI2024

A cluster of results on amplituhedron tiles

Abstract The amplituhedron is a mathematical object which was introduced to provide a geometric origin of scattering amplitudes in $$\mathcal {N}=4$$ N = 4 super Yang–Mills theory. It generalizes cyclic polytopes and the positive Grassmannian and has a very rich combinatorics with connections to cluster algebras. In this article, we provide a series of results about tiles and tilings of the $$m=4$$ m = 4 amplituhedron. Firstly, we provide a full characterization of facets of BCFW tiles in terms of cluster variables for $$\text{ Gr}_{4,n}$$ Gr 4 , n . Secondly, we exhibit a tiling of the $$m=4$$ m = 4 amplituhedron which involves a tile which does not come from the BCFW recurrence—the spurion tile, which also satisfies all cluster properties. Finally, strengthening the connection with cluster algebras, we show that each standard BCFW tile is the positive part of a cluster variety, which allows us to compute the canonical form of each such tile explicitly in terms of cluster variables for $$\text{ Gr}_{4,n}$$ Gr 4 , n . This paper is a companion to our previous paper “Cluster algebras and tilings for the $$m=4$$ m = 4 amplituhedron.”

Physics↗
DOE OSTI2023

C–H Functionalization of Polyolefins to Access Reprocessable Polyolefin Thermosets

Upcycling plastic waste into reprocessable materials with performance-advantaged properties would contribute to the development of a circular plastics economy. Here, we modify branched polyolefins and postconsumer polyethylene through a versatile C–H functionalization approach using thiosulfonates as a privileged radical group transfer functionality. Cross-linking the functionalized polyolefins with polytopic amines provided dynamically cross-linked polyolefin networks enabled by associative bond exchange of diketoenamine functionality. A combination of resonant soft X-ray scattering and grazing incidence X-ray scattering revealed hierarchical phase morphology in which diketoenamine-rich microdomains phase-separate within amorphous regions between polyolefin crystallites. The combination of dynamic covalent cross-links and microphase separation results in useful and improved mechanical properties, including a ~4.5-fold increase in toughness, a reduction in creep deformation at temperatures relevant to use, and high-temperature structural stability compared to the parent polyolefin. The dynamic nature of diketoenamine cross-links provides stress relaxation at elevated temperatures, which enabled iterative reprocessing of the dynamic covalent polymer network with little cycle-to-cycle property fade. Finally, the ability to convert polyolefin waste into a reprocessable thermoformable material with attractive thermomechanical properties provides additional optionality for upcycling to enable future circularity.

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

Monte Carlo goodness-of-fit tests for degree corrected and related stochastic blockmodels

Abstract We construct Bayesian and frequentist finite-sample goodness-of-fit tests for three different variants of the stochastic blockmodel for network data. Since all of the stochastic blockmodel variants are log-linear in form when block assignments are known, the tests for the latent block model versions combine a block membership estimator with the algebraic statistics machinery for testing goodness-of-fit in log-linear models. We describe Markov bases and marginal polytopes of the variants of the stochastic blockmodel and discuss how both facilitate the development of goodness-of-fit tests and understanding of model behaviour. The general testing methodology developed here extends to any finite mixture of log-linear models on discrete data, and as such is the first application of the algebraic statistics machinery for latent-variable models.

Karwa, Vishesh↗
DOE OSTI2024

Twice upon a time: timelike-separated quantum extremal surfaces

The Python’s Lunch conjecture for the complexity of bulk reconstruction involves two types of nonminimal quantum extremal surfaces (QESs): bulges and throats, which differ by their local properties. The conjecture relies on the connection between bulk spatial geometry and quantum codes: a constricting geometry from bulge to throat encodes the bulk state nonisometrically, and so requires an exponentially complex Grover search to decode. However, thus far, the Python’s Lunch conjecture is only defined for spacetimes where all QESs are spacelike-separated from one another. Here we explicitly construct (time-reflection symmetric) spacetimes featuring both timelike-separated bulges and timelike-separated throats. Interestingly, all our examples also feature a third type of QES, locally resembling a de Sitter bifurcation surface, which we name a bounce. By analyzing the Hessian of generalized entropy at a QES, we argue that this classification into throats, bulges and bounces is exhaustive. We then propose an updated Python’s Lunch conjecture that can accommodate general timelike-separated QESs and bounces. Notably, our proposal suggests that the gravitational analogue of a tensor network is not necessarily the time-reflection symmetric slice, even when one exists.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗