scholarly journals On algebraic structures of numerical integration on vector spaces and manifolds

Author(s):  
Alexander Lundervold ◽  
Hans Munthe-Kaas
2003 ◽  
Vol 14 (06) ◽  
pp. 573-617 ◽  
Author(s):  
Ralph M. Kaufmann

We study the general theory of Frobenius algebras with group actions. These structures arise when one is studying the algebraic structures associated to a geometry stemming from a physical theory with a global finite gauge group, i.e. orbifold theories. In this context, we introduce and axiomatize these algebras. Furthermore, we define geometric cobordism categories whose functors to the category of vector spaces are parameterized by these algebras. The theory is also extended to the graded and super-graded cases. As an application, we consider Frobenius algebras having some additional properties making them more tractable. These properties are present in Frobenius algebras arising as quotients of Jacobian ideal, such as those having their origin in quasi-homogeneous singularities and their symmetries.


2019 ◽  
pp. 191-224
Author(s):  
R. Balakrishnan ◽  
Sriraman Sridharan

Symmetry ◽  
2020 ◽  
Vol 12 (3) ◽  
pp. 423 ◽  
Author(s):  
Muhammad Asif ◽  
Muhammad Akram ◽  
Ghous Ali

The Pythagorean fuzzy models deal with graphical and algebraic structures in case of vague information related to membership and non-membership grades. Here, we use Pythagorean fuzzy sets to generalize the concept of vector spaces and discuss their basis and dimensions. We also highlight the concept of Pythagorean fuzzy matroids and examine some of their fundamental characteristics like circuits, basis, dimensions, and rank functions. Additionally, we explore the concept of Pythagorean fuzzy matroids in linear algebra, graph theory, and combinatorics. Finally, we demonstrate the use of Pythagorean fuzzy matroids for minimizing the time taken by a salesman in delivering given products.


1992 ◽  
Vol 57 (3) ◽  
pp. 892-911 ◽  
Author(s):  
Alex Feldman

In §3 we construct a universal, ℵ0-categorical recursively presented partial order with greatest lower bound operator. This gives us the unique structure which embeds every countable lower semilattice. In §§5 and 6 we investigate the recursive and recursively enumerable substructures of this structure, in particular finding a suitable definition for the simple-maximal hierarchy and giving an example of an infinite recursively enumerable substructure which does not contain any infinite recursive substructure.The idea of looking at the lattice of recursively enumerable substructures of some recursive algebraic structure was introduced by Metakides and Nerode in [5], and since then many different kinds of algebraic structures have been studied in this way, including vector spaces, Boolean algebras, groups, algebraically closed fields, and equivalence relations. Since different algebraic structures have different recursion theoretic properties, one natural question is whether an algebraic structure with relatively little structure (such as a partial order or an equivalence relation) exhibits behavior more like classical recursion theory than one with more structure (such as vector spaces or algebraically closed fields).In [6] and [7], Metakides and Remmel studied recursion theory on orderings, and, as they point out in [6], orderings differ from most other algebraic structures in that the algebraic closure operation on orderings is trivial; but this does not present a problem for them, given the questions they explore. Moreover, they take an approach of proving general theorems which can then be applied to specific orderings. Our tack is different, although also well-established (see, for example, [3]), in which a “largest” structure is defined (in §3) which corresponds to the natural numbers in classical recursion theory. In order to distinguish substructures from subsets, a function symbol is added, namely greatest lower bound. The greatest lower bound function is fundamental to the study of orderings and occurs naturally in many of them, and thus is an appropriate addition to the theory of orderings. In §4 we redefine the concepts of simple and maximal in a manner appropriate to this structure, and prove several existence theorems.


1966 ◽  
Vol 25 ◽  
pp. 227-229 ◽  
Author(s):  
D. Brouwer

The paper presents a summary of the results obtained by C. J. Cohen and E. C. Hubbard, who established by numerical integration that a resonance relation exists between the orbits of Neptune and Pluto. The problem may be explored further by approximating the motion of Pluto by that of a particle with negligible mass in the three-dimensional (circular) restricted problem. The mass of Pluto and the eccentricity of Neptune's orbit are ignored in this approximation. Significant features of the problem appear to be the presence of two critical arguments and the possibility that the orbit may be related to a periodic orbit of the third kind.


2011 ◽  
Vol 131 (9) ◽  
pp. 1633-1641
Author(s):  
Toshifumi Honda ◽  
Kenji Obara ◽  
Minoru Harada ◽  
Hajime Igarashi

Sign in / Sign up

Export Citation Format

Share Document