Search NASA⌕ Search

SEARCH · Search NASA

Results for “homotopy type”

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.

Matching Complexes of Trees and Applications of the Matching Tree Algorithm

A matching complex of a simple graph G is a simplicial complex with faces given by the matchings of G. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa showed that matching complexes of forests are contractible or homotopy equivalent to a wedge of spheres. We study two specific families of trees. For caterpillar graphs, we give explicit formulas for the number of spheres in each dimension and for perfect binary trees we find a strict connectivity bound. We also use a tool from discrete Morse theory called the Matching Tree Algorithm to study the connectivity of honeycomb graphs, partially answering a question raised by Jonsson.

97 MATHEMATICS AND COMPUTING↗

A family of solution algorithms for nonlinear structural analysis based on relaxation equations

A family of hierarchical algorithms for nonlinear structural equations are presented. The algorithms are based on the Davidenko-Branin type homotopy and shown to yield consistent hierarchical perturbation equations. The algorithms appear to be particularly suitable to problems involving bifurcation and limit point calculations. An important by-product of the algorithms is that it provides a systematic and economical means for computing the stepsize at each iteration stage when a Newton-like method is employed to solve the systems of equations. Some sample problems are provided to illustrate the characteristics of the algorithms.

Park, K. C.↗

Minimization versus homotopy algorithms

The relative merits and demerits of the minimization techniques are assessed using globally convergent quasi-Newton algorithms on the one hand and the homotopy algorithms on the other hand for the solution of problems of nonlinear structural analysis. Like the homotopy algorithms, the globally convergent quasi-Newton algorithms are equally suited for the solution of the nonlinear equations of structural analysis directly without having to pose the problem as an equivalent minimization problem. In the close neighborhood of the limit and bifurcation points quasi-Newton algorithms experience difficulties. Homotopy algorithms are robust for practically all types of nonlinear problems but are computationally not as cost effective since they provide an extremely accurate prediction of the response by calculating it as a large number of points. Globally convergent algorithms can perform well with very approximate Hessians, while homotopy algorithms require extremely accurate Hessians. While quasi-Newton algorithms can be very easily structured to exploit sparsity and symmetry, homotopy algorithms are not presently so structured and would require special modifications for exploitation of such features without sacrificing robustness and global convergence.

Kamat, M. P.↗

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↗

Quantum field theory of topological spin dynamics

Here, we develop a field theory of quantum magnets and magnetic (semi)metals, which is suitable for the analysis of their universal and topological properties. The systems of interest include collinear, coplanar, and general noncoplanar magnets. At the basic level, we describe the dynamics of magnetic moments using smooth vector fields in the continuum limit. Dzyaloshinskii-Moriya interaction is captured by a non-Abelian vector gauge field, and chiral spin couplings related to topological defects appear as higher-rank antisymmetric tensor gauge fields. We distinguish type-I and type-II magnets by their equilibrium response to the non-Abelian gauge flux, and characterize the resulting lattices of skyrmions and hedgehogs, the spectra of spin waves, and the chiral response to external perturbations. The general spin-orbit coupling of electrons is similarly described by non-Abelian gauge fields, including higher-rank tensors related to the electronic Berry flux. Itinerant electrons and local moments exchange their gauge fluxes through Kondo and Hund interactions. Hence, by utilizing gauge fields, this theory provides a unifying physical picture of “intrinsic” and “topological” anomalous Hall effects, spin-Hall effects, and other correlations between the topological properties of electrons and moments. We predict “topological” magnetoelectric effect in materials prone to hosting hedgehogs. Links to experiments and model calculations are provided by deriving the couplings and gauge fields from generic microscopic models, including the Hubbard model with spin-orbit interactions. Much of the formal analysis is generalized to d spatial dimensions in order to access the $π_{d–1}(S^{d–1})$ homotopy classification of the magnetic hedgehog topological defects, and establish the possibility of novel quantum spin liquids that exhibit a fractional magnetoelectric effect. However, we emphasize the form of all results in the physically relevant $\textit{d}$ = 3 dimensions, and discuss a few applications to topological magnetic conductors like Mn 3 Sn and Pr 2 Ir 2 O 7 .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗