1,880,427 research outputs found
Abstract Algebra II
No full textThis Saylor course is an extension of abstract algebra I and revisits structures like groups, rings and fields as well as mappings like homomorphisms and isomorphisms.
Boundary Algebra: A Simple Notation for Boolean Algebra and the Truth Functors
Full text linkBoundary algebra [BA] is a simpler notation for Spencer-Brown’s (1969) primary algebra [pa], the Boolean algebra 2, and the truth functors. The primary arithmetic [PA] consists of the atoms ‘()’ and the blank page, concatenation, and enclosure between ‘(‘ and ‘)’, denoting the primitive notion of distinction. Inserting letters denoting the presence or absence of () into a PA formula yields a BA formula. The BA axioms are "()()=()" (A1), and "(()) [=?] may be written or erased at will” (A2). Repeated application of these axioms to a PA formula yields a member of B= {(),?} called its simplification. (a) has two intended interpretations: (a) ? a? (Boolean algebra 2), and (a) ? ~a (sentential logic). BA is self-dual: () ? 1 [dually 0] so that B is the carrier for 2, ab ? a?b [a?b], and (a)b [(a(b))] ? a=b, so that ?=() [()=?] follows trivially and B is a poset. The BA basis abc= bca (Dilworth 1938), a(ab)= a(b), and a()=() (Bricken 2002) facilitates clausal reasoning and proof by calculation. BA also simplifies normal forms and Quine’s (1982) truth value analysis. () ? true [false] yields boundary logic.G. Spencer Brown; boundary algebra; boundary logic; primary algebra; primary arithmetic; Boolean algebra; calculation proof; C.S. Peirce; existential graphs.
Linear Algebra and Smarandache Linear Algebra
Full text linkThe present book, on Smarandache linear algebra, not only studies the Smarandache analogues of linear algebra and its applications, it also aims to bridge the need for new research topics pertaining to linear algebra, purely in the algebraic sense. We have introduced Smarandache semilinear algebra, Smarandache bilinear algebra and Smarandache anti-linear algebra and their fuzzy equivalents. Moreover, in this book, we have brought out the study of linear algebra and vector spaces over finite prime fields, which is not properly represented or analyzed in linear algebra books
Irreducible highest weight representations of the simple n-Lie algebra
No full textA. Dzhumadil’daev classified all irreducible finite dimensional representations of the simple n-Lie algebra. Using a slightly different approach, we obtain in this paper a complete classification of all irreducible, highest weight modules, including the infinite-dimensional ones. As a corollary we find all primitive ideals of the universal enveloping algebra of this simple n-Lie algebr
Homological Algebra for Superalgebras of Differentiable Functions
No full textThis is the second in a series of papers laying the foundations for a differential graded approach to derived differential geometry (and other geometries in characteristic zero). In this paper, we extend the classical notion of a dg-algebra to define, in particular, the notion of a differential graded algebra in the world of C-infinity rings. The opposite of the category of differential graded C-infinity algebras contains the category of differential graded manifolds as a full subcategory. More generally, this notion of differential graded algebra makes sense for algebras over any (super) Fermat theory, and hence one also arrives at the definition of a differential graded algebra appropriate for the study of derived real and complex analytic manifolds and other variants. We go on to show that, for any super Fermat theory S which admits integration, a concept we define and show is satisfied by all important examples, the category of differential graded S-algebras supports a Quillen model structure naturally extending the classical one on differential graded algebras, both in the bounded and unbounded case (as well as differential algebras with no grading). Finally, we show that, under the same assumptions, any of these categories of differential graded S-algebras have a simplicial enrichment, compatible in a suitable sense with the model structure
A BV-algebra structure on Hochschild cohomology of the integral group ring of finitely generated Abelian groups
No full textWe study a Batalin-Vilkovisky algebra structure on the Hochschild cohomology of the group ring of finitely generated abelian groups. The Batalin-Vilkovisky algebra structure for finite abelian groups comes from the fact that the group ring of finite groups is a symmetric algebra, and the Batalin-Vilkovisky algebra structure for free abelian groups of finite rank comes from the fact that its group ring is a Calabi-Yau algebra. © 2024 The Author(s
The Weil algebra and the Van Est isomorphism
Full text linkThis paper belongs to a series of papers devoted to the study of the cohomology of classifying spaces. Generalizing the Weil algebra of a Lie algebra and Kalkman’s BRST model, here we introduce the Weil algebra W(A) associated to any Lie algebroid A. We then show that this Weil algebra is related to the Bott-Shulman complex (computing the cohomology of the classifying space) via a Van Est map and we prove a Van Est isomorphism theorem. As application, we generalize and find a simpler more conceptual proof of the main result of [6] on the reconstructions of multiplicative forms and of a result of [21, 9] on the reconstruction of connection 1-forms. This reveals the relevance of the Weil algebra and Van Est maps to the integration and the pre-quantization of Poisson (and Dirac) manifolds
Graphics calculators and algebra
Full text linkThe personal technology of the graphics calculator is presently the only one likely to be available widely enough to influence curriculum design and implementation on a large scale. The algebra curriculum of the past is overburdened with symbolic manipulation at the expense of understanding for most students. But algebra is much more than just symbolic manipulation. Connections between some aspects of algebra: expressing generality, functions, equations and advanced algebra and some graphics calculator capabilities are briefly described. It is suggested that these kinds of connections need to be taken into account in developing the algebra curriculum as well as in classroom teaching
Computer algebra and transputers applied to the finite element method
Full text linkRecent developments in computing technology have opened new prospects for computationally intensive numerical methods such as the finite element method. More complex and refined problems can be solved, for example increased number and order of the elements improving accuracy. The power of Computer Algebra systems and parallel processing techniques is expected to bring significant improvement in such methods. The main objective of this work has been to assess the use of these techniques in the finite element method. The generation of interpolation functions and element matrices has been investigated using Computer Algebra. Symbolic expressions were obtained automatically and efficiently converted into FORTRAN routines. Shape functions based on Lagrange polynomials and mapping functions for infinite elements were considered. One and two dimensional element matrices for bending problems based on Hermite polynomials were also derived. Parallel solvers for systems of linear equations have been developed since such systems often arise in numerical methods. Both symmetric and asymmetric solvers have been considered. The implementation was on Transputer-based machines. The speed-ups obtained are good. An analysis by finite element method of a free surface flow over a spillway has been carried out. Computer Algebra was used to derive the integrand of the element matrices and their numerical evaluation was done in parallel on a Transputer-based machine. A graphical interface was developed to enable the visualisation of the free surface and the influence of the parameters. The speed- ups obtained were good. Convergence of the iterative solution method used was good for gated spillways. Some problems experienced with the non-gated spillways have lead to a discussion and tests of the potential factors of instability
Identities in the Algebra of Partial Maps
No full textWe consider the identities of a variety of semigroup-related algebras modelling the algebra of partial maps. We show that the identities are intimately related to a weak semigroup deductive system and we show that the equational theory is decidable. We do this by giving a term rewriting system for the variety. We then show that this variety has many subvarieties whose equational theory interprets the full uniform word problem for semigroups and consequently are undecidable. As a corollary it is shown that the equational theory of Clifford semigroups whose natural order is a semilattice is undecidable
- …
