Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algebraic structures”

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 163 records · Page 9

An index for two-dimensional SPT states

We define an index for 2D G-invariant invertible states of bosonic lattice systems in the thermodynamic limit for a finite symmetry group G with a unitary action. Furthermore, we show that this index is an invariant of the symmetry protected phase.

97 MATHEMATICS AND COMPUTING↗

Homotopy transfer and self-dual Schur modules

We consider the free 2-nilpotent graded Lie algebra g generated in degree one by a finite dimensional vector space V. We recall the beautiful result that the cohomology H{sup ⋅}(g,K) of g with trivial coefficients carries a GL(V)-representation having only the Schur modules V with self-dual Young diagrams {λ: λ = λ′} in its decomposition into GL(V)-irreducibles (each with multiplicity one). The homotopy transfer theorem due to Tornike Kadeishvili allows to equip the cohomology of the Lie algebra g with a structure of homotopy commutative algebra.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Renormalized Reduced Order Models with Memory for Long Time Prediction

We examine the challenging problem of constructing reduced models for the long time prediction of systems where there is no timescale separation between the resolved and unresolved variables. In previous work we focused on the case where there was only transfer of activity (e.g. energy, mass) from the resolved to the unresolved variables. Here we investigate the much more difficult case where there is {\it two-way} transfer of activity between the resolved and unresolved variables. Like in the case of activity drain out of the resolved variables, even if one starts with an exact formalism, like the Mori-Zwanzig (MZ) formalism, the constructed reduced models can become unstable. We show how to remedy this situation by using dynamic information from the full system to {\it renormalize} the MZ reduced models. In addition to being stabilized, the renormalized models can be accurate for very long times. We use the Korteweg-de Vries equation to illustrate the approach. The coefficients of the renormalized models exhibit rich structure, including algebraic time dependence and incomplete similarity.

Price, Jacob↗

Asymptotic form of the longitudinal correlation function for isotropic homogeneous turbulence

An asymptotic form is derived for the longitudinal correlation function for isotropic homogeneous turbulence in an incompressible fluid governed by the Navier-Stokes equation. The result is obtained from an analysis of the algebraic-differential structure of the two-point correlation tensor contained in the complex-valued Fourier transform of the probability measure over the turbulence ensemble, which reveals that the Hopf characteristic functional (the complex-valued Fourier transform of the probability measure) satisfies the Fourier interference inequality. Consequences of the expression obtained, in which the correlation function is a positive definite function of the inverse cube of the spatial coordinate as it approaches infinity, are shown to include the nonexistence of the Loitsianskii invariant, and the solution is shown to be consistent with empirical formulas.

Rosen, G.↗

Improve Data Mining and Knowledge Discovery Through the Use of MatLab

Data mining is widely used to mine business, engineering, and scientific data. Data mining uses pattern based queries, searches, or other analyses of one or more electronic databases/datasets in order to discover or locate a predictive pattern or anomaly indicative of system failure, criminal or terrorist activity, etc. There are various algorithms, techniques and methods used to mine data; including neural networks, genetic algorithms, decision trees, nearest neighbor method, rule induction association analysis, slice and dice, segmentation, and clustering. These algorithms, techniques and methods used to detect patterns in a dataset, have been used in the development of numerous open source and commercially available products and technology for data mining. Data mining is best realized when latent information in a large quantity of data stored is discovered. No one technique solves all data mining problems; challenges are to select algorithms or methods appropriate to strengthen data/text mining and trending within given datasets. In recent years, throughout industry, academia and government agencies, thousands of data systems have been designed and tailored to serve specific engineering and business needs. Many of these systems use databases with relational algebra and structured query language to categorize and retrieve data. In these systems, data analyses are limited and require prior explicit knowledge of metadata and database relations; lacking exploratory data mining and discoveries of latent information. This presentation introduces MatLab(R) (MATrix LABoratory), an engineering and scientific data analyses tool to perform data mining. MatLab was originally intended to perform purely numerical calculations (a glorified calculator). Now, in addition to having hundreds of mathematical functions, it is a programming language with hundreds built in standard functions and numerous available toolboxes. MatLab's ease of data processing, visualization and its enormous availability of built in functionalities and toolboxes make it suitable to perform numerical computations and simulations as well as a data mining tool. Engineers and scientists can take advantage of the readily available functions/toolboxes to gain wider insight in their perspective data mining experiments.

Shaykhian, Gholam Ali↗

Improve Data Mining and Knowledge Discovery through the use of MatLab

Data mining is widely used to mine business, engineering, and scientific data. Data mining uses pattern based queries, searches, or other analyses of one or more electronic databases/datasets in order to discover or locate a predictive pattern or anomaly indicative of system failure, criminal or terrorist activity, etc. There are various algorithms, techniques and methods used to mine data; including neural networks, genetic algorithms, decision trees, nearest neighbor method, rule induction association analysis, slice and dice, segmentation, and clustering. These algorithms, techniques and methods used to detect patterns in a dataset, have been used in the development of numerous open source and commercially available products and technology for data mining. Data mining is best realized when latent information in a large quantity of data stored is discovered. No one technique solves all data mining problems; challenges are to select algorithms or methods appropriate to strengthen data/text mining and trending within given datasets. In recent years, throughout industry, academia and government agencies, thousands of data systems have been designed and tailored to serve specific engineering and business needs. Many of these systems use databases with relational algebra and structured query language to categorize and retrieve data. In these systems, data analyses are limited and require prior explicit knowledge of metadata and database relations; lacking exploratory data mining and discoveries of latent information. This presentation introduces MatLab(TradeMark)(MATrix LABoratory), an engineering and scientific data analyses tool to perform data mining. MatLab was originally intended to perform purely numerical calculations (a glorified calculator). Now, in addition to having hundreds of mathematical functions, it is a programming language with hundreds built in standard functions and numerous available toolboxes. MatLab's ease of data processing, visualization and its enormous availability of built in functionalities and toolboxes make it suitable to perform numerical computations and simulations as well as a data mining tool. Engineers and scientists can take advantage of the readily available functions/toolboxes to gain wider insight in their perspective data mining experiments.

Shaykahian, Gholan Ali↗

On a programming language for graph algorithms

An algorithmic language, GRAAL, is presented for describing and implementing graph algorithms of the type primarily arising in applications. The language is based on a set algebraic model of graph theory which defines the graph structure in terms of morphisms between certain set algebraic structures over the node set and arc set. GRAAL is modular in the sense that the user specifies which of these mappings are available with any graph. This allows flexibility in the selection of the storage representation for different graph structures. In line with its set theoretic foundation, the language introduces sets as a basic data type and provides for the efficient execution of all set and graph operators. At present, GRAAL is defined as an extension of ALGOL 60 (revised) and its formal description is given as a supplement to the syntactic and semantic definition of ALGOL. Several typical graph algorithms are written in GRAAL to illustrate various features of the language and to show its applicability.

Rheinboldt, W. C.↗

Structure of quasiparticles and their fusion algebra in fractional quantum Hall states

It was recently discovered that fractional quantum Hall (FQH) states can be characterized quantitatively by the pattern of zeros that describe how the ground-state wave function goes to zero when electrons are brought close together. Quasiparticles in the FQH states can be described in a similar quantitative way by the pattern of zeros that result when electrons are brought close to the quasiparticles. In this paper, we combine the pattern of zeros approach and the conformal field theory (CFT) approach to calculate the topological properties of quasiparticles. We discuss how the quasiparticles in FQH states naturally form representations of a magnetic translation algebra, with members of a representation differing from each other by Abelian quasiparticles. We find that this structure dramatically simplifies topological properties of the quasiparticles, such as their fusion rules, charges, and scaling dimensions, and has consequences for the ground state degeneracy of FQH states on higher genus surfaces. We find constraints on the pattern of zeros of quasiparticles that can fuse together, which allow us to derive the fusion rules of quasiparticles from their pattern of zeros, at least in the case of the (generalized and composite) parafermion states. We also calculate from CFT the number of quasiparticle types in the generalized and composite parafermion states, which confirm the result obtained previously through a completely different approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algebraic model to study the internal structure of pseudoscalar mesons with heavy-light quark content

The internal structure of all lowest-lying pseudoscalar mesons with heavy-light quark content is studied in detail using an algebraic model that has been applied recently, and successfully, to the same physical observables of pseudoscalar and vector mesons with hidden-flavor quark content, from light to heavy quark sectors. The algebraic model consists on constructing simple and evidence-based of the meson’s Bethe-Salpeter amplitude (BSA) and quark’s propagator in such a way that the Bethe-Salpeter wave function (BSWF) can then be readily computed algebraically. Its subsequent projection onto the light front yields the light front wave function (LFWF) whose form allows us a simple access to the valence-quark parton distribution amplitude (PDA) by integrating over the transverse momentum squared. We exploit our current knowledge of the PDAs of lowest-lying pseudoscalar heavy-light mesons to compute their generalized parton distributions (GPDs) through the overlap representation of LFWFs. From these three dimensional knowledge, different limits/projections lead us to deduce the related parton distribution functions (PDFs), electromagnetic form factors (EFFs), and impact parameter space GPDs (IPS-GPDs). When possible, we make explicit comparisons with available experimental results and earlier theoretical predictions. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

On the Additive Structure and Asymptotics of Codimensions c{sub n} in the Algebra F{sup (5)}

In this paper, we investigate the additive structure of the algebra F{sup (5)}, i.e., a relatively free, associative, countably-generated algebra with the identity [x{sub 1}, . . . , x{sub 5}] = 0 over an infinite field of characteristic ≠2, 3. We study the space of proper multilinear polynomials in this algebra and means of basis construction in one of its basic subspaces. As an additional result, we obtain estimations of codimensions c{sub n} = dimP{sub n}/P{sub n}∩ T{sup (5)}, where P{sub n} is the space of multilinear polynomials of degree n in F{sup (5)} and T{sup (5)} is the T-ideal generated by the long commutator [x{sub 1}, . . . , x{sub 5}].

97 MATHEMATICS AND COMPUTING↗

Operator approach to quantization of semigroups

The paper is devoted to the construction of compact quantum semigroups from semigroup C{sup ∗}-algebras generated by the 'deformation' of algebras of continuous functions on compact Abelian groups. The dual space of such a C{sup ∗}-algebra is endowed with the structure of a Banach *-algebra containing the algebra of measures on a compact group. We construct a weak Hopf *-algebra that is dense in such a compact quantum semigroup. We show that there exists an injective functor from the constructed category of compact quantum semigroups into the category of Abelian semigroups. Bibliography: 25 titles.

97 MATHEMATICS AND COMPUTING↗

Refined algebraic quantisation in a system with nonconstant gauge invariant structure functions

In a previous work [J. Louko and E. Martínez-Pascual, “Constraint rescaling in refined algebraic quantisation: Momentum constraint,” J. Math. Phys. 52, 123504 (2011)], refined algebraic quantisation (RAQ) within a family of classically equivalent constrained Hamiltonian systems that are related to each other by rescaling one momentum-type constraint was investigated. In the present work, the first steps to generalise this analysis to cases where more constraints occur are developed. The system under consideration contains two momentum-type constraints, originally abelian, where rescalings of these constraints by a non-vanishing function of the coordinates are allowed. These rescalings induce structure functions at the level of the gauge algebra. Providing a specific parametrised family of real-valued scaling functions, the implementation of the corresponding rescaled quantum momentum-type constraints is performed using RAQ when the gauge algebra: (i) remains abelian and (ii) undergoes into an algebra of a nonunimodular group with nonconstant gauge invariant structure functions. Case (ii) becomes the first example known to the author where an open algebra is handled in refined algebraic quantisation. Challenging issues that arise in the presence of non-gauge invariant structure functions are also addressed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Simit: A Language for Physical Simulation

With existing programming tools, writing high-performance simulation code is labor intensive and requires sacrificing readability and portability. Here, the alternative is to prototype simulations in a high-level language like Matlab, thereby sacrificing performance. The Matlab programming model naturally describes the behavior of an entire physical system using the language of linear algebra. However, simulations also manipulate individual geometric elements, which are best represented using linked data structures like meshes. Translating between the linked data structures and linear algebra comes at significant cost, both to the programmer and to the machine. High-performance implementations avoid the cost by rephrasing the computation in terms of linked or index data structures, leaving the code complicated and monolithic, often increasing its size by an order of magnitude. In this article, we present Simit, a new language for physical simulations that lets the programmer view the system both as a linked data structure in the form of a hypergraph and as a set of global vectors, matrices, and tensors depending on what is convenient at any given time. Simit provides a novel assembly construct that makes it conceptually easy and computationally efficient to move between the two abstractions. Using the information provided by the assembly construct, the compiler generates efficient in-place computation on the graph. We demonstrate that Simit is easy to use: a Simit program is typically shorter than a Matlab program; that it is high performance: a Simit program running sequentially on a CPU performs comparably to hand-optimized simulations; and that it is portable: Simit programs can be compiled for GPUs with no change to the program, delivering 4 to 20× speedups over our optimized CPU code.

97 MATHEMATICS AND COMPUTING↗

Applications of rigged Hilbert spaces in quantum mechanics and signal processing

Simultaneous use of discrete and continuous bases in quantum systems is not possible in the context of Hilbert spaces, but only in the more general structure of rigged Hilbert spaces (RHS). In addition, the relevant operators in RHS (but not in Hilbert space) are a realization of elements of a Lie enveloping algebra and support representations of semigroups. We explicitly construct here basis dependent RHS of the line and half-line and relate them to the universal enveloping algebras of the Weyl-Heisenberg algebra and su(1, 1), respectively. The complete sub-structure of both RHS and of the operators acting on them is obtained from their algebraic structures or from the related fractional Fourier transforms. This allows us to describe both quantum and signal processing states and their dynamics. Two relevant improvements are introduced: (i) new kinds of filters related to restrictions to subspaces and/or the elimination of high frequency fluctuations and (ii) an operatorial structure that, starting from fix objects, describes their time evolution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algebraic calculations for spectrum of superintegrable system from exceptional orthogonal polynomials

We introduce an extended Kepler–Coulomb quantum model in spherical coordinates. The Schrödinger equation of this Hamiltonian is solved in these coordinates and it is shown that the wave functions of the system can be expressed in terms of Laguerre, Legendre and exceptional Jacobi polynomials (of hypergeometric type). We construct ladder and shift operators based on the corresponding wave functions and obtain their recurrence formulas. These recurrence relations are used to construct higher-order, algebraically independent integrals of motion to prove superintegrability of the Hamiltonian. The integrals form a higher rank polynomial algebra. By constructing the structure functions of the associated deformed oscillator algebras we derive the degeneracy of energy spectrum of the superintegrable system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algorithms and algebraic solutions of decay chain differential equations for stable and unstable nuclide fractionation

Radioactive decay processes, such as alpha decay, produce decay chains where the mass numbers of nuclides decrease as larger nuclides expel energetic particles to form smaller nuclides. Under these conditions, the coefficient matrix that describes the differential rate expressions for radioactive decay can be made lower triangular. With this special structure, formulating an algebraic solution to the decay chains can be done by first formulating the eigenvectors that make up the coefficient matrix, which can then be solved using forward substitution for a lower triangular matrix. This work details the derivation of algebraic solutions for decay chains of any number of stable and unstable nuclides with any number of branching based on this eigenvector analysis. A prototype computational code was developed to validate and compare this methodology against a number of other methods for solving similar systems. A two-phase sorting algorithm yielding the lower triangular matrix structure was established to apply the developed algebraic solutions for decay chains involving beta-emitting radionuclides transformed into daughter nuclides without change in their mass number. In conclusion, the methodologies produced in this work provide an efficient way to estimate nuclide fractions from natural decay processes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Invariants of the Cox rings of double flag varieties of low complexity for exceptional groups

We find the algebras of unipotent invariants of the Cox rings for all double flag varieties of complexity 0 and 1 for the exceptional simple algebraic groups; namely, we obtain presentations of these algebras in terms of generators and relations. It is well known that such an algebra is free in the case of complexity 0. In this paper, we show that, in the case of complexity 1, the algebra in question is either a free algebra or a hypersurface. A similar result for classical groups was previously obtained by the author. Knowing the structure of this algebra enables one to decompose tensor products of some irreducible representations effectively into irreducible summands and to obtain some branching rules. Bibliography: 10 titles. (paper)

97 MATHEMATICS AND COMPUTING↗

Topological BPS charges in 10- and 11-dimensional supergravity

We consider the supersymmetry algebras of the maximal supergravities in 10 and 11 dimensions. We construct expressions from which the topological charge structure of the algebras can be determined in supersymmetric curved backgrounds. These are interpreted as the topological charges of the 1/2-BPS states that are found in the theories. We consider charges for all the M-, NS- and D-branes as well as the Kaluza-Klein monopoles. We also show that the dimensional reduction relations between the 11-dimensional and IIA charges, and T-duality relations of the IIA and IIB charges, match those found for the branes themselves. Finally we consider the massive versions of the IIA and 11-dimensional theories and find that the expressions for the charges, with a slight modification, are still valid in those instances.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗