Ideals, varieties, and algorithms an introduction to computational algebraic geometry and commutative algebra

CERN Document Server

Cox, David A; O'Shea, Donal

2015-01-01

This text covers topics in algebraic geometry and commutative algebra with a strong perspective toward practical and computational aspects. The first four chapters form the core of the book. A comprehensive chart in the preface illustrates a variety of ways to proceed with the material once these chapters are covered. In addition to the fundamentals of algebraic geometry—the elimination theorem, the extension theorem, the closure theorem, and the Nullstellensatz—this new edition incorporates several substantial changes, all of which are listed in the Preface. The largest revision incorporates a new chapter (ten), which presents some of the essentials of progress made over the last decades in computing Gröbner bases. The book also includes current computer algebra material in Appendix C and updated independent projects (Appendix D). The book may serve as a first or second course in undergraduate abstract algebra and, with some supplementation perhaps, for beginning graduate level courses in algebraic geom...

Computational linear and commutative algebra

CERN Document Server

Kreuzer, Martin

2016-01-01

This book combines, in a novel and general way, an extensive development of the theory of families of commuting matrices with applications to zero-dimensional commutative rings, primary decompositions and polynomial system solving. It integrates the Linear Algebra of the Third Millennium, developed exclusively here, with classical algorithmic and algebraic techniques. Even the experienced reader will be pleasantly surprised to discover new and unexpected aspects in a variety of subjects including eigenvalues and eigenspaces of linear maps, joint eigenspaces of commuting families of endomorphisms, multiplication maps of zero-dimensional affine algebras, computation of primary decompositions and maximal ideals, and solution of polynomial systems. This book completes a trilogy initiated by the uncharacteristically witty books Computational Commutative Algebra 1 and 2 by the same authors. The material treated here is not available in book form, and much of it is not available at all. The authors continue to prese...

Category-theoretic models of algebraic computer systems

Science.gov (United States)

Kovalyov, S. P.

2016-01-01

A computer system is said to be algebraic if it contains nodes that implement unconventional computation paradigms based on universal algebra. A category-based approach to modeling such systems that provides a theoretical basis for mapping tasks to these systems' architecture is proposed. The construction of algebraic models of general-purpose computations involving conditional statements and overflow control is formally described by a reflector in an appropriate category of algebras. It is proved that this reflector takes the modulo ring whose operations are implemented in the conventional arithmetic processors to the Łukasiewicz logic matrix. Enrichments of the set of ring operations that form bases in the Łukasiewicz logic matrix are found.

Classical versus Computer Algebra Methods in Elementary Geometry

Science.gov (United States)

Pech, Pavel

2005-01-01

Computer algebra methods based on results of commutative algebra like Groebner bases of ideals and elimination of variables make it possible to solve complex, elementary and non elementary problems of geometry, which are difficult to solve using a classical approach. Computer algebra methods permit the proof of geometric theorems, automatic…

Computing one of Victor Moll's irresistible integrals with computer algebra

Directory of Open Access Journals (Sweden)

Christoph Koutschan

2008-04-01

Full Text Available We investigate a certain quartic integral from V. Moll's book “Irresistible Integrals” and demonstrate how it can be solved by computer algebra methods, namely by using non-commutative Gröbner bases. We present recent implementations in the computer algebra systems SINGULAR and MATHEMATICA.

Algebraic computability and enumeration models recursion theory and descriptive complexity

CERN Document Server

Nourani, Cyrus F

2016-01-01

This book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic viewpoint. The reader is first introduced to categories and functorial models, with Kleene algebra examples for languages. Functorial models for Peano arithmetic are described toward important computational complexity areas on a Hilbert program, leading to computability with initial models. Infinite language categories are also introduced to explain descriptive complexity with recursive computability with admissible sets and urelements. Algebraic and categorical realizability is staged on several levels, addressing new computability questions with omitting types realizably. Further applications to computing with ultrafilters on sets and Turing degree computability are examined. Functorial models computability is presented with algebraic trees realizing intuitionistic type...

Computer Algebra Systems in Undergraduate Instruction.

Science.gov (United States)

Small, Don; And Others

1986-01-01

Computer algebra systems (such as MACSYMA and muMath) can carry out many of the operations of calculus, linear algebra, and differential equations. Use of them with sketching graphs of rational functions and with other topics is discussed. (MNS)

Introduction to relation algebras relation algebras

CERN Document Server

Givant, Steven

2017-01-01

The first volume of a pair that charts relation algebras from novice to expert level, this text offers a comprehensive grounding for readers new to the topic. Upon completing this introduction, mathematics students may delve into areas of active research by progressing to the second volume, Advanced Topics in Relation Algebras; computer scientists, philosophers, and beyond will be equipped to apply these tools in their own field. The careful presentation establishes first the arithmetic of relation algebras, providing ample motivation and examples, then proceeds primarily on the basis of algebraic constructions: subalgebras, homomorphisms, quotient algebras, and direct products. Each chapter ends with a historical section and a substantial number of exercises. The only formal prerequisite is a background in abstract algebra and some mathematical maturity, though the reader will also benefit from familiarity with Boolean algebra and naïve set theory. The measured pace and outstanding clarity are particularly ...

Geometric Algebra Computing

CERN Document Server

Corrochano, Eduardo Bayro

2010-01-01

This book presents contributions from a global selection of experts in the field. This useful text offers new insights and solutions for the development of theorems, algorithms and advanced methods for real-time applications across a range of disciplines. Written in an accessible style, the discussion of all applications is enhanced by the inclusion of numerous examples, figures and experimental analysis. Features: provides a thorough discussion of several tasks for image processing, pattern recognition, computer vision, robotics and computer graphics using the geometric algebra framework; int

Computational commutative and non-commutative algebraic geometry

CERN Document Server

Cojocaru, S; Ufnarovski, V

2005-01-01

This publication gives a good insight in the interplay between commutative and non-commutative algebraic geometry. The theoretical and computational aspects are the central theme in this study. The topic is looked at from different perspectives in over 20 lecture reports. It emphasizes the current trends in commutative and non-commutative algebraic geometry and algebra. The contributors to this publication present the most recent and state-of-the-art progresses which reflect the topic discussed in this publication. Both researchers and graduate students will find this book a good source of information on commutative and non-commutative algebraic geometry.

Clifford algebras, noncommutative tori and universal quantum computers

OpenAIRE

Vlasov, Alexander Yu.

2001-01-01

Recently author suggested [quant-ph/0010071] an application of Clifford algebras for construction of a "compiler" for universal binary quantum computer together with later development [quant-ph/0012009] of the similar idea for a non-binary base. The non-binary case is related with application of some extension of idea of Clifford algebras. It is noncommutative torus defined by polynomial algebraic relations of order l. For l=2 it coincides with definition of Clifford algebra. Here is presente...

IV International Conference on Computer Algebra in Physical Research. Collection of abstracts

International Nuclear Information System (INIS)

Rostovtsev, V.A.

1990-01-01

The abstracts of the reports made on IV International conference on computer algebra in physical research are presented. The capabilities of application of computers for algebraic computations in high energy physics and quantum field theory are discussed. Particular attention is paid to a software for the REDUCE computer algebra system

Using computer algebra and SMT-solvers to analyze a mathematical model of cholera propagation

Science.gov (United States)

Trujillo Arredondo, Mariana

2014-06-01

We analyze a mathematical model for the transmission of cholera. The model is already defined and involves variables such as the pathogen agent, which in this case is the bacterium Vibrio cholera, and the human population. The human population is divided into three classes: susceptible, infectious and removed. Using Computer Algebra, specifically Maple we obtain two equilibrium states: the disease free state and the endemic state. Using Maple it is possible to prove that the disease free state is locally asymptotically stable if and only if R0 1. Using the package Red-Log of the Computer algebra system Reduce and the SMT-Solver Z3Py it is possible to obtain numerical conditions for the model. The formula for the basic reproductive number makes a synthesis with all epidemic parameters in the model. Also it is possible to make numerical simulations which are very illustrative about the epidemic patters that are expected to be observed in real situations. We claim that these kinds of software are very useful in the analysis of epidemic models given that the symbolic computation provides algebraic formulas for the basic reproductive number and such algebraic formulas are very useful to derive control measures. For other side, computer algebra software is a powerful tool to make the stability analysis for epidemic models given that the all steps in the stability analysis can be made automatically: finding the equilibrium points, computing the jacobian, computing the characteristic polynomial for the jacobian, and applying the Routh-Hurwitz theorem to the characteristic polynomial. Finally, using SMT-Solvers is possible to make automatically checks of satisfiability, validity and quantifiers elimination being these computations very useful to analyse complicated epidemic models.

Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge

DEFF Research Database (Denmark)

Lauritzen, Niels

2005-01-01

We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge.......We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge....

ASYS: a computer algebra package for analysis of nonlinear algebraic equations systems

International Nuclear Information System (INIS)

Gerdt, V.P.; Khutornoj, N.V.

1992-01-01

A program package ASYS for analysis of nonlinear algebraic equations based on the Groebner basis technique is described. The package is written in REDUCE computer algebra language. It has special facilities to treat polynomial ideals of positive dimension, corresponding to algebraic systems with infinitely many solutions. Such systems can be transformed to an equivalent set of subsystems with reduced number of variables in completely automatic way. It often allows to construct the explicit form of a solution set in many problems of practical importance. Some examples and results of comparison with the standard Reduce package GROEBNER and special-purpose systems FELIX and A1PI are given. 21 refs.; 2 tabs

Computational triadic algebras of signs

Energy Technology Data Exchange (ETDEWEB)

Zadrozny, W. [T.J. Watson Research Center, Yorktown Heights, NY (United States)

1996-12-31

We present a finite model of Peirce`s ten classes of signs. We briefly describe Peirce`s taxonomy of signs; we prove that any finite collection of signs can be extended to a finite algebra of signs in which all interpretants are themselves being interpreted; and we argue that Peirce`s ten classes of signs can be defined using constraints on algebras of signs. The paper opens the possibility of defining multimodal cognitive agents using Peirce`s classes of signs, and is a first step towards building a computational logic of signs based on Peirce`s taxonomies.

2nd EACA International School on Computer Algebra and its Applications

CERN Document Server

Gimenez, Philippe; Sáenz-de-Cabezón, Eduardo

2017-01-01

Featuring up-to-date coverage of three topics lying at the intersection of combinatorics and commutative algebra, namely Koszul algebras, primary decompositions and subdivision operations in simplicial complexes, this book has its focus on computations. "Computations and combinatorics in commutative algebra" has been written by experts in both theoretical and computational aspects of these three subjects and is aimed at a broad audience, from experienced researchers who want to have an easy but deep review of the topics covered to postgraduate students who need a quick introduction to the techniques. The computational treatment of the material, including plenty of examples and code, will be useful for a wide range of professionals interested in the connections between commutative algebra and combinatorics.

Using CAMAL for algebraic computations in general relativity

International Nuclear Information System (INIS)

Fitch, J.P.

1979-01-01

CAMAL is a collection of computer algebra systems developed in Cambridge, England for use mainly in theoretical physics. One of these was designed originally for general relativity calculations, although it is often used in other fields. In a recent paper Cohen, Leringe, and Sundblad compared six systems for algebraic computations applied to general relativity available in Stockholm. Here similar information for CAMAL is given and by using the same tests CAMAL is added to the comparison. (author)

Global identifiability of linear compartmental models--a computer algebra algorithm.

Science.gov (United States)

Audoly, S; D'Angiò, L; Saccomani, M P; Cobelli, C

1998-01-01

A priori global identifiability deals with the uniqueness of the solution for the unknown parameters of a model and is, thus, a prerequisite for parameter estimation of biological dynamic models. Global identifiability is however difficult to test, since it requires solving a system of algebraic nonlinear equations which increases both in nonlinearity degree and number of terms and unknowns with increasing model order. In this paper, a computer algebra tool, GLOBI (GLOBal Identifiability) is presented, which combines the topological transfer function method with the Buchberger algorithm, to test global identifiability of linear compartmental models. GLOBI allows for the automatic testing of a priori global identifiability of general structure compartmental models from general multi input-multi output experiments. Examples of usage of GLOBI to analyze a priori global identifiability of some complex biological compartmental models are provided.

Applications of computer algebra

CERN Document Server

1985-01-01

Today, certain computer software systems exist which surpass the computational ability of researchers when their mathematical techniques are applied to many areas of science and engineering. These computer systems can perform a large portion of the calculations seen in mathematical analysis. Despite this massive power, thousands of people use these systems as a routine resource for everyday calculations. These software programs are commonly called "Computer Algebra" systems. They have names such as MACSYMA, MAPLE, muMATH, REDUCE and SMP. They are receiving credit as a computational aid with in­ creasing regularity in articles in the scientific and engineering literature. When most people think about computers and scientific research these days, they imagine a machine grinding away, processing numbers arithmetically. It is not generally realized that, for a number of years, computers have been performing non-numeric computations. This means, for example, that one inputs an equa­ tion and obtains a closed for...

Applications of symbolic algebraic computation

International Nuclear Information System (INIS)

Brown, W.S.; Hearn, A.C.

1979-01-01

This paper is a survey of applications of systems for symbomic algebraic computation. In most successful applications, calculations that can be taken to a given order by hand are then extended one or two more orders by computer. Furthermore, with a few notable exceptins, these applications also involve numerical computation in some way. Therefore the authors emphasize the interface between symbolic and numerical computation, including: 1. Computations with both symbolic and numerical phases. 2. Data involving both the unpredictible size and shape that typify symbolic computation and the (usually inexact) numerical values that characterize numerical computation. 3. Applications of one field to the other. It is concluded that the fields of symbolic and numerical computation can advance most fruitfully in harmony rather than in competition. (Auth.)

INdAM Meeting on Homological and Computational Methods in Commutative Algebra

CERN Document Server

Gubeladze, Joseph; Römer, Tim

2017-01-01

This volume collects contributions by leading experts in the area of commutative algebra related to the  INdAM meeting “Homological and Computational Methods in Commutative Algebra” held in Cortona (Italy) from May 30 to  June 3, 2016 . The conference and this volume are dedicated to Winfried Bruns on the occasion of his 70th birthday. In particular, the topics of this book strongly reflect the variety of Winfried Bruns’ research interests and his great impact on commutative algebra as well as its applications to related fields. The authors discuss recent and relevant developments in algebraic geometry, commutative algebra, computational algebra, discrete geometry and homological algebra. The book offers a unique resource, both for young and more experienced researchers seeking comprehensive overviews and extensive bibliographic references.

Computer algebra simulation - what can it do?; Was leistet Computer-Algebra-Simulation?

Energy Technology Data Exchange (ETDEWEB)

Braun, S. [Visual Analysis AG, Muenchen (Germany)

2001-07-01

Shortened development times require new and improved calculation methods. Numeric methods have long become state of the art. However, although numeric simulations provide a better understanding of process parameters, they do not give a feast overview of the interdependences between parameters. Numeric simulations are effective only if all physical parameters are sufficiently known; otherwise, the efficiency will decrease due to the large number of variant calculations required. Computer algebra simulation closes this gap and provides a deeper understanding of the physical fundamentals of technical processes. [German] Neue und verbesserte Berechnungsmethoden sind notwendig, um die staendige Verkuerzung der Entwicklungszyklen zu ermoeglichen. Herkoemmliche Methoden, die auf einem rein numerischen Ansatz basieren, haben sich in vielen Anwendungsbereichen laengst zum Standard entwickelt. Aber nicht nur die staendig kuerzer werdenden Entwicklungszyklen, sondern auch die weiterwachsende Komplexitaet machen es notwendig, ein besseres Verstaendnis der beteiligten Prozessparameter zu gewinnen. Die numerische Simulation besticht zwar durch Detailloesungen, selbst bei komplexen Strukturen und Prozessen, allerdings liefert sie keine schnelle Abschaetzung ueber die Zusammenhaenge zwischen den einzelnen Parametern. Die numerische Simulation ist nur dann effektiv, wenn alle physikalischen Parameter hinreichend bekannt sind; andernfalls sinkt die Effizienz durch die notwendige Anzahl von notwendigen Variantenrechnungen sehr stark. Die Computer-Algebra-Simulation schliesst diese Luecke in dem sie es erlaubt, sich einen tieferen Einblick in die physikalische Funktionsweise technischer Prozesse zu verschaffen. (orig.)

Inequalities, Assessment and Computer Algebra

Science.gov (United States)

Sangwin, Christopher J.

2015-01-01

The goal of this paper is to examine single variable real inequalities that arise as tutorial problems and to examine the extent to which current computer algebra systems (CAS) can (1) automatically solve such problems and (2) determine whether students' own answers to such problems are correct. We review how inequalities arise in contemporary…

A sampler of useful computational tools for applied geometry, computer graphics, and image processing foundations for computer graphics, vision, and image processing

CERN Document Server

Cohen-Or, Daniel; Ju, Tao; Mitra, Niloy J; Shamir, Ariel; Sorkine-Hornung, Olga; Zhang, Hao (Richard)

2015-01-01

A Sampler of Useful Computational Tools for Applied Geometry, Computer Graphics, and Image Processing shows how to use a collection of mathematical techniques to solve important problems in applied mathematics and computer science areas. The book discusses fundamental tools in analytical geometry and linear algebra. It covers a wide range of topics, from matrix decomposition to curvature analysis and principal component analysis to dimensionality reduction.Written by a team of highly respected professors, the book can be used in a one-semester, intermediate-level course in computer science. It

Simple relation algebras

CERN Document Server

Givant, Steven

2017-01-01

This monograph details several different methods for constructing simple relation algebras, many of which are new with this book. By drawing these seemingly different methods together, all are shown to be aspects of one general approach, for which several applications are given. These tools for constructing and analyzing relation algebras are of particular interest to mathematicians working in logic, algebraic logic, or universal algebra, but will also appeal to philosophers and theoretical computer scientists working in fields that use mathematics. The book is written with a broad audience in mind and features a careful, pedagogical approach; an appendix contains the requisite background material in relation algebras. Over 400 exercises provide ample opportunities to engage with the material, making this a monograph equally appropriate for use in a special topics course or for independent study. Readers interested in pursuing an extended background study of relation algebras will find a comprehensive treatme...

Implementing Computer Algebra Enabled Questions for the Assessment and Learning of Mathematics

Science.gov (United States)

Sangwin, Christopher J.; Naismith, Laura

2008-01-01

We present principles for the design of an online system to support computer algebra enabled questions for use within the teaching and learning of mathematics in higher education. The introduction of a computer algebra system (CAS) into a computer aided assessment (CAA) system affords sophisticated response processing of student provided answers.…

Algebraic computing in general relativity

International Nuclear Information System (INIS)

D'Inverno, R.A.

1975-01-01

The purpose of this paper is to bring to the attention of potential users the existence of algebraic computing systems, and to illustrate their use by reviewing a number of problems for which such a system has been successfully used in General Relativity. In addition, some remarks are included which may be of help in the future design of these systems. (author)

Aberration studies and computer algebra

International Nuclear Information System (INIS)

Hawkes, P.W.

1981-01-01

The labour of calculating expressions for aberration coefficients is considerably lightened if a computer algebra language is used to perform the various substitutions and expansions involved. After a brief discussion of matrix representations of aberration coefficients, a particular language, which has shown itself to be well adapted to particle optics, is described and applied to the study of high frequency cavity lenses. (orig.)

Categorical Algebra and its Applications

CERN Document Server

1988-01-01

Categorical algebra and its applications contain several fundamental papers on general category theory, by the top specialists in the field, and many interesting papers on the applications of category theory in functional analysis, algebraic topology, algebraic geometry, general topology, ring theory, cohomology, differential geometry, group theory, mathematical logic and computer sciences. The volume contains 28 carefully selected and refereed papers, out of 96 talks delivered, and illustrates the usefulness of category theory today as a powerful tool of investigation in many other areas.

Computer Algebra Recipes for Mathematical Physics

CERN Document Server

Enns, Richard H

2005-01-01

Over two hundred novel and innovative computer algebra worksheets or "recipes" will enable readers in engineering, physics, and mathematics to easily and rapidly solve and explore most problems they encounter in their mathematical physics studies. While the aim of this text is to illustrate applications, a brief synopsis of the fundamentals for each topic is presented, the topics being organized to correlate with those found in traditional mathematical physics texts. The recipes are presented in the form of stories and anecdotes, a pedagogical approach that makes a mathematically challenging subject easier and more fun to learn. Key features: * Uses the MAPLE computer algebra system to allow the reader to easily and quickly change the mathematical models and the parameters and then generate new answers * No prior knowledge of MAPLE is assumed; the relevant MAPLE commands are introduced on a need-to-know basis * All MAPLE commands are indexed for easy reference * A classroom-tested story/anecdote format is use...

Elementary Business Calculus with Computer Algebra.

Science.gov (United States)

Judson, Phoebe T.

1990-01-01

Described are various ways that a computer algebra system (MAPLE) was used to facilitate the resequencing of skills and applications within an elementary college-level business calculus course. Experimental results confirmed earlier findings that skills acquisition is not a prerequisite to conceptual understanding or problem-solving ability. (JJK)

SAGA advances in ShApes, Geometry, and Algebra : results from the Marie Curie initial training network

CERN Document Server

Muntingh, Georg

2014-01-01

This book summarizes research carried out in workshops of the SAGA project, an Initial Training Network exploring the interplay of Shapes, Algebra, Geometry and Algorithms. Written by a combination of young and experienced researchers, the book introduces new ideas in an established context. Among the central topics are approximate and sparse implicitization and surface parametrization; algebraic tools for geometric computing; algebraic geometry for computer aided design applications and problems with industrial applications. Readers will encounter new methods for the (approximate) transition between the implicit and parametric representation; new algebraic tools for geometric computing; new applications of isogeometric analysis, and will gain insight into the emerging research field situated between algebraic geometry and computer aided geometric design.

Application of Computer Graphics to Graphing in Algebra and Trigonometry. Final Report.

Science.gov (United States)

Morris, J. Richard

This project was designed to improve the graphing competency of students in elementary algebra, intermediate algebra, and trigonometry courses at Virginia Commonwealth University. Computer graphics programs were designed using an Apple II Plus computer and implemented using Pascal. The software package is interactive and gives students control…

Algebraic computing program for studying the gauge theory

International Nuclear Information System (INIS)

Zet, G.

2005-01-01

An algebraic computing program running on Maple V platform is presented. The program is devoted to the study of the gauge theory with an internal Lie group as local symmetry. The physical quantities (gauge potentials, strength tensors, dual tensors etc.) are introduced either as equations in terms of previous defined quantities (tensors), or by manual entry of the component values. The components of the strength tensor and of its dual are obtained with respect to a given metric of the space-time used for describing the gauge theory. We choose a Minkowski space-time endowed with spherical symmetry and give some example of algebraic computing that are adequate for studying electroweak or gravitational interactions. The field equations are also obtained and their solutions are determined using the DEtools facilities of the Maple V computing program. (author)

Guide to Geometric Algebra in Practice

CERN Document Server

Dorst, Leo

2011-01-01

This highly practical "Guide to Geometric Algebra in Practice" reviews algebraic techniques for geometrical problems in computer science and engineering, and the relationships between them. The topics covered range from powerful new theoretical developments, to successful applications, and the development of new software and hardware tools. This title: provides hands-on review exercises throughout the book, together with helpful chapter summaries; presents a concise introductory tutorial to conformal geometric algebra (CGA) in the appendices; examines the application of CGA for the d

Computing with impure numbers - Automatic consistency checking and units conversion using computer algebra

Science.gov (United States)

Stoutemyer, D. R.

1977-01-01

The computer algebra language MACSYMA enables the programmer to include symbolic physical units in computer calculations, and features automatic detection of dimensionally-inhomogeneous formulas and conversion of inconsistent units in a dimensionally homogeneous formula. Some examples illustrate these features.

Quantum complexity of graph and algebraic problems

International Nuclear Information System (INIS)

Doern, Sebastian

2008-01-01

This thesis is organized as follows: In Chapter 2 we give some basic notations, definitions and facts from linear algebra, graph theory, group theory and quantum computation. In Chapter 3 we describe three important methods for the construction of quantum algorithms. We present the quantum search algorithm by Grover, the quantum amplitude amplification and the quantum walk search technique by Magniez et al. These three tools are the basis for the development of our new quantum algorithms for graph and algebra problems. In Chapter 4 we present two tools for proving quantum query lower bounds. We present the quantum adversary method by Ambainis and the polynomial method introduced by Beals et al. The quantum adversary tool is very useful to prove good lower bounds for many graph and algebra problems. The part of the thesis containing the original results is organized in two parts. In the first part we consider the graph problems. In Chapter 5 we give a short summary of known quantum graph algorithms. In Chapter 6 to 8 we study the complexity of our new algorithms for matching problems, graph traversal and independent set problems on quantum computers. In the second part of our thesis we present new quantum algorithms for algebraic problems. In Chapter 9 to 10 we consider group testing problems and prove quantum complexity bounds for important problems from linear algebra. (orig.)

Quantum complexity of graph and algebraic problems

Energy Technology Data Exchange (ETDEWEB)

Doern, Sebastian

2008-02-04

This thesis is organized as follows: In Chapter 2 we give some basic notations, definitions and facts from linear algebra, graph theory, group theory and quantum computation. In Chapter 3 we describe three important methods for the construction of quantum algorithms. We present the quantum search algorithm by Grover, the quantum amplitude amplification and the quantum walk search technique by Magniez et al. These three tools are the basis for the development of our new quantum algorithms for graph and algebra problems. In Chapter 4 we present two tools for proving quantum query lower bounds. We present the quantum adversary method by Ambainis and the polynomial method introduced by Beals et al. The quantum adversary tool is very useful to prove good lower bounds for many graph and algebra problems. The part of the thesis containing the original results is organized in two parts. In the first part we consider the graph problems. In Chapter 5 we give a short summary of known quantum graph algorithms. In Chapter 6 to 8 we study the complexity of our new algorithms for matching problems, graph traversal and independent set problems on quantum computers. In the second part of our thesis we present new quantum algorithms for algebraic problems. In Chapter 9 to 10 we consider group testing problems and prove quantum complexity bounds for important problems from linear algebra. (orig.)

Principles of algebraic geometry

CERN Document Server

Griffiths, Phillip A

1994-01-01

A comprehensive, self-contained treatment presenting general results of the theory. Establishes a geometric intuition and a working facility with specific geometric practices. Emphasizes applications through the study of interesting examples and the development of computational tools. Coverage ranges from analytic to geometric. Treats basic techniques and results of complex manifold theory, focusing on results applicable to projective varieties, and includes discussion of the theory of Riemann surfaces and algebraic curves, algebraic surfaces and the quadric line complex as well as special top

Computer methods in general relativity: algebraic computing

CERN Document Server

Araujo, M E; Skea, J E F; Koutras, A; Krasinski, A; Hobill, D; McLenaghan, R G; Christensen, S M

1993-01-01

Karlhede & MacCallum [1] gave a procedure for determining the Lie algebra of the isometry group of an arbitrary pseudo-Riemannian manifold, which they intended to im- plement using the symbolic manipulation package SHEEP but never did. We have recently finished making this procedure explicit by giving an algorithm suitable for implemen- tation on a computer [2]. Specifically, we have written an algorithm for determining the isometry group of a spacetime (in four dimensions), and partially implemented this algorithm using the symbolic manipulation package CLASSI, which is an extension of SHEEP.

Algebraic Modeling of Topological and Computational Structures and Applications

CERN Document Server

Theodorou, Doros; Stefaneas, Petros; Kauffman, Louis

2017-01-01

This interdisciplinary book covers a wide range of subjects, from pure mathematics (knots, braids, homotopy theory, number theory) to more applied mathematics (cryptography, algebraic specification of algorithms, dynamical systems) and concrete applications (modeling of polymers and ionic liquids, video, music and medical imaging). The main mathematical focus throughout the book is on algebraic modeling with particular emphasis on braid groups. The research methods include algebraic modeling using topological structures, such as knots, 3-manifolds, classical homotopy groups, and braid groups. The applications address the simulation of polymer chains and ionic liquids, as well as the modeling of natural phenomena via topological surgery. The treatment of computational structures, including finite fields and cryptography, focuses on the development of novel techniques. These techniques can be applied to the design of algebraic specifications for systems modeling and verification. This book is the outcome of a w...

Solving algebraic computational problems in geodesy and geoinformatics the answer to modern challenges

CERN Document Server

Awange, Joseph L

2004-01-01

While preparing and teaching 'Introduction to Geodesy I and II' to - dergraduate students at Stuttgart University, we noticed a gap which motivated the writing of the present book: Almost every topic that we taughtrequiredsomeskillsinalgebra,andinparticular,computeral- bra! From positioning to transformation problems inherent in geodesy and geoinformatics, knowledge of algebra and application of computer algebra software were required. In preparing this book therefore, we haveattemptedtoputtogetherbasicconceptsofabstractalgebra which underpin the techniques for solving algebraic problems. Algebraic c- putational algorithms useful for solving problems which require exact solutions to nonlinear systems of equations are presented and tested on various problems. Though the present book focuses mainly on the two ?elds,theconceptsand techniquespresented hereinarenonetheless- plicable to other ?elds where algebraic computational problems might be encountered. In Engineering for example, network densi?cation and robo...

Linking Computer Algebra Systems and Paper-and-Pencil Techniques To Support the Teaching of Mathematics.

Science.gov (United States)

van Herwaarden, Onno A.; Gielen, Joseph L. W.

2002-01-01

Focuses on students showing a lack of conceptual insight while using computer algebra systems (CAS) in the setting of an elementary calculus and linear algebra course for first year university students in social sciences. The use of a computer algebra environment has been incorporated into a more traditional course but with special attention on…

A Computer Algebra Approach to Solving Chemical Equilibria in General Chemistry

Science.gov (United States)

Kalainoff, Melinda; Lachance, Russ; Riegner, Dawn; Biaglow, Andrew

2012-01-01

In this article, we report on a semester-long study of the incorporation into our general chemistry course, of advanced algebraic and computer algebra techniques for solving chemical equilibrium problems. The method presented here is an alternative to the commonly used concentration table method for describing chemical equilibria in general…

Microeconomic theory and computation applying the maxima open-source computer algebra system

CERN Document Server

Hammock, Michael R

2014-01-01

This book provides a step-by-step tutorial for using Maxima, an open-source multi-platform computer algebra system, to examine the economic relationships that form the core of microeconomics in a way that complements traditional modeling techniques.

Polymorphism and Module-Reuse Mechanisms for Algebraic Petri Nets in CoopnTools

OpenAIRE

Buffo, Mathieu; Buchs, Didier; Donatelli, S.; Kleijn, J.

1999-01-01

This paper introduces CoopnTools, a tool set allowing the support of object-oriented specifications written by means of the language CO-OPN/2, based on synchronised algebraic Petri nets. In particular, this paper shows how concrete mechanisms dealing with polymorphism and module-reuse are implemented in CoopnTools.

AIR Tools II: algebraic iterative reconstruction methods, improved implementation

DEFF Research Database (Denmark)

Hansen, Per Christian; Jørgensen, Jakob Sauer

2017-01-01

with algebraic iterative methods and their convergence properties. The present software is a much expanded and improved version of the package AIR Tools from 2012, based on a new modular design. In addition to improved performance and memory use, we provide more flexible iterative methods, a column-action method...

The combinatorics computation for Casimir operators of the symplectic Lie algebra and the application for determining the center of the enveloping algebra of a semidirect product

International Nuclear Information System (INIS)

Le Van Hop.

1989-12-01

The combinatorics computation is used to describe the Casimir operators of the symplectic Lie Algebra. This result is applied for determining the Center of the enveloping Algebra of the semidirect Product of the Heisenberg Lie Algebra and the symplectic Lie Algebra. (author). 10 refs

Classification and identification of Lie algebras

CERN Document Server

Snobl, Libor

2014-01-01

The purpose of this book is to serve as a tool for researchers and practitioners who apply Lie algebras and Lie groups to solve problems arising in science and engineering. The authors address the problem of expressing a Lie algebra obtained in some arbitrary basis in a more suitable basis in which all essential features of the Lie algebra are directly visible. This includes algorithms accomplishing decomposition into a direct sum, identification of the radical and the Levi decomposition, and the computation of the nilradical and of the Casimir invariants. Examples are given for each algorithm. For low-dimensional Lie algebras this makes it possible to identify the given Lie algebra completely. The authors provide a representative list of all Lie algebras of dimension less or equal to 6 together with their important properties, including their Casimir invariants. The list is ordered in a way to make identification easy, using only basis independent properties of the Lie algebras. They also describe certain cl...

The algebraic manipulation program DIRAC on IBM personal computers

International Nuclear Information System (INIS)

Grozin, A.G.; Perlt, H.

1989-01-01

The version DIRAC (2.2) for IBM compatible personal computers is described. It is designed to manipulate algebraically with polynomials and tensors. After a short introduction concerning implementation and usage on personal computers an example program is given. It contains a detailed user's guide to DIRAC (2.2) and, additionally some useful applications. 4 refs

Changes in Pre-Service Teachers' Algebraic Misconceptions by Using Computer-Assisted Instruction

Science.gov (United States)

Lin, ByCheng-Yao; Ko, Yi-Yin; Kuo, Yu-Chun

2014-01-01

In order to carry out current reforms regarding algebra and technology in elementary school mathematics successfully, pre-service elementary mathematics teachers must be equipped with adequate understandings of algebraic concepts and self-confidence in using computers for their future teaching. This paper examines the differences in preservice…

Image reconstruction of computed tomograms using functional algebra

International Nuclear Information System (INIS)

Bradaczek, M.; Bradaczek, H.

1997-01-01

A detailed presentation of the process for calculating computed tomograms from the measured data by means of functional algebra is given and an attempt is made to demonstrate the relationships to those inexperienced in mathematics. Suggestions are also made to the manufacturers for improving tomography software although the authors cannot exclude the possibility that some of the recommendations may have already been realized. An interpolation in Fourier space to right-angled coordinates was not employed so that additional computer time and errors resulting from the interpolation are avoided. The savings in calculation time can only be estimated but should amount to about 25%. The error-correction calculation is merely a suggestion since it depends considerably on the apparatus used. Functional algebra is introduced here because it is not so well known but does provide appreciable simplifications in comparison to an explicit presentation. Didactic reasons as well as the possibility for reducing calculation time provided the foundation for this work. (orig.) [de

Using Computer Symbolic Algebra to Solve Differential Equations.

Science.gov (United States)

Mathews, John H.

1989-01-01

This article illustrates that mathematical theory can be incorporated into the process to solve differential equations by a computer algebra system, muMATH. After an introduction to functions of muMATH, several short programs for enhancing the capabilities of the system are discussed. Listed are six references. (YP)

Affine.m—Mathematica package for computations in representation theory of finite-dimensional and affine Lie algebras

Science.gov (United States)

Nazarov, Anton

2012-11-01

In this paper we present Affine.m-a program for computations in representation theory of finite-dimensional and affine Lie algebras and describe implemented algorithms. The algorithms are based on the properties of weights and Weyl symmetry. Computation of weight multiplicities in irreducible and Verma modules, branching of representations and tensor product decomposition are the most important problems for us. These problems have numerous applications in physics and we provide some examples of these applications. The program is implemented in the popular computer algebra system Mathematica and works with finite-dimensional and affine Lie algebras. Catalogue identifier: AENA_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AENB_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, UK Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 24 844 No. of bytes in distributed program, including test data, etc.: 1 045 908 Distribution format: tar.gz Programming language: Mathematica. Computer: i386-i686, x86_64. Operating system: Linux, Windows, Mac OS, Solaris. RAM: 5-500 Mb Classification: 4.2, 5. Nature of problem: Representation theory of finite-dimensional Lie algebras has many applications in different branches of physics, including elementary particle physics, molecular physics, nuclear physics. Representations of affine Lie algebras appear in string theories and two-dimensional conformal field theory used for the description of critical phenomena in two-dimensional systems. Also Lie symmetries play a major role in a study of quantum integrable systems. Solution method: We work with weights and roots of finite-dimensional and affine Lie algebras and use Weyl symmetry extensively. Central problems which are the computations of weight multiplicities, branching and fusion coefficients are solved using one general recurrent

An algorithm to construct the basic algebra of a skew group algebra

NARCIS (Netherlands)

Horobeţ, E.

2016-01-01

We give an algorithm for the computation of the basic algebra Morita equivalent to a skew group algebra of a path algebra by obtaining formulas for the number of vertices and arrows of the new quiver Qb. We apply this algorithm to compute the basic algebra corresponding to all simple quaternion

Asymptotic identity in min-plus algebra: a report on CPNS.

Science.gov (United States)

Li, Ming; Zhao, Wei

2012-01-01

Network calculus is a theory initiated primarily in computer communication networks, especially in the aspect of real-time communications, where min-plus algebra plays a role. Cyber-physical networking systems (CPNSs) are recently developing fast and models in data flows as well as systems in CPNS are, accordingly, greatly desired. Though min-plus algebra may be a promising tool to linearize any node in CPNS as can be seen from its applications to the Internet computing, there are tough problems remaining unsolved in this regard. The identity in min-plus algebra is one problem we shall address. We shall point out the confusions about the conventional identity in the min-plus algebra and present an analytical expression of the asymptotic identity that may not cause confusions.

Computer-Aided College Algebra: Learning Components that Students Find Beneficial

Science.gov (United States)

Aichele, Douglas B.; Francisco, Cynthia; Utley, Juliana; Wescoatt, Benjamin

2011-01-01

A mixed-method study was conducted during the Fall 2008 semester to better understand the experiences of students participating in computer-aided instruction of College Algebra using the software MyMathLab. The learning environment included a computer learning system for the majority of the instruction, a support system via focus groups (weekly…

Principles of linear algebra with Mathematica

CERN Document Server

Shiskowski, Kenneth M

2013-01-01

A hands-on introduction to the theoretical and computational aspects of linear algebra using Mathematica® Many topics in linear algebra are simple, yet computationally intensive, and computer algebra systems such as Mathematica® are essential not only for learning to apply the concepts to computationally challenging problems, but also for visualizing many of the geometric aspects within this field of study. Principles of Linear Algebra with Mathematica uniquely bridges the gap between beginning linear algebra and computational linear algebra that is often encountered in applied settings,

Computer Program For Linear Algebra

Science.gov (United States)

Krogh, F. T.; Hanson, R. J.

1987-01-01

Collection of routines provided for basic vector operations. Basic Linear Algebra Subprogram (BLAS) library is collection from FORTRAN-callable routines for employing standard techniques to perform basic operations of numerical linear algebra.

Asymptotic Identity in Min-Plus Algebra: A Report on CPNS

Science.gov (United States)

Li, Ming; Zhao, Wei

2012-01-01

Network calculus is a theory initiated primarily in computer communication networks, especially in the aspect of real-time communications, where min-plus algebra plays a role. Cyber-physical networking systems (CPNSs) are recently developing fast and models in data flows as well as systems in CPNS are, accordingly, greatly desired. Though min-plus algebra may be a promising tool to linearize any node in CPNS as can be seen from its applications to the Internet computing, there are tough problems remaining unsolved in this regard. The identity in min-plus algebra is one problem we shall address. We shall point out the confusions about the conventional identity in the min-plus algebra and present an analytical expression of the asymptotic identity that may not cause confusions. PMID:21822446

A comparison of equality in computer algebra and correctness in mathematical pedagogy (II)

OpenAIRE

Bradford, Russell; Davenport, James H; Sangwin, C

2010-01-01

A perennial problem in computer-aided assessment is that “a right answer”, pedagogically speaking, is not the same thing as “a mathematically correct expression”, as verified by a computer algebra system, or indeed other techniques such as random evaluation. Paper I in this series considered the difference in cases where there was “the right answer”, typically calculus questions. Here we look at some other cases, notably in linear algebra, where there can be many “right answers”, but still th...

Maple (Computer Algebra System) in Teaching Pre-Calculus: Example of Absolute Value Function

Science.gov (United States)

Tuluk, Güler

2014-01-01

Modules in Computer Algebra Systems (CAS) make Mathematics interesting and easy to understand. The present study focused on the implementation of the algebraic, tabular (numerical), and graphical approaches used for the construction of the concept of absolute value function in teaching mathematical content knowledge along with Maple 9. The study…

The Simulation of an Oxidation-Reduction Titration Curve with Computer Algebra

Science.gov (United States)

Whiteley, Richard V., Jr.

2015-01-01

Although the simulation of an oxidation/reduction titration curve is an important exercise in an undergraduate course in quantitative analysis, that exercise is frequently simplified to accommodate computational limitations. With the use of readily available computer algebra systems, however, such curves for complicated systems can be generated…

Monomial algebras

CERN Document Server

Villarreal, Rafael

2015-01-01

The book stresses the interplay between several areas of pure and applied mathematics, emphasizing the central role of monomial algebras. It unifies the classical results of commutative algebra with central results and notions from graph theory, combinatorics, linear algebra, integer programming, and combinatorial optimization. The book introduces various methods to study monomial algebras and their presentation ideals, including Stanley-Reisner rings, subrings and blowup algebra-emphasizing square free quadratics, hypergraph clutters, and effective computational methods.

Spacetime algebra as a powerful tool for electromagnetism

Energy Technology Data Exchange (ETDEWEB)

Dressel, Justin, E-mail: prof.justin.dressel@gmail.com [Department of Electrical and Computer Engineering, University of California, Riverside, CA 92521 (United States); Center for Emergent Matter Science (CEMS), RIKEN, Wako-shi, Saitama, 351-0198 (Japan); Bliokh, Konstantin Y. [Center for Emergent Matter Science (CEMS), RIKEN, Wako-shi, Saitama, 351-0198 (Japan); Interdisciplinary Theoretical Science Research Group (iTHES), RIKEN, Wako-shi, Saitama, 351-0198 (Japan); Nori, Franco [Center for Emergent Matter Science (CEMS), RIKEN, Wako-shi, Saitama, 351-0198 (Japan); Physics Department, University of Michigan, Ann Arbor, MI 48109-1040 (United States)

2015-08-08

We present a comprehensive introduction to spacetime algebra that emphasizes its practicality and power as a tool for the study of electromagnetism. We carefully develop this natural (Clifford) algebra of the Minkowski spacetime geometry, with a particular focus on its intrinsic (and often overlooked) complex structure. Notably, the scalar imaginary that appears throughout the electromagnetic theory properly corresponds to the unit 4-volume of spacetime itself, and thus has physical meaning. The electric and magnetic fields are combined into a single complex and frame-independent bivector field, which generalizes the Riemann–Silberstein complex vector that has recently resurfaced in studies of the single photon wavefunction. The complex structure of spacetime also underpins the emergence of electromagnetic waves, circular polarizations, the normal variables for canonical quantization, the distinction between electric and magnetic charge, complex spinor representations of Lorentz transformations, and the dual (electric–magnetic field exchange) symmetry that produces helicity conservation in vacuum fields. This latter symmetry manifests as an arbitrary global phase of the complex field, motivating the use of a complex vector potential, along with an associated transverse and gauge-invariant bivector potential, as well as complex (bivector and scalar) Hertz potentials. Our detailed treatment aims to encourage the use of spacetime algebra as a readily available and mature extension to existing vector calculus and tensor methods that can greatly simplify the analysis of fundamentally relativistic objects like the electromagnetic field.

Spacetime algebra as a powerful tool for electromagnetism

Science.gov (United States)

Dressel, Justin; Bliokh, Konstantin Y.; Nori, Franco

2015-08-01

We present a comprehensive introduction to spacetime algebra that emphasizes its practicality and power as a tool for the study of electromagnetism. We carefully develop this natural (Clifford) algebra of the Minkowski spacetime geometry, with a particular focus on its intrinsic (and often overlooked) complex structure. Notably, the scalar imaginary that appears throughout the electromagnetic theory properly corresponds to the unit 4-volume of spacetime itself, and thus has physical meaning. The electric and magnetic fields are combined into a single complex and frame-independent bivector field, which generalizes the Riemann-Silberstein complex vector that has recently resurfaced in studies of the single photon wavefunction. The complex structure of spacetime also underpins the emergence of electromagnetic waves, circular polarizations, the normal variables for canonical quantization, the distinction between electric and magnetic charge, complex spinor representations of Lorentz transformations, and the dual (electric-magnetic field exchange) symmetry that produces helicity conservation in vacuum fields. This latter symmetry manifests as an arbitrary global phase of the complex field, motivating the use of a complex vector potential, along with an associated transverse and gauge-invariant bivector potential, as well as complex (bivector and scalar) Hertz potentials. Our detailed treatment aims to encourage the use of spacetime algebra as a readily available and mature extension to existing vector calculus and tensor methods that can greatly simplify the analysis of fundamentally relativistic objects like the electromagnetic field.

Applied linear algebra and matrix analysis

CERN Document Server

Shores, Thomas S

2018-01-01

In its second edition, this textbook offers a fresh approach to matrix and linear algebra. Its blend of theory, computational exercises, and analytical writing projects is designed to highlight the interplay between these aspects of an application. This approach places special emphasis on linear algebra as an experimental science that provides tools for solving concrete problems. The second edition’s revised text discusses applications of linear algebra like graph theory and network modeling methods used in Google’s PageRank algorithm. Other new materials include modeling examples of diffusive processes, linear programming, image processing, digital signal processing, and Fourier analysis. These topics are woven into the core material of Gaussian elimination and other matrix operations; eigenvalues, eigenvectors, and discrete dynamical systems; and the geometrical aspects of vector spaces. Intended for a one-semester undergraduate course without a strict calculus prerequisite, Applied Linear Algebra and M...

Hom-Novikov algebras

International Nuclear Information System (INIS)

Yau, Donald

2011-01-01

We study a twisted generalization of Novikov algebras, called Hom-Novikov algebras, in which the two defining identities are twisted by a linear map. It is shown that Hom-Novikov algebras can be obtained from Novikov algebras by twisting along any algebra endomorphism. All algebra endomorphisms on complex Novikov algebras of dimensions 2 or 3 are computed, and their associated Hom-Novikov algebras are described explicitly. Another class of Hom-Novikov algebras is constructed from Hom-commutative algebras together with a derivation, generalizing a construction due to Dorfman and Gel'fand. Two other classes of Hom-Novikov algebras are constructed from Hom-Lie algebras together with a suitable linear endomorphism, generalizing a construction due to Bai and Meng.

A Web-Based Authoring Tool for Algebra-Related Intelligent Tutoring Systems

Directory of Open Access Journals (Sweden)

Maria Virvou

2000-01-01

Full Text Available This paper describes the development of a web-based authoring tool for Intelligent Tutoring Systems. The tool aims to be useful to teachers and students of domains that make use of algebraic equations. The initial input to the tool is a "description" of a specific domain given by a human teacher. In return the tool provides assistance at the construction of exercises by the human teacher and then monitors the students while they are solving the exercises and provides appropriate feedback. The tool incorporates intelligence in its diagnostic component, which performs error diagnosis to students’ errors. It also handles the teaching material in a flexible and individualised way.

Algebraic Functions, Computer Programming, and the Challenge of Transfer

Science.gov (United States)

Schanzer, Emmanuel Tanenbaum

2015-01-01

Students' struggles with algebra are well documented. Prior to the introduction of functions, mathematics is typically focused on applying a set of arithmetic operations to compute an answer. The introduction of functions, however, marks the point at which mathematics begins to focus on building up abstractions as a way to solve complex problems.…

Combinatorial commutative algebra

CERN Document Server

Miller, Ezra

2005-01-01

Offers an introduction to combinatorial commutative algebra, focusing on combinatorial techniques for multigraded polynomial rings, semigroup algebras, and determined rings. The chapters in this work cover topics ranging from homological invariants of monomial ideals and their polyhedral resolutions, to tools for studying algebraic varieties.

An algorithm for analysis of the structure of finitely presented Lie algebras

Directory of Open Access Journals (Sweden)

Vladimir P. Gerdt

1997-12-01

Full Text Available We consider the following problem: what is the most general Lie algebra satisfying a given set of Lie polynomial equations? The presentation of Lie algebras by a finite set of generators and defining relations is one of the most general mathematical and algorithmic schemes of their analysis. That problem is of great practical importance, covering applications ranging from mathematical physics to combinatorial algebra. Some particular applications are constructionof prolongation algebras in the Wahlquist-Estabrook method for integrability analysis of nonlinear partial differential equations and investigation of Lie algebras arising in different physical models. The finite presentations also indicate a way to q-quantize Lie algebras. To solve this problem, one should perform a large volume of algebraic transformations which is sharply increased with growth of the number of generators and relations. For this reason, in practice one needs to use a computer algebra tool. We describe here an algorithm for constructing the basis of a finitely presented Lie algebra and its commutator table, and its implementation in the C language. Some computer results illustrating our algorithmand its actual implementation are also presented.

GPU Linear algebra extensions for GNU/Octave

International Nuclear Information System (INIS)

Bosi, L B; Mariotti, M; Santocchia, A

2012-01-01

Octave is one of the most widely used open source tools for numerical analysis and liner algebra. Our project aims to improve Octave by introducing support for GPU computing in order to speed up some linear algebra operations. The core of our work is a C library that executes some BLAS operations concerning vector- vector, vector matrix and matrix-matrix functions on the GPU. OpenCL functions are used to program GPU kernels, which are bound within the GNU/octave framework. We report the project implementation design and some preliminary results about performance.

Realization Of Algebraic Processor For XML Documents Processing

International Nuclear Information System (INIS)

Georgiev, Bozhidar; Georgieva, Adriana

2010-01-01

In this paper, are presented some possibilities concerning the implementation of an algebraic method for XML hierarchical data processing which makes faster the XML search mechanism. Here is offered a different point of view for creation of advanced algebraic processor (with all necessary software tools and programming modules respectively). Therefore, this nontraditional approach for fast XML navigation with the presented algebraic processor may help to build an easier user-friendly interface provided XML transformations, which can avoid the difficulties in the complicated language constructions of XSL, XSLT and XPath. This approach allows comparatively simple search of XML hierarchical data by means of the following types of functions: specification functions and so named build-in functions. The choice of programming language Java may appear strange at first, but it isn't when you consider that the applications can run on different kinds of computers. The specific search mechanism based on the linear algebra theory is faster in comparison with MSXML parsers (on the basis of the developed examples with about 30%). Actually, there exists the possibility for creating new software tools based on the linear algebra theory, which cover the whole navigation and search techniques characterizing XSLT/XPath. The proposed method is able to replace more complicated operations in other SOA components.

Learning algebra on screen and on paper: The effect of using a digital tool on students' understanding

Science.gov (United States)

Jupri, Al; Drijvers, Paul; van den Heuvel-Panhuizen, Marja

2016-02-01

The use of digital tools in algebra education is expected to not only contribute to master skill, but also to acquire conceptual understanding. The question is how digital tools affect students" thinking and understanding. This paper presents an analysis of data of one group of three grade seventh students (12-13 year-old) on the use of a digital tool for algebra, the Cover-up applet for solving equations in particular. This case study was part of a larger teaching experiment on initial algebra enriched with digital technology which aimed to improve students" conceptual understanding and skills in solving equations in one variable. The qualitative analysis of a video observation, digital and written work showed that the use of the applet affects student thinking in terms of strategies used by students while dealing with the equations. We conclude that the effects of the use of the digital tool can be traced from student problem solving strategies on paper-and-pencil environment which are similar to strategies while working with the digital tool. In future research, we recommend to use specific theoretical lenses, such as the theory of instrumental genesis and the onto-semiotic approach, to reveal more explicit relationships between students" conceptual understanding and the use of a digital tool.

Lectures on algebraic statistics

CERN Document Server

Drton, Mathias; Sullivant, Seth

2009-01-01

How does an algebraic geometer studying secant varieties further the understanding of hypothesis tests in statistics? Why would a statistician working on factor analysis raise open problems about determinantal varieties? Connections of this type are at the heart of the new field of "algebraic statistics". In this field, mathematicians and statisticians come together to solve statistical inference problems using concepts from algebraic geometry as well as related computational and combinatorial techniques. The goal of these lectures is to introduce newcomers from the different camps to algebraic statistics. The introduction will be centered around the following three observations: many important statistical models correspond to algebraic or semi-algebraic sets of parameters; the geometry of these parameter spaces determines the behaviour of widely used statistical inference procedures; computational algebraic geometry can be used to study parameter spaces and other features of statistical models.

Exact distributions of two-sample rank statistics and block rank statistics using computer algebra

NARCIS (Netherlands)

Wiel, van de M.A.

1998-01-01

We derive generating functions for various rank statistics and we use computer algebra to compute the exact null distribution of these statistics. We present various techniques for reducing time and memory space used by the computations. We use the results to write Mathematica notebooks for

Algebra

CERN Document Server

Flanders, Harley

1975-01-01

Algebra presents the essentials of algebra with some applications. The emphasis is on practical skills, problem solving, and computational techniques. Topics covered range from equations and inequalities to functions and graphs, polynomial and rational functions, and exponentials and logarithms. Trigonometric functions and complex numbers are also considered, together with exponentials and logarithms.Comprised of eight chapters, this book begins with a discussion on the fundamentals of algebra, each topic explained, illustrated, and accompanied by an ample set of exercises. The proper use of a

A Cohomological Perspective on Algebraic Quantum Field Theory

Science.gov (United States)

Hawkins, Eli

2018-05-01

Algebraic quantum field theory is considered from the perspective of the Hochschild cohomology bicomplex. This is a framework for studying deformations and symmetries. Deformation is a possible approach to the fundamental challenge of constructing interacting QFT models. Symmetry is the primary tool for understanding the structure and properties of a QFT model. This perspective leads to a generalization of the algebraic quantum field theory framework, as well as a more general definition of symmetry. This means that some models may have symmetries that were not previously recognized or exploited. To first order, a deformation of a QFT model is described by a Hochschild cohomology class. A deformation could, for example, correspond to adding an interaction term to a Lagrangian. The cohomology class for such an interaction is computed here. However, the result is more general and does not require the undeformed model to be constructed from a Lagrangian. This computation leads to a more concrete version of the construction of perturbative algebraic quantum field theory.

A Cohomological Perspective on Algebraic Quantum Field Theory

Science.gov (United States)

Hawkins, Eli

2018-02-01

Algebraic quantum field theory is considered from the perspective of the Hochschild cohomology bicomplex. This is a framework for studying deformations and symmetries. Deformation is a possible approach to the fundamental challenge of constructing interacting QFT models. Symmetry is the primary tool for understanding the structure and properties of a QFT model. This perspective leads to a generalization of the algebraic quantum field theory framework, as well as a more general definition of symmetry. This means that some models may have symmetries that were not previously recognized or exploited. To first order, a deformation of a QFT model is described by a Hochschild cohomology class. A deformation could, for example, correspond to adding an interaction term to a Lagrangian. The cohomology class for such an interaction is computed here. However, the result is more general and does not require the undeformed model to be constructed from a Lagrangian. This computation leads to a more concrete version of the construction of perturbative algebraic quantum field theory.

Revisiting Newtonian and Non-Newtonian Fluid Mechanics Using Computer Algebra

Science.gov (United States)

Knight, D. G.

2006-01-01

This article illustrates how a computer algebra system, such as Maple[R], can assist in the study of theoretical fluid mechanics, for both Newtonian and non-Newtonian fluids. The continuity equation, the stress equations of motion, the Navier-Stokes equations, and various constitutive equations are treated, using a full, but straightforward,…

Banana Algebra: Compositional syntactic language extension

DEFF Research Database (Denmark)

Andersen, Jacob; Brabrand, Claus; Christiansen, David Raymond

2013-01-01

We propose an algebra of languages and transformations as a means of compositional syntactic language extension. The algebra provides a layer of high-level abstractions built on top of languages (captured by context-free grammars) and transformations (captured by constructive catamorphisms...... algebra as presented in the paper is implemented as the Banana Algebra Tool which may be used to syntactically extend languages in an incremental and modular fashion via algebraic composition of previously defined languages and transformations. We demonstrate and evaluate the tool via several kinds...

Assessing Elementary Algebra with STACK

Science.gov (United States)

Sangwin, Christopher J.

2007-01-01

This paper concerns computer aided assessment (CAA) of mathematics in which a computer algebra system (CAS) is used to help assess students' responses to elementary algebra questions. Using a methodology of documentary analysis, we examine what is taught in elementary algebra. The STACK CAA system, http://www.stack.bham.ac.uk/, which uses the CAS…

Commutative algebra with a view toward algebraic geometry

CERN Document Server

Eisenbud, David

1995-01-01

Commutative Algebra is best understood with knowledge of the geometric ideas that have played a great role in its formation, in short, with a view towards algebraic geometry. The author presents a comprehensive view of commutative algebra, from basics, such as localization and primary decomposition, through dimension theory, differentials, homological methods, free resolutions and duality, emphasizing the origins of the ideas and their connections with other parts of mathematics. Many exercises illustrate and sharpen the theory and extended exercises give the reader an active part in complementing the material presented in the text. One novel feature is a chapter devoted to a quick but thorough treatment of Grobner basis theory and the constructive methods in commutative algebra and algebraic geometry that flow from it. Applications of the theory and even suggestions for computer algebra projects are included. This book will appeal to readers from beginners to advanced students of commutative algebra or algeb...

A Comparison of Success and Failure Rates between Computer-Assisted and Traditional College Algebra Sections

Science.gov (United States)

Herron, Sherry; Gandy, Rex; Ye, Ningjun; Syed, Nasser

2012-01-01

A unique aspect of the implementation of a computer algebra system (CAS) at a comprehensive university in the U.S. allowed us to compare the student success and failure rates to the traditional method of teaching college algebra. Due to space limitations, the university offered sections of both CAS and traditional simultaneously and, upon…

Matlab linear algebra

CERN Document Server

Lopez, Cesar

2014-01-01

MATLAB is a high-level language and environment for numerical computation, visualization, and programming. Using MATLAB, you can analyze data, develop algorithms, and create models and applications. The language, tools, and built-in math functions enable you to explore multiple approaches and reach a solution faster than with spreadsheets or traditional programming languages, such as C/C++ or Java. MATLAB Linear Algebra introduces you to the MATLAB language with practical hands-on instructions and results, allowing you to quickly achieve your goals. In addition to giving an introduction to

Prime factorization using quantum annealing and computational algebraic geometry

Science.gov (United States)

Dridi, Raouf; Alghassi, Hedayat

2017-02-01

We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gröbner bases. We present a novel autonomous algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over 200000, the largest number factored to date using a quantum processor. We also explain how Gröbner bases can be used to reduce the degree of Hamiltonians.

Prime factorization using quantum annealing and computational algebraic geometry

OpenAIRE

Dridi, Raouf; Alghassi, Hedayat

2017-01-01

We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gr?bner bases. We present a novel autonomous algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over 200000, the largest number factored to date using a quantum processor. We also explain how Gr?bner bases can be used to reduce the degree of Hamiltonians.

Lukasiewicz-Moisil algebras

CERN Document Server

Boicescu, V; Georgescu, G; Rudeanu, S

1991-01-01

The Lukasiewicz-Moisil algebras were created by Moisil as an algebraic counterpart for the many-valued logics of Lukasiewicz. The theory of LM-algebras has developed to a considerable extent both as an algebraic theory of intrinsic interest and in view of its applications to logic and switching theory.This book gives an overview of the theory, comprising both classical results and recent contributions, including those of the authors. N-valued and &THgr;-valued algebras are presented, as well as &THgr;-algebras with negation.Mathematicians interested in lattice theory or symbolic logic, and computer scientists, will find in this monograph stimulating material for further research.

Linear-Algebra Programs

Science.gov (United States)

Lawson, C. L.; Krogh, F. T.; Gold, S. S.; Kincaid, D. R.; Sullivan, J.; Williams, E.; Hanson, R. J.; Haskell, K.; Dongarra, J.; Moler, C. B.

1982-01-01

The Basic Linear Algebra Subprograms (BLAS) library is a collection of 38 FORTRAN-callable routines for performing basic operations of numerical linear algebra. BLAS library is portable and efficient source of basic operations for designers of programs involving linear algebriac computations. BLAS library is supplied in portable FORTRAN and Assembler code versions for IBM 370, UNIVAC 1100 and CDC 6000 series computers.

Inequalities, assessment and computer algebra

Science.gov (United States)

Sangwin, Christopher J.

2015-01-01

The goal of this paper is to examine single variable real inequalities that arise as tutorial problems and to examine the extent to which current computer algebra systems (CAS) can (1) automatically solve such problems and (2) determine whether students' own answers to such problems are correct. We review how inequalities arise in contemporary curricula. We consider the formal mathematical processes by which such inequalities are solved, and we consider the notation and syntax through which solutions are expressed. We review the extent to which current CAS can accurately solve these inequalities, and the form given to the solutions by the designers of this software. Finally, we discuss the functionality needed to deal with students' answers, i.e. to establish equivalence (or otherwise) of expressions representing unions of intervals. We find that while contemporary CAS accurately solve inequalities there is a wide variety of notation used.

The C*-algebra of a vector bundle and fields of Cuntz algebras

OpenAIRE

Vasselli, Ezio

2004-01-01

We study the Pimsner algebra associated with the module of continuous sections of a Hilbert bundle, and prove that it is a continuous bundle of Cuntz algebras. We discuss the role of such Pimsner algebras w.r.t. the notion of inner endomorphism. Furthermore, we study bundles of Cuntz algebras carrying a global circle action, and assign to them a class in the representable KK-group of the zero-grade bundle. We compute such class for the Pimsner algebra of a vector bundle.

C*-algebras by example

CERN Document Server

Davidson, Kenneth R

1996-01-01

The subject of C*-algebras received a dramatic revitalization in the 1970s by the introduction of topological methods through the work of Brown, Douglas, and Fillmore on extensions of C*-algebras and Elliott's use of K-theory to provide a useful classification of AF algebras. These results were the beginning of a marvelous new set of tools for analyzing concrete C*-algebras. This book is an introductory graduate level text which presents the basics of the subject through a detailed analysis of several important classes of C*-algebras. The development of operator algebras in the last twenty yea

Computer programs for nonlinear algebraic equations

International Nuclear Information System (INIS)

Asaoka, Takumi

1977-10-01

We have provided principal computer subroutines for obtaining numerical solutions of nonlinear algebraic equations through a review of the various methods. Benchmark tests were performed on these subroutines to grasp the characteristics of them compared to the existing subroutines. As computer programs based on the secant method, subroutines of the Muller's method using the Chambers' algorithm were newly developed, in addition to the equipment of subroutines of the Muller's method itself. The programs based on the Muller-Chambers' method are useful especially for low-order polynomials with complex coefficients except for the case of finding the triple roots, three close roots etc. In addition, we have equipped subroutines based on the Madsen's algorithm, a variant of the Newton's method. The subroutines have revealed themselves very useful as standard programs because all the roots are found accurately for every case though they take longer computing time than other subroutines for low-order polynomials. It is shown also that an existing subroutine of the Bairstow's method gives the fastest algorithm for polynomials with complex coefficients, except for the case of finding the triple roots etc. We have provided also subroutines to estimate error bounds for all the roots produced with the various algorithms. (auth.)

Algorithmic and experimental methods in algebra, geometry, and number theory

CERN Document Server

Decker, Wolfram; Malle, Gunter

2017-01-01

This book presents state-of-the-art research and survey articles that highlight work done within the Priority Program SPP 1489 “Algorithmic and Experimental Methods in Algebra, Geometry and Number Theory”, which was established and generously supported by the German Research Foundation (DFG) from 2010 to 2016. The goal of the program was to substantially advance algorithmic and experimental methods in the aforementioned disciplines, to combine the different methods where necessary, and to apply them to central questions in theory and practice. Of particular concern was the further development of freely available open source computer algebra systems and their interaction in order to create powerful new computational tools that transcend the boundaries of the individual disciplines involved.  The book covers a broad range of topics addressing the design and theoretical foundations, implementation and the successful application of algebraic algorithms in order to solve mathematical research problems. It off...

Possibility of Engineering Education That Makes Use of Algebraic Calculators by Various Scenes

Science.gov (United States)

Umeno, Yoshio

Algebraic calculators are graphing calculators with a feature of computer algebra system. It can be said that we can solve mathematics only by pushing some keys of these calculators in technical colleges or universities. They also possess another feature, so we can make extensive use in engineering education. For example, we can use them for a basic education, a programming education, English education, and creative thinking tools for excellent students. In this paper, we will introduce the summary of algebraic calculators, then, consider how we utilize them in engineer education.

A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy (II)

Science.gov (United States)

Bradford, Russell; Davenport, James H.; Sangwin, Chris

2010-01-01

A perennial problem in computer-aided assessment is that "a right answer", pedagogically speaking, is not the same thing as "a mathematically correct expression", as verified by a computer algebra system, or indeed other techniques such as random evaluation. Paper I in this series considered the difference in cases where there was "the right…

Multilinear Computing and Multilinear Algebraic Geometry

Science.gov (United States)

2016-08-10

algebra : linear systems, least squares, eigevalue problems, singular value problems, determinant evaluation, low-rank approximations, etc — problems...intractability to move beyond linear algebra , substantiating what the PI had proposed. High-resolution MRI with tensors: In another piece of work... applications . One reason is that we found out that many statistical estimation problems ( linear regression, errors-in-variables regression, principal components

Non-commutative multiple-valued logic algebras

CERN Document Server

Ciungu, Lavinia Corina

2014-01-01

This monograph provides a self-contained and easy-to-read introduction to non-commutative multiple-valued logic algebras; a subject which has attracted much interest in the past few years because of its impact on information science, artificial intelligence and other subjects.   A study of the newest results in the field, the monograph includes treatment of pseudo-BCK algebras, pseudo-hoops, residuated lattices, bounded divisible residuated lattices, pseudo-MTL algebras, pseudo-BL algebras and pseudo-MV algebras. It provides a fresh perspective on new trends in logic and algebras in that algebraic structures can be developed into fuzzy logics which connect quantum mechanics, mathematical logic, probability theory, algebra and soft computing.   Written in a clear, concise and direct manner, Non-Commutative Multiple-Valued Logic Algebras will be of interest to masters and PhD students, as well as researchers in mathematical logic and theoretical computer science.

Templates for Linear Algebra Problems

NARCIS (Netherlands)

Bai, Z.; Day, D.; Demmel, J.; Dongarra, J.; Gu, M.; Ruhe, A.; Vorst, H.A. van der

1995-01-01

The increasing availability of advanced-architecture computers is having a very signicant eect on all spheres of scientic computation, including algorithm research and software development in numerical linear algebra. Linear algebra {in particular, the solution of linear systems of equations and

Symbolic derivation of high-order Rayleigh-Schroedinger perturbation energies using computer algebra: Application to vibrational-rotational analysis of diatomic molecules

Energy Technology Data Exchange (ETDEWEB)

Herbert, John M. [Kansas State Univ., Manhattan, KS (United States). Dept. of Chemistry

1997-01-01

Rayleigh-Schroedinger perturbation theory is an effective and popular tool for describing low-lying vibrational and rotational states of molecules. This method, in conjunction with ab initio techniques for computation of electronic potential energy surfaces, can be used to calculate first-principles molecular vibrational-rotational energies to successive orders of approximation. Because of mathematical complexities, however, such perturbation calculations are rarely extended beyond the second order of approximation, although recent work by Herbert has provided a formula for the nth-order energy correction. This report extends that work and furnishes the remaining theoretical details (including a general formula for the Rayleigh-Schroedinger expansion coefficients) necessary for calculation of energy corrections to arbitrary order. The commercial computer algebra software Mathematica is employed to perform the prohibitively tedious symbolic manipulations necessary for derivation of generalized energy formulae in terms of universal constants, molecular constants, and quantum numbers. As a pedagogical example, a Hamiltonian operator tailored specifically to diatomic molecules is derived, and the perturbation formulae obtained from this Hamiltonian are evaluated for a number of such molecules. This work provides a foundation for future analyses of polyatomic molecules, since it demonstrates that arbitrary-order perturbation theory can successfully be applied with the aid of commercially available computer algebra software.

Bicovariant quantum algebras and quantum Lie algebras

International Nuclear Information System (INIS)

Schupp, P.; Watts, P.; Zumino, B.

1993-01-01

A bicovariant calculus of differential operators on a quantum group is constructed in a natural way, using invariant maps from Fun(G q ) to U q g, given by elements of the pure braid group. These operators - the 'reflection matrix' Y= triple bond L + SL - being a special case - generate algebras that linearly close under adjoint actions, i.e. they form generalized Lie algebras. We establish the connection between the Hopf algebra formulation of the calculus and a formulation in compact matrix form which is quite powerful for actual computations and as applications we find the quantum determinant and an orthogonality relation for Y in SO q (N). (orig.)

Donaldson invariants in algebraic geometry

International Nuclear Information System (INIS)

Goettsche, L.

2000-01-01

In these lectures I want to give an introduction to the relation of Donaldson invariants with algebraic geometry: Donaldson invariants are differentiable invariants of smooth compact 4-manifolds X, defined via moduli spaces of anti-self-dual connections. If X is an algebraic surface, then these moduli spaces can for a suitable choice of the metric be identified with moduli spaces of stable vector bundles on X. This can be used to compute Donaldson invariants via methods of algebraic geometry and has led to a lot of activity on moduli spaces of vector bundles and coherent sheaves on algebraic surfaces. We will first recall the definition of the Donaldson invariants via gauge theory. Then we will show the relation between moduli spaces of anti-self-dual connections and moduli spaces of vector bundles on algebraic surfaces, and how this makes it possible to compute Donaldson invariants via algebraic geometry methods. Finally we concentrate on the case that the number b + of positive eigenvalues of the intersection form on the second homology of the 4-manifold is 1. In this case the Donaldson invariants depend on the metric (or in the algebraic geometric case on the polarization) via a system of walls and chambers. We will study the change of the invariants under wall-crossing, and use this in particular to compute the Donaldson invariants of rational algebraic surfaces. (author)

ACE - an algebraic compiler and encoder for the Chalk River datatron computer

International Nuclear Information System (INIS)

Kennedy, J.M.; Okazaki, E.A.; Millican, M.

1960-03-01

ACE is a program written for the Chalk River Datatron (Burroughs 205) Computer to enable the machine to compile a program for solving a problem from instructions supplied by the user in a notation related much more closely to algebra than to the machine's own code. (author)

Algorithms in Algebraic Geometry

CERN Document Server

Dickenstein, Alicia; Sommese, Andrew J

2008-01-01

In the last decade, there has been a burgeoning of activity in the design and implementation of algorithms for algebraic geometric computation. Some of these algorithms were originally designed for abstract algebraic geometry, but now are of interest for use in applications and some of these algorithms were originally designed for applications, but now are of interest for use in abstract algebraic geometry. The workshop on Algorithms in Algebraic Geometry that was held in the framework of the IMA Annual Program Year in Applications of Algebraic Geometry by the Institute for Mathematics and Its

Computer algebra in quantum field theory integration, summation and special functions

CERN Document Server

Schneider, Carsten

2013-01-01

The book focuses on advanced computer algebra methods and special functions that have striking applications in the context of quantum field theory. It presents the state of the art and new methods for (infinite) multiple sums, multiple integrals, in particular Feynman integrals, difference and differential equations in the format of survey articles. The presented techniques emerge from interdisciplinary fields: mathematics, computer science and theoretical physics; the articles are written by mathematicians and physicists with the goal that both groups can learn from the other field, including

Development process of in-service training intended for teachers to perform teaching of mathematics with computer algebra systems

Science.gov (United States)

Ardıç, Mehmet Alper; Işleyen, Tevfik

2018-01-01

In this study, we deal with the development process of in-service training activities designed in order for mathematics teachers of secondary education to realize teaching of mathematics, utilizing computer algebra systems. In addition, the results obtained from the researches carried out during and after the in-service training were summarized. Last section focuses on suggestions any teacher can use to carry out activities aimed at using computer algebra systems in teaching environments.

QUANTUM: A Wolfram Mathematica add-on for Dirac Bra-Ket Notation, Non-Commutative Algebra, and Simulation of Quantum Computing Circuits

International Nuclear Information System (INIS)

Muñoz, J L Gómez; Delgado, F

2016-01-01

This paper introduces QUANTUM, a free library of commands of Wolfram Mathematica that can be used to perform calculations directly in Dirac braket and operator notation. Its development started several years ago, in order to study quantum random walks. Later, many other features were included, like operator and commutator algebra, simulation and graphing of quantum computing circuits, generation and solution of Heisenberg equations of motion, among others. To the best of our knowledge, QUANTUM remains a unique tool in its use of Dirac notation, because it is used both in the input and output of the calculations. This work depicts its usage and features in Quantum Computing and Quantum Hamilton Dynamics. (paper)

Matrix algebra theory, computations and applications in statistics

CERN Document Server

Gentle, James E

2017-01-01

This textbook for graduate and advanced undergraduate students presents the theory of matrix algebra for statistical applications, explores various types of matrices encountered in statistics, and covers numerical linear algebra. Matrix algebra is one of the most important areas of mathematics in data science and in statistical theory, and the second edition of this very popular textbook provides essential updates and comprehensive coverage on critical topics in mathematics in data science and in statistical theory. Part I offers a self-contained description of relevant aspects of the theory of matrix algebra for applications in statistics. It begins with fundamental concepts of vectors and vector spaces; covers basic algebraic properties of matrices and analytic properties of vectors and matrices in multivariate calculus; and concludes with a discussion on operations on matrices in solutions of linear systems and in eigenanalysis. Part II considers various types of matrices encountered in statistics, such as...

Learning algebra on screen and on paper: The effect of using a digital tool on students' understanding

NARCIS (Netherlands)

Jupri, A.; Drijvers, P.H.M.; Van den Heuvel-Panhuizen, M.

2016-01-01

The use of digital tools in algebra education is expected to not only contribute to master skill, but also to acquire conceptual understanding. The question is how digital tools affect students’ thinking and understanding. This paper presents an analysis of data of one group of three grade seventh

Exploring Students' Understanding of Ordinary Differential Equations Using Computer Algebraic System (CAS)

Science.gov (United States)

Maat, Siti Mistima; Zakaria, Effandi

2011-01-01

Ordinary differential equations (ODEs) are one of the important topics in engineering mathematics that lead to the understanding of technical concepts among students. This study was conducted to explore the students' understanding of ODEs when they solve ODE questions using a traditional method as well as a computer algebraic system, particularly…

A graph algebra for scalable visual analytics.

Science.gov (United States)

Shaverdian, Anna A; Zhou, Hao; Michailidis, George; Jagadish, Hosagrahar V

2012-01-01

Visual analytics (VA), which combines analytical techniques with advanced visualization features, is fast becoming a standard tool for extracting information from graph data. Researchers have developed many tools for this purpose, suggesting a need for formal methods to guide these tools' creation. Increased data demands on computing requires redesigning VA tools to consider performance and reliability in the context of analysis of exascale datasets. Furthermore, visual analysts need a way to document their analyses for reuse and results justification. A VA graph framework encapsulated in a graph algebra helps address these needs. Its atomic operators include selection and aggregation. The framework employs a visual operator and supports dynamic attributes of data to enable scalable visual exploration of data.

Calculation of heat-kernel coefficients and usage of computer algebra

International Nuclear Information System (INIS)

Bel'kov, A.A.; Lanev, A.V.; Schaale, A.

1995-01-01

The calculation of heat-kernel coefficients with the classical De Witt algorithm has been discussed. We present the explicit form of the coefficients up to h 5 in the general case and up to h 7 min for the minimal parts. The results are compared with the expressions in other papers. A method to optimize the usage of memory for working with large expressions on universal computer algebra systems has been proposed. 20 refs

Algebraic Methods to Design Signals

Science.gov (United States)

2015-08-27

to date on designing signals using algebraic and combinatorial methods. Mathematical tools from algebraic number theory, representation theory and... combinatorial objects in designing signals for communication purposes. Sequences and arrays with desirable autocorrelation properties have many...multiple access methods in mobile radio communication systems. We continue our mathematical framework based on group algebras, character theory

The classical limit of W-algebras

International Nuclear Information System (INIS)

Figueroa-O'Farrill, J.M.; Ramos, E.

1992-01-01

We define and compute explicitly the classical limit of the realizations of W n appearing as hamiltonian structures of generalized KdV hierarchies. The classical limit is obtained by taking the commutative limit of the ring of pseudodifferential operators. These algebras - denoted w n - have free field realizations in which the generators are given by the elementary symmetric polynomials in the free fields. We compute the algebras explicitly and we show that they are all reductions of a new algebra w KP , which is proposed as the universal classical W-algebra for the w n series. As a deformation of this algebra we also obtain w 1+∞ , the classical limit of W 1+∞ . (orig.)

The algebraic collective model

International Nuclear Information System (INIS)

Rowe, D.J.; Turner, P.S.

2005-01-01

A recently proposed computationally tractable version of the Bohr collective model is developed to the extent that we are now justified in describing it as an algebraic collective model. The model has an SU(1,1)xSO(5) algebraic structure and a continuous set of exactly solvable limits. Moreover, it provides bases for mixed symmetry collective model calculations. However, unlike the standard realization of SU(1,1), used for computing beta wave functions and their matrix elements in a spherical basis, the algebraic collective model makes use of an SU(1,1) algebra that generates wave functions appropriate for deformed nuclei with intrinsic quadrupole moments ranging from zero to any large value. A previous paper focused on the SO(5) wave functions, as SO(5) (hyper-)spherical harmonics, and computation of their matrix elements. This paper gives analytical expressions for the beta matrix elements needed in applications of the model and illustrative results to show the remarkable gain in efficiency that is achieved by using such a basis in collective model calculations for deformed nuclei

Adaptive algebraic reconstruction technique

International Nuclear Information System (INIS)

Lu Wenkai; Yin Fangfang

2004-01-01

Algebraic reconstruction techniques (ART) are iterative procedures for reconstructing objects from their projections. It is proven that ART can be computationally efficient by carefully arranging the order in which the collected data are accessed during the reconstruction procedure and adaptively adjusting the relaxation parameters. In this paper, an adaptive algebraic reconstruction technique (AART), which adopts the same projection access scheme in multilevel scheme algebraic reconstruction technique (MLS-ART), is proposed. By introducing adaptive adjustment of the relaxation parameters during the reconstruction procedure, one-iteration AART can produce reconstructions with better quality, in comparison with one-iteration MLS-ART. Furthermore, AART outperforms MLS-ART with improved computational efficiency

A user's manual of Tools for Error Estimation of Complex Number Matrix Computation (Ver.1.0)

International Nuclear Information System (INIS)

Ichihara, Kiyoshi.

1997-03-01

'Tools for Error Estimation of Complex Number Matrix Computation' is a subroutine library which aids the users in obtaining the error ranges of the complex number linear system's solutions or the Hermitian matrices' eigen values. This library contains routines for both sequential computers and parallel computers. The subroutines for linear system error estimation calulate norms of residual vectors, matrices's condition numbers, error bounds of solutions and so on. The error estimation subroutines for Hermitian matrix eigen values' derive the error ranges of the eigen values according to the Korn-Kato's formula. This user's manual contains a brief mathematical background of error analysis on linear algebra and usage of the subroutines. (author)

Resolution of First- and Second-Order Linear Differential Equations with Periodic Inputs by a Computer Algebra System

Directory of Open Access Journals (Sweden)

M. Legua

2008-01-01

Full Text Available In signal processing, a pulse means a rapid change in the amplitude of a signal from a baseline value to a higher or lower value, followed by a rapid return to the baseline value. A square wave function may be viewed as a pulse that repeats its occurrence periodically but the return to the baseline value takes some time to happen. When these periodic functions act as inputs in dynamic systems, the standard tool commonly used to solve the associated initial value problem (IVP is Laplace transform and its inverse. We show how a computer algebra system may also provide the solution of these IVP straight forwardly by adequately introducing the periodic input.

Linear algebra

CERN Document Server

Edwards, Harold M

1995-01-01

In his new undergraduate textbook, Harold M Edwards proposes a radically new and thoroughly algorithmic approach to linear algebra Originally inspired by the constructive philosophy of mathematics championed in the 19th century by Leopold Kronecker, the approach is well suited to students in the computer-dominated late 20th century Each proof is an algorithm described in English that can be translated into the computer language the class is using and put to work solving problems and generating new examples, making the study of linear algebra a truly interactive experience Designed for a one-semester course, this text adopts an algorithmic approach to linear algebra giving the student many examples to work through and copious exercises to test their skills and extend their knowledge of the subject Students at all levels will find much interactive instruction in this text while teachers will find stimulating examples and methods of approach to the subject

Constraint-Referenced Analytics of Algebra Learning

Science.gov (United States)

Sutherland, Scot M.; White, Tobin F.

2016-01-01

The development of the constraint-referenced analytics tool for monitoring algebra learning activities presented here came from the desire to firstly, take a more quantitative look at student responses in collaborative algebra activities, and secondly, to situate those activities in a more traditional introductory algebra setting focusing on…

Numerical linear algebra with applications using Matlab

CERN Document Server

Ford, William

2014-01-01

Designed for those who want to gain a practical knowledge of modern computational techniques for the numerical solution of linear algebra problems, Numerical Linear Algebra with Applications contains all the material necessary for a first year graduate or advanced undergraduate course on numerical linear algebra with numerous applications to engineering and science. With a unified presentation of computation, basic algorithm analysis, and numerical methods to compute solutions, this book is ideal for solving real-world problems. It provides necessary mathematical background information for

Color Algebras

Science.gov (United States)

Mulligan, Jeffrey B.

2017-01-01

A color algebra refers to a system for computing sums and products of colors, analogous to additive and subtractive color mixtures. The difficulty addressed here is the fact that, because of metamerism, we cannot know with certainty the spectrum that produced a particular color solely on the basis of sensory data. Knowledge of the spectrum is not required to compute additive mixture of colors, but is critical for subtractive (multiplicative) mixture. Therefore, we cannot predict with certainty the multiplicative interactions between colors based solely on sensory data. There are two potential applications of a color algebra: first, to aid modeling phenomena of human visual perception, such as color constancy and transparency; and, second, to provide better models of the interactions of lights and surfaces for computer graphics rendering.

Building a symbolic computer algebra toolbox to compute 2D Fourier transforms in polar coordinates.

Science.gov (United States)

Dovlo, Edem; Baddour, Natalie

2015-01-01

The development of a symbolic computer algebra toolbox for the computation of two dimensional (2D) Fourier transforms in polar coordinates is presented. Multidimensional Fourier transforms are widely used in image processing, tomographic reconstructions and in fact any application that requires a multidimensional convolution. By examining a function in the frequency domain, additional information and insights may be obtained. The advantages of our method include: •The implementation of the 2D Fourier transform in polar coordinates within the toolbox via the combination of two significantly simpler transforms.•The modular approach along with the idea of lookup tables implemented help avoid the issue of indeterminate results which may occur when attempting to directly evaluate the transform.•The concept also helps prevent unnecessary computation of already known transforms thereby saving memory and processing time.

Formalization and Implementation of Algebraic Methods in Geometry

Directory of Open Access Journals (Sweden)

Filip Marić

2012-02-01

Full Text Available We describe our ongoing project of formalization of algebraic methods for geometry theorem proving (Wu's method and the Groebner bases method, their implementation and integration in educational tools. The project includes formal verification of the algebraic methods within Isabelle/HOL proof assistant and development of a new, open-source Java implementation of the algebraic methods. The project should fill-in some gaps still existing in this area (e.g., the lack of formal links between algebraic methods and synthetic geometry and the lack of self-contained implementations of algebraic methods suitable for integration with dynamic geometry tools and should enable new applications of theorem proving in education.

Non-freely generated W-algebras and construction of N=2 super W-algebras

International Nuclear Information System (INIS)

Blumenhagen, R.

1994-07-01

Firstly, we investigate the origin of the bosonic W-algebras W(2, 3, 4, 5), W(2, 4, 6) and W(2, 4, 6) found earlier by direct construction. We present a coset construction for all three examples leading to a new type of finitely, non-freely generated quantum W-algebras, which we call unifying W-algebras. Secondly, we develop a manifest covariant formalism to construct N = 2 super W-algebras explicitly on a computer. Applying this algorithm enables us to construct the first four examples of N = 2 super W-algebras with two generators and the N = 2 super W 4 algebra involving three generators. The representation theory of the former ones shows that all examples could be divided into four classes, the largest one containing the N = 2 special type of spectral flow algebras. Besides the W-algebra of the CP(3) Kazama-Suzuki coset model, the latter example with three generators discloses a second solution which could also be explained as a unifying W-algebra for the CP(n) models. (orig.)

Cohomology of Effect Algebras

Directory of Open Access Journals (Sweden)

Frank Roumen

2017-01-01

Full Text Available We will define two ways to assign cohomology groups to effect algebras, which occur in the algebraic study of quantum logic. The first way is based on Connes' cyclic cohomology. The resulting cohomology groups are related to the state space of the effect algebra, and can be computed using variations on the Kunneth and Mayer-Vietoris sequences. The second way involves a chain complex of ordered abelian groups, and gives rise to a cohomological characterization of state extensions on effect algebras. This has applications to no-go theorems in quantum foundations, such as Bell's theorem.

Fusion rules of chiral algebras

International Nuclear Information System (INIS)

Gaberdiel, M.

1994-01-01

Recently we showed that for the case of the WZW and the minimal models fusion can be understood as a certain ring-like tensor product of the symmetry algebra. In this paper we generalize this analysis to arbitrary chiral algebras. We define the tensor product of conformal field theory in the general case and prove that it is associative and symmetric up to equivalence. We also determine explicitly the action of the chiral algebra on this tensor product. In the second part of the paper we demonstrate that this framework provides a powerful tool for calculating restrictions for the fusion rules of chiral algebras. We exhibit this for the case of the W 3 algebra and the N=1 and N=2 NS superconformal algebras. (orig.)

Fundamentals of algebraic graph transformation

CERN Document Server

Ehrig, Hartmut; Prange, Ulrike; Taentzer, Gabriele

2006-01-01

Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. Part I is an introduction to the classical case of graph and typed graph transformation. In Part II basic and advanced results are first shown for an abstract form of replacement systems, so-called adhesive high-level replacement systems based on category theory, and are then instantiated to several forms of graph and Petri net transformation systems. Part III develops typed attributed graph transformation, a technique of key relevance in the modeling of visual languages and in model transformation. Part IV contains a practical case study on model transformation and a presentation of the AGG (attributed graph grammar) tool envir...

Learning abstract algebra with ISETL

CERN Document Server

Dubinsky, Ed

1994-01-01

Most students in abstract algebra classes have great difficulty making sense of what the instructor is saying. Moreover, this seems to remain true almost independently of the quality of the lecture. This book is based on the constructivist belief that, before students can make sense of any presentation of abstract mathematics, they need to be engaged in mental activities which will establish an experiential base for any future verbal explanation. No less, they need to have the opportunity to reflect on their activities. This approach is based on extensive theoretical and empirical studies as well as on the substantial experience of the authors in teaching astract algebra. The main source of activities in this course is computer constructions, specifically, small programs written in the mathlike programming language ISETL; the main tool for reflections is work in teams of 2-4 students, where the activities are discussed and debated. Because of the similarity of ISETL expressions to standard written mathematics...

Applied linear algebra

CERN Document Server

Olver, Peter J

2018-01-01

This textbook develops the essential tools of linear algebra, with the goal of imparting technique alongside contextual understanding. Applications go hand-in-hand with theory, each reinforcing and explaining the other. This approach encourages students to develop not only the technical proficiency needed to go on to further study, but an appreciation for when, why, and how the tools of linear algebra can be used across modern applied mathematics. Providing an extensive treatment of essential topics such as Gaussian elimination, inner products and norms, and eigenvalues and singular values, this text can be used for an in-depth first course, or an application-driven second course in linear algebra. In this second edition, applications have been updated and expanded to include numerical methods, dynamical systems, data analysis, and signal processing, while the pedagogical flow of the core material has been improved. Throughout, the text emphasizes the conceptual connections between each application and the un...

Infinite dimension algebra and conformal symmetry

International Nuclear Information System (INIS)

Ragoucy-Aubezon, E.

1991-04-01

A generalisation of Kac-Moody algebras (current algebras defined on a circle) to algebras defined on a compact supermanifold of any dimension and with any number of supersymmetries is presented. For such a purpose, we compute all the central extensions of loop algebras defined on this supermanifold, i.e. all the cohomology classes of these loop algebras. Then, we try to extend the relation (i.e. semi-direct sum) that exists between the two dimensional conformal algebras (called Virasoro algebra) and the usual Kac-Moody algebras, by considering the derivation algebra of our extended Kac-Moody algebras. The case of superconformal algebras (used in superstrings theories) is treated, as well as the cases of area-preserving diffeomorphisms (used in membranes theories), and Krichever-Novikov algebras (used for interacting strings). Finally, we present some generalizations of the Sugawara construction to the cases of extended Kac-Moody algebras, and Kac-Moody of superalgebras. These constructions allow us to get new realizations of the Virasoro, and Ramond, Neveu-Schwarz algebras

Extended Kac-Moody algebras and applications

International Nuclear Information System (INIS)

Ragoucy, E.; Sorba, P.

1991-04-01

The notion of a Kac-Moody algebra defined on the S 1 circle is extended to super Kac-Moody algebras defined on MxG N , M being a smooth closed compact manifold of dimension greater than one, and G N the Grassman algebra with N generators. All the central extensions of these algebras are computed. Then, for each such algebra the derivation algebra constructed from the MxG N diffeomorphism is determined. The twists of such super Kac-Moody algebras as well as the generalization to non-compact surfaces are partially studied. Finally, the general construction is applied to the study of conformal and superconformal algebras, as well as area-preserving diffeomorphisms algebra and its supersymmetric extension. (author) 65 refs

MATLAB matrix algebra

CERN Document Server

Pérez López, César

2014-01-01

MATLAB is a high-level language and environment for numerical computation, visualization, and programming. Using MATLAB, you can analyze data, develop algorithms, and create models and applications. The language, tools, and built-in math functions enable you to explore multiple approaches and reach a solution faster than with spreadsheets or traditional programming languages, such as C/C++ or Java. MATLAB Matrix Algebra introduces you to the MATLAB language with practical hands-on instructions and results, allowing you to quickly achieve your goals. Starting with a look at symbolic and numeric variables, with an emphasis on vector and matrix variables, you will go on to examine functions and operations that support vectors and matrices as arguments, including those based on analytic parent functions. Computational methods for finding eigenvalues and eigenvectors of matrices are detailed, leading to various matrix decompositions. Applications such as change of bases, the classification of quadratic forms and ...

Hopf algebras in noncommutative geometry

International Nuclear Information System (INIS)

Varilly, Joseph C.

2001-10-01

We give an introductory survey to the use of Hopf algebras in several problems of non- commutative geometry. The main example, the Hopf algebra of rooted trees, is a graded, connected Hopf algebra arising from a universal construction. We show its relation to the algebra of transverse differential operators introduced by Connes and Moscovici in order to compute a local index formula in cyclic cohomology, and to the several Hopf algebras defined by Connes and Kreimer to simplify the combinatorics of perturbative renormalization. We explain how characteristic classes for a Hopf module algebra can be obtained from the cyclic cohomology of the Hopf algebra which acts on it. Finally, we discuss the theory of non- commutative spherical manifolds and show how they arise as homogeneous spaces of certain compact quantum groups. (author)

(Modular Effect Algebras are Equivalent to (Frobenius Antispecial Algebras

Directory of Open Access Journals (Sweden)

Dusko Pavlovic

2017-01-01

Full Text Available Effect algebras are one of the generalizations of Boolean algebras proposed in the quest for a quantum logic. Frobenius algebras are a tool of categorical quantum mechanics, used to present various families of observables in abstract, often nonstandard frameworks. Both effect algebras and Frobenius algebras capture their respective fragments of quantum mechanics by elegant and succinct axioms; and both come with their conceptual mysteries. A particularly elegant and mysterious constraint, imposed on Frobenius algebras to characterize a class of tripartite entangled states, is the antispecial law. A particularly contentious issue on the quantum logic side is the modularity law, proposed by von Neumann to mitigate the failure of distributivity of quantum logical connectives. We show that, if quantum logic and categorical quantum mechanics are formalized in the same framework, then the antispecial law of categorical quantum mechanics corresponds to the natural requirement of effect algebras that the units are each other's unique complements; and that the modularity law corresponds to the Frobenius condition. These correspondences lead to the equivalence announced in the title. Aligning the two formalisms, at the very least, sheds new light on the concepts that are more clearly displayed on one side than on the other (such as e.g. the orthogonality. Beyond that, it may also open up new approaches to deep and important problems of quantum mechanics (such as the classification of complementary observables.

Applications of Soft Sets in -Algebras

Directory of Open Access Journals (Sweden)

N. O. Alshehri

2013-01-01

Full Text Available In 1999, Molodtsov introduced the concept of soft set theory as a general mathematical tool for dealing with uncertainty and vagueness. In this paper, we apply the concept of soft sets to K-algebras and investigate some properties of Abelian soft K-algebras. We also introduce the concept of soft intersection K-algebras and investigate some of their properties.

A course in BE-algebras

CERN Document Server

Mukkamala, Sambasiva Rao

2018-01-01

This book presents a unified course in BE-algebras with a comprehensive introduction, general theoretical basis and several examples. It introduces the general theoretical basis of BE-algebras, adopting a credible style to offer students a conceptual understanding of the subject. BE-algebras are important tools for certain investigations in algebraic logic, because they can be considered as fragments of any propositional logic containing a logical connective implication and the constant "1", which is considered as the logical value “true”.  Primarily aimed at graduate and postgraduate students of mathematics, it also helps researchers and mathematicians to build a strong foundation in applied abstract algebra. Presenting insights into some of the abstract thinking that constitutes modern abstract algebra, it provides a transition from elementary topics to advanced topics in BE-algebras. With abundant examples and exercises arranged after each section, it offers readers a comprehensive, easy-to-follow int...

Edix: A Software for Editing Algebraic Expressions.

OpenAIRE

Bouhineau , Denis; Nicaud , Jean-François; Pavard , X.

2001-01-01

International audience; The paper presents a computer software, called Edix, devoted to the edition of algebraic expressions in their usual 2D representation. At present, many systems display fine algebraic expressions, but the edition of such expressions is weak. Systems like Word and FrameMaker place sub-expressions in too many boxes so that many editing actions are not simple, while usual CAS (computer algebra systems) just use a 1D representation for the edition. Furthermore, Edix allows ...

An algebraic substructuring using multiple shifts for eigenvalue computations

International Nuclear Information System (INIS)

Ko, Jin Hwan; Jung, Sung Nam; Byun, Do Young; Bai, Zhaojun

2008-01-01

Algebraic substructuring (AS) is a state-of-the-art method in eigenvalue computations, especially for large-sized problems, but originally it was designed to calculate only the smallest eigenvalues. Recently, an updated version of AS has been introduced to calculate the interior eigenvalues over a specified range by using a shift concept that is referred to as the shifted AS. In this work, we propose a combined method of both AS and the shifted AS by using multiple shifts for solving a considerable number of eigensolutions in a large-sized problem, which is an emerging computational issue of noise or vibration analysis in vehicle design. In addition, we investigated the accuracy of the shifted AS by presenting an error criterion. The proposed method has been applied to the FE model of an automobile body. The combined method yielded a higher efficiency without loss of accuracy in comparison to the original AS

Gauss Elimination: Workhorse of Linear Algebra.

Science.gov (United States)

1995-08-05

linear algebra computation for solving systems, computing determinants and determining the rank of matrix. All of these are discussed in varying contexts. These include different arithmetic or algebraic setting such as integer arithmetic or polynomial rings as well as conventional real (floating-point) arithmetic. These have effects on both accuracy and complexity analyses of the algorithm. These, too, are covered here. The impact of modern parallel computer architecture on GE is also

CENTER CONDITIONS AND CYCLICITY FOR A FAMILY OF CUBIC SYSTEMS: COMPUTER ALGEBRA APPROACH.

Science.gov (United States)

Ferčec, Brigita; Mahdi, Adam

2013-01-01

Using methods of computational algebra we obtain an upper bound for the cyclicity of a family of cubic systems. We overcame the problem of nonradicality of the associated Bautin ideal by moving from the ring of polynomials to a coordinate ring. Finally, we determine the number of limit cycles bifurcating from each component of the center variety.

The Automation of Stochastization Algorithm with Use of SymPy Computer Algebra Library

Science.gov (United States)

Demidova, Anastasya; Gevorkyan, Migran; Kulyabov, Dmitry; Korolkova, Anna; Sevastianov, Leonid

2018-02-01

SymPy computer algebra library is used for automatic generation of ordinary and stochastic systems of differential equations from the schemes of kinetic interaction. Schemes of this type are used not only in chemical kinetics but also in biological, ecological and technical models. This paper describes the automatic generation algorithm with an emphasis on application details.

Syntactic Language Extension via an Algebra of Languages and Transformations

DEFF Research Database (Denmark)

Andersen, Jacob; Brabrand, Claus

2010-01-01

We propose an algebra of languages and transformations as a means for extending languages syntactically. The algebra provides a layer of high-level abstractions built on top of languages (captured by context-free grammars) and transformations (captured by constructive catamorphisms). The algebra...... is self-contained in that any term of the algebra specifying a transformation can be reduced to a catamorphism, before the transformation is run. Thus, the algebra comes “for free” without sacrificing the strong safety and efficiency properties of constructive catamorphisms. The entire algebra...... as presented in the paper is implemented as the Banana Algebra Tool which may be used to syntactically extend languages in an incremental and modular fashion via algebraic composition of previously defined languages and transformations. We demonstrate and evaluate the tool via several kinds of extensions....

A Study of the Use of a Handheld Computer Algebra System in Discrete Mathematics

Science.gov (United States)

Powers, Robert A.; Allison, Dean E.; Grassl, Richard M.

2005-01-01

This study investigated the impact of the TI-92 handheld Computer Algebra System (CAS) on student achievement in a discrete mathematics course. Specifically, the researchers examined the differences between a CAS section and a control section of discrete mathematics on students' in-class examinations. Additionally, they analysed student approaches…

Numerical linear algebra theory and applications

CERN Document Server

Beilina, Larisa; Karchevskii, Mikhail

2017-01-01

This book combines a solid theoretical background in linear algebra with practical algorithms for numerical solution of linear algebra problems. Developed from a number of courses taught repeatedly by the authors, the material covers topics like matrix algebra, theory for linear systems of equations, spectral theory, vector and matrix norms combined with main direct and iterative numerical methods, least squares problems, and eigen problems. Numerical algorithms illustrated by computer programs written in MATLAB® are also provided as supplementary material on SpringerLink to give the reader a better understanding of professional numerical software for the solution of real-life problems. Perfect for a one- or two-semester course on numerical linear algebra, matrix computation, and large sparse matrices, this text will interest students at the advanced undergraduate or graduate level.

Parallel computing: numerics, applications, and trends

National Research Council Canada - National Science Library

Trobec, Roman; Vajteršic, Marián; Zinterhof, Peter

2009-01-01

... and/or distributed systems. The contributions to this book are focused on topics most concerned in the trends of today's parallel computing. These range from parallel algorithmics, programming, tools, network computing to future parallel computing. Particular attention is paid to parallel numerics: linear algebra, differential equations, numerica...

Quantum algebras in nuclear structure

International Nuclear Information System (INIS)

Bonatsos, D.; Daskaloyannis, C.

1995-01-01

Quantum algebras is a mathematical tool which provides us with a class of symmetries wider than that of Lie algebras, which are contained in the former as a special case. After a self-contained introduction through the necessary mathematical tools (q-numbers, q-analysis, q-oscillators, q-algebras), the su q (2) rotator model and its extensions, the construction of deformed exactly soluble models (Interacting Boson Model, Moszkowski model), the use of deformed bosons in the description of pairing correlations, and the symmetries of the anisotropic quantum harmonic oscillator with rational ratios of frequencies, which underline the structure of superdeformed and hyperdeformed nuclei are discussed in some details. A brief description of similar applications to molecular structure and an outlook are also given. (author) 2 Tabs., 324 Refs

Chiral algebras for trinion theories

International Nuclear Information System (INIS)

Lemos, Madalena; Peelaers, Wolfger

2015-01-01

It was recently understood that one can identify a chiral algebra in any four-dimensional N=2 superconformal theory. In this note, we conjecture the full set of generators of the chiral algebras associated with the T n theories. The conjecture is motivated by making manifest the critical affine module structure in the graded partition function of the chiral algebras, which is computed by the Schur limit of the superconformal index for T n theories. We also explicitly construct the chiral algebra arising from the T 4 theory. Its null relations give rise to new T 4 Higgs branch chiral ring relations.

Term Satisfiability in FLew-Algebras

Czech Academy of Sciences Publication Activity Database

Haniková, Zuzana; Savický, Petr

2016-01-01

Roč. 631, 6 June (2016), s. 1-15 ISSN 0304-3975 R&D Projects: GA ČR GBP202/12/G061 Institutional support: RVO:67985807 Keywords : substructural logic * FLew-algebra * MV-algebra * satisfiability * computational complexity Subject RIV: BA - General Mathematics Impact factor: 0.698, year: 2016

An algebraic approach to linear-optical schemes for deterministic quantum computing

International Nuclear Information System (INIS)

Aniello, Paolo; Cagli, Ruben Coen

2005-01-01

Linear-optical passive (LOP) devices and photon counters are sufficient to implement universal quantum computation with single photons, and particular schemes have already been proposed. In this paper we discuss the link between the algebraic structure of LOP transformations and quantum computing. We first show how to decompose the Fock space of N optical modes in finite-dimensional subspaces that are suitable for encoding strings of qubits and invariant under LOP transformations (these subspaces are related to the spaces of irreducible unitary representations of U (N). Next we show how to design in algorithmic fashion LOP circuits which implement any quantum circuit deterministically. We also present some simple examples, such as the circuits implementing a cNOT gate and a Bell state generator/analyser

A process algebra software engineering environment

NARCIS (Netherlands)

Diertens, B.

2008-01-01

In previous work we described how the process algebra based language PSF can be used in software engineering, using the ToolBus, a coordination architecture also based on process algebra, as implementation model. In this article we summarize that work and describe the software development process

Introduction to algebra and trigonometry

CERN Document Server

Kolman, Bernard

1981-01-01

Introduction to Algebra and Trigonometry provides a complete and self-contained presentation of the fundamentals of algebra and trigonometry.This book describes an axiomatic development of the foundations of algebra, defining complex numbers that are used to find the roots of any quadratic equation. Advanced concepts involving complex numbers are also elaborated, including the roots of polynomials, functions and function notation, and computations with logarithms. This text also discusses trigonometry from a functional standpoint. The angles, triangles, and applications involving triangles are

Circle Maps and C*-algebras

DEFF Research Database (Denmark)

Schmidt, Thomas Lundsgaard; Thomsen, Klaus

2015-01-01

We consider a construction of $C^*$-algebras from continuous piecewise monotone maps on the circle which generalizes the crossed product construction for homeomorphisms and more generally the construction of Renault, Deaconu and Anantharaman-Delaroche for local homeomorphisms. Assuming that the map...... is surjective and not locally injective we give necessary and sufficient conditions for the simplicity of the $C^*$-algebra and show that it is then a Kirchberg algebra. We provide tools for the calculation of the K-theory groups and turn them into an algorithmic method for Markov maps....

Algebraic Graph Theory Morphisms, Monoids and Matrices

CERN Document Server

Knauer, Ulrich

2011-01-01

This is a highly self-contained book about algebraic graph theory which iswritten with a view to keep the lively and unconventional atmosphere of a spoken text to communicate the enthusiasm the author feels about this subject. The focus is on homomorphisms and endomorphisms, matrices and eigenvalues. Graph models are extremely useful for almost all applications and applicators as they play an important role as structuring tools. They allow to model net structures -like roads, computers, telephones -instances of abstract data structures -likelists, stacks, trees -and functional or object orient

Quantum algebras as quantizations of dual Poisson–Lie groups

International Nuclear Information System (INIS)

Ballesteros, Ángel; Musso, Fabio

2013-01-01

A systematic computational approach for the explicit construction of any quantum Hopf algebra (U z (g), Δ z ) starting from the Lie bialgebra (g, δ) that gives the first-order deformation of the coproduct map Δ z is presented. The procedure is based on the well-known ‘quantum duality principle’, namely the fact that any quantum algebra can be viewed as the quantization of the unique Poisson–Lie structure (G*, Λ g ) on the dual group G*, which is obtained by exponentiating the Lie algebra g* defined by the dual map δ*. From this perspective, the coproduct for U z (g) is just the pull-back of the group law for G*, and the Poisson analogues of the quantum commutation rules for U z (g) are given by the unique Poisson–Lie structure Λ g on G* whose linearization is the Poisson analogue of the initial Lie algebra g. This approach is shown to be a very useful technical tool in order to solve the Lie bialgebra quantization problem explicitly since, once a Lie bialgebra (g, δ) is given, the full dual Poisson–Lie group (G*, Λ) can be obtained either by applying standard Poisson–Lie group techniques or by implementing the algorithm presented here with the aid of symbolic manipulation programs. As a consequence, the quantization of (G*, Λ) will give rise to the full U z (g) quantum algebra, provided that ordering problems are appropriately fixed through the choice of certain local coordinates on G* whose coproduct fulfils a precise ‘quantum symmetry’ property. The applicability of this approach is explicitly demonstrated by reviewing the construction of several instances of quantum deformations of physically relevant Lie algebras such as sl(2,R), the (2+1) anti-de Sitter algebra so(2, 2) and the Poincaré algebra in (3+1) dimensions. (paper)

Vertex algebras and algebraic curves

CERN Document Server

Frenkel, Edward

2004-01-01

Vertex algebras are algebraic objects that encapsulate the concept of operator product expansion from two-dimensional conformal field theory. Vertex algebras are fast becoming ubiquitous in many areas of modern mathematics, with applications to representation theory, algebraic geometry, the theory of finite groups, modular functions, topology, integrable systems, and combinatorics. This book is an introduction to the theory of vertex algebras with a particular emphasis on the relationship with the geometry of algebraic curves. The notion of a vertex algebra is introduced in a coordinate-independent way, so that vertex operators become well defined on arbitrary smooth algebraic curves, possibly equipped with additional data, such as a vector bundle. Vertex algebras then appear as the algebraic objects encoding the geometric structure of various moduli spaces associated with algebraic curves. Therefore they may be used to give a geometric interpretation of various questions of representation theory. The book co...

A novel technique to solve nonlinear higher-index Hessenberg differential-algebraic equations by Adomian decomposition method.

Science.gov (United States)

Benhammouda, Brahim

2016-01-01

Since 1980, the Adomian decomposition method (ADM) has been extensively used as a simple powerful tool that applies directly to solve different kinds of nonlinear equations including functional, differential, integro-differential and algebraic equations. However, for differential-algebraic equations (DAEs) the ADM is applied only in four earlier works. There, the DAEs are first pre-processed by some transformations like index reductions before applying the ADM. The drawback of such transformations is that they can involve complex algorithms, can be computationally expensive and may lead to non-physical solutions. The purpose of this paper is to propose a novel technique that applies the ADM directly to solve a class of nonlinear higher-index Hessenberg DAEs systems efficiently. The main advantage of this technique is that; firstly it avoids complex transformations like index reductions and leads to a simple general algorithm. Secondly, it reduces the computational work by solving only linear algebraic systems with a constant coefficient matrix at each iteration, except for the first iteration where the algebraic system is nonlinear (if the DAE is nonlinear with respect to the algebraic variable). To demonstrate the effectiveness of the proposed technique, we apply it to a nonlinear index-three Hessenberg DAEs system with nonlinear algebraic constraints. This technique is straightforward and can be programmed in Maple or Mathematica to simulate real application problems.

An algebraic approach to the scattering equations

Energy Technology Data Exchange (ETDEWEB)

Huang, Rijun; Rao, Junjie [Zhejiang Institute of Modern Physics, Zhejiang University,Hangzhou, 310027 (China); Feng, Bo [Zhejiang Institute of Modern Physics, Zhejiang University,Hangzhou, 310027 (China); Center of Mathematical Science, Zhejiang University,Hangzhou, 310027 (China); He, Yang-Hui [School of Physics, NanKai University,Tianjin, 300071 (China); Department of Mathematics, City University,London, EC1V 0HB (United Kingdom); Merton College, University of Oxford,Oxford, OX14JD (United Kingdom)

2015-12-10

We employ the so-called companion matrix method from computational algebraic geometry, tailored for zero-dimensional ideals, to study the scattering equations. The method renders the CHY-integrand of scattering amplitudes computable using simple linear algebra and is amenable to an algorithmic approach. Certain identities in the amplitudes as well as rationality of the final integrand become immediate in this formalism.

An algebraic approach to the scattering equations

International Nuclear Information System (INIS)

Huang, Rijun; Rao, Junjie; Feng, Bo; He, Yang-Hui

2015-01-01

We employ the so-called companion matrix method from computational algebraic geometry, tailored for zero-dimensional ideals, to study the scattering equations. The method renders the CHY-integrand of scattering amplitudes computable using simple linear algebra and is amenable to an algorithmic approach. Certain identities in the amplitudes as well as rationality of the final integrand become immediate in this formalism.

Algebraic partial Boolean algebras

International Nuclear Information System (INIS)

Smith, Derek

2003-01-01

Partial Boolean algebras, first studied by Kochen and Specker in the 1960s, provide the structure for Bell-Kochen-Specker theorems which deny the existence of non-contextual hidden variable theories. In this paper, we study partial Boolean algebras which are 'algebraic' in the sense that their elements have coordinates in an algebraic number field. Several of these algebras have been discussed recently in a debate on the validity of Bell-Kochen-Specker theorems in the context of finite precision measurements. The main result of this paper is that every algebraic finitely-generated partial Boolean algebra B(T) is finite when the underlying space H is three-dimensional, answering a question of Kochen and showing that Conway and Kochen's infinite algebraic partial Boolean algebra has minimum dimension. This result contrasts the existence of an infinite (non-algebraic) B(T) generated by eight elements in an abstract orthomodular lattice of height 3. We then initiate a study of higher-dimensional algebraic partial Boolean algebras. First, we describe a restriction on the determinants of the elements of B(T) that are generated by a given set T. We then show that when the generating set T consists of the rays spanning the minimal vectors in a real irreducible root lattice, B(T) is infinite just if that root lattice has an A 5 sublattice. Finally, we characterize the rays of B(T) when T consists of the rays spanning the minimal vectors of the root lattice E 8

Thermodiffusion in Multicomponent Mixtures Thermodynamic, Algebraic, and Neuro-Computing Models

CERN Document Server

Srinivasan, Seshasai

2013-01-01

Thermodiffusion in Multicomponent Mixtures presents the computational approaches that are employed in the study of thermodiffusion in various types of mixtures, namely, hydrocarbons, polymers, water-alcohol, molten metals, and so forth. We present a detailed formalism of these methods that are based on non-equilibrium thermodynamics or algebraic correlations or principles of the artificial neural network. The book will serve as single complete reference to understand the theoretical derivations of thermodiffusion models and its application to different types of multi-component mixtures. An exhaustive discussion of these is used to give a complete perspective of the principles and the key factors that govern the thermodiffusion process.

Homological methods, representation theory, and cluster algebras

CERN Document Server

Trepode, Sonia

2018-01-01

This text presents six mini-courses, all devoted to interactions between representation theory of algebras, homological algebra, and the new ever-expanding theory of cluster algebras. The interplay between the topics discussed in this text will continue to grow and this collection of courses stands as a partial testimony to this new development. The courses are useful for any mathematician who would like to learn more about this rapidly developing field; the primary aim is to engage graduate students and young researchers. Prerequisites include knowledge of some noncommutative algebra or homological algebra. Homological algebra has always been considered as one of the main tools in the study of finite-dimensional algebras. The strong relationship with cluster algebras is more recent and has quickly established itself as one of the important highlights of today’s mathematical landscape. This connection has been fruitful to both areas—representation theory provides a categorification of cluster algebras, wh...

Rationality problem for algebraic tori

CERN Document Server

Hoshi, Akinari

2017-01-01

The authors give the complete stably rational classification of algebraic tori of dimensions 4 and 5 over a field k. In particular, the stably rational classification of norm one tori whose Chevalley modules are of rank 4 and 5 is given. The authors show that there exist exactly 487 (resp. 7, resp. 216) stably rational (resp. not stably but retract rational, resp. not retract rational) algebraic tori of dimension 4, and there exist exactly 3051 (resp. 25, resp. 3003) stably rational (resp. not stably but retract rational, resp. not retract rational) algebraic tori of dimension 5. The authors make a procedure to compute a flabby resolution of a G-lattice effectively by using the computer algebra system GAP. Some algorithms may determine whether the flabby class of a G-lattice is invertible (resp. zero) or not. Using the algorithms, the suthors determine all the flabby and coflabby G-lattices of rank up to 6 and verify that they are stably permutation. The authors also show that the Krull-Schmidt theorem for G-...

Linear algebra

CERN Document Server

Liesen, Jörg

2015-01-01

This self-contained textbook takes a matrix-oriented approach to linear algebra and presents a complete theory, including all details and proofs, culminating in the Jordan canonical form and its proof. Throughout the development, the applicability of the results is highlighted. Additionally, the book presents special topics from applied linear algebra including matrix functions, the singular value decomposition, the Kronecker product and linear matrix equations. The matrix-oriented approach to linear algebra leads to a better intuition and a deeper understanding of the abstract concepts, and therefore simplifies their use in real world applications. Some of these applications are presented in detailed examples. In several ‘MATLAB-Minutes’ students can comprehend the concepts and results using computational experiments. Necessary basics for the use of MATLAB are presented in a short introduction. Students can also actively work with the material and practice their mathematical skills in more than 300 exerc...

Difference sets connecting algebra, combinatorics, and geometry

CERN Document Server

Moore, Emily H

2013-01-01

Difference sets belong both to group theory and to combinatorics. Studying them requires tools from geometry, number theory, and representation theory. This book lays a foundation for these topics, including a primer on representations and characters of finite groups. It makes the research literature on difference sets accessible to students who have studied linear algebra and abstract algebra, and it prepares them to do their own research. This text is suitable for an undergraduate capstone course, since it illuminates the many links among topics that the students have already studied. To this end, almost every chapter ends with a coda highlighting the main ideas and emphasizing mathematical connections. This book can also be used for self-study by anyone interested in these connections and concrete examples. An abundance of exercises, varying from straightforward to challenging, invites the reader to solve puzzles, construct proofs, and investigate problems--by hand or on a computer. Hints and solutions are...

Linear Algebra and Image Processing

Science.gov (United States)

Allali, Mohamed

2010-01-01

We use the computing technology digital image processing (DIP) to enhance the teaching of linear algebra so as to make the course more visual and interesting. Certainly, this visual approach by using technology to link linear algebra to DIP is interesting and unexpected to both students as well as many faculty. (Contains 2 tables and 11 figures.)

Study guide for college algebra

CERN Document Server

Snow, James W; Shapiro, Arnold

1981-01-01

Study Guide for College Algebra is a supplemental material for the basic text, College Algebra. Its purpose is to make the learning of college algebra and trigonometry easier and enjoyable.The book provides detailed solutions to exercises found in the text. Students are encouraged to use the study guide as a learning tool during the duration of the course, a reviewer prior to an exam, a reference book, and as a quick overview before studying a section of the text. The Study Guide and Solutions Manual consists of four major components: basic concepts that should be learned from each unit, what

AIR Tools - A MATLAB package of algebraic iterative reconstruction methods

DEFF Research Database (Denmark)

Hansen, Per Christian; Saxild-Hansen, Maria

2012-01-01

We present a MATLAB package with implementations of several algebraic iterative reconstruction methods for discretizations of inverse problems. These so-called row action methods rely on semi-convergence for achieving the necessary regularization of the problem. Two classes of methods are impleme......We present a MATLAB package with implementations of several algebraic iterative reconstruction methods for discretizations of inverse problems. These so-called row action methods rely on semi-convergence for achieving the necessary regularization of the problem. Two classes of methods...... are implemented: Algebraic Reconstruction Techniques (ART) and Simultaneous Iterative Reconstruction Techniques (SIRT). In addition we provide a few simplified test problems from medical and seismic tomography. For each iterative method, a number of strategies are available for choosing the relaxation parameter...

Schwarz maps of algebraic linear ordinary differential equations

Science.gov (United States)

Sanabria Malagón, Camilo

2017-12-01

A linear ordinary differential equation is called algebraic if all its solution are algebraic over its field of definition. In this paper we solve the problem of finding closed form solution to algebraic linear ordinary differential equations in terms of standard equations. Furthermore, we obtain a method to compute all algebraic linear ordinary differential equations with rational coefficients by studying their associated Schwarz map through the Picard-Vessiot Theory.

Algebraic and computational aspects of real tensor ranks

CERN Document Server

Sakata, Toshio; Miyazaki, Mitsuhiro

2016-01-01

This book provides comprehensive summaries of theoretical (algebraic) and computational aspects of tensor ranks, maximal ranks, and typical ranks, over the real number field. Although tensor ranks have been often argued in the complex number field, it should be emphasized that this book treats real tensor ranks, which have direct applications in statistics. The book provides several interesting ideas, including determinant polynomials, determinantal ideals, absolutely nonsingular tensors, absolutely full column rank tensors, and their connection to bilinear maps and Hurwitz-Radon numbers. In addition to reviews of methods to determine real tensor ranks in details, global theories such as the Jacobian method are also reviewed in details. The book includes as well an accessible and comprehensive introduction of mathematical backgrounds, with basics of positive polynomials and calculations by using the Groebner basis. Furthermore, this book provides insights into numerical methods of finding tensor ranks through...

Hecke algebraic properties of dynamical R-matrices. Application to related quantum matrix algebras

International Nuclear Information System (INIS)

Khadzhiivanov, L.K.; Todorov, I.T.; Isaev, A.P.; Pyatov, P.N.; Ogievetskij, O.V.

1998-01-01

The quantum dynamical Yang-Baxter (or Gervais-Neveu-Felder) equation defines an R-matrix R cap (p), where p stands for a set of mutually commuting variables. A family of SL (n)-type solutions of this equation provides a new realization of the Hecke algebra. We define quantum antisymmetrizers, introduce the notion of quantum determinant and compute the inverse quantum matrix for matrix algebras of the type R cap (p) a 1 a 2 = a 1 a 2 R cap. It is pointed out that such a quantum matrix algebra arises in the operator realization of the chiral zero modes of the WZNW model

Modules as Learning Tools in Linear Algebra

Science.gov (United States)

Cooley, Laurel; Vidakovic, Draga; Martin, William O.; Dexter, Scott; Suzuki, Jeff; Loch, Sergio

2014-01-01

This paper reports on the experience of STEM and mathematics faculty at four different institutions working collaboratively to integrate learning theory with curriculum development in a core undergraduate linear algebra context. The faculty formed a Professional Learning Community (PLC) with a focus on learning theories in mathematics and…

The $K$-theory of real graph $C*$-algebras

OpenAIRE

Boersema, Jeffrey L.

2014-01-01

In this paper, we will introduce real graph algebras and develop the theory to the point of being able to calculate the $K$-theory of such algebras. The $K$-theory situation is significantly more complicated than in the case for complex graph algebras. To develop the long exact sequence to compute the $K$-theory of a real graph algebra, we need to develop a generalized theory of crossed products for real C*-algebras for groups with involution. We also need to deal with the additional algebrai...

Polynomial algebra of discrete models in systems biology.

Science.gov (United States)

Veliz-Cuba, Alan; Jarrah, Abdul Salam; Laubenbacher, Reinhard

2010-07-01

An increasing number of discrete mathematical models are being published in Systems Biology, ranging from Boolean network models to logical models and Petri nets. They are used to model a variety of biochemical networks, such as metabolic networks, gene regulatory networks and signal transduction networks. There is increasing evidence that such models can capture key dynamic features of biological networks and can be used successfully for hypothesis generation. This article provides a unified framework that can aid the mathematical analysis of Boolean network models, logical models and Petri nets. They can be represented as polynomial dynamical systems, which allows the use of a variety of mathematical tools from computer algebra for their analysis. Algorithms are presented for the translation into polynomial dynamical systems. Examples are given of how polynomial algebra can be used for the model analysis. alanavc@vt.edu Supplementary data are available at Bioinformatics online.

"E pluribus unum" or How to Derive Single-equation Descriptions for Output-quantities in Nonlinear Circuits using Differential Algebra

OpenAIRE

Gerbracht, Eberhard H. -A.

2008-01-01

In this paper we describe by a number of examples how to deduce one single characterizing higher order differential equation for output quantities of an analog circuit. In the linear case, we apply basic "symbolic" methods from linear algebra to the system of differential equations which is used to model the analog circuit. For nonlinear circuits and their corresponding nonlinear differential equations, we show how to employ computer algebra tools implemented in Maple, which are based on diff...

Linear Algebra and Smarandache Linear Algebra

OpenAIRE

Vasantha, Kandasamy

2003-01-01

The 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 p...

Computer generation of integrands for Feynman parametric integrals

International Nuclear Information System (INIS)

Cvitanovic, Predrag

1973-01-01

TECO text editing language, available on PDP-10 computers, is used for the generation and simplification of Feynman integrals. This example shows that TECO can be a useful computational tool in complicated calculations where similar algebraic structures recur many times

Elements of algebraic coding systems

CERN Document Server

Cardoso da Rocha, Jr, Valdemar

2014-01-01

Elements of Algebraic Coding Systems is an introductory text to algebraic coding theory. In the first chapter, you'll gain inside knowledge of coding fundamentals, which is essential for a deeper understanding of state-of-the-art coding systems. This book is a quick reference for those who are unfamiliar with this topic, as well as for use with specific applications such as cryptography and communication. Linear error-correcting block codes through elementary principles span eleven chapters of the text. Cyclic codes, some finite field algebra, Goppa codes, algebraic decoding algorithms, and applications in public-key cryptography and secret-key cryptography are discussed, including problems and solutions at the end of each chapter. Three appendices cover the Gilbert bound and some related derivations, a derivation of the Mac- Williams' identities based on the probability of undetected error, and two important tools for algebraic decoding-namely, the finite field Fourier transform and the Euclidean algorithm f...

Introduction to vertex algebras, Borcherds algebras and the Monster Lie algebras

International Nuclear Information System (INIS)

Gebert, R.W.

1993-09-01

The theory of vertex algebras constitutes a mathematically rigorous axiomatic formulation of the algebraic origins of conformal field theory. In this context Borcherds algebras arise as certain ''physical'' subspaces of vertex algebras. The aim of this review is to give a pedagogical introduction into this rapidly-developing area of mathematics. Based on the machinery of formal calculus we present the axiomatic definition of vertex algebras. We discuss the connection with conformal field theory by deriving important implications of these axioms. In particular, many explicit calculations are presented to stress the eminent role of the Jacobi identity axiom for vertex algebras. As a class of concrete examples the vertex algebras associated with even lattices are constructed and it is shown in detail how affine Lie algebras and the fake Monster Lie algebra naturally appear. This leads us to the abstract definition of Borcherds algebras as generalized Kac-Moody algebras and their basic properties. Finally, the results about the simplest generic Borcherds algebras are analysed from the point of view of symmetry in quantum theory and the construction of the Monster Lie algebra is sketched. (orig.)

Helmholtz algebraic solitons

Energy Technology Data Exchange (ETDEWEB)

Christian, J M; McDonald, G S [Joule Physics Laboratory, School of Computing, Science and Engineering, Materials and Physics Research Centre, University of Salford, Salford M5 4WT (United Kingdom); Chamorro-Posada, P, E-mail: j.christian@salford.ac.u [Departamento de Teoria de la Senal y Comunicaciones e Ingenieria Telematica, Universidad de Valladolid, ETSI Telecomunicacion, Campus Miguel Delibes s/n, 47011 Valladolid (Spain)

2010-02-26

We report, to the best of our knowledge, the first exact analytical algebraic solitons of a generalized cubic-quintic Helmholtz equation. This class of governing equation plays a key role in photonics modelling, allowing a full description of the propagation and interaction of broad scalar beams. New conservation laws are presented, and the recovery of paraxial results is discussed in detail. The stability properties of the new solitons are investigated by combining semi-analytical methods and computer simulations. In particular, new general stability regimes are reported for algebraic bright solitons.

Helmholtz algebraic solitons

International Nuclear Information System (INIS)

Christian, J M; McDonald, G S; Chamorro-Posada, P

2010-01-01

We report, to the best of our knowledge, the first exact analytical algebraic solitons of a generalized cubic-quintic Helmholtz equation. This class of governing equation plays a key role in photonics modelling, allowing a full description of the propagation and interaction of broad scalar beams. New conservation laws are presented, and the recovery of paraxial results is discussed in detail. The stability properties of the new solitons are investigated by combining semi-analytical methods and computer simulations. In particular, new general stability regimes are reported for algebraic bright solitons.

Titration Calculations with Computer Algebra Software

Science.gov (United States)

Lachance, Russ; Biaglow, Andrew

2012-01-01

This article examines the symbolic algebraic solution of the titration equations for a diprotic acid, as obtained using "Mathematica," "Maple," and "Mathcad." The equilibrium and conservation equations are solved symbolically by the programs to eliminate the approximations that normally would be performed by the student. Of the three programs,…

Understanding geometric algebra for electromagnetic theory

CERN Document Server

Arthur, John W

2011-01-01

"This book aims to disseminate geometric algebra as a straightforward mathematical tool set for working with and understanding classical electromagnetic theory. It's target readership is anyone who has some knowledge of electromagnetic theory, predominantly ordinary scientists and engineers who use it in the course of their work, or postgraduate students and senior undergraduates who are seeking to broaden their knowledge and increase their understanding of the subject. It is assumed that the reader is not a mathematical specialist and is neither familiar with geometric algebra or its application to electromagnetic theory. The modern approach, geometric algebra, is the mathematical tool set we should all have started out with and once the reader has a grasp of the subject, he or she cannot fail to realize that traditional vector analysis is really awkward and even misleading by comparison"--Provided by publisher.

Alternative algebraic approaches in quantum chemistry

International Nuclear Information System (INIS)

Mezey, Paul G.

2015-01-01

Various algebraic approaches of quantum chemistry all follow a common principle: the fundamental properties and interrelations providing the most essential features of a quantum chemical representation of a molecule or a chemical process, such as a reaction, can always be described by algebraic methods. Whereas such algebraic methods often provide precise, even numerical answers, nevertheless their main role is to give a framework that can be elaborated and converted into computational methods by involving alternative mathematical techniques, subject to the constraints and directions provided by algebra. In general, algebra describes sets of interrelations, often phrased in terms of algebraic operations, without much concern with the actual entities exhibiting these interrelations. However, in many instances, the very realizations of two, seemingly unrelated algebraic structures by actual quantum chemical entities or properties play additional roles, and unexpected connections between different algebraic structures are often giving new insight. Here we shall be concerned with two alternative algebraic structures: the fundamental group of reaction mechanisms, based on the energy-dependent topology of potential energy surfaces, and the interrelations among point symmetry groups for various distorted nuclear arrangements of molecules. These two, distinct algebraic structures provide interesting interrelations, which can be exploited in actual studies of molecular conformational and reaction processes. Two relevant theorems will be discussed

Alternative algebraic approaches in quantum chemistry

Energy Technology Data Exchange (ETDEWEB)

Mezey, Paul G., E-mail: paul.mezey@gmail.com [Canada Research Chair in Scientific Modeling and Simulation, Department of Chemistry and Department of Physics and Physical Oceanography, Memorial University of Newfoundland, 283 Prince Philip Drive, St. John' s, NL A1B 3X7 (Canada)

2015-01-22

Various algebraic approaches of quantum chemistry all follow a common principle: the fundamental properties and interrelations providing the most essential features of a quantum chemical representation of a molecule or a chemical process, such as a reaction, can always be described by algebraic methods. Whereas such algebraic methods often provide precise, even numerical answers, nevertheless their main role is to give a framework that can be elaborated and converted into computational methods by involving alternative mathematical techniques, subject to the constraints and directions provided by algebra. In general, algebra describes sets of interrelations, often phrased in terms of algebraic operations, without much concern with the actual entities exhibiting these interrelations. However, in many instances, the very realizations of two, seemingly unrelated algebraic structures by actual quantum chemical entities or properties play additional roles, and unexpected connections between different algebraic structures are often giving new insight. Here we shall be concerned with two alternative algebraic structures: the fundamental group of reaction mechanisms, based on the energy-dependent topology of potential energy surfaces, and the interrelations among point symmetry groups for various distorted nuclear arrangements of molecules. These two, distinct algebraic structures provide interesting interrelations, which can be exploited in actual studies of molecular conformational and reaction processes. Two relevant theorems will be discussed.

Algebraic dynamics solutions and algebraic dynamics algorithm for nonlinear partial differential evolution equations of dynamical systems

Institute of Scientific and Technical Information of China (English)

2008-01-01

Using functional derivative technique in quantum field theory, the algebraic dy-namics approach for solution of ordinary differential evolution equations was gen-eralized to treat partial differential evolution equations. The partial differential evo-lution equations were lifted to the corresponding functional partial differential equations in functional space by introducing the time translation operator. The functional partial differential evolution equations were solved by algebraic dynam-ics. The algebraic dynamics solutions are analytical in Taylor series in terms of both initial functions and time. Based on the exact analytical solutions, a new nu-merical algorithm—algebraic dynamics algorithm was proposed for partial differ-ential evolution equations. The difficulty of and the way out for the algorithm were discussed. The application of the approach to and computer numerical experi-ments on the nonlinear Burgers equation and meteorological advection equation indicate that the algebraic dynamics approach and algebraic dynamics algorithm are effective to the solution of nonlinear partial differential evolution equations both analytically and numerically.

Some Applications of Algebraic System Solving

Science.gov (United States)

Roanes-Lozano, Eugenio

2011-01-01

Technology and, in particular, computer algebra systems, allows us to change both the way we teach mathematics and the mathematical curriculum. Curiously enough, unlike what happens with linear system solving, algebraic system solving is not widely known. The aim of this paper is to show that, although the theory lying behind the "exact…

Solution of the Schrodinger Equation for a Diatomic Oscillator Using Linear Algebra: An Undergraduate Computational Experiment

Science.gov (United States)

Gasyna, Zbigniew L.

2008-01-01

Computational experiment is proposed in which a linear algebra method is applied to the solution of the Schrodinger equation for a diatomic oscillator. Calculations of the vibration-rotation spectrum for the HCl molecule are presented and the results show excellent agreement with experimental data. (Contains 1 table and 1 figure.)

Generalized Heisenberg algebra and algebraic method: The example of an infinite square-well potential

International Nuclear Information System (INIS)

Curado, E.M.F.; Hassouni, Y.; Rego-Monteiro, M.A.; Rodrigues, Ligia M.C.S.

2008-01-01

We discuss the role of generalized Heisenberg algebras (GHA) in obtaining an algebraic method to describe physical systems. The method consists in finding the GHA associated to a physical system and the relations between its generators and the physical observables. We choose as an example the infinite square-well potential for which we discuss the representations of the corresponding GHA. We suggest a way of constructing a physical realization of the generators of some GHA and apply it to the square-well potential. An expression for the position operator x in terms of the generators of the algebra is given and we compute its matrix elements

On the topology of real algebraic plane curves

DEFF Research Database (Denmark)

Cheng, Jinsan; Lazard, Sylvain; Peñaranda, Luis

2010-01-01

We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of singular and critical points, is also relevant. A challenge is to compute efficiently this information for the given...... and isolation with rational univariate representations. This has the advantage of avoiding computations with polynomials with algebraic coefficients, even in non-generic positions. Our algorithm isolates critical points in boxes and computes a decomposition of the plane by rectangular boxes. This decomposition...

Matrix Operations for Engineers and Scientists An Essential Guide in Linear Algebra

CERN Document Server

Jeffrey, Alan

2010-01-01

Engineers and scientists need to have an introduction to the basics of linear algebra in a context they understand. Computer algebra systems make the manipulation of matrices and the determination of their properties a simple matter, and in practical applications such software is often essential. However, using this tool when learning about matrices, without first gaining a proper understanding of the underlying theory, limits the ability to use matrices and to apply them to new problems. This book explains matrices in the detail required by engineering or science students, and it discusses linear systems of ordinary differential equations. These students require a straightforward introduction to linear algebra illustrated by applications to which they can relate. It caters of the needs of undergraduate engineers in all disciplines, and provides considerable detail where it is likely to be helpful. According to the author the best way to understand the theory of matrices is by working simple exercises designe...

The algebra of non-local charges in non-linear sigma models

International Nuclear Information System (INIS)

Abdalla, E.; Abdalla, M.C.B.; Brunelli, J.C.; Zadra, A.

1993-07-01

We obtain the exact Dirac algebra obeyed by the conserved non-local charges in bosonic non-linear sigma models. Part of the computation is specialized for a symmetry group O(N). As it turns out the algebra corresponds to a cubic deformation of the Kac-Moody algebra. The non-linear terms are computed in closed form. In each Dirac bracket we only find highest order terms (as explained in the paper), defining a saturated algebra. We generalize the results for the presence of a Wess-Zumino term. The algebra is very similar to the previous one, containing now a calculable correction of order one unit lower. (author). 22 refs, 5 figs

Supersymmetry algebra cohomology. I. Definition and general structure

International Nuclear Information System (INIS)

Brandt, Friedemann

2010-01-01

This paper concerns standard supersymmetry algebras in diverse dimensions, involving bosonic translational generators and fermionic supersymmetry generators. A cohomology related to these supersymmetry algebras, termed supersymmetry algebra cohomology, and corresponding 'primitive elements' are defined by means of a BRST (Becchi-Rouet-Stora-Tyutin)-type coboundary operator. A method to systematically compute this cohomology is outlined and illustrated by simple examples.

Quantum W-algebras and elliptic algebras

International Nuclear Information System (INIS)

Feigin, B.; Kyoto Univ.; Frenkel, E.

1996-01-01

We define a quantum W-algebra associated to sl N as an associative algebra depending on two parameters. For special values of the parameters, this algebra becomes the ordinary W-algebra of sl N , or the q-deformed classical W-algebra of sl N . We construct free field realizations of the quantum W-algebras and the screening currents. We also point out some interesting elliptic structures arising in these algebras. In particular, we show that the screening currents satisfy elliptic analogues of the Drinfeld relations in U q (n). (orig.)

Analytical solution using computer algebra of a biosensor for detecting toxic substances in water

Science.gov (United States)

Rúa Taborda, María. Isabel

2014-05-01

In a relatively recent paper an electrochemical biosensor for water toxicity detection based on a bio-chip as a whole cell was proposed and numerically solved and analyzed. In such paper the kinetic processes in a miniaturized electrochemical biosensor system was described using the equations for specific enzymatic reaction and the diffusion equation. The numerical solution shown excellent agreement with the measured data but such numerical solution is not enough to design efficiently the corresponding bio-chip. For this reason an analytical solution is demanded. The object of the present work is to provide such analytical solution and then to give algebraic guides to design the bio-sensor. The analytical solution is obtained using computer algebra software, specifically Maple. The method of solution is the Laplace transform, with Bromwich integral and residue theorem. The final solution is given as a series of Bessel functions and the effective time for the bio-sensor is computed. It is claimed that the analytical solutions that were obtained will be very useful to predict further current variations in similar systems with different geometries, materials and biological components. Beside of this the analytical solution that we provide is very useful to investigate the relationship between different chamber parameters such as cell radius and height; and electrode radius.

AIR Tools - A MATLAB Package of Algebraic Iterative Reconstruction Techniques

DEFF Research Database (Denmark)

Hansen, Per Christian; Saxild-Hansen, Maria

This collection of MATLAB software contains implementations of several Algebraic Iterative Reconstruction methods for discretizations of inverse problems. These so-called row action methods rely on semi-convergence for achieving the necessary regularization of the problem. Two classes of methods...... are implemented: Algebraic Reconstruction Techniques (ART) and Simultaneous Iterative Reconstruction Techniques (SIRT). In addition we provide a few simplified test problems from medical and seismic tomography. For each iterative method, a number of strategies are available for choosing the relaxation parameter...

Recoupling Lie algebra and universal ω-algebra

International Nuclear Information System (INIS)

Joyce, William P.

2004-01-01

We formulate the algebraic version of recoupling theory suitable for commutation quantization over any gradation. This gives a generalization of graded Lie algebra. Underlying this is the new notion of an ω-algebra defined in this paper. ω-algebra is a generalization of algebra that goes beyond nonassociativity. We construct the universal enveloping ω-algebra of recoupling Lie algebras and prove a generalized Poincare-Birkhoff-Witt theorem. As an example we consider the algebras over an arbitrary recoupling of Z n graded Heisenberg Lie algebra. Finally we uncover the usual coalgebra structure of a universal envelope and substantiate its Hopf structure

Practical algebraic renormalization

International Nuclear Information System (INIS)

Grassi, Pietro Antonio; Hurth, Tobias; Steinhauser, Matthias

2001-01-01

A practical approach is presented which allows the use of a non-invariant regularization scheme for the computation of quantum corrections in perturbative quantum field theory. The theoretical control of algebraic renormalization over non-invariant counterterms is translated into a practical computational method. We provide a detailed introduction into the handling of the Slavnov-Taylor and Ward-Takahashi identities in the standard model both in the conventional and the background gauge. Explicit examples for their practical derivation are presented. After a brief introduction into the Quantum Action Principle the conventional algebraic method which allows for the restoration of the functional identities is discussed. The main point of our approach is the optimization of this procedure which results in an enormous reduction of the calculational effort. The counterterms which have to be computed are universal in the sense that they are independent of the regularization scheme. The method is explicitly illustrated for two processes of phenomenological interest: QCD corrections to the decay of the Higgs boson into two photons and two-loop electroweak corrections to the process B→X s γ

Exponentiation and deformations of Lie-admissible algebras

International Nuclear Information System (INIS)

Myung, H.C.

1982-01-01

The exponential function is defined for a finite-dimensional real power-associative algebra with unit element. The application of the exponential function is focused on the power-associative (p,q)-mutation of a real or complex associative algebra. Explicit formulas are computed for the (p,q)-mutation of the real envelope of the spin 1 algebra and the Lie algebra so(3) of the rotation group, in light of earlier investigations of the spin 1/2. A slight variant of the mutated exponential is interpreted as a continuous function of the Lie algebra into some isotope of the corresponding linear Lie group. The second part of this paper is concerned with the representation and deformation of a Lie-admissible algebra. The second cohomology group of a Lie-admissible algebra is introduced as a generalization of those of associative and Lie algebras in the Hochschild and Chevalley-Eilenberg theory. Some elementary theory of algebraic deformation of Lie-admissible algebras is discussed in view of generalization of that of associative and Lie algebras. Lie-admissible deformations are also suggested by the representation of Lie-admissible algebras. Some explicit examples of Lie-admissible deformation are given in terms of the (p,q)-mutation of associative deformation of an associative algebra. Finally, we discuss Lie-admissible deformations of order one

How to Produce S-Tense Operators on Lattice Effect Algebras

Science.gov (United States)

Chajda, Ivan; Janda, Jiří; Paseka, Jan

2014-07-01

Tense operators in effect algebras play a key role for the representation of the dynamics of formally described physical systems. For this, it is important to know how to construct them on a given effect algebra and how to compute all possible pairs of tense operators on . However, we firstly need to derive a time frame which enables these constructions and computations. Hence, we usually apply a suitable set of states of the effect algebra in question. To approximate physical reality in quantum mechanics, we use only the so-called Jauch-Piron states on in our paper. To realize our constructions, we are restricted on lattice effect algebras only.

On the Integration of Computer Algebra Systems (CAS) by Canadian Mathematicians: Results of a National Survey

Science.gov (United States)

Buteau, Chantal; Jarvis, Daniel H.; Lavicza, Zsolt

2014-01-01

In this article, we outline the findings of a Canadian survey study (N = 302) that focused on the extent of computer algebra systems (CAS)-based technology use in postsecondary mathematics instruction. Results suggest that a considerable number of Canadian mathematicians use CAS in research and teaching. CAS use in research was found to be the…

Algebraic limit cycles in polynomial systems of differential equations

International Nuclear Information System (INIS)

Llibre, Jaume; Zhao Yulin

2007-01-01

Using elementary tools we construct cubic polynomial systems of differential equations with algebraic limit cycles of degrees 4, 5 and 6. We also construct a cubic polynomial system of differential equations having an algebraic homoclinic loop of degree 3. Moreover, we show that there are polynomial systems of differential equations of arbitrary degree that have algebraic limit cycles of degree 3, as well as give an example of a cubic polynomial system of differential equations with two algebraic limit cycles of degree 4

(M,N-Soft Intersection BL-Algebras and Their Congruences

Directory of Open Access Journals (Sweden)

Xueling Ma

2014-01-01

Full Text Available The purpose of this paper is to give a foundation for providing a new soft algebraic tool in considering many problems containing uncertainties. In order to provide these new soft algebraic structures, we discuss a new soft set-(M, N-soft intersection set, which is a generalization of soft intersection sets. We introduce the concepts of (M, N-SI filters of BL-algebras and establish some characterizations. Especially, (M, N-soft congruences in BL-algebras are concerned.

Benchmark Numerical Toolkits for High Performance Computing, Phase I

Data.gov (United States)

National Aeronautics and Space Administration — Computational codes in physics and engineering often use implicit solution algorithms that require linear algebra tools such as Ax=b solvers, eigenvalue,...

Fixed point algebras for easy quantum groups

DEFF Research Database (Denmark)

Gabriel, Olivier; Weber, Moritz

2016-01-01

Compact matrix quantum groups act naturally on Cuntz algebras. The first author isolated certain conditions under which the fixed point algebras under this action are Kirchberg algebras. Hence they are completely determined by their K-groups. Building on prior work by the second author,we prove...... that free easy quantum groups satisfy these conditions and we compute the K-groups of their fixed point algebras in a general form. We then turn to examples such as the quantum permutation group S+ n,the free orthogonal quantum group O+ n and the quantum reflection groups Hs+ n. Our fixed point......-algebra construction provides concrete examples of free actions of free orthogonal easy quantum groups,which are related to Hopf-Galois extensions....

Neutrosophic Regular Filters and Fuzzy Regular Filters in Pseudo-BCI Algebras

Directory of Open Access Journals (Sweden)

Xiaohong Zhang

2017-09-01

Full Text Available Neutrosophic set is a new mathematical tool for handling problems involving imprecise, indeterminacy and inconsistent data. Pseudo-BCI algebra is a kind of non-classical logic algebra in close connection with various non-commutative fuzzy logics. Recently, we applied neutrosophic set theory to pseudo-BCI algebras. In this paper, we study neutrosophic filters in pseudo-BCI algebras.

Instructional Supports for Representational Fluency in Solving Linear Equations with Computer Algebra Systems and Paper-and-Pencil

Science.gov (United States)

Fonger, Nicole L.; Davis, Jon D.; Rohwer, Mary Lou

2018-01-01

This research addresses the issue of how to support students' representational fluency--the ability to create, move within, translate across, and derive meaning from external representations of mathematical ideas. The context of solving linear equations in a combined computer algebra system (CAS) and paper-and-pencil classroom environment is…

Fuzzy logic of quasi-truth an algebraic treatment

CERN Document Server

Di Nola, Antonio; Turunen, Esko

2016-01-01

This book presents the first algebraic treatment of quasi-truth fuzzy logic and covers the algebraic foundations of many-valued logic. It offers a comprehensive account of basic techniques and reports on important results showing the pivotal role played by perfect many-valued algebras (MV-algebras). It is well known that the first-order predicate Łukasiewicz logic is not complete with respect to the canonical set of truth values. However, it is complete with respect to all linearly ordered MV –algebras. As there are no simple linearly ordered MV-algebras in this case, infinitesimal elements of an MV-algebra are allowed to be truth values. The book presents perfect algebras as an interesting subclass of local MV-algebras and provides readers with the necessary knowledge and tools for formalizing the fuzzy concept of quasi true and quasi false. All basic concepts are introduced in detail to promote a better understanding of the more complex ones. It is an advanced and inspiring reference-guide for graduate s...

Differential Hopf algebra structures on the universal enveloping algebra ofa Lie algebra

NARCIS (Netherlands)

N.W. van den Hijligenberg; R. Martini

1995-01-01

textabstractWe discuss a method to construct a De Rham complex (differential algebra) of Poincar'e-Birkhoff-Witt-type on the universal enveloping algebra of a Lie algebra $g$. We determine the cases in which this gives rise to a differential Hopf algebra that naturally extends the Hopf algebra

Exploring Interactive and Dynamic Simulations Using a Computer Algebra System in an Advanced Placement Chemistry Course

Science.gov (United States)

Matsumoto, Paul S.

2014-01-01

The article describes the use of Mathematica, a computer algebra system (CAS), in a high school chemistry course. Mathematica was used to generate a graph, where a slider controls the value of parameter(s) in the equation; thus, students can visualize the effect of the parameter(s) on the behavior of the system. Also, Mathematica can show the…

The Yoneda algebra of a K2 algebra need not be another K2 algebra

OpenAIRE

Cassidy, T.; Phan, C.; Shelton, B.

2010-01-01

The Yoneda algebra of a Koszul algebra or a D-Koszul algebra is Koszul. K2 algebras are a natural generalization of Koszul algebras, and one would hope that the Yoneda algebra of a K2 algebra would be another K2 algebra. We show that this is not necessarily the case by constructing a monomial K2 algebra for which the corresponding Yoneda algebra is not K2.

Basic math and pre-algebra for dummies

CERN Document Server

Zegarelli, Mark

2014-01-01

Tips for simplifying tricky basic math and pre-algebra operations Whether you're a student preparing to take algebra or a parent who wants or needs to brush up on basic math, this fun, friendly guide has the tools you need to get in gear. From positive, negative, and whole numbers to fractions, decimals, and percents, you'll build necessary math skills to tackle more advanced topics, such as imaginary numbers, variables, and algebraic equations. Explanations and practical examples that mirror today's teaching methodsRelevant cultural vernacular and referencesStandard For Dummies materials that

Numerical algebra, matrix theory, differential-algebraic equations and control theory festschrift in honor of Volker Mehrmann

CERN Document Server

Bollhöfer, Matthias; Kressner, Daniel; Mehl, Christian; Stykel, Tatjana

2015-01-01

This edited volume highlights the scientific contributions of Volker Mehrmann, a leading expert in the area of numerical (linear) algebra, matrix theory, differential-algebraic equations and control theory. These mathematical research areas are strongly related and often occur in the same real-world applications. The main areas where such applications emerge are computational engineering and sciences, but increasingly also social sciences and economics. This book also reflects some of Volker Mehrmann's major career stages. Starting out working in the areas of numerical linear algebra (his first full professorship at TU Chemnitz was in "Numerical Algebra," hence the title of the book) and matrix theory, Volker Mehrmann has made significant contributions to these areas ever since. The highlights of these are discussed in Parts I and II of the present book. Often the development of new algorithms in numerical linear algebra is motivated by problems in system and control theory. These and his later major work on ...

Mathematical methods linear algebra normed spaces distributions integration

CERN Document Server

Korevaar, Jacob

1968-01-01

Mathematical Methods, Volume I: Linear Algebra, Normed Spaces, Distributions, Integration focuses on advanced mathematical tools used in applications and the basic concepts of algebra, normed spaces, integration, and distributions.The publication first offers information on algebraic theory of vector spaces and introduction to functional analysis. Discussions focus on linear transformations and functionals, rectangular matrices, systems of linear equations, eigenvalue problems, use of eigenvectors and generalized eigenvectors in the representation of linear operators, metric and normed vector

Handbook of linear algebra

CERN Document Server

Hogben, Leslie

2013-01-01

With a substantial amount of new material, the Handbook of Linear Algebra, Second Edition provides comprehensive coverage of linear algebra concepts, applications, and computational software packages in an easy-to-use format. It guides you from the very elementary aspects of the subject to the frontiers of current research. Along with revisions and updates throughout, the second edition of this bestseller includes 20 new chapters.New to the Second EditionSeparate chapters on Schur complements, additional types of canonical forms, tensors, matrix polynomials, matrix equations, special types of

Algebraic K-theory of generalized schemes

DEFF Research Database (Denmark)

Anevski, Stella Victoria Desiree

and geometry over the field with one element. It also permits the construction of important Arakelov theoretical objects, such as the completion \\Spec Z of Spec Z. In this thesis, we prove a projective bundle theorem for the eld with one element and compute the Chow rings of the generalized schemes Sp\\ec ZN......Nikolai Durov has developed a generalization of conventional scheme theory in which commutative algebraic monads replace commutative unital rings as the basic algebraic objects. The resulting geometry is expressive enough to encompass conventional scheme theory, tropical algebraic geometry......, appearing in the construction of \\Spec Z....

Basic linear algebra

CERN Document Server

Blyth, T S

2002-01-01

Basic Linear Algebra is a text for first year students leading from concrete examples to abstract theorems, via tutorial-type exercises. More exercises (of the kind a student may expect in examination papers) are grouped at the end of each section. The book covers the most important basics of any first course on linear algebra, explaining the algebra of matrices with applications to analytic geometry, systems of linear equations, difference equations and complex numbers. Linear equations are treated via Hermite normal forms which provides a successful and concrete explanation of the notion of linear independence. Another important highlight is the connection between linear mappings and matrices leading to the change of basis theorem which opens the door to the notion of similarity. This new and revised edition features additional exercises and coverage of Cramer's rule (omitted from the first edition). However, it is the new, extra chapter on computer assistance that will be of particular interest to readers:...

High order aberrations calculation of a hexapole corrector using a differential algebra method

Energy Technology Data Exchange (ETDEWEB)

Kang, Yongfeng, E-mail: yfkang@mail.xjtu.edu.cn [Key Laboratory for Physical Electronics and Devices of the Ministry of Education, Xi' an Jiaotong University, Xi' an 710049 (China); Liu, Xing [Key Laboratory for Physical Electronics and Devices of the Ministry of Education, Xi' an Jiaotong University, Xi' an 710049 (China); Zhao, Jingyi, E-mail: jingyi.zhao@foxmail.com [School of Science, Chang’an University, Xi’an 710064 (China); Tang, Tiantong [Key Laboratory for Physical Electronics and Devices of the Ministry of Education, Xi' an Jiaotong University, Xi' an 710049 (China)

2017-02-21

A differential algebraic (DA) method is proved as an unusual and effective tool in numerical analysis. It implements conveniently differentiation up to arbitrary high order, based on the nonstandard analysis. In this paper, the differential algebra (DA) method has been employed to compute the high order aberrations up to the fifth order of a practical hexapole corrector including round lenses and hexapole lenses. The program has been developed and tested as well. The electro-magnetic fields of arbitrary point are obtained by local analytic expressions, then field potentials are transformed into new forms which can be operated in the DA calculation. In this paper, the geometric and chromatic aberrations up to fifth order of a practical hexapole corrector system are calculated by the developed program.

Cylindric-like algebras and algebraic logic

CERN Document Server

Ferenczi, Miklós; Németi, István

2013-01-01

Algebraic logic is a subject in the interface between logic, algebra and geometry, it has strong connections with category theory and combinatorics. Tarski’s quest for finding structure in logic leads to cylindric-like algebras as studied in this book, they are among the main players in Tarskian algebraic logic. Cylindric algebra theory can be viewed in many ways:  as an algebraic form of definability theory, as a study of higher-dimensional relations, as an enrichment of Boolean Algebra theory, or, as logic in geometric form (“cylindric” in the name refers to geometric aspects). Cylindric-like algebras have a wide range of applications, in, e.g., natural language theory, data-base theory, stochastics, and even in relativity theory. The present volume, consisting of 18 survey papers, intends to give an overview of the main achievements and new research directions in the past 30 years, since the publication of the Henkin-Monk-Tarski monographs. It is dedicated to the memory of Leon Henkin.

An algebraic interpretation of PSP composition.

Science.gov (United States)

Vaucher, G

1998-01-01

The introduction of time in artificial neurons is a delicate problem on which many groups are working. Our approach combines some properties of biological models and the algebraic properties of McCulloch and Pitts artificial neuron (AN) (McCulloch and Pitts, 1943) to produce a new model which links both characteristics. In this extended artificial neuron, postsynaptic potentials (PSPs) are considered as numerical elements, having two degrees of freedom, on which the neuron computes operations. Modelled in this manner, a group of neurons can be seen as a computer with an asynchronous architecture. To formalize the functioning of this computer, we propose an algebra of impulses. This approach might also be interesting in the modelling of the passive electrical properties in some biological neurons.

Clifford algebras, spinors, spin groups and covering groups

International Nuclear Information System (INIS)

Magneville, C.; Pansart, J.P.

1991-03-01

The Dirac equation uses matrices named Υ matrices which are representations of general algebraic structures associated with a metric space. These algebras are the Clifford algebras. In the first past, these algebras are studied. Then the notion of spinor is developed. It is shown that Majorana and Weyl spinors only exist for some particular metric space. In the second part, Clifford and spinor groups are studied. They may be interpreted as the extension of the notion of orthogonal group for Clifford algebras and their spaces for representation. The rotation of a spinor is computed. In the last part, the connexion between the spinor groups and the Universal Covering Groups is presented [fr

Algebraic geometry and Bethe ansatz. Part I. The quotient ring for BAE

Science.gov (United States)

Jiang, Yunfeng; Zhang, Yang

2018-03-01

In this paper and upcoming ones, we initiate a systematic study of Bethe ansatz equations for integrable models by modern computational algebraic geometry. We show that algebraic geometry provides a natural mathematical language and powerful tools for understanding the structure of solution space of Bethe ansatz equations. In particular, we find novel efficient methods to count the number of solutions of Bethe ansatz equations based on Gröbner basis and quotient ring. We also develop analytical approach based on companion matrix to perform the sum of on-shell quantities over all physical solutions without solving Bethe ansatz equations explicitly. To demonstrate the power of our method, we revisit the completeness problem of Bethe ansatz of Heisenberg spin chain, and calculate the sum rules of OPE coefficients in planar N=4 super-Yang-Mills theory.

Ada Linear-Algebra Program

Science.gov (United States)

Klumpp, A. R.; Lawson, C. L.

1988-01-01

Routines provided for common scalar, vector, matrix, and quaternion operations. Computer program extends Ada programming language to include linear-algebra capabilities similar to HAS/S programming language. Designed for such avionics applications as software for Space Station.

Differential Hopf algebra structures on the universal enveloping algebra of a Lie algebra

NARCIS (Netherlands)

van den Hijligenberg, N.W.; van den Hijligenberg, N.W.; Martini, Ruud

1995-01-01

We discuss a method to construct a De Rham complex (differential algebra) of Poincar'e-Birkhoff-Witt-type on the universal enveloping algebra of a Lie algebra $g$. We determine the cases in which this gives rise to a differential Hopf algebra that naturally extends the Hopf algebra structure of

K-Bessel functions associated to a 3-rank Jordan algebra

Directory of Open Access Journals (Sweden)

Hacen Dib

2005-01-01

Full Text Available Using the Bessel-Muirhead system, we can express the K-Bessel function defined on a Jordan algebra as a linear combination of the J-solutions. We determine explicitly the coefficients when the rank of this Jordan algebra is three after a reduction to the rank two. The main tools are some algebraic identities developed for this occasion.

Multicore Performance of Block Algebraic Iterative Reconstruction Methods

DEFF Research Database (Denmark)

Sørensen, Hans Henrik B.; Hansen, Per Christian

2014-01-01

Algebraic iterative methods are routinely used for solving the ill-posed sparse linear systems arising in tomographic image reconstruction. Here we consider the algebraic reconstruction technique (ART) and the simultaneous iterative reconstruction techniques (SIRT), both of which rely on semiconv......Algebraic iterative methods are routinely used for solving the ill-posed sparse linear systems arising in tomographic image reconstruction. Here we consider the algebraic reconstruction technique (ART) and the simultaneous iterative reconstruction techniques (SIRT), both of which rely...... on semiconvergence. Block versions of these methods, based on a partitioning of the linear system, are able to combine the fast semiconvergence of ART with the better multicore properties of SIRT. These block methods separate into two classes: those that, in each iteration, access the blocks in a sequential manner...... a fixed relaxation parameter in each method, namely, the one that leads to the fastest semiconvergence. Computational results show that for multicore computers, the sequential approach is preferable....

Algebraic dynamics solutions and algebraic dynamics algorithm for nonlinear ordinary differential equations

Institute of Scientific and Technical Information of China (English)

WANG; Shunjin; ZHANG; Hua

2006-01-01

The problem of preserving fidelity in numerical computation of nonlinear ordinary differential equations is studied in terms of preserving local differential structure and approximating global integration structure of the dynamical system.The ordinary differential equations are lifted to the corresponding partial differential equations in the framework of algebraic dynamics,and a new algorithm-algebraic dynamics algorithm is proposed based on the exact analytical solutions of the ordinary differential equations by the algebraic dynamics method.In the new algorithm,the time evolution of the ordinary differential system is described locally by the time translation operator and globally by the time evolution operator.The exact analytical piece-like solution of the ordinary differential equations is expressd in terms of Taylor series with a local convergent radius,and its finite order truncation leads to the new numerical algorithm with a controllable precision better than Runge Kutta Algorithm and Symplectic Geometric Algorithm.

Tools for computational finance

CERN Document Server

Seydel, Rüdiger U

2017-01-01

Computational and numerical methods are used in a number of ways across the field of finance. It is the aim of this book to explain how such methods work in financial engineering. By concentrating on the field of option pricing, a core task of financial engineering and risk analysis, this book explores a wide range of computational tools in a coherent and focused manner and will be of use to anyone working in computational finance. Starting with an introductory chapter that presents the financial and stochastic background, the book goes on to detail computational methods using both stochastic and deterministic approaches. Now in its sixth edition, Tools for Computational Finance has been significantly revised and contains:    Several new parts such as a section on extended applications of tree methods, including multidimensional trees, trinomial trees, and the handling of dividends; Additional material in the field of generating normal variates with acceptance-rejection methods, and on Monte Carlo methods...

Application of symbolic and algebraic manipulation software in solving applied mechanics problems

Science.gov (United States)

Tsai, Wen-Lang; Kikuchi, Noboru

1993-01-01

As its name implies, symbolic and algebraic manipulation is an operational tool which not only can retain symbols throughout computations but also can express results in terms of symbols. This report starts with a history of symbolic and algebraic manipulators and a review of the literatures. With the help of selected examples, the capabilities of symbolic and algebraic manipulators are demonstrated. These applications to problems of applied mechanics are then presented. They are the application of automatic formulation to applied mechanics problems, application to a materially nonlinear problem (rigid-plastic ring compression) by finite element method (FEM) and application to plate problems by FEM. The advantages and difficulties, contributions, education, and perspectives of symbolic and algebraic manipulation are discussed. It is well known that there exist some fundamental difficulties in symbolic and algebraic manipulation, such as internal swelling and mathematical limitation. A remedy for these difficulties is proposed, and the three applications mentioned are solved successfully. For example, the closed from solution of stiffness matrix of four-node isoparametrical quadrilateral element for 2-D elasticity problem was not available before. Due to the work presented, the automatic construction of it becomes feasible. In addition, a new advantage of the application of symbolic and algebraic manipulation found is believed to be crucial in improving the efficiency of program execution in the future. This will substantially shorten the response time of a system. It is very significant for certain systems, such as missile and high speed aircraft systems, in which time plays an important role.

Identification of control targets in Boolean molecular network models via computational algebra.

Science.gov (United States)

Murrugarra, David; Veliz-Cuba, Alan; Aguilar, Boris; Laubenbacher, Reinhard

2016-09-23

Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network. Supplementary data is available online and our code in Macaulay2 and Matlab are available via http://www.ms.uky.edu/~dmu228/ControlAlg . This paper presents a novel method for the identification of intervention targets in Boolean network models. The results in this paper show that the proposed methods are useful and efficient for moderately large networks.

Improved Linear Algebra Methods for Redshift Computation from Limited Spectrum Data - II

Science.gov (United States)

Foster, Leslie; Waagen, Alex; Aijaz, Nabella; Hurley, Michael; Luis, Apolo; Rinsky, Joel; Satyavolu, Chandrika; Gazis, Paul; Srivastava, Ashok; Way, Michael

2008-01-01

Given photometric broadband measurements of a galaxy, Gaussian processes may be used with a training set to solve the regression problem of approximating the redshift of this galaxy. However, in practice solving the traditional Gaussian processes equation is too slow and requires too much memory. We employed several methods to avoid this difficulty using algebraic manipulation and low-rank approximation, and were able to quickly approximate the redshifts in our testing data within 17 percent of the known true values using limited computational resources. The accuracy of one method, the V Formulation, is comparable to the accuracy of the best methods currently used for this problem.

Fast Bitwise Implementation of the Algebraic Normal Form Transform

OpenAIRE

Bakoev, Valentin

2017-01-01

The representation of Boolean functions by their algebraic normal forms (ANFs) is very important for cryptography, coding theory and other scientific areas. The ANFs are used in computing the algebraic degree of S-boxes, some other cryptographic criteria and parameters of errorcorrecting codes. Their applications require these criteria and parameters to be computed by fast algorithms. Hence the corresponding ANFs should also be obtained by fast algorithms. Here we continue o...

Analysis of Secondary School Students’ Algebraic Thinking and Math-Talk Learning Community to Help Students Learn

Science.gov (United States)

Nurhayati, D. M.; Herman, T.; Suhendra, S.

2017-09-01

This study aims to determine the difficulties of algebraic thinking ability of students in one of secondary school on quadrilateral subject and to describe Math-Talk Learning Community as the alternative way that can be done to overcome the difficulties of the students’ algebraic thinking ability. Research conducted by using quantitative approach with descriptive method. The population in this research was all students of that school and twenty three students as the sample that was chosen by purposive sampling technique. Data of algebraic thinking were collected through essay test. The results showed the percentage of achievement of students’ algebraic thinking’s indicators on three aspects: a) algebra as generalized arithmetic with the indicators (conceptually based computational strategies and estimation); b) algebra as the language of mathematics (meaning of variables, variable expressions and meaning of solution); c) algebra as a tool for functions and mathematical modelling (representing mathematical ideas using equations, tables, or words and generalizing patterns and rules in real-world contexts) is still low. It is predicted that because the secondary school students was not familiar with the abstract problem and they are still at a semi-concrete stage where the stage of cognitive development is between concrete and abstract. Based on the percentage achievement of each indicators, it can be concluded that the level of achievement of student’s mathematical communication using conventional learning is still low, so students’ algebraic thinking ability need to be improved.

Semi-infinite Weil complex and the Virasoro algebra

International Nuclear Information System (INIS)

Feigin, B.; Frenkel, E.

1991-01-01

We define a semi-infinite analogue of the Weil algebra associated with an infinite-dimensional Lie algebra. It can be used for the definition of semi-infinite characteristic classes by analogy with the Chern-Weil construction. The second term of a spectral sequence of this Weil complex consists of the semi-infinite cohomology of the Lie algebra with coefficients in its 'adjoint semi-infinite symmetric powers'. We compute this cohomology for the Virasoro algebra. This is just the BRST cohomology of the bosonic βγ-system with the central charge 26. We give a complete description of the Fock representations of this bosonic system as modules over the Virasoro algebra, using Friedan-Martinec-Shenker bosonization. We derive a combinatorial identity from this result. (orig.)

The current algebra on the circle as a germ of local field theories

International Nuclear Information System (INIS)

Buchholz, D.; Mack, G.; Todorov, I.; Bylgarska Akademiya na Naukite, Sofia. Inst. za Yadrena Izsledvaniya i Yadrena Energetika)

1988-01-01

Methods of algebraic quantum field theory are used to classify all field- and observable algebras, whose common germ is the U(1)-current algebra. An elementary way is described to compute characters of such algebras. It exploits the Kubo-Martin-Schwinger condition for Gibbs states. (orig.)

From Rota-Baxter algebras to pre-Lie algebras

International Nuclear Information System (INIS)

An Huihui; Ba, Chengming

2008-01-01

Rota-Baxter algebras were introduced to solve some analytic and combinatorial problems and have appeared in many fields in mathematics and mathematical physics. Rota-Baxter algebras provide a construction of pre-Lie algebras from associative algebras. In this paper, we give all Rota-Baxter operators of weight 1 on complex associative algebras in dimension ≤3 and their corresponding pre-Lie algebras

Quartic Poisson algebras and quartic associative algebras and realizations as deformed oscillator algebras

International Nuclear Information System (INIS)

Marquette, Ian

2013-01-01

We introduce the most general quartic Poisson algebra generated by a second and a fourth order integral of motion of a 2D superintegrable classical system. We obtain the corresponding quartic (associative) algebra for the quantum analog, extend Daskaloyannis construction obtained in context of quadratic algebras, and also obtain the realizations as deformed oscillator algebras for this quartic algebra. We obtain the Casimir operator and discuss how these realizations allow to obtain the finite-dimensional unitary irreducible representations of quartic algebras and obtain algebraically the degenerate energy spectrum of superintegrable systems. We apply the construction and the formula obtained for the structure function on a superintegrable system related to type I Laguerre exceptional orthogonal polynomials introduced recently

Algebraic Verification Method for SEREs Properties via Groebner Bases Approaches

Directory of Open Access Journals (Sweden)

Ning Zhou

2013-01-01

Full Text Available This work presents an efficient solution using computer algebra system to perform linear temporal properties verification for synchronous digital systems. The method is essentially based on both Groebner bases approaches and symbolic simulation. A mechanism for constructing canonical polynomial set based symbolic representations for both circuit descriptions and assertions is studied. We then present a complete checking algorithm framework based on these algebraic representations by using Groebner bases. The computational experience result in this work shows that the algebraic approach is a quite competitive checking method and will be a useful supplement to the existent verification methods based on simulation.

Yoneda algebras of almost Koszul algebras

Indian Academy of Sciences (India)

Abstract. Let k be an algebraically closed field, A a finite dimensional connected. (p,q)-Koszul self-injective algebra with p, q ≥ 2. In this paper, we prove that the. Yoneda algebra of A is isomorphic to a twisted polynomial algebra A![t; β] in one inde- terminate t of degree q +1 in which A! is the quadratic dual of A, β is an ...

Quantum cluster algebras and quantum nilpotent algebras

Science.gov (United States)

Goodearl, Kenneth R.; Yakimov, Milen T.

2014-01-01

A major direction in the theory of cluster algebras is to construct (quantum) cluster algebra structures on the (quantized) coordinate rings of various families of varieties arising in Lie theory. We prove that all algebras in a very large axiomatically defined class of noncommutative algebras possess canonical quantum cluster algebra structures. Furthermore, they coincide with the corresponding upper quantum cluster algebras. We also establish analogs of these results for a large class of Poisson nilpotent algebras. Many important families of coordinate rings are subsumed in the class we are covering, which leads to a broad range of applications of the general results to the above-mentioned types of problems. As a consequence, we prove the Berenstein–Zelevinsky conjecture [Berenstein A, Zelevinsky A (2005) Adv Math 195:405–455] for the quantized coordinate rings of double Bruhat cells and construct quantum cluster algebra structures on all quantum unipotent groups, extending the theorem of Geiß et al. [Geiß C, et al. (2013) Selecta Math 19:337–397] for the case of symmetric Kac–Moody groups. Moreover, we prove that the upper cluster algebras of Berenstein et al. [Berenstein A, et al. (2005) Duke Math J 126:1–52] associated with double Bruhat cells coincide with the corresponding cluster algebras. PMID:24982197

An introduction to algebraic geometry and algebraic groups

CERN Document Server

Geck, Meinolf

2003-01-01

An accessible text introducing algebraic geometries and algebraic groups at advanced undergraduate and early graduate level, this book develops the language of algebraic geometry from scratch and uses it to set up the theory of affine algebraic groups from first principles.Building on the background material from algebraic geometry and algebraic groups, the text provides an introduction to more advanced and specialised material. An example is the representation theory of finite groups of Lie type.The text covers the conjugacy of Borel subgroups and maximal tori, the theory of algebraic groups

Algebraic Hyperstructures and Fuzzy Logic in the Treatment of Uncertainty

OpenAIRE

Antonio Maturo; Annamaria Porreca

2016-01-01

This study presents some fundamental aspects of recent theories  on algebraic Hyperstructures, an important tool for an interdisciplinary vision of Geometry and Algebra. We examine some hypergroupoids of events, useful for a new algebraic-geometry perspective in the study and issues of probability applications. This paper considers some fundamental aspects of fuzzy classifications and their applications to problems of evaluation and decision in Architecture and Economics. Finally, we present ...

Zeta functional equation on Jordan algebras of type II

International Nuclear Information System (INIS)

Kayoya, J.B.

2003-10-01

Using the Jordan algebras method, specially the properties of Peirce decomposition and the Frobenius transformation, we compute the coefficients of the zeta functional equation, in the case of Jordan algebras of Type II. As particular cases of our result, we can cite the case of V M (n, R) studied by Gelbart and Godement-Jacquet, and the case of V Herm(3, O s ) studied by Muro. Let us also mention, that recently, Bopp and Rubenthaler have obtained a more general result on the zeta functional equation by using methods based on the algebraic properties of regular graded algebras which are in one to one correspondence with simple Jordan algebras. The method used in this paper is a direct application of specific properties of Jordan algebras of Type H. (author)

Function algebras on finite sets basic course on many-valued logic and clone theory

CERN Document Server

Lau, Dietlinde

2006-01-01

Gives an introduction to the theory of function algebras. This book gives the general concepts of the Universal Algebra in order to familiarize the reader from the beginning on with the algebraic side of function algebras. It is a source on function algebras for students and researchers in mathematical logic and theoretical computer science.

Constructing canonical bases of quantized enveloping algebras

OpenAIRE

Graaf, W.A. de

2001-01-01

An algorithm for computing the elements of a given weight of the canonical basis of a quantized enveloping algebra is described. Subsequently, a similar algorithm is presented for computing the canonical basis of a finite-dimensional module.

Hypercard Another Computer Tool.

Science.gov (United States)

Geske, Joel

1991-01-01

Describes "Hypercard," a computer application package usable in all three modes of instructional computing: tutor, tool, and tutee. Suggests using Hypercard in scholastic journalism programs to teach such topics as news, headlines, design, photography, and advertising. Argues that the ability to access, organize, manipulate, and comprehend…

Differential Hopf algebra structures on the Universal Enveloping Algebra of a Lie Algebra

NARCIS (Netherlands)

van den Hijligenberg, N.W.; van den Hijligenberg, N.; Martini, Ruud

1995-01-01

We discuss a method to construct a De Rham complex (differential algebra) of Poincaré–Birkhoff–Witt type on the universal enveloping algebra of a Lie algebra g. We determine the cases in which this gives rise to a differential Hopf algebra that naturally extends the Hopf algebrastructure of U(g).

Visualization Tools for Teaching Computer Security

Science.gov (United States)

Yuan, Xiaohong; Vega, Percy; Qadah, Yaseen; Archer, Ricky; Yu, Huiming; Xu, Jinsheng

2010-01-01

Using animated visualization tools has been an important teaching approach in computer science education. We have developed three visualization and animation tools that demonstrate various information security concepts and actively engage learners. The information security concepts illustrated include: packet sniffer and related computer network…

Algebraic K-theory of crystallographic groups the three-dimensional splitting case

CERN Document Server

Farley, Daniel Scott

2014-01-01

The Farrell-Jones isomorphism conjecture in algebraic K-theory offers a description of the algebraic K-theory of a group using a generalized homology theory. In cases where the conjecture is known to be a theorem, it gives a powerful method for computing the lower algebraic K-theory of a group. This book contains a computation of the lower algebraic K-theory of the split three-dimensional crystallographic groups, a geometrically important class of three-dimensional crystallographic group, representing a third of the total number. The book leads the reader through all aspects of the calculation. The first chapters describe the split crystallographic groups and their classifying spaces. Later chapters assemble the techniques that are needed to apply the isomorphism theorem. The result is a useful starting point for researchers who are interested in the computational side of the Farrell-Jones isomorphism conjecture, and a contribution to the growing literature in the field.

The relation between quantum W algebras and Lie algebras

International Nuclear Information System (INIS)

Boer, J. de; Tjin, T.

1994-01-01

By quantizing the generalized Drinfeld-Sokolov reduction scheme for arbitrary sl 2 embeddings we show that a large set W of quantum W algebras can be viewed as (BRST) cohomologies of affine Lie algebras. The set W contains many known W algebras such as W N and W 3 (2) . Our formalism yields a completely algorithmic method for calculating the W algebra generators and their operator product expansions, replacing the cumbersome construction of W algebras as commutants of screening operators. By generalizing and quantizing the Miura transformation we show that any W algebra in W can be embedded into the universal enveloping algebra of a semisimple affine Lie algebra which is, up to shifts in level, isomorphic to a subalgebra of the original affine algebra. Therefore any realization of this semisimple affine Lie algebra leads to a realization of the W algebra. In particular, one obtains in this way a general and explicit method for constructing the free field realizations and Fock resolutions for all algebras in W. Some examples are explicitly worked out. (orig.)

Geometric algebra with applications in science and engineering

CERN Document Server

Sobczyk, Garret

2001-01-01

The goal of this book is to present a unified mathematical treatment of diverse problems in mathematics, physics, computer science, and engineer­ ing using geometric algebra. Geometric algebra was invented by William Kingdon Clifford in 1878 as a unification and generalization of the works of Grassmann and Hamilton, which came more than a quarter of a century before. Whereas the algebras of Clifford and Grassmann are well known in advanced mathematics and physics, they have never made an impact in elementary textbooks where the vector algebra of Gibbs-Heaviside still predominates. The approach to Clifford algebra adopted in most of the ar­ ticles here was pioneered in the 1960s by David Hestenes. Later, together with Garret Sobczyk, he developed it into a unified language for math­ ematics and physics. Sobczyk first learned about the power of geometric algebra in classes in electrodynamics and relativity taught by Hestenes at Arizona State University from 1966 to 1967. He still vividly remembers a feeling ...

2-Local derivations on matrix algebras over semi-prime Banach algebras and on AW*-algebras

International Nuclear Information System (INIS)

Ayupov, Shavkat; Kudaybergenov, Karimbergen

2016-01-01

The paper is devoted to 2-local derivations on matrix algebras over unital semi-prime Banach algebras. For a unital semi-prime Banach algebra A with the inner derivation property we prove that any 2-local derivation on the algebra M 2 n (A), n ≥ 2, is a derivation. We apply this result to AW*-algebras and show that any 2-local derivation on an arbitrary AW*-algebra is a derivation. (paper)

Quantum cluster algebra structures on quantum nilpotent algebras

CERN Document Server

Goodearl, K R

2017-01-01

All algebras in a very large, axiomatically defined class of quantum nilpotent algebras are proved to possess quantum cluster algebra structures under mild conditions. Furthermore, it is shown that these quantum cluster algebras always equal the corresponding upper quantum cluster algebras. Previous approaches to these problems for the construction of (quantum) cluster algebra structures on (quantized) coordinate rings arising in Lie theory were done on a case by case basis relying on the combinatorics of each concrete family. The results of the paper have a broad range of applications to these problems, including the construction of quantum cluster algebra structures on quantum unipotent groups and quantum double Bruhat cells (the Berenstein-Zelevinsky conjecture), and treat these problems from a unified perspective. All such applications also establish equality between the constructed quantum cluster algebras and their upper counterparts.

Computing algebraic transfer entropy and coupling directions via transcripts

Science.gov (United States)

Amigó, José M.; Monetti, Roberto; Graff, Beata; Graff, Grzegorz

2016-11-01

Most random processes studied in nonlinear time series analysis take values on sets endowed with a group structure, e.g., the real and rational numbers, and the integers. This fact allows to associate with each pair of group elements a third element, called their transcript, which is defined as the product of the second element in the pair times the first one. The transfer entropy of two such processes is called algebraic transfer entropy. It measures the information transferred between two coupled processes whose values belong to a group. In this paper, we show that, subject to one constraint, the algebraic transfer entropy matches the (in general, conditional) mutual information of certain transcripts with one variable less. This property has interesting practical applications, especially to the analysis of short time series. We also derive weak conditions for the 3-dimensional algebraic transfer entropy to yield the same coupling direction as the corresponding mutual information of transcripts. A related issue concerns the use of mutual information of transcripts to determine coupling directions in cases where the conditions just mentioned are not fulfilled. We checked the latter possibility in the lowest dimensional case with numerical simulations and cardiovascular data, and obtained positive results.

Real space process algebra

NARCIS (Netherlands)

Bergstra, J.A.; Baeten, J.C.M.

1993-01-01

The real time process algebra of Baeten and Bergstra [Formal Aspects of Computing, 3, 142-188 (1991)] is extended to real space by requiring the presence of spatial coordinates for each atomic action, in addition to the required temporal attribute. It is found that asynchronous communication

Fredholm Modules over Graph C^∗-Algebras

DEFF Research Database (Denmark)

Crisp, Tyrone

2015-01-01

We present two applications of explicit formulas, due to Cuntz and Krieger, for computations in K-homology of graph C∗-algebras. We prove that every K-homology class for such an algebra is represented by a Fredholm module having finite-rank commutators, and we exhibit generating Fredholm modules...

DOA estimation for conformal vector-sensor array using geometric algebra

Science.gov (United States)

Meng, Tianzhen; Wu, Minjie; Yuan, Naichang

2017-12-01

In this paper, the problem of direction of arrival (DOA) estimation is considered in the case of multiple polarized signals impinging on the conformal electromagnetic vector-sensor array (CVA). We focus on modeling the manifold holistically by a new mathematical tool called geometric algebra. Compared with existing methods, the presented one has two main advantages. Firstly, it acquires higher resolution by preserving the orthogonality of the signal components. Secondly, it avoids the cumbersome matrix operations while performing the coordinate transformations, and therefore, has a much lower computational complexity. Simulation results are provided to demonstrate the effectiveness of the proposed algorithm.

The Effects of Computer-assisted and Distance Learning of Geometric Modeling

Directory of Open Access Journals (Sweden)

Omer Faruk Sozcu

2013-01-01

Full Text Available The effects of computer-assisted and distance learning of geometric modeling and computer aided geometric design are studied. It was shown that computer algebra systems and dynamic geometric environments can be considered as excellent tools for teaching mathematical concepts of mentioned areas, and distance education technologies would be indispensable for consolidation of successfully passed topics

Quadratic algebras

CERN Document Server

Polishchuk, Alexander

2005-01-01

Quadratic algebras, i.e., algebras defined by quadratic relations, often occur in various areas of mathematics. One of the main problems in the study of these (and similarly defined) algebras is how to control their size. A central notion in solving this problem is the notion of a Koszul algebra, which was introduced in 1970 by S. Priddy and then appeared in many areas of mathematics, such as algebraic geometry, representation theory, noncommutative geometry, K-theory, number theory, and noncommutative linear algebra. The book offers a coherent exposition of the theory of quadratic and Koszul algebras, including various definitions of Koszulness, duality theory, Poincar�-Birkhoff-Witt-type theorems for Koszul algebras, and the Koszul deformation principle. In the concluding chapter of the book, they explain a surprising connection between Koszul algebras and one-dependent discrete-time stochastic processes.

Regularity of C*-algebras and central sequence algebras

DEFF Research Database (Denmark)

Christensen, Martin S.

The main topic of this thesis is regularity properties of C*-algebras and how these regularity properties are re ected in their associated central sequence algebras. The thesis consists of an introduction followed by four papers [A], [B], [C], [D]. In [A], we show that for the class of simple...... Villadsen algebra of either the rst type with seed space a nite dimensional CW complex, or the second type, tensorial absorption of the Jiang-Su algebra is characterized by the absence of characters on the central sequence algebra. Additionally, in a joint appendix with Joan Bosa, we show that the Villadsen...... algebra of the second type with innite stable rank fails the corona factorization property. In [B], we consider the class of separable C*-algebras which do not admit characters on their central sequence algebra, and show that it has nice permanence properties. We also introduce a new divisibility property...

Real division algebras and other algebras motivated by physics

International Nuclear Information System (INIS)

Benkart, G.; Osborn, J.M.

1981-01-01

In this survey we discuss several general techniques which have been productive in the study of real division algebras, flexible Lie-admissible algebras, and other nonassociative algebras, and we summarize results obtained using these methods. The principal method involved in this work is to view an algebra A as a module for a semisimple Lie algebra of derivations of A and to use representation theory to study products in A. In the case of real division algebras, we also discuss the use of isotopy and the use of a generalized Peirce decomposition. Most of the work summarized here has appeared in more detail in various other papers. The exceptions are results on a class of algebras of dimension 15, motivated by physics, which admit the Lie algebra sl(3) as an algebra of derivations

Algorithmic algebraic geometry and flux vacua

International Nuclear Information System (INIS)

Gray, James; He Yanghui; Lukas, Andre

2006-01-01

We develop a new and efficient method to systematically analyse four dimensional effective supergravities which descend from flux compactifications. The issue of finding vacua of such systems, both supersymmetric and non-supersymmetric, is mapped into a problem in computational algebraic geometry. Using recent developments in computer algebra, the problem can then be rapidly dealt with in a completely algorithmic fashion. Two main results are (1) a procedure for calculating constraints which the flux parameters must satisfy in these models if any given type of vacuum is to exist; (2) a stepwise process for finding all of the isolated vacua of such systems and their physical properties. We illustrate our discussion with several concrete examples, some of which have eluded conventional methods so far

Automatic Construction of Finite Algebras

Institute of Scientific and Technical Information of China (English)

张健

1995-01-01

This paper deals with model generation for equational theories,i.e.,automatically generating (finite)models of a given set of (logical) equations.Our method of finite model generation and a tool for automatic construction of finite algebras is described.Some examples are given to show the applications of our program.We argue that,the combination of model generators and theorem provers enables us to get a better understanding of logical theories.A brief comparison betwween our tool and other similar tools is also presented.

Field-Theoretic Weyl Deformation Quantization of Enlarged Poisson Algebras

Directory of Open Access Journals (Sweden)

Lothar Schlafer

2008-05-01

Full Text Available C*-algebraic Weyl quantization is extended by allowing also degenerate pre-symplectic forms for the Weyl relations with infinitely many degrees of freedom, and by starting out from enlarged classical Poisson algebras. A powerful tool is found in the construction of Poisson algebras and non-commutative twisted Banach-*-algebras on the stage of measures on the not locally compact test function space. Already within this frame strict deformation quantization is obtained, but in terms of Banach-*-algebras instead of C*-algebras. Fourier transformation and representation theory of the measure Banach-*-algebras are combined with the theory of continuous projective group representations to arrive at the genuine C*-algebraic strict deformation quantization in the sense of Rieffel and Landsman. Weyl quantization is recognized to depend in the first step functorially on the (in general infinite dimensional, pre-symplectic test function space; but in the second step one has to select a family of representations, indexed by the deformation parameter h. The latter ambiguity is in the present investigation connected with the choice of a folium of states, a structure, which does not necessarily require a Hilbert space representation.

A note on probabilistic models over strings: the linear algebra approach.

Science.gov (United States)

Bouchard-Côté, Alexandre

2013-12-01

Probabilistic models over strings have played a key role in developing methods that take into consideration indels as phylogenetically informative events. There is an extensive literature on using automata and transducers on phylogenies to do inference on these probabilistic models, in which an important theoretical question is the complexity of computing the normalization of a class of string-valued graphical models. This question has been investigated using tools from combinatorics, dynamic programming, and graph theory, and has practical applications in Bayesian phylogenetics. In this work, we revisit this theoretical question from a different point of view, based on linear algebra. The main contribution is a set of results based on this linear algebra view that facilitate the analysis and design of inference algorithms on string-valued graphical models. As an illustration, we use this method to give a new elementary proof of a known result on the complexity of inference on the "TKF91" model, a well-known probabilistic model over strings. Compared to previous work, our proving method is easier to extend to other models, since it relies on a novel weak condition, triangular transducers, which is easy to establish in practice. The linear algebra view provides a concise way of describing transducer algorithms and their compositions, opens the possibility of transferring fast linear algebra libraries (for example, based on GPUs), as well as low rank matrix approximation methods, to string-valued inference problems.

Cluster algebras in mathematical physics

International Nuclear Information System (INIS)

Francesco, Philippe Di; Gekhtman, Michael; Kuniba, Atsuo; Yamazaki, Masahito

2014-01-01

This special issue of Journal of Physics A: Mathematical and Theoretical contains reviews and original research articles on cluster algebras and their applications to mathematical physics. Cluster algebras were introduced by S Fomin and A Zelevinsky around 2000 as a tool for studying total positivity and dual canonical bases in Lie theory. Since then the theory has found diverse applications in mathematics and mathematical physics. Cluster algebras are axiomatically defined commutative rings equipped with a distinguished set of generators (cluster variables) subdivided into overlapping subsets (clusters) of the same cardinality subject to certain polynomial relations. A cluster algebra of rank n can be viewed as a subring of the field of rational functions in n variables. Rather than being presented, at the outset, by a complete set of generators and relations, it is constructed from the initial seed via an iterative procedure called mutation producing new seeds successively to generate the whole algebra. A seed consists of an n-tuple of rational functions called cluster variables and an exchange matrix controlling the mutation. Relations of cluster algebra type can be observed in many areas of mathematics (Plücker and Ptolemy relations, Stokes curves and wall-crossing phenomena, Feynman integrals, Somos sequences and Hirota equations to name just a few examples). The cluster variables enjoy a remarkable combinatorial pattern; in particular, they exhibit the Laurent phenomenon: they are expressed as Laurent polynomials rather than more general rational functions in terms of the cluster variables in any seed. These characteristic features are often referred to as the cluster algebra structure. In the last decade, it became apparent that cluster structures are ubiquitous in mathematical physics. Examples include supersymmetric gauge theories, Poisson geometry, integrable systems, statistical mechanics, fusion products in infinite dimensional algebras, dilogarithm

Linear algebra meets Lie algebra: the Kostant-Wallach theory

OpenAIRE

Shomron, Noam; Parlett, Beresford N.

2008-01-01

In two languages, Linear Algebra and Lie Algebra, we describe the results of Kostant and Wallach on the fibre of matrices with prescribed eigenvalues of all leading principal submatrices. In addition, we present a brief introduction to basic notions in Algebraic Geometry, Integrable Systems, and Lie Algebra aimed at specialists in Linear Algebra.

Surface defects and chiral algebras

Energy Technology Data Exchange (ETDEWEB)

Córdova, Clay [School of Natural Sciences, Institute for Advanced Study,1 Einstein Dr, Princeton, NJ 08540 (United States); Gaiotto, Davide [Perimeter Institute for Theoretical Physics,31 Caroline St N, Waterloo, ON N2L 2Y5 (Canada); Shao, Shu-Heng [School of Natural Sciences, Institute for Advanced Study,1 Einstein Dr, Princeton, NJ 08540 (United States)

2017-05-26

We investigate superconformal surface defects in four-dimensional N=2 superconformal theories. Each such defect gives rise to a module of the associated chiral algebra and the surface defect Schur index is the character of this module. Various natural chiral algebra operations such as Drinfeld-Sokolov reduction and spectral flow can be interpreted as constructions involving four-dimensional surface defects. We compute the index of these defects in the free hypermultiplet theory and Argyres-Douglas theories, using both infrared techniques involving BPS states, as well as renormalization group flows onto Higgs branches. In each case we find perfect agreement with the predicted characters.

Model Checking Processes Specified In Join-Calculus Algebra

Directory of Open Access Journals (Sweden)

Sławomir Piotr Maludziński

2014-01-01

Full Text Available This article presents a model checking tool used to verify concurrent systems specified in join-calculus algebra. The temporal properties of systems under verification are expressed in CTL logic. Join-calculus algebra with its operational semantics defined by the chemical abstract machine serves as the basic method for the specification of concurrent systems and their synchronization mechanisms, and allows the examination of more complex systems.

Algebraic classification of the conformal tensor

International Nuclear Information System (INIS)

Ares de Parga, Gonzalo; Chavoya, O.; Lopez B, J.L.; Ovando Z, Gerardo

1989-01-01

Starting from the Petrov matrix method, we deduce a new algorithm (adaptable to computers), within the Newman-Penrose formalism, to obtain the algebraic type of the Weyl tensor in general relativity. (author)

Universal algebra

CERN Document Server

Grätzer, George

1979-01-01

Universal Algebra, heralded as ". . . the standard reference in a field notorious for the lack of standardization . . .," has become the most authoritative, consistently relied on text in a field with applications in other branches of algebra and other fields such as combinatorics, geometry, and computer science. Each chapter is followed by an extensive list of exercises and problems. The "state of the art" account also includes new appendices (with contributions from B. Jónsson, R. Quackenbush, W. Taylor, and G. Wenzel) and a well-selected additional bibliography of over 1250 papers and books which makes this a fine work for students, instructors, and researchers in the field. "This book will certainly be, in the years to come, the basic reference to the subject." --- The American Mathematical Monthly (First Edition) "In this reviewer's opinion [the author] has more than succeeded in his aim. The problems at the end of each chapter are well-chosen; there are more than 650 of them. The book is especially sui...

Non commutative geometry methods for group C*-algebras

International Nuclear Information System (INIS)

Do Ngoc Diep.

1996-09-01

This book is intended to provide a quick introduction to the subject. The exposition is scheduled in the sequence, as possible for more understanding for beginners. The author exposed a K-theoretic approach to study group C * -algebras: started in the elementary part, with one example of description of the structure of C * -algebra of the group of affine transformations of the real straight line, continued then for some special classes of solvable and nilpotent Lie groups. In the second advanced part, he introduced the main tools of the theory. In particular, the conception of multidimensional geometric quantization and the index of group C * -algebras were created and developed. (author). Refs

QuBiLS-MAS, open source multi-platform software for atom- and bond-based topological (2D) and chiral (2.5D) algebraic molecular descriptors computations.

Science.gov (United States)

Valdés-Martiní, José R; Marrero-Ponce, Yovani; García-Jacas, César R; Martinez-Mayorga, Karina; Barigye, Stephen J; Vaz d'Almeida, Yasser Silveira; Pham-The, Hai; Pérez-Giménez, Facundo; Morell, Carlos A

2017-06-07

In previous reports, Marrero-Ponce et al. proposed algebraic formalisms for characterizing topological (2D) and chiral (2.5D) molecular features through atom- and bond-based ToMoCoMD-CARDD (acronym for Topological Molecular Computational Design-Computer Aided Rational Drug Design) molecular descriptors. These MDs codify molecular information based on the bilinear, quadratic and linear algebraic forms and the graph-theoretical electronic-density and edge-adjacency matrices in order to consider atom- and bond-based relations, respectively. These MDs have been successfully applied in the screening of chemical compounds of different therapeutic applications ranging from antimalarials, antibacterials, tyrosinase inhibitors and so on. To compute these MDs, a computational program with the same name was initially developed. However, this in house software barely offered the functionalities required in contemporary molecular modeling tasks, in addition to the inherent limitations that made its usability impractical. Therefore, the present manuscript introduces the QuBiLS-MAS (acronym for Quadratic, Bilinear and N-Linear mapS based on graph-theoretic electronic-density Matrices and Atomic weightingS) software designed to compute topological (0-2.5D) molecular descriptors based on bilinear, quadratic and linear algebraic forms for atom- and bond-based relations. The QuBiLS-MAS module was designed as standalone software, in which extensions and generalizations of the former ToMoCoMD-CARDD 2D-algebraic indices are implemented, considering the following aspects: (a) two new matrix normalization approaches based on double-stochastic and mutual probability formalisms; (b) topological constraints (cut-offs) to take into account particular inter-atomic relations; (c) six additional atomic properties to be used as weighting schemes in the calculation of the molecular vectors; (d) four new local-fragments to consider molecular regions of interest; (e) number of lone-pair electrons in

A program for constructing finitely presented Lie algebras and superalgebras

International Nuclear Information System (INIS)

Gerdt, V.P.; Kornyak, V.V.

1997-01-01

The purpose of this paper is to describe a C program FPLSA for investigating finitely presented Lie algebras and superalgebras. The underlying algorithm is based on constructing the complete set of relations called also standard basis or Groebner basis of ideal of free Lie (super) algebra generated by the input set of relations. The program may be used, in particular, to compute the Lie (super)algebra basis elements and its structure constants, to classify the finitely presented algebras depending on the values of parameters in the relations, and to construct the Hilbert series. These problems are illustrated by examples. (orig.)

Extended Virasoro algebra and algebra of area preserving diffeomorphisms

International Nuclear Information System (INIS)

Arakelyan, T.A.

1990-01-01

The algebra of area preserving diffeomorphism plays an important role in the theory of relativistic membranes. It is pointed out that the relation between this algebra and the extended Virasoro algebra associated with the generalized Kac-Moody algebras G(T 2 ). The highest weight representation of these infinite-dimensional algebras as well as of their subalgebras is studied. 5 refs

Topics in quaternion linear algebra

CERN Document Server

Rodman, Leiba

2014-01-01

Quaternions are a number system that has become increasingly useful for representing the rotations of objects in three-dimensional space and has important applications in theoretical and applied mathematics, physics, computer science, and engineering. This is the first book to provide a systematic, accessible, and self-contained exposition of quaternion linear algebra. It features previously unpublished research results with complete proofs and many open problems at various levels, as well as more than 200 exercises to facilitate use by students and instructors. Applications presented in the book include numerical ranges, invariant semidefinite subspaces, differential equations with symmetries, and matrix equations. Designed for researchers and students across a variety of disciplines, the book can be read by anyone with a background in linear algebra, rudimentary complex analysis, and some multivariable calculus. Instructors will find it useful as a complementary text for undergraduate linear algebra courses...

Geometric optimization and sums of algebraic functions

KAUST Repository

Vigneron, Antoine E.

2014-01-01

We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of nonnegative, constant description complexity algebraic functions. We first give an FPTAS for optimizing such a sum of algebraic functions, and then we apply it to several geometric optimization problems. We obtain the first FPTAS for two fundamental geometric shape-matching problems in fixed dimension: maximizing the volume of overlap of two polyhedra under rigid motions and minimizing their symmetric difference. We obtain the first FPTAS for other problems in fixed dimension, such as computing an optimal ray in a weighted subdivision, finding the largest axially symmetric subset of a polyhedron, and computing minimum-area hulls.

IDEALS GENERATED BY LINEAR FORMS AND SYMMETRIC ALGEBRAS

Directory of Open Access Journals (Sweden)

Gaetana Restuccia

2016-01-01

Full Text Available We consider ideals generated by linear forms in the variables X1 : : : ;Xn in the polynomial ring R[X1; : : : ;Xn], being R a commutative, Noetherian ring with identity. We investigate when a sequence a1; a2; : : : ; am of linear forms is an ssequence, in order to compute algebraic invariants of the symmetric algebra of the ideal I = (a1; a2; : : : ; am.

An application of the division algebras, Jordan algebras and split composition algebras

International Nuclear Information System (INIS)

Foot, R.; Joshi, G.C.

1992-01-01

It has been established that the covering group of the Lorentz group in D = 3, 4, 6, 10 can be expressed in a unified way, based on the four composition division algebras R, C, Q and O. In this paper, the authors discuss, in this framework, the role of the complex numbers of quantum mechanics. A unified treatment of quantum-mechanical spinors is given. The authors provide an explicit demonstration that the vector and spinor transformations recently constructed from a subgroup of the reduced structure group of the Jordan algebras M n 3 are indeed the Lorentz transformations. The authors also show that if the division algebras in the construction of the covering groups of the Lorentz groups in D = 3, 4, 6, 10 are replaced by the split composition algebras, then the sequence of groups SO(2, 2), SO(3, 3) and SO(5, 5) result. The analysis is presumed to be self-contained as the relevant aspects of the division algebras and Jordan algebras are reviewed. Some applications to physical theory are indicated

Interactions Between Representation Ttheory, Algebraic Topology and Commutative Algebra

CERN Document Server

Pitsch, Wolfgang; Zarzuela, Santiago

2016-01-01

This book includes 33 expanded abstracts of selected talks given at the two workshops "Homological Bonds Between Commutative Algebra and Representation Theory" and "Brave New Algebra: Opening Perspectives," and the conference "Opening Perspectives in Algebra, Representations, and Topology," held at the Centre de Recerca Matemàtica (CRM) in Barcelona between January and June 2015. These activities were part of the one-semester intensive research program "Interactions Between Representation Theory, Algebraic Topology and Commutative Algebra (IRTATCA)." Most of the abstracts present preliminary versions of not-yet published results and cover a large number of topics (including commutative and non commutative algebra, algebraic topology, singularity theory, triangulated categories, representation theory) overlapping with homological methods. This comprehensive book is a valuable resource for the community of researchers interested in homological algebra in a broad sense, and those curious to learn the latest dev...

Classification of filiform Lie algebras up to dimension 7 over finite fields

OpenAIRE

Falcón Ganfornina, Óscar Jesús; Falcón Ganfornina, Raúl Manuel; Núñez Valdés, Juan; Pacheco Martínez, Ana María; Villar Liñán, María Trinidad

2016-01-01

This paper tries to develop a recent research which consists in using Discrete Mathematics as a tool in the study of the problem of the classification of Lie algebras in general, dealing in this case with filiform Lie algebras up to dimension 7 over finite fields. The idea lies in the representation of each Lie algebra by a certain type of graphs. Then, some properties on Graph Theory make easier to classify the algebras. As main results, we find out that there exist, up to isomor...

The Usage of Programming Software “The Library of Electronic Visual Aids “Algebra 7-9” During Algebra Learning in 7-9 Forms.

Directory of Open Access Journals (Sweden)

V.A. Kreknin

2008-06-01

Full Text Available The Programming software “The Library of Electronic Visual Aids “Algebra 7-9” for secondary institutions was developed for the computer support of algebra classes in 7-9 forms of secondary school. The present article describes the data about its basic characteristics features and possibilities.

Hochschild homology of structured algebras

DEFF Research Database (Denmark)

Wahl, Nathalie; Westerland, Craig Christopher

2016-01-01

–Kontsevich–Soibelman moduli space action on the Hochschild complex of open TCFTs, the Tradler–Zeinalian and Kaufmann actions of Sullivan diagrams on the Hochschild complex of strict Frobenius algebras, and give applications to string topology in characteristic zero. Our main tool is a generalization of the Hochschild complex....

Duncan F. Gregory, William Walton and the development of British algebra: 'algebraical geometry', 'geometrical algebra', abstraction.

Science.gov (United States)

Verburgt, Lukas M

2016-01-01

This paper provides a detailed account of the period of the complex history of British algebra and geometry between the publication of George Peacock's Treatise on Algebra in 1830 and William Rowan Hamilton's paper on quaternions of 1843. During these years, Duncan Farquharson Gregory and William Walton published several contributions on 'algebraical geometry' and 'geometrical algebra' in the Cambridge Mathematical Journal. These contributions enabled them not only to generalize Peacock's symbolical algebra on the basis of geometrical considerations, but also to initiate the attempts to question the status of Euclidean space as the arbiter of valid geometrical interpretations. At the same time, Gregory and Walton were bound by the limits of symbolical algebra that they themselves made explicit; their work was not and could not be the 'abstract algebra' and 'abstract geometry' of figures such as Hamilton and Cayley. The central argument of the paper is that an understanding of the contributions to 'algebraical geometry' and 'geometrical algebra' of the second generation of 'scientific' symbolical algebraists is essential for a satisfactory explanation of the radical transition from symbolical to abstract algebra that took place in British mathematics in the 1830s-1840s.

An invitation to general algebra and universal constructions

CERN Document Server

Bergman, George M

2015-01-01

Rich in examples and intuitive discussions, this book presents General Algebra using the unifying viewpoint of categories and functors. Starting with a survey, in non-category-theoretic terms, of many familiar and not-so-familiar constructions in algebra (plus two from topology for perspective), the reader is guided to an understanding and appreciation of the general concepts and tools unifying these constructions. Topics include: set theory, lattices, category theory, the formulation of universal constructions in category-theoretic terms, varieties of algebras, and adjunctions. A large number of exercises, from the routine to the challenging, interspersed through the text, develop the reader's grasp of the material, exhibit applications of the general theory to diverse areas of algebra, and in some cases point to outstanding open questions. Graduate students and researchers wishing to gain fluency in important mathematical constructions will welcome this carefully motivated book.

Computer-aided translation tools

DEFF Research Database (Denmark)

Christensen, Tina Paulsen; Schjoldager, Anne

2016-01-01

in Denmark is rather high in general, but limited in the case of machine translation (MT) tools: While most TSPs use translation-memory (TM) software, often in combination with a terminology management system (TMS), only very few have implemented MT, which is criticised for its low quality output, especially......The paper reports on a questionnaire survey from 2013 of the uptake and use of computer-aided translation (CAT) tools by Danish translation service providers (TSPs) and discusses how these tools appear to have impacted on the Danish translation industry. According to our results, the uptake...

Algebra

CERN Document Server

Tabak, John

2004-01-01

Looking closely at algebra, its historical development, and its many useful applications, Algebra examines in detail the question of why this type of math is so important that it arose in different cultures at different times. The book also discusses the relationship between algebra and geometry, shows the progress of thought throughout the centuries, and offers biographical data on the key figures. Concise and comprehensive text accompanied by many illustrations presents the ideas and historical development of algebra, showcasing the relevance and evolution of this branch of mathematics.

Iwahori-Hecke algebras and Schur algebras of the symmetric group

CERN Document Server

Mathas, Andrew

1999-01-01

This volume presents a fully self-contained introduction to the modular representation theory of the Iwahori-Hecke algebras of the symmetric groups and of the q-Schur algebras. The study of these algebras was pioneered by Dipper and James in a series of landmark papers. The primary goal of the book is to classify the blocks and the simple modules of both algebras. The final chapter contains a survey of recent advances and open problems. The main results are proved by showing that the Iwahori-Hecke algebras and q-Schur algebras are cellular algebras (in the sense of Graham and Lehrer). This is proved by exhibiting natural bases of both algebras which are indexed by pairs of standard and semistandard tableaux respectively. Using the machinery of cellular algebras, which is developed in Chapter 2, this results in a clean and elegant classification of the irreducible representations of both algebras. The block theory is approached by first proving an analogue of the Jantzen sum formula for the q-Schur algebras. T...

Algebra of pseudo-differential operators over C*-algebra

International Nuclear Information System (INIS)

Mohammad, N.

1982-08-01

Algebras of pseudo-differential operators over C*-algebras are studied for the special case when in Hormander class Ssub(rho,delta)sup(m)(Ω) Ω = Rsup(n); rho = 1, delta = 0, m any real number, and the C*-algebra is infinite dimensional non-commutative. The space B, i.e. the set of A-valued C*-functions in Rsup(n) (or Rsup(n) x Rsup(n)) whose derivatives are all bounded, plays an important role. A denotes C*-algebra. First the operator class Ssub(phi,0)sup(m) is defined, and through it, the class Lsub(1,0)sup(m) of pseudo-differential operators. Then the basic asymptotic expansion theorems concerning adjoint and product of operators of class Ssub(1,0)sup(m) are stated. Finally, proofs are given of L 2 -continuity theorem and the main theorem, which states that algebra of all pseudo-differential operators over C*-algebras is itself C*-algebra

Geometric Algebra Techniques in Flux Compactifications

International Nuclear Information System (INIS)

Coman, Ioana Alexandra; Lazaroiu, Calin Iuliu; Babalic, Elena Mirela

2016-01-01

We study “constrained generalized Killing (s)pinors,” which characterize supersymmetric flux compactifications of supergravity theories. Using geometric algebra techniques, we give conceptually clear and computationally effective methods for translating supersymmetry conditions into differential and algebraic constraints on collections of differential forms. In particular, we give a synthetic description of Fierz identities, which are an important ingredient of such problems. As an application, we show how our approach can be used to efficiently treat N=1 compactification of M-theory on eight manifolds and prove that we recover results previously obtained in the literature.

Operator algebras and topology

International Nuclear Information System (INIS)

Schick, T.

2002-01-01

These notes, based on three lectures on operator algebras and topology at the 'School on High Dimensional Manifold Theory' at the ICTP in Trieste, introduce a new set of tools to high dimensional manifold theory, namely techniques coming from the theory of operator algebras, in particular C*-algebras. These are extensively studied in their own right. We will focus on the basic definitions and properties, and on their relevance to the geometry and topology of manifolds. A central pillar of work in the theory of C*-algebras is the Baum-Connes conjecture. This is an isomorphism conjecture, as discussed in the talks of Luck, but with a certain special flavor. Nevertheless, it has important direct applications to the topology of manifolds, it implies e.g. the Novikov conjecture. In the first chapter, the Baum-Connes conjecture will be explained and put into our context. Another application of the Baum-Connes conjecture is to the positive scalar curvature question. This will be discussed by Stephan Stolz. It implies the so-called 'stable Gromov-Lawson-Rosenberg conjecture'. The unstable version of this conjecture said that, given a closed spin manifold M, a certain obstruction, living in a certain (topological) K-theory group, vanishes if and only M admits a Riemannian metric with positive scalar curvature. It turns out that this is wrong, and counterexamples will be presented in the second chapter. The third chapter introduces another set of invariants, also using operator algebra techniques, namely L 2 -cohomology, L 2 -Betti numbers and other L 2 -invariants. These invariants, their basic properties, and the central questions about them, are introduced in the third chapter. (author)

Jordan algebras versus C*- algebras

International Nuclear Information System (INIS)

Stormer, E.

1976-01-01

The axiomatic formulation of quantum mechanics and the problem of whether the observables form self-adjoint operators on a Hilbert space, are discussed. The relation between C*- algebras and Jordan algebras is studied using spectral theory. (P.D.)

Implicative Algebras

African Journals Online (AJOL)

Tadesse

In this paper we introduce the concept of implicative algebras which is an equivalent definition of lattice implication algebra of Xu (1993) and further we prove that it is a regular Autometrized. Algebra. Further we remark that the binary operation → on lattice implicative algebra can never be associative. Key words: Implicative ...

Open algebraic surfaces

CERN Document Server

Miyanishi, Masayoshi

2000-01-01

Open algebraic surfaces are a synonym for algebraic surfaces that are not necessarily complete. An open algebraic surface is understood as a Zariski open set of a projective algebraic surface. There is a long history of research on projective algebraic surfaces, and there exists a beautiful Enriques-Kodaira classification of such surfaces. The research accumulated by Ramanujan, Abhyankar, Moh, and Nagata and others has established a classification theory of open algebraic surfaces comparable to the Enriques-Kodaira theory. This research provides powerful methods to study the geometry and topology of open algebraic surfaces. The theory of open algebraic surfaces is applicable not only to algebraic geometry, but also to other fields, such as commutative algebra, invariant theory, and singularities. This book contains a comprehensive account of the theory of open algebraic surfaces, as well as several applications, in particular to the study of affine surfaces. Prerequisite to understanding the text is a basic b...

Separable algebras

CERN Document Server

Ford, Timothy J

2017-01-01

This book presents a comprehensive introduction to the theory of separable algebras over commutative rings. After a thorough introduction to the general theory, the fundamental roles played by separable algebras are explored. For example, Azumaya algebras, the henselization of local rings, and Galois theory are rigorously introduced and treated. Interwoven throughout these applications is the important notion of étale algebras. Essential connections are drawn between the theory of separable algebras and Morita theory, the theory of faithfully flat descent, cohomology, derivations, differentials, reflexive lattices, maximal orders, and class groups. The text is accessible to graduate students who have finished a first course in algebra, and it includes necessary foundational material, useful exercises, and many nontrivial examples.

Current algebra, statistical mechanics and quantum models

Science.gov (United States)

Vilela Mendes, R.

2017-11-01

Results obtained in the past for free boson systems at zero and nonzero temperatures are revisited to clarify the physical meaning of current algebra reducible functionals which are associated to systems with density fluctuations, leading to observable effects on phase transitions. To use current algebra as a tool for the formulation of quantum statistical mechanics amounts to the construction of unitary representations of diffeomorphism groups. Two mathematical equivalent procedures exist for this purpose. One searches for quasi-invariant measures on configuration spaces, the other for a cyclic vector in Hilbert space. Here, one argues that the second approach is closer to the physical intuition when modelling complex systems. An example of application of the current algebra methodology to the pairing phenomenon in two-dimensional fermion systems is discussed.

Generalized EMV-Effect Algebras

Science.gov (United States)

Borzooei, R. A.; Dvurečenskij, A.; Sharafi, A. H.

2018-04-01

Recently in Dvurečenskij and Zahiri (2017), new algebraic structures, called EMV-algebras which generalize both MV-algebras and generalized Boolean algebras, were introduced. We present equivalent conditions for EMV-algebras. In addition, we define a partial algebraic structure, called a generalized EMV-effect algebra, which is close to generalized MV-effect algebras. Finally, we show that every generalized EMV-effect algebra is either an MV-effect algebra or can be embedded into an MV-effect algebra as a maximal ideal.

Special set linear algebra and special set fuzzy linear algebra

OpenAIRE

Kandasamy, W. B. Vasantha; Smarandache, Florentin; Ilanthenral, K.

2009-01-01

The authors in this book introduce the notion of special set linear algebra and special set fuzzy Linear algebra, which is an extension of the notion set linear algebra and set fuzzy linear algebra. These concepts are best suited in the application of multi expert models and cryptology. This book has five chapters. In chapter one the basic concepts about set linear algebra is given in order to make this book a self contained one. The notion of special set linear algebra and their fuzzy analog...

On one method of realization of commutation relation algebra

International Nuclear Information System (INIS)

Sveshnikov, K.A.

1983-01-01

Method for constructing the commulation relation representations based on the purely algebraic construction of joined algebraic representation with specially selected composition law has been suggested9 Purely combinatorial construction realizing commulation relations representation has been obtained proceeding from formal equivalence of operatopr action on vector and adding a simbol to a sequences of symbols. The above method practically has the structure of calculating algorithm, which assigns some rule of ''word'' formation of an initial set of ''letters''. In other words, a computer language with definite relations between words (an analogy between quantum mechanics and computer linguistics has been applied)

A Structural Model of Algebra Achievement: Computational Fluency and Spatial Visualisation as Mediators of the Effect of Working Memory on Algebra Achievement

Science.gov (United States)

Tolar, Tammy Daun; Lederberg, Amy R.; Fletcher, Jack M.

2009-01-01

The goal of this study was to develop and evaluate a structural model of the relations among cognitive abilities and arithmetic skills and college students' algebra achievement. The model of algebra achievement was compared to a model of performance on the Scholastic Assessment in Mathematics (SAT-M) to determine whether the pattern of relations…

Teachers' Understanding of Algebraic Generalization

Science.gov (United States)

Hawthorne, Casey Wayne

conceptualizations of the symbols. Finally, by comparing two teachers' understandings of student thinking in the classroom, I developed an instructional trajectory to describe steps along students' generalization processes. This emergent framework serves as an instructional tool for teachers' use in identifying significant connections in supporting students to develop understanding of algebraic symbols as representations that communicate the quantities perceived in the figure.

Integrating Computational Science Tools into a Thermodynamics Course

Science.gov (United States)

Vieira, Camilo; Magana, Alejandra J.; García, R. Edwin; Jana, Aniruddha; Krafcik, Matthew

2018-01-01

Computational tools and methods have permeated multiple science and engineering disciplines, because they enable scientists and engineers to process large amounts of data, represent abstract phenomena, and to model and simulate complex concepts. In order to prepare future engineers with the ability to use computational tools in the context of their disciplines, some universities have started to integrate these tools within core courses. This paper evaluates the effect of introducing three computational modules within a thermodynamics course on student disciplinary learning and self-beliefs about computation. The results suggest that using worked examples paired to computer simulations to implement these modules have a positive effect on (1) student disciplinary learning, (2) student perceived ability to do scientific computing, and (3) student perceived ability to do computer programming. These effects were identified regardless of the students' prior experiences with computer programming.

Calculating three loop ladder and V-topologies for massive operator matrix elements by computer algebra

International Nuclear Information System (INIS)

Ablinger, J.; Schneider, C.; Manteuffel, A. von

2015-09-01

Three loop ladder and V-topology diagrams contributing to the massive operator matrix element A Qg are calculated. The corresponding objects can all be expressed in terms of nested sums and recurrences depending on the Mellin variable N and the dimensional parameter ε. Given these representations, the desired Laurent series expansions in ε can be obtained with the help of our computer algebra toolbox. Here we rely on generalized hypergeometric functions and Mellin-Barnes representations, on difference ring algorithms for symbolic summation, on an optimized version of the multivariate Almkvist-Zeilberger algorithm for symbolic integration, and on new methods to calculate Laurent series solutions of coupled systems of differential equations. The solutions can be computed for general coefficient matrices directly for any basis also performing the expansion in the dimensional parameter in case it is expressible in terms of indefinite nested product-sum expressions. This structural result is based on new results of our difference ring theory. In the cases discussed we deal with iterative sum- and integral-solutions over general alphabets. The final results are expressed in terms of special sums, forming quasi-shuffle algebras, such as nested harmonic sums, generalized harmonic sums, and nested binomially weighted (cyclotomic) sums. Analytic continuations to complex values of N are possible through the recursion relations obeyed by these quantities and their analytic asymptotic expansions. The latter lead to a host of new constants beyond the multiple zeta values, the infinite generalized harmonic and cyclotomic sums in the case of V-topologies.

Calculating three loop ladder and V-topologies for massive operator matrix elements by computer algebra

Science.gov (United States)

Ablinger, J.; Behring, A.; Blümlein, J.; De Freitas, A.; von Manteuffel, A.; Schneider, C.

2016-05-01

Three loop ladder and V-topology diagrams contributing to the massive operator matrix element AQg are calculated. The corresponding objects can all be expressed in terms of nested sums and recurrences depending on the Mellin variable N and the dimensional parameter ε. Given these representations, the desired Laurent series expansions in ε can be obtained with the help of our computer algebra toolbox. Here we rely on generalized hypergeometric functions and Mellin-Barnes representations, on difference ring algorithms for symbolic summation, on an optimized version of the multivariate Almkvist-Zeilberger algorithm for symbolic integration, and on new methods to calculate Laurent series solutions of coupled systems of differential equations. The solutions can be computed for general coefficient matrices directly for any basis also performing the expansion in the dimensional parameter in case it is expressible in terms of indefinite nested product-sum expressions. This structural result is based on new results of our difference ring theory. In the cases discussed we deal with iterative sum- and integral-solutions over general alphabets. The final results are expressed in terms of special sums, forming quasi-shuffle algebras, such as nested harmonic sums, generalized harmonic sums, and nested binomially weighted (cyclotomic) sums. Analytic continuations to complex values of N are possible through the recursion relations obeyed by these quantities and their analytic asymptotic expansions. The latter lead to a host of new constants beyond the multiple zeta values, the infinite generalized harmonic and cyclotomic sums in the case of V-topologies.

Sixth SIAM conference on applied linear algebra: Final program and abstracts. Final technical report

Energy Technology Data Exchange (ETDEWEB)

NONE

1997-12-31

Linear algebra plays a central role in mathematics and applications. The analysis and solution of problems from an amazingly wide variety of disciplines depend on the theory and computational techniques of linear algebra. In turn, the diversity of disciplines depending on linear algebra also serves to focus and shape its development. Some problems have special properties (numerical, structural) that can be exploited. Some are simply so large that conventional approaches are impractical. New computer architectures motivate new algorithms, and fresh ways to look at old ones. The pervasive nature of linear algebra in analyzing and solving problems means that people from a wide spectrum--universities, industrial and government laboratories, financial institutions, and many others--share an interest in current developments in linear algebra. This conference aims to bring them together for their mutual benefit. Abstracts of papers presented are included.

Banach Synaptic Algebras

Science.gov (United States)

Foulis, David J.; Pulmannov, Sylvia

2018-04-01

Using a representation theorem of Erik Alfsen, Frederic Schultz, and Erling Størmer for special JB-algebras, we prove that a synaptic algebra is norm complete (i.e., Banach) if and only if it is isomorphic to the self-adjoint part of a Rickart C∗-algebra. Also, we give conditions on a Banach synaptic algebra that are equivalent to the condition that it is isomorphic to the self-adjoint part of an AW∗-algebra. Moreover, we study some relationships between synaptic algebras and so-called generalized Hermitian algebras.

Parallel algorithms for numerical linear algebra

CERN Document Server

van der Vorst, H

1990-01-01

This is the first in a new series of books presenting research results and developments concerning the theory and applications of parallel computers, including vector, pipeline, array, fifth/future generation computers, and neural computers.All aspects of high-speed computing fall within the scope of the series, e.g. algorithm design, applications, software engineering, networking, taxonomy, models and architectural trends, performance, peripheral devices.Papers in Volume One cover the main streams of parallel linear algebra: systolic array algorithms, message-passing systems, algorithms for p

Algebra of 2D periodic operators with local and perpendicular defects

DEFF Research Database (Denmark)

Kutsenko, Anton

2016-01-01

We show that 2D periodic operators with local and perpendicular defects form an algebra. We provide an algorithm for finding spectrum for such operators. While the continuous spectral components can be computed by simple algebraic operations on some matrix-valued functions and a few number...

Noncommutative Chern-Connes characters of some noncompact quantum algebras

International Nuclear Information System (INIS)

Do Ngoc Diep; Kuku, Aderemi O.

2001-09-01

We prove in this paper that the periodic cyclic homology of the quantized algebras of functions on coadjoint orbits of connected and simply connected Lie group, are isomorphic to the periodic cyclic homology of the quantized algebras of functions on coadjoint orbits of compact maximal subgroups, without localization. Some noncompact quantum groups and algebras were constructed and their irreducible representations were classified in recent works of Do Ngoc Diep and Nguyen Viet Hai [DH1]-[DH2] by using deformation quantization. In this paper we compute their K-groups, periodic cyclic homology groups and their Chern characters. (author)

Grassmann algebras

International Nuclear Information System (INIS)

Garcia, R.L.

1983-11-01

The Grassmann algebra is presented briefly. Exponential and logarithm of matrices functions, whose elements belong to this algebra, are studied with the help of the SCHOONSCHIP and REDUCE 2 algebraic manipulators. (Author) [pt

Algebraic geometry

CERN Document Server

Lefschetz, Solomon

2005-01-01

An introduction to algebraic geometry and a bridge between its analytical-topological and algebraical aspects, this text for advanced undergraduate students is particularly relevant to those more familiar with analysis than algebra. 1953 edition.

Partially-massless higher-spin algebras and their finite-dimensional truncations

International Nuclear Information System (INIS)

Joung, Euihun; Mkrtchyan, Karapet

2016-01-01

The global symmetry algebras of partially-massless (PM) higher-spin (HS) fields in (A)dS d+1 are studied. The algebras involving PM generators up to depth 2 (ℓ−1) are defined as the maximal symmetries of free conformal scalar field with 2 ℓ order wave equation in d dimensions. We review the construction of these algebras by quotienting certain ideals in the universal enveloping algebra of (A)dS d+1 isometries. We discuss another description in terms of Howe duality and derive the formula for computing trace in these algebras. This enables us to explicitly calculate the bilinear form for this one-parameter family of algebras. In particular, the bilinear form shows the appearance of additional ideal for any non-negative integer values of ℓ−d/2 , which coincides with the annihilator of the one-row ℓ-box Young diagram representation of so d+2 . Hence, the corresponding finite-dimensional coset algebra spanned by massless and PM generators is equivalent to the symmetries of this representation.

Linear algebra a first course with applications

CERN Document Server

Knop, Larry E

2008-01-01

Linear Algebra: A First Course with Applications explores the fundamental ideas of linear algebra, including vector spaces, subspaces, basis, span, linear independence, linear transformation, eigenvalues, and eigenvectors, as well as a variety of applications, from inventories to graphics to Google's PageRank. Unlike other texts on the subject, this classroom-tested book gives students enough time to absorb the material by focusing on vector spaces early on and using computational sections as numerical interludes. It offers introductions to Maple™, MATLAB®, and TI-83 Plus for calculating matri

Converting nested algebra expressions into flat algebra expressions

NARCIS (Netherlands)

Paredaens, J.; Van Gucht, D.

1992-01-01

Nested relations generalize ordinary flat relations by allowing tuple values to be either atomic or set valued. The nested algebra is a generalization of the flat relational algebra to manipulate nested relations. In this paper we study the expressive power of the nested algebra relative to its

Fibered F-Algebra

OpenAIRE

Kleyn, Aleks

2007-01-01

The concept of F-algebra and its representation can be extended to an arbitrary bundle. We define operations of fibered F-algebra in fiber. The paper presents the representation theory of of fibered F-algebra as well as a comparison of representation of F-algebra and of representation of fibered F-algebra.

Representations of the Virasoro algebra from lattice models

International Nuclear Information System (INIS)

Koo, W.M.; Saleur, H.

1994-01-01

We investigate in detail how the Virasoro algebra appears in the scaling limit of the simplest lattice models of XXZ or RSOS type. Our approach is straightforward but to our knowledge had never been tried so far. We simply formulate a conjecture for the lattice stress-energy tensor motivated by the exact derivation of lattice global Ward identities. We then check that the proper algebraic relations are obeyed in the scaling limit. The latter is under reasonable control thanks to the Bethe-ansatz solution. The results, which are mostly numerical for technical reasons, are remarkably precise. They are also corroborated by exact pieces of information from various sources, in particular Temperley-Lieb algebra representation theory. Most features of the Virasoro algebra (like central term, null vectors, metric properties, etc.) can thus be observed using the lattice models. This seems of general interest for lattice field theory, and also more specifically for finding relations between conformal invariance and lattice integrability, since a basis for the irreducible representations of the Virasoro algebra should now follow (at least in principle) from Bethe-ansatz computations. ((orig.))

The bubble algebra: structure of a two-colour Temperley-Lieb Algebra

International Nuclear Information System (INIS)

Grimm, Uwe; Martin, Paul P

2003-01-01

We define new diagram algebras providing a sequence of multiparameter generalizations of the Temperley-Lieb algebra, suitable for the modelling of dilute lattice systems of two-dimensional statistical mechanics. These algebras give a rigorous foundation to the various 'multi-colour algebras' of Grimm, Pearce and others. We determine the generic representation theory of the simplest of these algebras, and locate the nongeneric cases (at roots of unity of the corresponding parameters). We show by this example how the method used (Martin's general procedure for diagram algebras) may be applied to a wide variety of such algebras occurring in statistical mechanics. We demonstrate how these algebras may be used to solve the Yang-Baxter equations

Research Progress in Mathematical Analysis of Map Projection by Computer Algebra

Directory of Open Access Journals (Sweden)

BIAN Shaofeng

2017-10-01

Full Text Available Map projection is an important component of modern cartography, and involves many fussy mathematical analysis processes, such as the power series expansions of elliptical functions, differential of complex and implicit functions, elliptical integral and the operation of complex numbers. The derivation of these problems by hand not only consumes much time and energy but also makes mistake easily, and sometimes can not be realized at all because of the impossible complexity. The research achievements in mathematical analysis of map projection by computer algebra are systematically reviewed in five aspects, i.e., the symbolic expressions of forward and inverse solution of ellipsoidal latitudes, the direct transformations between map projections with different distortion properties, expressions of Gauss projection by complex function, mathematical analysis of oblique Mercator projection, polar chart projection with its transformation. Main problems that need to be further solved in this research field are analyzed. It will be helpful to promote the development of map projection.

Current algebra and differential geometry

International Nuclear Information System (INIS)

Alekseev, Anton; Strobl, Thomas

2005-01-01

We show that symmetries and gauge symmetries of a large class of 2-dimensional sigma models are described by a new type of a current algebra. The currents are labeled by pairs of a vector field and a 1-form on the target space of the sigma model. We compute the current-current commutator and analyse the anomaly cancellation condition, which can be interpreted geometrically in terms of Dirac structures, previously studied in the mathematical literature. Generalized complex structures correspond to decompositions of the current algebra into pairs of anomaly free subalgebras. Sigma models that we can treat with our method include both physical and topological examples, with and without Wess-Zumino type terms. (author)

Matrix algebra and sampling theory : The case of the Horvitz-Thompson estimator

NARCIS (Netherlands)

Dol, W.; Steerneman, A.G.M.; Wansbeek, T.J.

Matrix algebra is a tool not commonly employed in sampling theory. The intention of this paper is to help change this situation by showing, in the context of the Horvitz-Thompson (HT) estimator, the convenience of the use of a number of matrix-algebra results. Sufficient conditions for the

C*-algebras over topological spaces

DEFF Research Database (Denmark)

Meyer, Ralf; Nest, Ryszard

2012-01-01

We define the filtrated K-theory of a C*-algebra over a finite topological space X and explain how to construct a spectral sequence that computes the bivariant Kasparov theory over X in terms of filtrated K-theory. For finite spaces with a totally ordered lattice of open subsets, this spectral...

Analytic transfer maps for Lie algebraic design codes

International Nuclear Information System (INIS)

van Zeijts, J.; Neri, F.; Dragt, A.J.

1990-01-01

Lie algebraic methods provide a powerful tool for modeling particle transport through Hamiltonian systems. Briefly summarized, Lie algebraic design codes work as follows: first the time t flow generated by a Hamiltonian system is represented by a Lie algebraic map acting on the initial conditions. Maps are generated for each element in the lattice or beamline under study. Next all these maps are concatenated into a one-turn or one-pass map that represents the complete dynamics of the system. Finally, the resulting map is analyzed and design decisions are made based on the linear and nonlinear entries in the map. The authors give a short description of how to find Lie algebraic transfer maps in analytic form, for inclusion in accelerator design codes. As an example they find the transfer map, through third order, for the combined-function quadrupole magnet, and use such magnets to correct detrimental third-order aberrations in a spot forming system

Algebraic model checking for Boolean gene regulatory networks.

Science.gov (United States)

Tran, Quoc-Nam

2011-01-01

We present a computational method in which modular and Groebner bases (GB) computation in Boolean rings are used for solving problems in Boolean gene regulatory networks (BN). In contrast to other known algebraic approaches, the degree of intermediate polynomials during the calculation of Groebner bases using our method will never grow resulting in a significant improvement in running time and memory space consumption. We also show how calculation in temporal logic for model checking can be done by means of our direct and efficient Groebner basis computation in Boolean rings. We present our experimental results in finding attractors and control strategies of Boolean networks to illustrate our theoretical arguments. The results are promising. Our algebraic approach is more efficient than the state-of-the-art model checker NuSMV on BNs. More importantly, our approach finds all solutions for the BN problems.

Algebraic monoids, group embeddings, and algebraic combinatorics

CERN Document Server

Li, Zhenheng; Steinberg, Benjamin; Wang, Qiang

2014-01-01

This book contains a collection of fifteen articles and is dedicated to the sixtieth birthdays of Lex Renner and Mohan Putcha, the pioneers of the field of algebraic monoids.   Topics presented include:   v  structure and representation theory of reductive algebraic monoids v  monoid schemes and applications of monoids v  monoids related to Lie theory v  equivariant embeddings of algebraic groups v  constructions and properties of monoids from algebraic combinatorics v  endomorphism monoids induced from vector bundles v  Hodge–Newton decompositions of reductive monoids   A portion of these articles are designed to serve as a self-contained introduction to these topics, while the remaining contributions are research articles containing previously unpublished results, which are sure to become very influential for future work. Among these, for example, the important recent work of Michel Brion and Lex Renner showing that the algebraic semigroups are strongly π-regular.   Graduate students as well a...

Leavitt path algebras

CERN Document Server

Abrams, Gene; Siles Molina, Mercedes

2017-01-01

This book offers a comprehensive introduction by three of the leading experts in the field, collecting fundamental results and open problems in a single volume. Since Leavitt path algebras were first defined in 2005, interest in these algebras has grown substantially, with ring theorists as well as researchers working in graph C*-algebras, group theory and symbolic dynamics attracted to the topic. Providing a historical perspective on the subject, the authors review existing arguments, establish new results, and outline the major themes and ring-theoretic concepts, such as the ideal structure, Z-grading and the close link between Leavitt path algebras and graph C*-algebras. The book also presents key lines of current research, including the Algebraic Kirchberg Phillips Question, various additional classification questions, and connections to noncommutative algebraic geometry. Leavitt Path Algebras will appeal to graduate students and researchers working in the field and related areas, such as C*-algebras and...

Understanding geometric algebra Hamilton, Grassmann, and Clifford for computer vision and graphics

CERN Document Server

Kanatani, Kenichi

2015-01-01

Introduction PURPOSE OF THIS BOOK ORGANIZATION OF THIS BOOK OTHER FEATURES 3D Euclidean Geometry VECTORS BASIS AND COMPONENTS INNER PRODUCT AND NORM VECTOR PRODUCTS SCALAR TRIPLE PRODUCT PROJECTION, REJECTION, AND REFLECTION ROTATION PLANES LINES PLANES AND LINES Oblique Coordinate Systems RECIPROCAL BASIS RECIPROCAL COMPONENTS INNER, VECTOR, AND SCALAR TRIPLE PRODUCTS METRIC TENSOR RECIPROCITY OF EXPRESSIONS COORDINATE TRANSFORMATIONSHamilton's Quaternion Algebra QUATERNIONS ALGEBRA OF QUATERNIONS CONJUGATE, NORM, AND INVERSE REPRESENTATION OF ROTATION BY QUATERNION Grassmann's Outer Product

The W(sl(N+3), sl(3)) algebra and their contractions to W3

International Nuclear Information System (INIS)

Bellucci, S.

1996-09-01

The authors construct the nonlinear W(sl(N+3), sl(3)) algebras and find the spectrum of values of the central charge that gives rise, by contracting the W(sl(N+3), sl(3)) algebras, to a W 3 algebra belonging to the coset W((sl(N+3), sl(3)/(u(1) x sl(N)). Using the tool of embedding the W(sl(N+3), sl(3)) algebras into linearizing algebras, the authors construct new realization of W 3 modulo null fields. The possibility to reproduce, within the conformal linearization framework, the central charge spectrum for minimal models of the nonlinear W(sl(N+3), sl(3)) algebras is discussed at the end

Algebraic and structural automata theory

CERN Document Server

Mikolajczak, B

1991-01-01

Automata Theory is part of computability theory which covers problems in computer systems, software, activity of nervous systems (neural networks), and processes of live organisms development.The result of over ten years of research, this book presents work in the following areas of Automata Theory: automata morphisms, time-varying automata, automata realizations and relationships between automata and semigroups.Aimed at those working in discrete mathematics and computer science, parts of the book are suitable for use in graduate courses in computer science, electronics, telecommunications, and control engineering. It is assumed that the reader is familiar with the basic concepts of algebra and graph theory.

Approximation of complex algebraic numbers by algebraic numbers of bounded degree

OpenAIRE

Bugeaud, Yann; Evertse, Jan-Hendrik

2007-01-01

We investigate how well complex algebraic numbers can be approximated by algebraic numbers of degree at most n. We also investigate how well complex algebraic numbers can be approximated by algebraic integers of degree at most n+1. It follows from our investigations that for every positive integer n there are complex algebraic numbers of degree larger than n that are better approximable by algebraic numbers of degree at most n than almost all complex numbers. As it turns out, these numbers ar...

Operadic formulation of topological vertex algebras and gerstenhaber or Batalin-Vilkovisky algebras

International Nuclear Information System (INIS)

Huang Yizhi

1994-01-01

We give the operadic formulation of (weak, strong) topological vertex algebras, which are variants of topological vertex operator algebras studied recently by Lian and Zuckerman. As an application, we obtain a conceptual and geometric construction of the Batalin-Vilkovisky algebraic structure (or the Gerstenhaber algebra structure) on the cohomology of a topological vertex algebra (or of a weak topological vertex algebra) by combining this operadic formulation with a theorem of Getzler (or of Cohen) which formulates Batalin-Vilkovisky algebras (or Gerstenhaber algebras) in terms of the homology of the framed little disk operad (or of the little disk operad). (orig.)

An introduction to central simple algebras and their applications to wireless communication

CERN Document Server

Berhuy, Gre�gory

2013-01-01

Central simple algebras arise naturally in many areas of mathematics. They are closely connected with ring theory, but are also important in representation theory, algebraic geometry and number theory. Recently, surprising applications of the theory of central simple algebras have arisen in the context of coding for wireless communication. The exposition in the book takes advantage of this serendipity, presenting an introduction to the theory of central simple algebras intertwined with its applications to coding theory. Many results or constructions from the standard theory are presented in classical form, but with a focus on explicit techniques and examples, often from coding theory. Topics covered include quaternion algebras, splitting fields, the Skolem-Noether Theorem, the Brauer group, crossed products, cyclic algebras and algebras with a unitary involution. Code constructions give the opportunity for many examples and explicit computations. This book provides an introduction to the theory of central alg...

Non commutative geometry methods for group C{sup *}-algebras

Energy Technology Data Exchange (ETDEWEB)

Diep, Do Ngoc

1996-09-01

This book is intended to provide a quick introduction to the subject. The exposition is scheduled in the sequence, as possible for more understanding for beginners. The author exposed a K-theoretic approach to study group C{sup *}-algebras: started in the elementary part, with one example of description of the structure of C{sup *}-algebra of the group of affine transformations of the real straight line, continued then for some special classes of solvable and nilpotent Lie groups. In the second advanced part, he introduced the main tools of the theory. In particular, the conception of multidimensional geometric quantization and the index of group C{sup *}-algebras were created and developed. (author). Refs.

THE METHODICAL ASPECTS OF THE ALGEBRA AND THE MATHEMATICAL ANALYSIS STUDY USING THE SAGEMATH CLOUD

Directory of Open Access Journals (Sweden)

M. Popel

2014-06-01

Full Text Available The quality of mathematics education depends largely on the quality of education in general. The main idea may be summarized as follows: in order to educate the younger generation of people to be able to meet adequately the demands of the time, it is necessary to create conditions for the high-quality mathematics education. Improving the quality of mathematics education of pupils in secondary school is one of the most pressing problems. Contents of the school course of mathematics and its teaching method has always been the subject of undammed and sometimes stormy scientific debates. There are especially true methods of teaching algebra and the analisis in the high secondary school. Still in the study process the algebraic concepts and principles of analysis are given in such an abstract and generalized form that the student may has considerable difficulties to map these general abstract concepts to the certain concrete images, they are generalizations of. Improving education quality indicators can be achieved by using the appropriate computer technology. The article deals with the use of the cloud-oriented systems of computer mathematics (SCM. The prospects of development of the Web-SCM in terms of cloud-based learning environment are considered. The pedagogical features of the SageMath Cloud use as a tool for mathematics learning are revealed. The methodological aspects of algebra and elementary analysis teaching in a high profile school using the cloud-oriented the SCM SageMath Cloud are revealed.

From the topological development of matrix models to the topological string theory: arrangement of surfaces through algebraic geometry

International Nuclear Information System (INIS)

Orantin, N.

2007-09-01

The 2-matrix model has been introduced to study Ising model on random surfaces. Since then, the link between matrix models and arrangement of discrete surfaces has strongly tightened. This manuscript aims to investigate these deep links and extend them beyond the matrix models, following my work's evolution. First, I take care to define properly the hermitian 2 matrix model which gives rise to generating functions of discrete surfaces equipped with a spin structure. Then, I show how to compute all the terms in the topological expansion of any observable by using algebraic geometry tools. They are obtained as differential forms on an algebraic curve associated to the model: the spectral curve. In a second part, I show how to define such differentials on any algebraic curve even if it does not come from a matrix model. I then study their numerous symmetry properties under deformations of the algebraic curve. In particular, I show that these objects coincide with the topological expansion of the observable of a matrix model if the algebraic curve is the spectral curve of this model. Finally, I show that the fine tuning of the parameters ensures that these objects can be promoted to modular invariants and satisfy the holomorphic anomaly equation of the Kodaira-Spencer theory. This gives a new hint that the Dijkgraaf-Vafa conjecture is correct. (author)

Tools for Embedded Computing Systems Software

Science.gov (United States)

1978-01-01

A workshop was held to assess the state of tools for embedded systems software and to determine directions for tool development. A synopsis of the talk and the key figures of each workshop presentation, together with chairmen summaries, are presented. The presentations covered four major areas: (1) tools and the software environment (development and testing); (2) tools and software requirements, design, and specification; (3) tools and language processors; and (4) tools and verification and validation (analysis and testing). The utility and contribution of existing tools and research results for the development and testing of embedded computing systems software are described and assessed.

Wn(2) algebras

International Nuclear Information System (INIS)

Feigin, B.L.; Semikhatov, A.M.

2004-01-01

We construct W-algebra generalizations of the sl-circumflex(2) algebra-W algebras W n (2) generated by two currents E and F with the highest pole of order n in their OPE. The n=3 term in this series is the Bershadsky-Polyakov W 3 (2) algebra. We define these algebras as a centralizer (commutant) of the Uqs-bar (n vertical bar 1) quantum supergroup and explicitly find the generators in a factored, 'Miura-like' form. Another construction of the W n (2) algebras is in terms of the coset sl-circumflex(n vertical bar 1)/sl-circumflex(n). The relation between the two constructions involves the 'duality' (k+n-1)(k'+n-1)=1 between levels k and k' of two sl-circumflex(n) algebras

Algebraic classification of the Weyl tensor in higher dimensions based on its 'superenergy' tensor

International Nuclear Information System (INIS)

Senovilla, Jose M M

2010-01-01

The algebraic classification of the Weyl tensor in the arbitrary dimension n is recovered by means of the principal directions of its 'superenergy' tensor. This point of view can be helpful in order to compute the Weyl aligned null directions explicitly, and permits one to obtain the algebraic type of the Weyl tensor by computing the principal eigenvalue of rank-2 symmetric future tensors. The algebraic types compatible with states of intrinsic gravitational radiation can then be explored. The underlying ideas are general, so that a classification of arbitrary tensors in the general dimension can be achieved. (fast track communication)

The vacuum preserving Lie algebra of a classical W-algebra

International Nuclear Information System (INIS)

Feher, L.; Tsutsui, I.

1993-07-01

We simplify and generalize an argument due to Bowcock and Watts showing that one can associate a finite Lie algebra (the 'classical vacuum preserving algebra') containing the Moebius sl(2) subalgebra to any classical W-algebra. Our construction is based on a kinematical analysis of the Poisson brackets of quasi-fields. In the case of the W S G -subalgebra S of a simple Lie algebra G, we exhibit a natural isomorphism between this finite Lie algebra and G whereby the Moebius sl(2) is identified with S. (orig.)

Nonflexible Lie-admissible algebras

International Nuclear Information System (INIS)

Myung, H.C.

1978-01-01

We discuss the structure of Lie-admissible algebras which are defined by nonflexible identities. These algebras largely arise from the antiflexible algebras, 2-varieties and associator dependent algebras. The nonflexible Lie-admissible algebras in our discussion are in essence byproducts of the study of nonassociative algebras defined by identities of degree 3. The main purpose is to discuss the classification of simple Lie-admissible algebras of nonflexible type

On 2-Banach algebras

International Nuclear Information System (INIS)

Mohammad, N.; Siddiqui, A.H.

1987-11-01

The notion of a 2-Banach algebra is introduced and its structure is studied. After a short discussion of some fundamental properties of bivectors and tensor product, several classical results of Banach algebras are extended to the 2-Banach algebra case. A condition under which a 2-Banach algebra becomes a Banach algebra is obtained and the relation between algebra of bivectors and 2-normed algebra is discussed. 11 refs

Computational Science in Armenia (Invited Talk)

Science.gov (United States)

Marandjian, H.; Shoukourian, Yu.

This survey is devoted to the development of informatics and computer science in Armenia. The results in theoretical computer science (algebraic models, solutions to systems of general form recursive equations, the methods of coding theory, pattern recognition and image processing), constitute the theoretical basis for developing problem-solving-oriented environments. As examples can be mentioned: a synthesizer of optimized distributed recursive programs, software tools for cluster-oriented implementations of two-dimensional cellular automata, a grid-aware web interface with advanced service trading for linear algebra calculations. In the direction of solving scientific problems that require high-performance computing resources, examples of completed projects include the field of physics (parallel computing of complex quantum systems), astrophysics (Armenian virtual laboratory), biology (molecular dynamics study of human red blood cell membrane), meteorology (implementing and evaluating the Weather Research and Forecast Model for the territory of Armenia). The overview also notes that the Institute for Informatics and Automation Problems of the National Academy of Sciences of Armenia has established a scientific and educational infrastructure, uniting computing clusters of scientific and educational institutions of the country and provides the scientific community with access to local and international computational resources, that is a strong support for computational science in Armenia.

A brief history of process algebra

NARCIS (Netherlands)

Baeten, J.C.M.

2005-01-01

This note addresses the history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science. Origins are traced back to the early seventies of the twentieth century, and developments since that time are sketched. The author

A brief history of process algebra

NARCIS (Netherlands)

Baeten, J.C.M.

2004-01-01

Abstract. This note addresses the history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science. Origins are traced back to the early seventies of the twentieth century, and developments since that time are sketched. The

On squares of representations of compact Lie algebras

International Nuclear Information System (INIS)

Zeier, Robert; Zimborás, Zoltán

2015-01-01

We study how tensor products of representations decompose when restricted from a compact Lie algebra to one of its subalgebras. In particular, we are interested in tensor squares which are tensor products of a representation with itself. We show in a classification-free manner that the sum of multiplicities and the sum of squares of multiplicities in the corresponding decomposition of a tensor square into irreducible representations has to strictly grow when restricted from a compact semisimple Lie algebra to a proper subalgebra. For this purpose, relevant details on tensor products of representations are compiled from the literature. Since the sum of squares of multiplicities is equal to the dimension of the commutant of the tensor-square representation, it can be determined by linear-algebra computations in a scenario where an a priori unknown Lie algebra is given by a set of generators which might not be a linear basis. Hence, our results offer a test to decide if a subalgebra of a compact semisimple Lie algebra is a proper one without calculating the relevant Lie closures, which can be naturally applied in the field of controlled quantum systems

On squares of representations of compact Lie algebras

Energy Technology Data Exchange (ETDEWEB)

Zeier, Robert, E-mail: robert.zeier@ch.tum.de [Department Chemie, Technische Universität München, Lichtenbergstrasse 4, 85747 Garching (Germany); Zimborás, Zoltán, E-mail: zimboras@gmail.com [Department of Computer Science, University College London, Gower St., London WC1E 6BT (United Kingdom)

2015-08-15

We study how tensor products of representations decompose when restricted from a compact Lie algebra to one of its subalgebras. In particular, we are interested in tensor squares which are tensor products of a representation with itself. We show in a classification-free manner that the sum of multiplicities and the sum of squares of multiplicities in the corresponding decomposition of a tensor square into irreducible representations has to strictly grow when restricted from a compact semisimple Lie algebra to a proper subalgebra. For this purpose, relevant details on tensor products of representations are compiled from the literature. Since the sum of squares of multiplicities is equal to the dimension of the commutant of the tensor-square representation, it can be determined by linear-algebra computations in a scenario where an a priori unknown Lie algebra is given by a set of generators which might not be a linear basis. Hence, our results offer a test to decide if a subalgebra of a compact semisimple Lie algebra is a proper one without calculating the relevant Lie closures, which can be naturally applied in the field of controlled quantum systems.

Toda lattice field theories, discrete W algebras, Toda lattice hierarchies and quantum groups

International Nuclear Information System (INIS)

Bonora, L.; Colatto, L.P.; Constantinidis, C.P.

1996-05-01

In analogy with the Liouville case, we study the sl 3 Toda theory on the lattice and define the relevant quadratic algebra and out of it we recover the discrete W 3 algebra. We define an integrable system with respect to the latter and establish the relation with the Toda lattice hierarchy. We compute the relevant continuum limits. Finally we find the quantum version of the quadratic algebra. (author). 16 refs

Conformal algebras of two-dimensional disordered systems

International Nuclear Information System (INIS)

Gurarie, Victor; Ludwig, Andreas W.W.

2002-01-01

We discuss the structure of two-dimensional conformal field theories at a central charge c=0 describing critical disordered systems, polymers and percolation. We construct a novel extension of the c=0 Virasoro algebra, characterized by a number b measuring the effective number of massless degrees of freedom, and by a logarithmic partner of the stress tensor. It is argued to be present at a generic random critical point, lacking super Kac-Moody, or other higher symmetries, and is a tool to describe and classify such theories. Interestingly, this algebra is not only consistent with, but indeed naturally accommodates in general an underlying global supersymmetry. Polymers and percolation realize this algebra. Unexpectedly, we find that the c=0 Kac table of the degenerate fields contains two distinct theories with b=5/6 and b=-5/8 which we conjecture to correspond to percolation and polymers, respectively. A given Kac-table field can be degenerate only in one of them. Remarkably, we also find this algebra, and thereby an ensuing hidden supersymmetry, realized at general replica-averaged critical points, for which we derive an explicit formula for b. (author). Letter-to-the-editor

Abstract Algebra for Algebra Teaching: Influencing School Mathematics Instruction

Science.gov (United States)

Wasserman, Nicholas H.

2016-01-01

This article explores the potential for aspects of abstract algebra to be influential for the teaching of school algebra (and early algebra). Using national standards for analysis, four primary areas common in school mathematics--and their progression across elementary, middle, and secondary mathematics--where teaching may be transformed by…

Searching dependency between algebraic equations: An algorithm applied to automated reasoning

International Nuclear Information System (INIS)

Yang Lu; Zhang Jingzhong

1990-01-01

An efficient computer algorithm is given to decide how many branches of the solution to a system of algebraic also solve another equation. As one of the applications, this can be used in practice to verify a conjecture with hypotheses and conclusion expressed by algebraic equations, despite the variety of reducible or irreducible. (author). 10 refs

The Boolean algebra and central Galois algebras

Directory of Open Access Journals (Sweden)

George Szeto

2001-01-01

Full Text Available Let B be a Galois algebra with Galois group G, Jg={b∈B∣bx=g(xb   for all   x∈B} for g∈G, and BJg=Beg for a central idempotent eg. Then a relation is given between the set of elements in the Boolean algebra (Ba,≤ generated by {0,eg∣g∈G} and a set of subgroups of G, and a central Galois algebra Be with a Galois subgroup of G is characterized for an e∈Ba.

Mobile Learning: Integrating Text Messaging into a Community College Pre-Algebra Course

Science.gov (United States)

Bull, Prince; McCormick, Carlos

2012-01-01

This study investigated the use of text messaging as an educational tool in a pre-algebra course at a community college in the central region of North Carolina. The research was conducted in two pre-algebra classes with thirty-three students and one instructor. Data were gathered using qualitative and quantitative methods. A mixed method design…

Wavelets and quantum algebras

International Nuclear Information System (INIS)

Ludu, A.; Greiner, M.

1995-09-01

A non-linear associative algebra is realized in terms of translation and dilation operators, and a wavelet structure generating algebra is obtained. We show that this algebra is a q-deformation of the Fourier series generating algebra, and reduces to this for certain value of the deformation parameter. This algebra is also homeomorphic with the q-deformed su q (2) algebra and some of its extensions. Through this algebraic approach new methods for obtaining the wavelets are introduced. (author). 20 refs

Novikov-Jordan algebras

OpenAIRE

Dzhumadil'daev, A. S.

2002-01-01

Algebras with identity $(a\\star b)\\star (c\\star d) -(a\\star d)\\star(c\\star b)$ $=(a,b,c)\\star d-(a,d,c)\\star b$ are studied. Novikov algebras under Jordan multiplication and Leibniz dual algebras satisfy this identity. If algebra with such identity has unit, then it is associative and commutative.

An Algebraic View of Super-Belnap Logics

Czech Academy of Sciences Publication Activity Database

Albuquerque, H.; Přenosil, Adam; Rivieccio, U.

2017-01-01

Roč. 105, č. 6 (2017), s. 1051-1086 ISSN 0039-3215 R&D Projects: GA ČR GBP202/12/G061 Grant - others:EU(XE) PIRSES- GA-2012-31898 Institutional support: RVO:67985807 Keywords : Super-Belnap logics * Four-valued logic * Paraconsistent logic * Belnap–Dunn logic * FDE * Logic of Paradox * Kleene logic * Exactly True logic * De Morgan algebras * Abstract Algebraic Logic * Leibniz filters * Strong versions of logics Subject RIV: BA - General Mathematics OBOR OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 0.589, year: 2016

Applications of Maple To Algebraic Cryptography.

Science.gov (United States)

Sigmon, Neil P.

1997-01-01

Demonstrates the use of technology to enhance the appreciation of applications involving abstract algebra. The symbolic manipulator Maple can perform computations required for a linear cryptosystem. One major benefit of this process is that students can encipher and decipher messages using a linear cryptosystem without becoming confused and…

Many-core graph analytics using accelerated sparse linear algebra routines

Science.gov (United States)

Kozacik, Stephen; Paolini, Aaron L.; Fox, Paul; Kelmelis, Eric

2016-05-01

Graph analytics is a key component in identifying emerging trends and threats in many real-world applications. Largescale graph analytics frameworks provide a convenient and highly-scalable platform for developing algorithms to analyze large datasets. Although conceptually scalable, these techniques exhibit poor performance on modern computational hardware. Another model of graph computation has emerged that promises improved performance and scalability by using abstract linear algebra operations as the basis for graph analysis as laid out by the GraphBLAS standard. By using sparse linear algebra as the basis, existing highly efficient algorithms can be adapted to perform computations on the graph. This approach, however, is often less intuitive to graph analytics experts, who are accustomed to vertex-centric APIs such as Giraph, GraphX, and Tinkerpop. We are developing an implementation of the high-level operations supported by these APIs in terms of linear algebra operations. This implementation is be backed by many-core implementations of the fundamental GraphBLAS operations required, and offers the advantages of both the intuitive programming model of a vertex-centric API and the performance of a sparse linear algebra implementation. This technology can reduce the number of nodes required, as well as the run-time for a graph analysis problem, enabling customers to perform more complex analysis with less hardware at lower cost. All of this can be accomplished without the requirement for the customer to make any changes to their analytics code, thanks to the compatibility with existing graph APIs.

(Quasi-)Poisson enveloping algebras

OpenAIRE

Yang, Yan-Hong; Yao, Yuan; Ye, Yu

2010-01-01

We introduce the quasi-Poisson enveloping algebra and Poisson enveloping algebra for a non-commutative Poisson algebra. We prove that for a non-commutative Poisson algebra, the category of quasi-Poisson modules is equivalent to the category of left modules over its quasi-Poisson enveloping algebra, and the category of Poisson modules is equivalent to the category of left modules over its Poisson enveloping algebra.

Iterated Leavitt Path Algebras

International Nuclear Information System (INIS)

Hazrat, R.

2009-11-01

Leavitt path algebras associate to directed graphs a Z-graded algebra and in their simplest form recover the Leavitt algebras L(1,k). In this note, we introduce iterated Leavitt path algebras associated to directed weighted graphs which have natural ± Z grading and in their simplest form recover the Leavitt algebras L(n,k). We also characterize Leavitt path algebras which are strongly graded. (author)

Chiral determinant formulae and subsingular vectors for the N=2 superconformal algebras

International Nuclear Information System (INIS)

Gato-Rivera, B.; Rosado, J.I.

1997-01-01

We derive conjectures for the N=2 ''chiral'' determinant formulae of the topological algebra, the antiperiodic NS algebra, and the periodic R-algebra, corresponding to incomplete Verma modules built on chiral topological primaries, chiral and antichiral NS primaries, and Ramond ground states, respectively. Our method is based on the analysis of the singular vectors in chiral Verma modules and their spectral flow symmetries, together with some computer exploration and some consistency checks. In addition, and as a consequence, we uncover the existence of subsingular vectors in these algebras, giving examples (subsingular vectors are non-highest-weight null vectors which are not descendants of any highest-weight singular vectors). (orig.)

Formalized Linear Algebra over Elementary Divisor Rings in Coq

OpenAIRE

Cano , Guillaume; Cohen , Cyril; Dénès , Maxime; Mörtberg , Anders; Siles , Vincent

2016-01-01

International audience; This paper presents a Coq formalization of linear algebra over elementary divisor rings, that is, rings where every matrix is equivalent to a matrix in Smith normal form. The main results are the formalization that these rings support essential operations of linear algebra, the classification theorem of finitely pre-sented modules over such rings and the uniqueness of the Smith normal form up to multiplication by units. We present formally verified algorithms comput-in...

Algebraic topological entropy

International Nuclear Information System (INIS)

Hudetz, T.

1989-01-01

As a 'by-product' of the Connes-Narnhofer-Thirring theory of dynamical entropy for (originally non-Abelian) nuclear C * -algebras, the well-known variational principle for topological entropy is eqivalently reformulated in purly algebraically defined terms for (separable) Abelian C * -algebras. This 'algebraic variational principle' should not only nicely illustrate the 'feed-back' of methods developed for quantum dynamical systems to the classical theory, but it could also be proved directly by 'algebraic' methods and could thus further simplify the original proof of the variational principle (at least 'in principle'). 23 refs. (Author)

Linearizing W-algebras

International Nuclear Information System (INIS)

Krivonos, S.O.; Sorin, A.S.

1994-06-01

We show that the Zamolodchikov's and Polyakov-Bershadsky nonlinear algebras W 3 and W (2) 3 can be embedded as subalgebras into some linear algebras with finite set of currents. Using these linear algebras we find new field realizations of W (2) 3 and W 3 which could be a starting point for constructing new versions of W-string theories. We also reveal a number of hidden relationships between W 3 and W (2) 3 . We conjecture that similar linear algebras can exist for other W-algebra as well. (author). 10 refs

Study on infrared multiphoton excitation of the linear triatomic molecule by the Lie-algebra approach

International Nuclear Information System (INIS)

Feng, H.; Zheng, Y.; Ding, S.

2007-01-01

Infrared multiphoton vibrational excitation of the linear triatomic molecule has been studied using the quadratic anharmonic Lie-algebra model, unitary transformations, and Magnus approximation. An explicit Lie-algebra expression for the vibrational transition probability is obtained by using a Lie-algebra approach. This explicit Lie-algebra expressions for time-evolution operator and vibrational transition probabilities make the computation clearer and easier. The infrared multiphoton vibrational excitation of the DCN linear tri-atomic molecule is discussed as an example

Algebraic mesh generation for large scale viscous-compressible aerodynamic simulation

International Nuclear Information System (INIS)

Smith, R.E.

1984-01-01

Viscous-compressible aerodynamic simulation is the numerical solution of the compressible Navier-Stokes equations and associated boundary conditions. Boundary-fitted coordinate systems are well suited for the application of finite difference techniques to the Navier-Stokes equations. An algebraic approach to boundary-fitted coordinate systems is one where an explicit functional relation describes a mesh on which a solution is obtained. This approach has the advantage of rapid-precise mesh control. The basic mathematical structure of three algebraic mesh generation techniques is described. They are transfinite interpolation, the multi-surface method, and the two-boundary technique. The Navier-Stokes equations are transformed to a computational coordinate system where boundary-fitted coordinates can be applied. Large-scale computation implies that there is a large number of mesh points in the coordinate system. Computation of viscous compressible flow using boundary-fitted coordinate systems and the application of this computational philosophy on a vector computer are presented

The fusion rules for the Temperley–Lieb algebra and its dilute generalization

International Nuclear Information System (INIS)

Belletête, Jonathan

2015-01-01

The Temperley–Lieb (TL) family of algebras is well known for its role in building integrable lattice models. Even though a proof is still missing, it is agreed that these models should go to conformal field theories in the thermodynamic limit and that the limiting vector space should carry a representation of the Virasoro algebra. The fusion rules are a notable feature of the Virasoro algebra. One would hope that there is an analogous construction for the TL family. Such a construction was proposed by Read and Saleur (2007 Nucl. Phys. B 777 316) and partially computed by Gainutdinov and Vasseur (2013 Nucl. Phys. B 868 223–70) using the bimodule structure over the TL algebras and the quantum group Uq (sl2).We use their definition for the dilute Temperley–Lieb (dTL) family, a generalization of the original TL family. We develop a new way of computing fusion by using induction and show its power by obtaining fusion rules for both dTL and TL. We recover those computed by Gainutdivov and Vasseur and new ones that were beyond their scope. In particular, we identify a set of irreducible TL- or dTL-representations whose behavior under fusion is that of some irreducibles of the minimal models of conformal field theory. (paper)

QuBiLS-MIDAS: a parallel free-software for molecular descriptors computation based on multilinear algebraic maps.

Science.gov (United States)

García-Jacas, César R; Marrero-Ponce, Yovani; Acevedo-Martínez, Liesner; Barigye, Stephen J; Valdés-Martiní, José R; Contreras-Torres, Ernesto

2014-07-05

The present report introduces the QuBiLS-MIDAS software belonging to the ToMoCoMD-CARDD suite for the calculation of three-dimensional molecular descriptors (MDs) based on the two-linear (bilinear), three-linear, and four-linear (multilinear or N-linear) algebraic forms. Thus, it is unique software that computes these tensor-based indices. These descriptors, establish relations for two, three, and four atoms by using several (dis-)similarity metrics or multimetrics, matrix transformations, cutoffs, local calculations and aggregation operators. The theoretical background of these N-linear indices is also presented. The QuBiLS-MIDAS software was developed in the Java programming language and employs the Chemical Development Kit library for the manipulation of the chemical structures and the calculation of the atomic properties. This software is composed by a desktop user-friendly interface and an Abstract Programming Interface library. The former was created to simplify the configuration of the different options of the MDs, whereas the library was designed to allow its easy integration to other software for chemoinformatics applications. This program provides functionalities for data cleaning tasks and for batch processing of the molecular indices. In addition, it offers parallel calculation of the MDs through the use of all available processors in current computers. The studies of complexity of the main algorithms demonstrate that these were efficiently implemented with respect to their trivial implementation. Lastly, the performance tests reveal that this software has a suitable behavior when the amount of processors is increased. Therefore, the QuBiLS-MIDAS software constitutes a useful application for the computation of the molecular indices based on N-linear algebraic maps and it can be used freely to perform chemoinformatics studies. Copyright © 2014 Wiley Periodicals, Inc.

Supersymmetric construction of exactly solvable potentials and nonlinear algebras

International Nuclear Information System (INIS)

Junker, G.; Roy, P.

1998-01-01

Using algebraic tools of supersymmetric quantum mechanics we construct classes of conditionally exactly solvable potentials being the supersymmetric partners of the linear or radial harmonic oscillator. With the help of the raising and lowering operators of these harmonic oscillators and the SUSY operators we construct ladder operators for these new conditionally solvable systems. It is found that these ladder operators together with the Hamilton operator form a nonlinear algebra which is of quadratic and cubic type for the SUSY partners of the linear and radial harmonic oscillator

Quantum deformed su(mvertical stroke n) algebra and superconformal algebra on quantum superspace

International Nuclear Information System (INIS)

Kobayashi, Tatsuo

1993-01-01

We study a deformed su(mvertical stroke n) algebra on a quantum superspace. Some interesting aspects of the deformed algebra are shown. As an application of the deformed algebra we construct a deformed superconformal algebra. From the deformed su(1vertical stroke 4) algebra, we derive deformed Lorentz, translation of Minkowski space, iso(2,2) and its supersymmetric algebras as closed subalgebras with consistent automorphisms. (orig.)

On Numerical Stability in Large Scale Linear Algebraic Computations

Czech Academy of Sciences Publication Activity Database

Strakoš, Zdeněk; Liesen, J.

2005-01-01

Roč. 85, č. 5 (2005), s. 307-325 ISSN 0044-2267 R&D Projects: GA AV ČR 1ET400300415 Institutional research plan: CEZ:AV0Z10300504 Keywords : linear algebraic systems * eigenvalue problems * convergence * numerical stability * backward error * accuracy * Lanczos method * conjugate gradient method * GMRES method Subject RIV: BA - General Mathematics Impact factor: 0.351, year: 2005

An algebraic iterative reconstruction technique for differential X-ray phase-contrast computed tomography.

Science.gov (United States)

Fu, Jian; Schleede, Simone; Tan, Renbo; Chen, Liyuan; Bech, Martin; Achterhold, Klaus; Gifford, Martin; Loewen, Rod; Ruth, Ronald; Pfeiffer, Franz

2013-09-01

Iterative reconstruction has a wide spectrum of proven advantages in the field of conventional X-ray absorption-based computed tomography (CT). In this paper, we report on an algebraic iterative reconstruction technique for grating-based differential phase-contrast CT (DPC-CT). Due to the differential nature of DPC-CT projections, a differential operator and a smoothing operator are added to the iterative reconstruction, compared to the one commonly used for absorption-based CT data. This work comprises a numerical study of the algorithm and its experimental verification using a dataset measured at a two-grating interferometer setup. Since the algorithm is easy to implement and allows for the extension to various regularization possibilities, we expect a significant impact of the method for improving future medical and industrial DPC-CT applications. Copyright © 2012. Published by Elsevier GmbH.

Linear algebraic groups

CERN Document Server

Springer, T A

1998-01-01

"[The first] ten chapters...are an efficient, accessible, and self-contained introduction to affine algebraic groups over an algebraically closed field. The author includes exercises and the book is certainly usable by graduate students as a text or for self-study...the author [has a] student-friendly style… [The following] seven chapters... would also be a good introduction to rationality issues for algebraic groups. A number of results from the literature…appear for the first time in a text." –Mathematical Reviews (Review of the Second Edition) "This book is a completely new version of the first edition. The aim of the old book was to present the theory of linear algebraic groups over an algebraically closed field. Reading that book, many people entered the research field of linear algebraic groups. The present book has a wider scope. Its aim is to treat the theory of linear algebraic groups over arbitrary fields. Again, the author keeps the treatment of prerequisites self-contained. The material of t...

Extended conformal algebras

International Nuclear Information System (INIS)

Goddard, Peter

1990-01-01

The algebra of the group of conformal transformations in two dimensions consists of two commuting copies of the Virasoro algebra. In many mathematical and physical contexts, the representations of ν which are relevant satisfy two conditions: they are unitary and they have the ''positive energy'' property that L o is bounded below. In an irreducible unitary representation the central element c takes a fixed real value. In physical contexts, the value of c is a characteristic of a theory. If c < 1, it turns out that the conformal algebra is sufficient to ''solve'' the theory, in the sense of relating the calculation of the infinite set of physically interesting quantities to a finite subset which can be handled in principle. For c ≥ 1, this is no longer the case for the algebra alone and one needs some sort of extended conformal algebra, such as the superconformal algebra. It is these algebras that this paper aims at addressing. (author)

Elementary mathematical and computational tools for electrical and computer engineers using Matlab

CERN Document Server

Manassah, Jamal T

2013-01-01

Ideal for use as a short-course textbook and for self-study Elementary Mathematical and Computational Tools for Electrical and Computer Engineers Using MATLAB fills that gap. Accessible after just one semester of calculus, it introduces the many practical analytical and numerical tools that are essential to success both in future studies and in professional life. Sharply focused on the needs of the electrical and computer engineering communities, the text provides a wealth of relevant exercises and design problems. Changes in MATLAB's version 6.0 are included in a special addendum.

Additional operations in algebra of structural numbers for control algorithm development

Directory of Open Access Journals (Sweden)

Morhun A.V.

2016-12-01

Full Text Available The structural numbers and the algebra of the structural numbers due to the simplicity of representation, flexibility and current algebraic operations are the powerful tool for a wide range of applications. In autonomous power supply systems and systems with distributed generation (Micro Grid mathematical apparatus of structural numbers can be effectively used for the calculation of the parameters of the operating modes of consumption of electric energy. The purpose of the article is the representation of the additional algebra of structural numbers. The standard algebra was proposed to be extended by the additional operations and modification current in order to expand the scope of their use, namely to construct a flexible, adaptive algorithms of control systems. It is achieved due to the possibility to consider each individual component of the system with its parameters and provide easy management of entire system and each individual component. Thus, structural numbers and extended algebra are the perspective line of research and further studying is required.

Computer-Aided Modelling Methods and Tools

DEFF Research Database (Denmark)

Cameron, Ian; Gani, Rafiqul

2011-01-01

The development of models for a range of applications requires methods and tools. In many cases a reference model is required that allows the generation of application specific models that are fit for purpose. There are a range of computer aided modelling tools available that help to define the m...

Generalized symmetry algebras

International Nuclear Information System (INIS)

Dragon, N.

1979-01-01

The possible use of trilinear algebras as symmetry algebras for para-Fermi fields is investigated. The shortcomings of the examples are argued to be a general feature of such generalized algebras. (author)

Rota-Baxter algebras and the Hopf algebra of renormalization

Energy Technology Data Exchange (ETDEWEB)

Ebrahimi-Fard, K.

2006-06-15

Recently, the theory of renormalization in perturbative quantum field theory underwent some exciting new developments. Kreimer discovered an organization of Feynman graphs into combinatorial Hopf algebras. The process of renormalization is captured by a factorization theorem for regularized Hopf algebra characters. Hereby the notion of Rota-Baxter algebras enters the scene. In this work we develop in detail several mathematical aspects of Rota-Baxter algebras as they appear also in other sectors closely related to perturbative renormalization, to wit, for instance multiple-zeta-values and matrix differential equations. The Rota-Baxter picture enables us to present the algebraic underpinning for the Connes-Kreimer Birkhoff decomposition in a concise way. This is achieved by establishing a general factorization theorem for filtered algebras. Which in turn follows from a new recursion formula based on the Baker-Campbell-Hausdorff formula. This allows us to generalize a classical result due to Spitzer to non-commutative Rota-Baxter algebras. The Baker-Campbell-Hausdorff based recursion turns out to be a generalization of Magnus' expansion in numerical analysis to generalized integration operators. We will exemplify these general results by establishing a simple representation of the combinatorics of renormalization in terms of triangular matrices. We thereby recover in the presence of a Rota-Baxter operator the matrix representation of the Birkhoff decomposition of Connes and Kreimer. (orig.)

Rota-Baxter algebras and the Hopf algebra of renormalization

International Nuclear Information System (INIS)

Ebrahimi-Fard, K.

2006-06-01

Recently, the theory of renormalization in perturbative quantum field theory underwent some exciting new developments. Kreimer discovered an organization of Feynman graphs into combinatorial Hopf algebras. The process of renormalization is captured by a factorization theorem for regularized Hopf algebra characters. Hereby the notion of Rota-Baxter algebras enters the scene. In this work we develop in detail several mathematical aspects of Rota-Baxter algebras as they appear also in other sectors closely related to perturbative renormalization, to wit, for instance multiple-zeta-values and matrix differential equations. The Rota-Baxter picture enables us to present the algebraic underpinning for the Connes-Kreimer Birkhoff decomposition in a concise way. This is achieved by establishing a general factorization theorem for filtered algebras. Which in turn follows from a new recursion formula based on the Baker-Campbell-Hausdorff formula. This allows us to generalize a classical result due to Spitzer to non-commutative Rota-Baxter algebras. The Baker-Campbell-Hausdorff based recursion turns out to be a generalization of Magnus' expansion in numerical analysis to generalized integration operators. We will exemplify these general results by establishing a simple representation of the combinatorics of renormalization in terms of triangular matrices. We thereby recover in the presence of a Rota-Baxter operator the matrix representation of the Birkhoff decomposition of Connes and Kreimer. (orig.)

Solution of Inverse Kinematics for 6R Robot Manipulators With Offset Wrist Based on Geometric Algebra.

Science.gov (United States)

Fu, Zhongtao; Yang, Wenyu; Yang, Zhen

2013-08-01

In this paper, we present an efficient method based on geometric algebra for computing the solutions to the inverse kinematics problem (IKP) of the 6R robot manipulators with offset wrist. Due to the fact that there exist some difficulties to solve the inverse kinematics problem when the kinematics equations are complex, highly nonlinear, coupled and multiple solutions in terms of these robot manipulators stated mathematically, we apply the theory of Geometric Algebra to the kinematic modeling of 6R robot manipulators simply and generate closed-form kinematics equations, reformulate the problem as a generalized eigenvalue problem with symbolic elimination technique, and then yield 16 solutions. Finally, a spray painting robot, which conforms to the type of robot manipulators, is used as an example of implementation for the effectiveness and real-time of this method. The experimental results show that this method has a large advantage over the classical methods on geometric intuition, computation and real-time, and can be directly extended to all serial robot manipulators and completely automatized, which provides a new tool on the analysis and application of general robot manipulators.

Galilean contractions of W-algebras

Directory of Open Access Journals (Sweden)

Jørgen Rasmussen

2017-09-01

Full Text Available Infinite-dimensional Galilean conformal algebras can be constructed by contracting pairs of symmetry algebras in conformal field theory, such as W-algebras. Known examples include contractions of pairs of the Virasoro algebra, its N=1 superconformal extension, or the W3 algebra. Here, we introduce a contraction prescription of the corresponding operator-product algebras, or equivalently, a prescription for contracting tensor products of vertex algebras. With this, we work out the Galilean conformal algebras arising from contractions of N=2 and N=4 superconformal algebras as well as of the W-algebras W(2,4, W(2,6, W4, and W5. The latter results provide evidence for the existence of a whole new class of W-algebras which we call Galilean W-algebras. We also apply the contraction prescription to affine Lie algebras and find that the ensuing Galilean affine algebras admit a Sugawara construction. The corresponding central charge is level-independent and given by twice the dimension of the underlying finite-dimensional Lie algebra. Finally, applications of our results to the characterisation of structure constants in W-algebras are proposed.

Quantum affine algebras and deformations of the virasoro and W-algebras

International Nuclear Information System (INIS)

Frenkel, E.; Reshetikhin, N.

1996-01-01

Using the Wakimoto realization of quantum affine algebras we define new Poisson algebras, which are q-deformations of the classical W-algebras. We also define their free field realizations, i.e. homomorphisms into some Heisenberg-Poisson algebras. The formulas for these homomorphisms coincide with formulas for spectra of transfer-matrices in the corresponding quantum integrable models derived by the Bethe-Ansatz method. (orig.)

Algebraic entropy for algebraic maps

International Nuclear Information System (INIS)

Hone, A N W; Ragnisco, Orlando; Zullo, Federico

2016-01-01

We propose an extension of the concept of algebraic entropy, as introduced by Bellon and Viallet for rational maps, to algebraic maps (or correspondences) of a certain kind. The corresponding entropy is an index of the complexity of the map. The definition inherits the basic properties from the definition of entropy for rational maps. We give an example with positive entropy, as well as two examples taken from the theory of Bäcklund transformations. (letter)

On hyper BCC-algebras

OpenAIRE

Borzooei, R. A.; Dudek, W. A.; Koohestani, N.

2006-01-01

We study hyper BCC-algebras which are a common generalization of BCC-algebras and hyper BCK-algebras. In particular, we investigate different types of hyper BCC-ideals and describe the relationship among them. Next, we calculate all nonisomorphic 22 hyper BCC-algebras of order 3 of which only three are not hyper BCK-algebras.

Workshop on Software Development Tools for Petascale Computing

Energy Technology Data Exchange (ETDEWEB)

Vetter, Jeffrey [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Georgia Inst. of Technology, Atlanta, GA (United States)

2007-08-01

Petascale computing systems will soon be available to the DOE science community. Recent studies in the productivity of HPC platforms point to better software environments as a key enabler to science on these systems. To prepare for the deployment and productive use of these petascale platforms, the DOE science and general HPC community must have the software development tools, such as performance analyzers and debuggers that meet application requirements for scalability, functionality, reliability, and ease of use. In this report, we identify and prioritize the research opportunities in the area of software development tools for high performance computing. To facilitate this effort, DOE hosted a group of 55 leading international experts in this area at the Software Development Tools for PetaScale Computing (SDTPC) Workshop, which was held in Washington, D.C. on August 1 and 2, 2007. Software development tools serve as an important interface between the application teams and the target HPC architectures. Broadly speaking, these roles can be decomposed into three categories: performance tools, correctness tools, and development environments. Accordingly, this SDTPC report has four technical thrusts: performance tools, correctness tools, development environment infrastructures, and scalable tool infrastructures. The last thrust primarily targets tool developers per se, rather than end users. Finally, this report identifies non-technical strategic challenges that impact most tool development. The organizing committee emphasizes that many critical areas are outside the scope of this charter; these important areas include system software, compilers, and I/O.

The boolean algebra with restricted variables as a tool for fault tree modularization

International Nuclear Information System (INIS)

Caldarola, L.; Wickenhaeuser, A.

1981-08-01

The number of minimal cut sets (m.c.s.) of very complex and highly interconnected fault trees can become extremely large (e.g. more than 10 7 ). In this case the usual analytical approach of dissecting the fault tree TOP variable into m.c.s. is not only computationally prohibitively expensive, but also meaningless because it does not offer any synthetic overview of system behavior. The method proposed in this paper overcomes the deficiencies of the analytical method. It is shown that, by applying boolean algebra with restricted variables (b.a.w.r.v.), the concept of fault tree modularization can be straightforwardly extended from a single gate to a set of gates. Thus, large fault trees are divided into smaller fault trees (modules), which are connected to each other according to a simple scheme. This scheme is represented by a block diagram in which each block is a module. The modules are analyzed separately by the m.c.s. method, and the results are combined according of the TOP event. The method allows the calculation of very large fault trees in a short time and offers a synthetic overview of systems behavior through the block diagram. Numerical examples are also included. Calculations have been carried out by using the computer code MUSTAMO, which is based on the theory developed in this paper. (orig.) [de

On hyper BCC-algebras

Directory of Open Access Journals (Sweden)

R. A. Borzooei

2006-01-01

Full Text Available We study hyper BCC-algebras which are a common generalization of BCC-algebras and hyper BCK-algebras. In particular, we investigate different types of hyper BCC-ideals and describe the relationship among them. Next, we calculate all nonisomorphic 22 hyper BCC-algebras of order 3 of which only three are not hyper BCK-algebras.

Algebraic theory of numbers

CERN Document Server

Samuel, Pierre

2008-01-01

Algebraic number theory introduces students not only to new algebraic notions but also to related concepts: groups, rings, fields, ideals, quotient rings and quotient fields, homomorphisms and isomorphisms, modules, and vector spaces. Author Pierre Samuel notes that students benefit from their studies of algebraic number theory by encountering many concepts fundamental to other branches of mathematics - algebraic geometry, in particular.This book assumes a knowledge of basic algebra but supplements its teachings with brief, clear explanations of integrality, algebraic extensions of fields, Gal

epsilon : A tool to find a canonical basis of master integrals

Science.gov (United States)

Prausa, Mario

2017-10-01

In 2013, Henn proposed a special basis for a certain class of master integrals, which are expressible in terms of iterated integrals. In this basis, the master integrals obey a differential equation, where the right hand side is proportional to ɛ in d = 4 - 2 ɛ space-time dimensions. An algorithmic approach to find such a basis was found by Lee. We present the tool epsilon, an efficient implementation of Lee's algorithm based on the Fermat computer algebra system as computational back end.

Generalized Weyl modules for twisted current algebras

Science.gov (United States)

Makedonskyi, I. A.; Feigin, E. B.

2017-08-01

We introduce the notion of generalized Weyl modules for twisted current algebras. We study their representation-theoretic and combinatorial properties and also their connection with nonsymmetric Macdonald polynomials. As an application, we compute the dimension of the classical Weyl modules in the remaining unknown case.

K-theory and periodic cyclic homology of some noncompact quantum algebras

International Nuclear Information System (INIS)

Do Ngoc Diep; Kuku, Aderemi O.

2003-07-01

We prove in this paper that the periodic cyclic homology of the quantized algebras of functions on coadjoint orbits of connected and simply connected Lie group, are isomorphic to the periodic cyclic homology of the quantized algebras of functions on coadjoint orbits of compact maximal subgroups, without localization. Some noncompact quantum groups and algebras were constructed and their irreducible representations were classified in recent works of Do Ngoc Diep and Nguyen Viet Hai [DH1]-[DH2] and Do Due Hanh [DD] by using deformation quantization. In this paper we compute their K-groups, periodic cyclic homology groups and their Chern characters. (author)

The BRS algebra of a free differential algebra

International Nuclear Information System (INIS)

Boukraa, S.

1987-04-01

We construct in this work, the Weil and the universal BRS algebras of theories that can have as a gauge symmetry a free differential (Sullivan) algebra, the natural extension of Lie algebras allowing the definition of p-form gauge potentials (p>1). The finite gauge transformations of these potentials are deduced from the infinitesimal ones and the group structure is shown. The geometrical meaning of these p-form gauge potentials is given by the notion of a Quillen superconnection. (author). 19 refs

Study on time of flight property of electron optical systems by differential algebraic method

International Nuclear Information System (INIS)

Cheng Min; Tang Tiantong; Yao Zhenhua

2002-01-01

Differential algebraic method is a powerful and promising technique in computer numerical analysis. When applied to nonlinear dynamics systems, the arbitrary high-order transfer properties of the systems can be computed directly with high precision. In this paper, the principle of differential algebra is applied to study on the time of flight (TOF) property of electron optical systems and their arbitrary order TOF transfer properties can be numerically calculated out. As an example, TOF transfer properties of a uniform magnetic sector field analyzer have been studied by differential algebraic method. Relative errors of the first-order and second-order TOF transfer coefficients of the magnetic sector field analyzer are of the order 10 -11 or smaller compared with the analytic solutions. It is proved that differential algebraic TOF method is of high accuracy and very helpful for high-order TOF transfer property analysis of electron optical systems. (author)

3D algebraic iterative reconstruction for cone-beam x-ray differential phase-contrast computed tomography.

Science.gov (United States)

Fu, Jian; Hu, Xinhua; Velroyen, Astrid; Bech, Martin; Jiang, Ming; Pfeiffer, Franz

2015-01-01

Due to the potential of compact imaging systems with magnified spatial resolution and contrast, cone-beam x-ray differential phase-contrast computed tomography (DPC-CT) has attracted significant interest. The current proposed FDK reconstruction algorithm with the Hilbert imaginary filter will induce severe cone-beam artifacts when the cone-beam angle becomes large. In this paper, we propose an algebraic iterative reconstruction (AIR) method for cone-beam DPC-CT and report its experiment results. This approach considers the reconstruction process as the optimization of a discrete representation of the object function to satisfy a system of equations that describes the cone-beam DPC-CT imaging modality. Unlike the conventional iterative algorithms for absorption-based CT, it involves the derivative operation to the forward projections of the reconstructed intermediate image to take into account the differential nature of the DPC projections. This method is based on the algebraic reconstruction technique, reconstructs the image ray by ray, and is expected to provide better derivative estimates in iterations. This work comprises a numerical study of the algorithm and its experimental verification using a dataset measured with a three-grating interferometer and a mini-focus x-ray tube source. It is shown that the proposed method can reduce the cone-beam artifacts and performs better than FDK under large cone-beam angles. This algorithm is of interest for future cone-beam DPC-CT applications.

Unitary W-algebras and three-dimensional higher spin gravities with spin one symmetry

International Nuclear Information System (INIS)

Afshar, Hamid; Creutzig, Thomas; Grumiller, Daniel; Hikida, Yasuaki; Rønne, Peter B.

2014-01-01

We investigate whether there are unitary families of W-algebras with spin one fields in the natural example of the Feigin-Semikhatov W_n"("2")-algebra. This algebra is conjecturally a quantum Hamiltonian reduction corresponding to a non-principal nilpotent element. We conjecture that this algebra admits a unitary real form for even n. Our main result is that this conjecture is consistent with the known part of the operator product algebra, and especially it is true for n=2 and n=4. Moreover, we find certain ranges of allowed levels where a positive definite inner product is possible. We also find a unitary conformal field theory for every even n at the special level k+n=(n+1)/(n−1). At these points, the W_n"("2")-algebra is nothing but a compactified free boson. This family of W-algebras admits an ’t Hooft limit. Further, in the case of n=4, we reproduce the algebra from the higher spin gravity point of view. In general, gravity computations allow us to reproduce some leading coefficients of the operator product.

Pseudo-Riemannian Novikov algebras

Energy Technology Data Exchange (ETDEWEB)

Chen Zhiqi; Zhu Fuhai [School of Mathematical Sciences and LPMC, Nankai University, Tianjin 300071 (China)], E-mail: chenzhiqi@nankai.edu.cn, E-mail: zhufuhai@nankai.edu.cn

2008-08-08

Novikov algebras were introduced in connection with the Poisson brackets of hydrodynamic-type and Hamiltonian operators in formal variational calculus. Pseudo-Riemannian Novikov algebras denote Novikov algebras with non-degenerate invariant symmetric bilinear forms. In this paper, we find that there is a remarkable geometry on pseudo-Riemannian Novikov algebras, and give a special class of pseudo-Riemannian Novikov algebras.

On the PR-algebras

International Nuclear Information System (INIS)

Lebedenko, V.M.

1978-01-01

The PR-algebras, i.e. the Lie algebras with commutation relations of [Hsub(i),Hsub(j)]=rsub(ij)Hsub(i)(i< j) type are investigated. On the basis of former results a criterion for the membership of 2-solvable Lie algebras to the PR-algebra class is given. The conditions imposed by the criterion are formulated in the linear algebra language

Introduction to W-algebras

International Nuclear Information System (INIS)

Takao, Masaru

1989-01-01

We review W-algebras which are generated by stress tensor and primary fields. Associativity plays an important role in determining the extended algebra and further implies the algebras to exist for special values of central charges. Explicitly constructing the algebras including primary fields of spin less than 4, we investigate the closure structure of the Jacobi identity of the extended algebras. (author)

Applied algebra codes, ciphers and discrete algorithms

CERN Document Server

Hardy, Darel W; Walker, Carol L

2009-01-01

This book attempts to show the power of algebra in a relatively simple setting.-Mathematical Reviews, 2010… The book supports learning by doing. In each section we can find many examples which clarify the mathematics introduced in the section and each section is followed by a series of exercises of which approximately half are solved in the end of the book. Additional the book comes with a CD-ROM containing an interactive version of the book powered by the computer algebra system Scientific Notebook. … the mathematics in the book are developed as needed and the focus of the book lies clearly o

Representations of braid group obtained from quantum sl(3) enveloping algebra

International Nuclear Information System (INIS)

Ma Zhongqi.

1989-07-01

The quantum Clebsch-Gordan coefficients for the coproduct 6x6 of the quantum sl(3) enveloping algebra are computed. Based on the representation 6, the representation of the braid group and the corresponding link polynomial are obtained. The link polynomials based on the representations of the quantum sl(3) enveloping algebra with one row Young tableau are discussed. (author). 11 refs, 3 tabs

Compact quantum group C*-algebras as Hopf algebras with approximate unit

International Nuclear Information System (INIS)

Do Ngoc Diep; Phung Ho Hai; Kuku, A.O.

1999-04-01

In this paper, we construct and study the representation theory of a Hopf C*-algebra with approximate unit, which constitutes quantum analogue of a compact group C*-algebra. The construction is done by first introducing a convolution-product on an arbitrary Hopf algebra H with integral, and then constructing the L 2 and C*-envelopes of H (with the new convolution-product) when H is a compact Hopf *-algebra. (author)

Intervals in Generalized Effect Algebras and their Sub-generalized Effect Algebras

Directory of Open Access Journals (Sweden)

Zdenka Riečanová

2013-01-01

Full Text Available We consider subsets G of a generalized effect algebra E with 0∈G and such that every interval [0, q]G = [0, q]E ∩ G of G (q ∈ G , q ≠ 0 is a sub-effect algebra of the effect algebra [0, q]E. We give a condition on E and G under which every such G is a sub-generalized effect algebra of E.

Variants of bosonization in parabosonic algebra: the Hopf and super-Hopf structures in parabosonic algebra

International Nuclear Information System (INIS)

Kanakoglou, K; Daskaloyannis, C

2008-01-01

Parabosonic algebra in finite or infinite degrees of freedom is considered as a Z 2 -graded associative algebra, and is shown to be a Z 2 -graded (or super) Hopf algebra. The super-Hopf algebraic structure of the parabosonic algebra is established directly without appealing to its relation to the osp(1/2n) Lie superalgebraic structure. The notion of super-Hopf algebra is equivalently described as a Hopf algebra in the braided monoidal category CZ 2 M. The bosonization technique for switching a Hopf algebra in the braided monoidal category H M (where H is a quasitriangular Hopf algebra) into an ordinary Hopf algebra is reviewed. In this paper, we prove that for the parabosonic algebra P B , beyond the application of the bosonization technique to the original super-Hopf algebra, a bosonization-like construction is also achieved using two operators, related to the parabosonic total number operator. Both techniques switch the same super-Hopf algebra P B to an ordinary Hopf algebra, thus producing two different variants of P B , with an ordinary Hopf structure

An Improved Algorithm for Generating Database Transactions from Relational Algebra Specifications

Directory of Open Access Journals (Sweden)

Daniel J. Dougherty

2010-03-01

Full Text Available Alloy is a lightweight modeling formalism based on relational algebra. In prior work with Fisler, Giannakopoulos, Krishnamurthi, and Yoo, we have presented a tool, Alchemy, that compiles Alloy specifications into implementations that execute against persistent databases. The foundation of Alchemy is an algorithm for rewriting relational algebra formulas into code for database transactions. In this paper we report on recent progress in improving the robustness and efficiency of this transformation.

Linear algebraic theory of partial coherence: discrete fields and measures of partial coherence.

Science.gov (United States)

Ozaktas, Haldun M; Yüksel, Serdar; Kutay, M Alper

2002-08-01

A linear algebraic theory of partial coherence is presented that allows precise mathematical definitions of concepts such as coherence and incoherence. This not only provides new perspectives and insights but also allows us to employ the conceptual and algebraic tools of linear algebra in applications. We define several scalar measures of the degree of partial coherence of an optical field that are zero for full incoherence and unity for full coherence. The mathematical definitions are related to our physical understanding of the corresponding concepts by considering them in the context of Young's experiment.

Continuous analog of multiplicative algebraic reconstruction technique for computed tomography

Science.gov (United States)

Tateishi, Kiyoko; Yamaguchi, Yusaku; Abou Al-Ola, Omar M.; Kojima, Takeshi; Yoshinaga, Tetsuya

2016-03-01

We propose a hybrid dynamical system as a continuous analog to the block-iterative multiplicative algebraic reconstruction technique (BI-MART), which is a well-known iterative image reconstruction algorithm for computed tomography. The hybrid system is described by a switched nonlinear system with a piecewise smooth vector field or differential equation and, for consistent inverse problems, the convergence of non-negatively constrained solutions to a globally stable equilibrium is guaranteed by the Lyapunov theorem. Namely, we can prove theoretically that a weighted Kullback-Leibler divergence measure can be a common Lyapunov function for the switched system. We show that discretizing the differential equation by using the first-order approximation (Euler's method) based on the geometric multiplicative calculus leads to the same iterative formula of the BI-MART with the scaling parameter as a time-step of numerical discretization. The present paper is the first to reveal that a kind of iterative image reconstruction algorithm is constructed by the discretization of a continuous-time dynamical system for solving tomographic inverse problems. Iterative algorithms with not only the Euler method but also the Runge-Kutta methods of lower-orders applied for discretizing the continuous-time system can be used for image reconstruction. A numerical example showing the characteristics of the discretized iterative methods is presented.

Applications of computational tools in biosciences and medical engineering

CERN Document Server

Altenbach, Holm

2015-01-01

 This book presents the latest developments and applications of computational tools related to the biosciences and medical engineering. It also reports the findings of different multi-disciplinary research projects, for example, from the areas of scaffolds and synthetic bones, implants and medical devices, and medical materials. It is also shown that the application of computational tools often requires mathematical and experimental methods. Computational tools such as the finite element methods, computer-aided design and optimization as well as visualization techniques such as computed axial tomography open up completely new research fields that combine the fields of engineering and bio/medical. Nevertheless, there are still hurdles since both directions are based on quite different ways of education. Often even the “language” can vary from discipline to discipline.

Boolean algebra

CERN Document Server

Goodstein, R L

2007-01-01

This elementary treatment by a distinguished mathematician employs Boolean algebra as a simple medium for introducing important concepts of modern algebra. Numerous examples appear throughout the text, plus full solutions.

Topological أ-algebras with Cأ-enveloping algebras II

Indian Academy of Sciences (India)

necessarily complete) pro-Cأ-topology which coincides with the relative uniform .... problems in Cأ-algebras, Phillips introduced more general weakly Cأ- .... Banach أ-algebra obtained by completing A=Np in the norm jjxpjjp ¼ pًxق where.

Stability of Linear Equations--Algebraic Approach

Science.gov (United States)

Cherif, Chokri; Goldstein, Avraham; Prado, Lucio M. G.

2012-01-01

This article could be of interest to teachers of applied mathematics as well as to people who are interested in applications of linear algebra. We give a comprehensive study of linear systems from an application point of view. Specifically, we give an overview of linear systems and problems that can occur with the computed solution when the…

Visualizing the inner product space ℝm×n in a MATLAB-assisted linear algebra classroom

Science.gov (United States)

Caglayan, Günhan

2018-05-01

This linear algebra note offers teaching and learning ideas in the treatment of the inner product space ? in a technology-supported learning environment. Classroom activities proposed in this note demonstrate creative ways of integrating MATLAB technology into various properties of Frobenius inner product as visualization tools that complement the algebraic approach. As implemented in linear algebra lessons in a university in the Unites States, the article also incorporates algebraic and visual work of students who experienced these activities with MATLAB software. The connection between the Frobenius norm and the Euclidean norm is also emphasized.

Genetic algorithms in teaching artificial intelligence (automated generation of specific algebras)

Science.gov (United States)

Habiballa, Hashim; Jendryscik, Radek

2017-11-01

The problem of teaching essential Artificial Intelligence (AI) methods is an important task for an educator in the branch of soft-computing. The key focus is often given to proper understanding of the principle of AI methods in two essential points - why we use soft-computing methods at all and how we apply these methods to generate reasonable results in sensible time. We present one interesting problem solved in the non-educational research concerning automated generation of specific algebras in the huge search space. We emphasize above mentioned points as an educational case study of an interesting problem in automated generation of specific algebras.

Algebraic conformal field theory

International Nuclear Information System (INIS)

Fuchs, J.; Nationaal Inst. voor Kernfysica en Hoge-Energiefysica

1991-11-01

Many conformal field theory features are special versions of structures which are present in arbitrary 2-dimensional quantum field theories. So it makes sense to describe 2-dimensional conformal field theories in context of algebraic theory of superselection sectors. While most of the results of the algebraic theory are rather abstract, conformal field theories offer the possibility to work out many formulae explicitly. In particular, one can construct the full algebra A-bar of global observables and the endomorphisms of A-bar which represent the superselection sectors. Some explicit results are presented for the level 1 so(N) WZW theories; the algebra A-bar is found to be the enveloping algebra of a Lie algebra L-bar which is an extension of the chiral symmetry algebra of the WZW theory. (author). 21 refs., 6 figs

Communication Avoiding and Overlapping for Numerical Linear Algebra

Science.gov (United States)

2012-05-08

future exascale systems, communication cost must be avoided or overlapped. Communication-avoiding 2.5D algorithms improve scalability by reducing...linear algebra problems to future exascale systems, communication cost must be avoided or overlapped. Communication-avoiding 2.5D algorithms improve...will continue to grow relative to the cost of computation. With exascale computing as the long-term goal, the community needs to develop techniques

A Process Algebra Approach to Quantum Electrodynamics

Science.gov (United States)

Sulis, William

2017-12-01

The process algebra program is directed towards developing a realist model of quantum mechanics free of paradoxes, divergences and conceptual confusions. From this perspective, fundamental phenomena are viewed as emerging from primitive informational elements generated by processes. The process algebra has been shown to successfully reproduce scalar non-relativistic quantum mechanics (NRQM) without the usual paradoxes and dualities. NRQM appears as an effective theory which emerges under specific asymptotic limits. Space-time, scalar particle wave functions and the Born rule are all emergent in this framework. In this paper, the process algebra model is reviewed, extended to the relativistic setting, and then applied to the problem of electrodynamics. A semiclassical version is presented in which a Minkowski-like space-time emerges as well as a vector potential that is discrete and photon-like at small scales and near-continuous and wave-like at large scales. QED is viewed as an effective theory at small scales while Maxwell theory becomes an effective theory at large scales. The process algebra version of quantum electrodynamics is intuitive and realist, free from divergences and eliminates the distinction between particle, field and wave. Computations are carried out using the configuration space process covering map, although the connection to second quantization has not been fully explored.

Boolean algebra essentials

CERN Document Server

Solomon, Alan D

2012-01-01

REA's Essentials provide quick and easy access to critical information in a variety of different fields, ranging from the most basic to the most advanced. As its name implies, these concise, comprehensive study guides summarize the essentials of the field covered. Essentials are helpful when preparing for exams, doing homework and will remain a lasting reference source for students, teachers, and professionals. Boolean Algebra includes set theory, sentential calculus, fundamental ideas of Boolean algebras, lattices, rings and Boolean algebras, the structure of a Boolean algebra, and Boolean

q-deformed Poincare algebra

International Nuclear Information System (INIS)

Ogievetsky, O.; Schmidke, W.B.; Wess, J.; Muenchen Univ.; Zumino, B.; Lawrence Berkeley Lab., CA

1992-01-01

The q-differential calculus for the q-Minkowski space is developed. The algebra of the q-derivatives with the q-Lorentz generators is found giving the q-deformation of the Poincare algebra. The reality structure of the q-Poincare algebra is given. The reality structure of the q-differentials is also found. The real Laplaacian is constructed. Finally the comultiplication, counit and antipode for the q-Poincare algebra are obtained making it a Hopf algebra. (orig.)

Generalizing the bms3 and 2D-conformal algebras by expanding the Virasoro algebra

Science.gov (United States)

Caroca, Ricardo; Concha, Patrick; Rodríguez, Evelyn; Salgado-Rebolledo, Patricio

2018-03-01

By means of the Lie algebra expansion method, the centrally extended conformal algebra in two dimensions and the bms3 algebra are obtained from the Virasoro algebra. We extend this result to construct new families of expanded Virasoro algebras that turn out to be infinite-dimensional lifts of the so-called Bk, Ck and Dk algebras recently introduced in the literature in the context of (super)gravity. We also show how some of these new infinite-dimensional symmetries can be obtained from expanded Kač-Moody algebras using modified Sugawara constructions. Applications in the context of three-dimensional gravity are briefly discussed.

Introduction to quantum algebras

International Nuclear Information System (INIS)

Kibler, M.R.

1992-09-01

The concept of a quantum algebra is made easy through the investigation of the prototype algebras u qp (2), su q (2) and u qp (1,1). The latter quantum algebras are introduced as deformations of the corresponding Lie algebras; this is achieved in a simple way by means of qp-bosons. The Hopf algebraic structure of u qp (2) is also discussed. The basic ingredients for the representation theory of u qp (2) are given. Finally, in connection with the quantum algebra u qp (2), the qp-analogues of the harmonic oscillator are discussed and of the (spherical and hyperbolical) angular momenta. (author) 50 refs

Linear response theory an analytic-algebraic approach

CERN Document Server

De Nittis, Giuseppe

2017-01-01

This book presents a modern and systematic approach to Linear Response Theory (LRT) by combining analytic and algebraic ideas. LRT is a tool to study systems that are driven out of equilibrium by external perturbations. In particular the reader is provided with a new and robust tool to implement LRT for a wide array of systems. The proposed formalism in fact applies to periodic and random systems in the discrete and the continuum. After a short introduction describing the structure of the book, its aim and motivation, the basic elements of the theory are presented in chapter 2. The mathematical framework of the theory is outlined in chapters 3–5: the relevant von Neumann algebras, noncommutative $L^p$- and Sobolev spaces are introduced; their construction is then made explicit for common physical systems; the notion of isopectral perturbations and the associated dynamics are studied. Chapter 6 is dedicated to the main results, proofs of the Kubo and Kubo-Streda formulas. The book closes with a chapter about...

Continuum analogues of contragredient Lie algebras

International Nuclear Information System (INIS)

Saveliev, M.V.; Vershik, A.M.

1989-03-01

We present an axiomatic formulation of a new class of infinite-dimensional Lie algebras - the generalizations of Z-graded Lie algebras with, generally speaking, an infinite-dimensional Cartan subalgebra and a contiguous set of roots. We call such algebras ''continuum Lie algebras''. The simple Lie algebras of constant growth are encapsulated in our formulation. We pay particular attention to the case when the local algebra is parametrized by a commutative algebra while the Cartan operator (the generalization of the Cartan matrix) is a linear operator. Special examples of these algebras are the Kac-Moody algebras, algebras of Poisson brackets, algebras of vector fields on a manifold, current algebras, and algebras with differential or integro-differential Cartan operator. The nonlinear dynamical systems associated with the continuum contragredient Lie algebras are also considered. (author). 9 refs

Tensor models, Kronecker coefficients and permutation centralizer algebras

Science.gov (United States)

Geloun, Joseph Ben; Ramgoolam, Sanjaye

2017-11-01

We show that the counting of observables and correlators for a 3-index tensor model are organized by the structure of a family of permutation centralizer algebras. These algebras are shown to be semi-simple and their Wedderburn-Artin decompositions into matrix blocks are given in terms of Clebsch-Gordan coefficients of symmetric groups. The matrix basis for the algebras also gives an orthogonal basis for the tensor observables which diagonalizes the Gaussian two-point functions. The centres of the algebras are associated with correlators which are expressible in terms of Kronecker coefficients (Clebsch-Gordan multiplicities of symmetric groups). The color-exchange symmetry present in the Gaussian model, as well as a large class of interacting models, is used to refine the description of the permutation centralizer algebras. This discussion is extended to a general number of colors d: it is used to prove the integrality of an infinite family of number sequences related to color-symmetrizations of colored graphs, and expressible in terms of symmetric group representation theory data. Generalizing a connection between matrix models and Belyi maps, correlators in Gaussian tensor models are interpreted in terms of covers of singular 2-complexes. There is an intriguing difference, between matrix and higher rank tensor models, in the computational complexity of superficially comparable correlators of observables parametrized by Young diagrams.

Basic abstract algebra for graduate students and advanced undergraduates

CERN Document Server

Ash, Robert B

2006-01-01

Geared toward upper-level undergraduates and graduate students, this text surveys fundamental algebraic structures and maps between these structures. Its techniques are used in many areas of mathematics, with applications to physics, engineering, and computer science as well. Author Robert B. Ash, a Professor of Mathematics at the University of Illinois, focuses on intuitive thinking. He also conveys the intrinsic beauty of abstract algebra while keeping the proofs as brief and clear as possible.The early chapters provide students with background by investigating the basic properties of groups

BLAS- BASIC LINEAR ALGEBRA SUBPROGRAMS

Science.gov (United States)

Krogh, F. T.

1994-01-01

The Basic Linear Algebra Subprogram (BLAS) library is a collection of FORTRAN callable routines for employing standard techniques in performing the basic operations of numerical linear algebra. The BLAS library was developed to provide a portable and efficient source of basic operations for designers of programs involving linear algebraic computations. The subprograms available in the library cover the operations of dot product, multiplication of a scalar and a vector, vector plus a scalar times a vector, Givens transformation, modified Givens transformation, copy, swap, Euclidean norm, sum of magnitudes, and location of the largest magnitude element. Since these subprograms are to be used in an ANSI FORTRAN context, the cases of single precision, double precision, and complex data are provided for. All of the subprograms have been thoroughly tested and produce consistent results even when transported from machine to machine. BLAS contains Assembler versions and FORTRAN test code for any of the following compilers: Lahey F77L, Microsoft FORTRAN, or IBM Professional FORTRAN. It requires the Microsoft Macro Assembler and a math co-processor. The PC implementation allows individual arrays of over 64K. The BLAS library was developed in 1979. The PC version was made available in 1986 and updated in 1988.

Quiver W-algebras

Science.gov (United States)

Kimura, Taro; Pestun, Vasily

2018-06-01

For a quiver with weighted arrows, we define gauge-theory K-theoretic W-algebra generalizing the definition of Shiraishi et al. and Frenkel and Reshetikhin. In particular, we show that the qq-character construction of gauge theory presented by Nekrasov is isomorphic to the definition of the W-algebra in the operator formalism as a commutant of screening charges in the free field representation. Besides, we allow arbitrary quiver and expect interesting applications to representation theory of generalized Borcherds-Kac-Moody Lie algebras, their quantum affinizations and associated W-algebras.

Abstract algebra

CERN Document Server

Garrett, Paul B

2007-01-01

Designed for an advanced undergraduate- or graduate-level course, Abstract Algebra provides an example-oriented, less heavily symbolic approach to abstract algebra. The text emphasizes specifics such as basic number theory, polynomials, finite fields, as well as linear and multilinear algebra. This classroom-tested, how-to manual takes a more narrative approach than the stiff formalism of many other textbooks, presenting coherent storylines to convey crucial ideas in a student-friendly, accessible manner. An unusual feature of the text is the systematic characterization of objects by universal

College algebra

CERN Document Server

Kolman, Bernard

1985-01-01

College Algebra, Second Edition is a comprehensive presentation of the fundamental concepts and techniques of algebra. The book incorporates some improvements from the previous edition to provide a better learning experience. It provides sufficient materials for use in the study of college algebra. It contains chapters that are devoted to various mathematical concepts, such as the real number system, the theory of polynomial equations, exponential and logarithmic functions, and the geometric definition of each conic section. Progress checks, warnings, and features are inserted. Every chapter c