#### Sample records for generalized boolean algebra

1. 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.

2. 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

3. 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

4. Summing Boolean Algebras

Institute of Scientific and Technical Information of China (English)

Antonio AIZPURU; Antonio GUTI(E)RREZ-D(A)VILA

2004-01-01

In this paper we will study some families and subalgebras ( ) of ( )(N) that let us characterize the unconditional convergence of series through the weak convergence of subseries ∑i∈A xi, A ∈ ( ).As a consequence, we obtain a new version of the Orlicz-Pettis theorem, for Banach spaces. We also study some relationships between algebraic properties of Boolean algebras and topological properties of the corresponding Stone spaces.

5. 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.

6. The Boolean algebra of Galois algebras

Directory of Open Access Journals (Sweden)

Lianyong Xue

2003-02-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 each gÃ¢ÂˆÂˆG, and BJg=Beg for a central idempotent eg, Ba the Boolean algebra generated by {0,eg|gÃ¢ÂˆÂˆG}, e a nonzero element in Ba, and He={gÃ¢ÂˆÂˆG|eeg=e}. Then, a monomial e is characterized, and the Galois extension Be, generated by e with Galois group He, is investigated.

7. Free Boolean algebras over unions of two well orderings

Czech Academy of Sciences Publication Activity Database

Bonnet, R.; Faouzi, L.; Kubiś, Wieslaw

2009-01-01

Roč. 156, č. 7 (2009), s. 1177-1185 ISSN 0166-8641 Institutional research plan: CEZ:AV0Z10190503 Keywords : Well quasi orderings * Poset algebras * Superatomic Boolean algebras * Compact distributive lattices Subject RIV: BA - General Mathematics Impact factor: 0.441, year: 2009

8. 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.

9. Boolean Operations with Prism Algebraic Patches

Science.gov (United States)

Bajaj, Chandrajit; Paoluzzi, Alberto; Portuesi, Simone; Lei, Na; Zhao, Wenqi

2009-01-01

In this paper we discuss a symbolic-numeric algorithm for Boolean operations, closed in the algebra of curved polyhedra whose boundary is triangulated with algebraic patches (A-patches). This approach uses a linear polyhedron as a first approximation of both the arguments and the result. On each triangle of a boundary representation of such linear approximation, a piecewise cubic algebraic interpolant is built, using a C1-continuous prism algebraic patch (prism A-patch) that interpolates the three triangle vertices, with given normal vectors. The boundary representation only stores the vertices of the initial triangulation and their external vertex normals. In order to represent also flat and/or sharp local features, the corresponding normal-per-face and/or normal-per-edge may be also given, respectively. The topology is described by storing, for each curved triangle, the two triples of pointers to incident vertices and to adjacent triangles. For each triangle, a scaffolding prism is built, produced by its extreme vertices and normals, which provides a containment volume for the curved interpolating A-patch. When looking for the result of a regularized Boolean operation, the 0-set of a tri-variate polynomial within each such prism is generated, and intersected with the analogous 0-sets of the other curved polyhedron, when two prisms have non-empty intersection. The intersection curves of the boundaries are traced and used to decompose each boundary into the 3 standard classes of subpatches, denoted in, out and on. While tracing the intersection curves, the locally refined triangulation of intersecting patches is produced, and added to the boundary representation. PMID:21516262

10. 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.

11. A complexity theory based on Boolean algebra

DEFF Research Database (Denmark)

Skyum, Sven; Valiant, Leslie

1985-01-01

A projection of a Boolean function is a function obtained by substituting for each of its variables a variable, the negation of a variable, or a constant. Reducibilities among computational problems under this relation of projection are considered. It is shown that much of what is of everyday rel...

12. Complete ccc Boolean algebras, the order sequential topology, and a problem of von Neumann

Czech Academy of Sciences Publication Activity Database

Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš

2005-01-01

Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 Institutional research plan: CEZ:AV0Z10750506; CEZ:AV0Z10190503 Keywords : Boolean algebras * Maharam submeasure * weak distributivity * independent reals Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005

13. On Boolean functions with generalized cryptographic properties

NARCIS (Netherlands)

Braeken, A.; Nikov, V.S.; Nikova, S.I.; Preneel, B.; Canteaut, A.; Viswanathan, K.

2004-01-01

By considering a new metric, we generalize cryptographic properties of Boolean functions such as resiliency and propagation characteristics. These new definitions result in a better understanding of the properties of Boolean functions and provide a better insight in the space defined by this metric.

14. Complete CCC Boolean Algebras, the order Sequential Topology, and a Problem of von Neumann

Czech Academy of Sciences Publication Activity Database

Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš

2005-01-01

Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 R&D Projects: GA ČR(CZ) GA201/02/0857; GA ČR(CZ) GA201/03/0933 Institutional research plan: CEZ:AV0Z10190503 Keywords : Boolean algebra * Maharam submeasure * weak distributivity Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005

15. 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)

16. Boolean Algebra Application in Analysis of Flight Accidents

Directory of Open Access Journals (Sweden)

Casandra Venera BALAN

2015-12-01

Full Text Available Fault tree analysis is a deductive approach for resolving an undesired event into its causes, identifying the causes of a failure and providing a framework for a qualitative and quantitative evaluation of the top event. An alternative approach to fault tree analysis methods calculus goes to logical expressions and it is based on a graphical representation of the data structure for a logic - based binary decision diagram representation. In this analysis, such sites will be reduced to a minimal size and arranged in the sense that the variables appear in the same order in each path. An event can be defined as a statement that can be true or false. Therefore, Boolean algebra rules allow restructuring of a Fault Tree into one equivalent to it, but simpler.

17. Steady state analysis of Boolean molecular network models via model reduction and computational algebra.

Science.gov (United States)

Veliz-Cuba, Alan; Aguilar, Boris; Hinkelmann, Franziska; Laubenbacher, Reinhard

2014-06-26

18. Interpolative Boolean Networks

Directory of Open Access Journals (Sweden)

2017-01-01

Full Text Available Boolean networks are used for modeling and analysis of complex systems of interacting entities. Classical Boolean networks are binary and they are relevant for modeling systems with complex switch-like causal interactions. More descriptive power can be provided by the introduction of gradation in this model. If this is accomplished by using conventional fuzzy logics, the generalized model cannot secure the Boolean frame. Consequently, the validity of the model’s dynamics is not secured. The aim of this paper is to present the Boolean consistent generalization of Boolean networks, interpolative Boolean networks. The generalization is based on interpolative Boolean algebra, the [0,1]-valued realization of Boolean algebra. The proposed model is adaptive with respect to the nature of input variables and it offers greater descriptive power as compared with traditional models. For illustrative purposes, IBN is compared to the models based on existing real-valued approaches. Due to the complexity of the most systems to be analyzed and the characteristics of interpolative Boolean algebra, the software support is developed to provide graphical and numerical tools for complex system modeling and analysis.

19. Topology general & algebraic

CERN Document Server

Chatterjee, D

2007-01-01

About the Book: This book provides exposition of the subject both in its general and algebraic aspects. It deals with the notions of topological spaces, compactness, connectedness, completeness including metrizability and compactification, algebraic aspects of topological spaces through homotopy groups and homology groups. It begins with the basic notions of topological spaces but soon going beyond them reaches the domain of algebra through the notions of homotopy, homology and cohomology. How these approaches work in harmony is the subject matter of this book. The book finally arrives at the

20. Properties of Boolean orthoposets

Science.gov (United States)

1993-10-01

A Boolean orthoposet is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0, then a ⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets. Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough and, on the other hand, enjoys some properties of Boolean algebras. In this paper we summarize results on Boolean orthoposets involving distributivity, set representation, properties of the state space, existence of Jauch-Piron states, and results concerning orthocompleteness and completion.

1. 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.

2. Security analysis of boolean algebra based on Zhang-Wang digital signature scheme

International Nuclear Information System (INIS)

Zheng, Jinbin

2014-01-01

In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software

3. Security analysis of boolean algebra based on Zhang-Wang digital signature scheme

Energy Technology Data Exchange (ETDEWEB)

Zheng, Jinbin, E-mail: jbzheng518@163.com [School of Mathematics and Computer Science, Long Yan University, Longyan 364012 (China)

2014-10-06

In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software.

4. Characterization of Boolean Algebras in Terms of Certain States of Jauch-Piron Type

Science.gov (United States)

Matoušek, Milan; Pták, Pavel

2015-12-01

Suppose that L is an orthomodular lattice (a quantum logic). We show that L is Boolean exactly if L possesses a strongly unital set of weakly Jauch-Piron states, or if L possesses a unital set of weakly positive states. We also discuss some general properties of Jauch-Piron-like states.

5. Einstein algebras and general relativity

International Nuclear Information System (INIS)

Heller, M.

1992-01-01

A purely algebraic structure called an Einstein algebra is defined in such a way that every spacetime satisfying Einstein's equations is an Einstein algebra but not vice versa. The Gelfand representation of Einstein algebras is defined, and two of its subrepresentations are discussed. One of them is equivalent to the global formulation of the standard theory of general relativity; the other one leads to a more general theory of gravitation which, in particular, includes so-called regular singularities. In order to include other types of singularities one must change to sheaves of Einstein algebras. They are defined and briefly discussed. As a test of the proposed method, the sheaf of Einstein algebras corresponding to the space-time of a straight cosmic string with quasiregular singularity is constructed. 22 refs

6. Generalized exclusion and Hopf algebras

International Nuclear Information System (INIS)

Yildiz, A

2002-01-01

We propose a generalized oscillator algebra at the roots of unity with generalized exclusion and we investigate the braided Hopf structure. We find that there are two solutions: these are the generalized exclusions of the bosonic and fermionic types. We also discuss the covariance properties of these oscillators

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

8. Invariants of generalized Lie algebras

International Nuclear Information System (INIS)

Agrawala, V.K.

1981-01-01

Invariants and invariant multilinear forms are defined for generalized Lie algebras with arbitrary grading and commutation factor. Explicit constructions of invariants and vector operators are given by contracting invariant forms with basic elements of the generalized Lie algebra. The use of the matrix of a linear map between graded vector spaces is emphasized. With the help of this matrix, the concept of graded trace of a linear operator is introduced, which is a rich source of multilinear forms of degree zero. To illustrate the use of invariants, a characteristic identity similar to that of Green is derived and a few Racah coefficients are evaluated in terms of invariants

9. Zorn algebra in general relativity

International Nuclear Information System (INIS)

Oliveira, C.G.; Maia, M.D.

The covariant differential properties of the split Cayley subalgebra of local real quaternion tetrads is considered. Referred to this local quaternion tetrad several geometrical objects are given in terms of Zorn-Weyl matrices. Associated to a pair of real null vectors we define two-component spinor fields over the curved space and the associated Zorn-Weyl matrices which satisfy the Dirac equation written in terms of the Zorn algebra. The formalism is generalized by considering a field of complex tetrads defining a Hermitian second rank tensor. The real part of this tensor describes the gravitational potentials and the imaginary part the electromagnetic potentials in the Lorentz gauge. The motion of a charged spin zero test body is considered. The Zorn-Weyl algebra associated to this generalized formalism has elements belonging to the full octonion algebra [pt

10. Teachers' Understanding of Algebraic Generalization

Science.gov (United States)

Hawthorne, Casey Wayne

Generalization has been identified as a cornerstone of algebraic thinking (e.g., Lee, 1996; Sfard, 1995) and is at the center of a rich conceptualization of K-8 algebra (Kaput, 2008; Smith, 2003). Moreover, mathematics teachers are being encouraged to use figural-pattern generalizing tasks as a basis of student-centered instruction, whereby teachers respond to and build upon the ideas that arise from students' explorations of these activities. Although more and more teachers are engaging their students in such generalizing tasks, little is known about teachers' understanding of generalization and their understanding of students' mathematical thinking in this domain. In this work, I addressed this gap, exploring the understanding of algebraic generalization of 4 exemplary 8th-grade teachers from multiple perspectives. A significant feature of this investigation is an examination of teachers' understanding of the generalization process, including the use of algebraic symbols. The research consisted of two phases. Phase I was an examination of the teachers' understandings of the underlying quantities and quantitative relationships represented by algebraic notation. In Phase II, I observed the instruction of 2 of these teachers. Using the lens of professional noticing of students' mathematical thinking, I explored the teachers' enacted knowledge of algebraic generalization, characterizing how it supported them to effectively respond to the needs and queries of their students. Results indicated that teachers predominantly see these figural patterns as enrichment activities, disconnected from course content. Furthermore, in my analysis, I identified conceptual difficulties teachers experienced when solving generalization tasks, in particular, connecting multiple symbolic representations with the quantities in the figures. Moreover, while the teachers strived to overcome the challenges of connecting different representations, they invoked both productive and unproductive

11. 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)

12. Algebraic properties of generalized inverses

CERN Document Server

Cvetković‐Ilić, Dragana S

2017-01-01

This book addresses selected topics in the theory of generalized inverses. Following a discussion of the “reverse order law” problem and certain problems involving completions of operator matrices, it subsequently presents a specific approach to solving the problem of the reverse order law for {1} -generalized inverses. Particular emphasis is placed on the existence of Drazin invertible completions of an upper triangular operator matrix; on the invertibility and different types of generalized invertibility of a linear combination of operators on Hilbert spaces and Banach algebra elements; on the problem of finding representations of the Drazin inverse of a 2x2 block matrix; and on selected additive results and algebraic properties for the Drazin inverse. In addition to the clarity of its content, the book discusses the relevant open problems for each topic discussed. Comments on the latest references on generalized inverses are also included. Accordingly, the book will be useful for graduate students, Ph...

13. Generalized Galilean algebras and Newtonian gravity

Science.gov (United States)

2016-04-01

The non-relativistic versions of the generalized Poincaré algebras and generalized AdS-Lorentz algebras are obtained. These non-relativistic algebras are called, generalized Galilean algebras of type I and type II and denoted by GBn and GLn respectively. Using a generalized Inönü-Wigner contraction procedure we find that the generalized Galilean algebras of type I can be obtained from the generalized Galilean algebras type II. The S-expansion procedure allows us to find the GB5 algebra from the Newton Hooke algebra with central extension. The procedure developed in Ref. [1] allows us to show that the nonrelativistic limit of the five dimensional Einstein-Chern-Simons gravity is given by a modified version of the Poisson equation. The modification could be compatible with the effects of Dark Matter, which leads us to think that Dark Matter can be interpreted as a non-relativistic limit of Dark Energy.

14. Boolean-Valued Belief Functions

Czech Academy of Sciences Publication Activity Database

Kramosil, Ivan

2002-01-01

Roč. 31, č. 2 (2002), s. 153-181 ISSN 0308-1079 R&D Projects: GA AV ČR IAA1030803 Institutional research plan: AV0Z1030915 Keywords : Dempster-Schafer theory * Boolean algebra Subject RIV: BA - General Mathematics Impact factor: 0.241, year: 2002

15. Generalized module extension Banach algebras: Derivations and ...

African Journals Online (AJOL)

Let A and X be Banach algebras and let X be an algebraic Banach A-module. Then the ℓ-1direct sum A x X equipped with the multiplication (a; x)(b; y) = (ab; ay + xb + xy) (a; b ∈ A; x; y ∈ X) is a Banach algebra, denoted by A ⋈ X, which will be called "a generalized module extension Banach algebra". Module extension ...

16. Boolean reasoning the logic of boolean equations

CERN Document Server

Brown, Frank Markham

2012-01-01

A systematic treatment of Boolean reasoning, this concise, newly revised edition combines the works of early logicians with recent investigations, including previously unpublished research results. Brown begins with an overview of elementary mathematical concepts and outlines the theory of Boolean algebras. Two concluding chapters deal with applications. 1990 edition.

17. A division algebra classification of generalized supersymmetries

International Nuclear Information System (INIS)

Toppan, Francesco

2004-10-01

Generalized supersymmetries admitting bosonic tensor central charges are classified in accordance with their division algebra properties. Division algebra consistent constraints lead (in the complex and quaternionic cases) to the classes of hermitian and holomorphic generalized supersymmetries. Applications to the analytic continuation of the M-algebra to the Euclidean and the systematic investigation of certain classes of models in generic space-times are briefly mentioned. (author)

18. General distributions in process algebra

NARCIS (Netherlands)

Katoen, Joost P.; d' Argenio, P.R.; Brinksma, Hendrik; Hermanns, H.; Katoen, Joost P.

2001-01-01

This paper is an informal tutorial on stochastic process algebras, i.e., process calculi where action occurrences may be subject to a delay that is governed by a (mostly continuous) random variable. Whereas most stochastic process algebras consider delays determined by negative exponential

19. Fractional supersymmetry through generalized anyonic algebra

International Nuclear Information System (INIS)

Douari, Jamila; Abdus Salam International Centre for Theoretical Physics, Trieste; Hassouni, Yassine

2001-01-01

The construction of anyonic operators and algebra is generalized by using quons operators. Therefore, the particular version of fractional supersymmetry is constructed on the two-dimensional lattice by associating two generalized anyons of different kinds. The fractional supersymmetry Hamiltonian operator is obtained on the two-dimensional lattice and the quantum algebra U q (sl 2 ) is realized. (author)

20. Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras

OpenAIRE

2012-01-01

Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In thi...

1. 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.

2. Generalized W-algebras and integrable hierarchies

International Nuclear Information System (INIS)

Burroughs, N.; De Groot, M.; Hollowood, T.; Miramontes, L.

1992-01-01

We report on generalizations of the KdV-type integrable hierarchies of Drinfel'd and Sokolov. These hierarchies lead to the existence of new classical W-algebras, which arise as the second hamiltonian structure of the hierarchies. In particular, we present a construction of the W n (l) -algebras. (orig.)

3. 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....

4. Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras

Science.gov (United States)

Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In this paper, we propose a novel, efficient algorithm for multi-valued bounded model checking. A notable feature of our algorithm is that it is not based on reduction of multi-values into two-values; instead, it generates a single formula which represents multi-valuedness by a suitable encoding, and asks a standard SAT solver to check its satisfiability. Our experimental results show a significant improvement in the number of variables and clauses and also in execution time compared with the reduction-based one.

5. Algebraic characterizations of measure algebras

Czech Academy of Sciences Publication Activity Database

Jech, Thomas

2008-01-01

Roč. 136, č. 4 (2008), s. 1285-1294 ISSN 0002-9939 R&D Projects: GA AV ČR IAA100190509 Institutional research plan: CEZ:AV0Z10190503 Keywords : Von - Neumann * sequential topology * Boolean-algebras * Souslins problem * Submeasures Subject RIV: BA - General Mathematics Impact factor: 0.584, year: 2008

6. A twisted generalization of Novikov-Poisson algebras

OpenAIRE

Yau, Donald

2010-01-01

Hom-Novikov-Poisson algebras, which are twisted generalizations of Novikov-Poisson algebras, are studied. Hom-Novikov-Poisson algebras are shown to be closed under tensor products and several kinds of twistings. Necessary and sufficient conditions are given under which Hom-Novikov-Poisson algebras give rise to Hom-Poisson algebras.

7. Boolean orthoposets and two-valued states on them

Science.gov (United States)

1992-06-01

A Boolean orthoposet (see e.g. [2]) is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0 then a⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets (see e.g. [8]). Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough (see [4,3]) and on the other hand, enjoys some properties of Boolean algebras [4,8,5]. In quantum logic theory an important role is played by so-called Jauch-Piron states [1,6,7]. In this paper we clarify the connection between Boolean orthoposets and orthoposets with "enough" two-valued Jauch-Piron states. Further, we obtain a characterization of Boolean orthoposets in terms of two-valued states.

8. Regular Gleason Measures and Generalized Effect Algebras

Science.gov (United States)

Dvurečenskij, Anatolij; Janda, Jiří

2015-12-01

We study measures, finitely additive measures, regular measures, and σ-additive measures that can attain even infinite values on the quantum logic of a Hilbert space. We show when particular classes of non-negative measures can be studied in the frame of generalized effect algebras.

9. 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.

10. Correlation Immunity, Avalanche Features, and Other Cryptographic Properties of Generalized Boolean Functions

Science.gov (United States)

2017-09-01

satisfying the strict avalanche criterion,” Discrete Math ., vol. 185, pp. 29–39, 1998. [2] R.C. Bose, “On some connections between the design of... Discrete Appl. Math ., vol. 149, pp. 73–86, 2005. [11] T.W. Cusick and P. Stănică, Cryptographic Boolean Functions and Applications, 2nd ed., San Diego...Stănică, “Bisecting binomial coefficients,” Discrete Appl. Math ., vol. 227, pp. 70–83, 2017. [28] T. Martinsen, W. Meidl, and P. Stănică, “Generalized

11. Twisted boundary states and representation of generalized fusion algebra

International Nuclear Information System (INIS)

Ishikawa, Hiroshi; Tani, Taro

2006-01-01

The mutual consistency of boundary conditions twisted by an automorphism group G of the chiral algebra is studied for general modular invariants of rational conformal field theories. We show that a consistent set of twisted boundary states associated with any modular invariant realizes a non-negative integer matrix representation (NIM-rep) of the generalized fusion algebra, an extension of the fusion algebra by representations of the twisted chiral algebra associated with the automorphism group G. We check this result for several concrete cases. In particular, we find that two NIM-reps of the fusion algebra for su(3) k (k=3,5) are organized into a NIM-rep of the generalized fusion algebra for the charge-conjugation automorphism of su(3) k . We point out that the generalized fusion algebra is non-commutative if G is non-Abelian and provide some examples for G-bar S 3 . Finally, we give an argument that the graph fusion algebra associated with simple current extensions coincides with the generalized fusion algebra for the extended chiral algebra, and thereby explain that the graph fusion algebra contains the fusion algebra of the extended theory as a subalgebra

12. Space-time algebra for the generalization of gravitational field

The Maxwell–Proca-like field equations of gravitolectromagnetism are formulated using space-time algebra (STA). The gravitational wave equation with massive gravitons and gravitomagnetic monopoles has been derived in terms of this algebra. Using space-time algebra, the most generalized form of ...

13. Generalized NLS hierarchies from rational W algebras

International Nuclear Information System (INIS)

Toppan, F.

1993-11-01

Finite rational W algebras are very natural structures appearing in coset constructions when a Kac-Moody subalgebra is factored out. The problem of relating these algebras to integrable hierarchies of equations is studied by showing how to associate to a rational W algebra its corresponding hierarchy. Two examples are worked out, the sl(2)/U(1) coset, leading to the Non-Linear Schroedinger hierarchy, and the U(1) coset of the Polyakov-Bershadsky W algebra, leading to a 3-field representation of the KP hierarchy already encountered in the literature. In such examples a rational algebra appears as algebra of constraints when reducing a KP hierarchy to a finite field representation. This fact arises the natural question whether rational algebras are always associated to such reductions and whether a classification of rational algebras can lead to a classification of the integrable hierarchies. (author). 19 refs

14. Atomic effect algebras with compression bases

International Nuclear Information System (INIS)

2011-01-01

Compression base effect algebras were recently introduced by Gudder [Demonstr. Math. 39, 43 (2006)]. They generalize sequential effect algebras [Rep. Math. Phys. 49, 87 (2002)] and compressible effect algebras [Rep. Math. Phys. 54, 93 (2004)]. The present paper focuses on atomic compression base effect algebras and the consequences of atoms being foci (so-called projections) of the compressions in the compression base. Part of our work generalizes results obtained in atomic sequential effect algebras by Tkadlec [Int. J. Theor. Phys. 47, 185 (2008)]. The notion of projection-atomicity is introduced and studied, and several conditions that force a compression base effect algebra or the set of its projections to be Boolean are found. Finally, we apply some of these results to sequential effect algebras and strengthen a previously established result concerning a sufficient condition for them to be Boolean.

15. General algebraic theory of identical particle scattering

International Nuclear Information System (INIS)

Bencze, G.; Redish, E.F.

1978-01-01

We consider the nonrelativistic N-body scattering problem for a system of particles in which some subsets of the particles are identical. We demonstrate how the particle identity can be included in a general class of linear integral equations for scattering operators or components of scattering operators. The Yakubovskii, Yakubovskii--Narodestkii, Rosenberg, and Bencze--Redish--Sloan equations are included in this class. Algebraic methods are used which rely on the properties of the symmetry group of the system. Operators depending only on physically distinguishable labels are introduced and linear integral equations for them are derived. This procedure maximally reduces the number of coupled equations while retaining the connectivity properties of the original equations

16. Algebraic Generalization Strategies Used by Kuwaiti Pre-Service Teachers

Science.gov (United States)

Alajmi, Amal Hussain

2016-01-01

This study reports on the algebraic generalization strategies used by elementary and middle/high school pre-service mathematics teachers in Kuwait. They were presented with 9 tasks that involved linear, exponential, and quadratic situations. The results showed that these pre-service teachers had difficulty in generalizing algebraic rules in all 3…

17. Division algebra, generalized supersymmetries and octonionic M-theory

International Nuclear Information System (INIS)

Toppan, Francesco

2004-11-01

This is the report of the talk given at the conference 'Number, Time and Relativity', held at the Bauman University, Moscow, August 2004, concerning the recent research activity of the author and his collaborators about the inter-relation of the concepts of division algebras, representations of Clifford algebras, generalized supersymmetries with the introduction of an alternative description of the M-algebra in terms of the non-associative structure of the octonions. (author)

18. The Boolean Algebra of Cubical Areas as a Tensor Product in the Category of Semilattices with Zero

Directory of Open Access Journals (Sweden)

Nicolas Ninin

2014-10-01

Full Text Available In this paper we describe a model of concurrency together with an algebraic structure reflecting the parallel composition. For the sake of simplicity we restrict to linear concurrent programs i.e. the ones with no loops nor branching. Such programs are given a semantics using cubical areas. Such a semantics is said to be geometric. The collection of all these cubical areas enjoys a structure of tensor product in the category of semi-lattice with zero. These results naturally extend to fully fledged concurrent programs up to some technical tricks.

19. 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

20. Quasi-algebras and general Weyl quantization

International Nuclear Information System (INIS)

Lassner, G.A.; Lassner, G.

1984-01-01

In this paper we show how the systematic use of the topological properties of the quasi-sup(*)-algebra L(S,S') leads to a systematization of the quantization procedure. With that as background, the multiplication of certain classes of pairs of operators of L(S,S') and the corresponding twisted product of their sybmols are defined. (orig./HSI)

1. A generalization of the deformed algebra of quantum group SU(2)q for Hopf algebra

International Nuclear Information System (INIS)

Ludu, A.; Gupta, R.K.

1992-12-01

A generalization of the deformation of Lie algebra of SU(2) group is established for the Hopf algebra, by modifying the J 3 component in all of its defining commutators. The modification is carried out in terms of a polynomial f, of J 3 and the q-deformation parameter, which contains the known q-deformation functionals as its particular cases. (author). 20 refs

2. 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)

3. 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.

4. Elements of Boolean-Valued Dempster-Shafer Theory

Czech Academy of Sciences Publication Activity Database

Kramosil, Ivan

2000-01-01

Roč. 10, č. 5 (2000), s. 825-835 ISSN 1210-0552. [SOFSEM 2000 Workshop on Soft Computing. Milovy, 27.11.2000-28.11.2000] R&D Projects: GA ČR GA201/00/1489 Institutional research plan: AV0Z1030915 Keywords : Boolean algebra * belief function * Dempster-Shafer theory * Dempster combination rule * nonspecifity degree Subject RIV: BA - General Mathematics

5. 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 ﬁnished 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.

6. Non-local matrix generalizations of W-algebras

International Nuclear Information System (INIS)

Bilal, A.

1995-01-01

There is a standard way to define two symplectic (hamiltonian) structures, the first and second Gelfand-Dikii brackets, on the space of ordinary m th -order linear differential operators L=-d m +U 1 d m-1 +U 2 d m-2 +..+U m . In this paper, I consider in detail the case where the U k are nxn-matrix-valued functions, with particular emphasis on the (more interesting) second Gelfand-Dikii bracket. Of particular interest is the reduction to the symplectic submanifold U 1 =0. This reduction gives rise to matrix generalizations of (the classical version of) the non-linear W m -algebras, called V n,m -algebras. The non-commutativity of the matrices leads to non-local terms in these V n,m -algebras. I show that these algebras contain a conformal Virasoro subalgebra and that combinations W k of the U k can be formed that are nxn-matrices of conformally primary fields of spin k, in analogy with the scalar case n=1. In general however, the V m,n -algebras have a much richer structure than the W m -algebras as can be seen on the examples of the non-linear and non-local Poisson brackets {(U 2 ) ab (σ),(U 2 ) cd (σ')}, {(U 2 ) ab (σ),(W 3 ) cd (σ')} and {(W 3 ) ab (σ),(W 3 ) cd (σ')} which I work out explicitly for all m and n. A matrix Miura transformation is derived, mapping these complicated (second Gelfand-Dikii) brackets of the U k to a set of much simpler Poisson brackets, providing the analogue of the free-field representation of the W m -algebras. (orig.)

7. The classical parafermion algebra, its generalization and its quantization

International Nuclear Information System (INIS)

Bardakci, K.

1992-01-01

The Poisson bracket algebra of the classical parafermions derived earlier from the lagrangian description of conformal coset models is generalized. It is also shown how to quantize models with commutative monodromy matrices, and progress is made in quantizing the non-commutative case. (orig.)

8. On the representation of generalized Dirac (Clifford) algebras

International Nuclear Information System (INIS)

Srivastava, T.

1981-10-01

Some results of Brauer and Weyl and of Jordan and Wigner on irreducible representations of generalized Dirac (Clifford) algebras have been proved, adopting a new and simple approach which (i) makes the whole subject straightforward for physicists and (ii) simplifies the demonstration of the fundamental theorem of Pauli. (author)

9. Generalized algebra-valued models of set theory

NARCIS (Netherlands)

Löwe, B.; Tarafder, S.

2015-01-01

We generalize the construction of lattice-valued models of set theory due to Takeuti, Titani, Kozawa and Ozawa to a wider class of algebras and show that this yields a model of a paraconsistent logic that validates all axioms of the negation-free fragment of Zermelo-Fraenkel set theory.

10. Generalized Heisenberg algebra and (non linear) pseudo-bosons

Science.gov (United States)

Bagarello, F.; Curado, E. M. F.; Gazeau, J. P.

2018-04-01

We propose a deformed version of the generalized Heisenberg algebra by using techniques borrowed from the theory of pseudo-bosons. In particular, this analysis is relevant when non self-adjoint Hamiltonians are needed to describe a given physical system. We also discuss relations with nonlinear pseudo-bosons. Several examples are discussed.

11. Quantum incompatibility of channels with general outcome operator algebras

Science.gov (United States)

Kuramochi, Yui

2018-04-01

A pair of quantum channels is said to be incompatible if they cannot be realized as marginals of a single channel. This paper addresses the general structure of the incompatibility of completely positive channels with a fixed quantum input space and with general outcome operator algebras. We define a compatibility relation for such channels by identifying the composite outcome space as the maximal (projective) C*-tensor product of outcome algebras. We show theorems that characterize this compatibility relation in terms of the concatenation and conjugation of channels, generalizing the recent result for channels with quantum outcome spaces. These results are applied to the positive operator valued measures (POVMs) by identifying each of them with the corresponding quantum-classical (QC) channel. We also give a characterization of the maximality of a POVM with respect to the post-processing preorder in terms of the conjugate channel of the QC channel. We consider another definition of compatibility of normal channels by identifying the composite outcome space with the normal tensor product of the outcome von Neumann algebras. We prove that for a given normal channel, the class of normally compatible channels is upper bounded by a special class of channels called tensor conjugate channels. We show the inequivalence of the C*- and normal compatibility relations for QC channels, which originates from the possibility and impossibility of copying operations for commutative von Neumann algebras in C*- and normal compatibility relations, respectively.

12. Algebraic structure of general electromagnetic fields and energy flow

International Nuclear Information System (INIS)

Hacyan, Shahen

2011-01-01

Highlights: → Algebraic structure of general electromagnetic fields in stationary spacetime. → Eigenvalues and eigenvectors of the electomagnetic field tensor. → Energy-momentum in terms of eigenvectors and Killing vector. → Explicit form of reference frame with vanishing Poynting vector. → Application of formalism to Bessel beams. - Abstract: The algebraic structures of a general electromagnetic field and its energy-momentum tensor in a stationary space-time are analyzed. The explicit form of the reference frame in which the energy of the field appears at rest is obtained in terms of the eigenvectors of the electromagnetic tensor and the existing Killing vector. The case of a stationary electromagnetic field is also studied and a comparison is made with the standard short-wave approximation. The results can be applied to the general case of a structured light beams, in flat or curved spaces. Bessel beams are worked out as example.

13. 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.

14. 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.

15. The algebra of two dimensional generalized Chebyshev-Koornwinder oscillator

International Nuclear Information System (INIS)

Borzov, V. V.; Damaskinsky, E. V.

2014-01-01

In the previous works of Borzov and Damaskinsky [“Chebyshev-Koornwinder oscillator,” Theor. Math. Phys. 175(3), 765–772 (2013)] and [“Ladder operators for Chebyshev-Koornwinder oscillator,” in Proceedings of the Days on Diffraction, 2013], the authors have defined the oscillator-like system that is associated with the two variable Chebyshev-Koornwinder polynomials. We call this system the generalized Chebyshev-Koornwinder oscillator. In this paper, we study the properties of infinite-dimensional Lie algebra that is analogous to the Heisenberg algebra for the Chebyshev-Koornwinder oscillator. We construct the exact irreducible representation of this algebra in a Hilbert space H of functions that are defined on a region which is bounded by the Steiner hypocycloid. The functions are square-integrable with respect to the orthogonality measure for the Chebyshev-Koornwinder polynomials and these polynomials form an orthonormalized basis in the space H. The generalized oscillator which is studied in the work can be considered as the simplest nontrivial example of multiboson quantum system that is composed of three interacting oscillators

16. On a generalized oscillator: invariance algebra and interbasis expansions

International Nuclear Information System (INIS)

Hakopyan, E.M.; Pogosyan, G.S.; Sisakyan, A.N.; Kibler, M.

1998-01-01

This article deals with a quantum-mechanical system which generalizes the ordinary isotropic harmonic oscillator system. We give the coefficients connecting the polar and Cartesian bases for D=2 and the coefficients connecting the Cartesian and cylindrical bases as well as the cylindrical and spherical bases for D=3. These interbasis expansion coefficients are found to be analytic continuations to real values of their arguments of the Clebsch-Gordan coefficients for the group SU(2). For D=2, the super integrable character for the generalized oscillator system is investigated from the point of view of a quadratic invariance algebra

17. Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games

NARCIS (Netherlands)

Kant, Gijs; van de Pol, Jan Cornelis; Wijs, A.J.; Bošnački, D.; Edelkamp, S.

Parameterised Boolean Equation Systems (PBESs) are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal μ-calculus formulae for process algebraic specifications with data. Solving a PBES is usually done by instantiation to a Parity Game and then

18. A general Euclidean connection for so(n,m) lie algebra and the algebraic approach to scattering

International Nuclear Information System (INIS)

Ionescu, R.A.

1994-11-01

We obtain a general Euclidean connection for so(n,m). This Euclidean connection allows an algebraic derivation of the S matrix and it reduces to the known one in suitable circumstances. (author). 8 refs

19. 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

20. Generalized Boolean logic Driven Markov Processes: A powerful modeling framework for Model-Based Safety Analysis of dynamic repairable and reconfigurable systems

International Nuclear Information System (INIS)

Piriou, Pierre-Yves; Faure, Jean-Marc; Lesage, Jean-Jacques

2017-01-01

This paper presents a modeling framework that permits to describe in an integrated manner the structure of the critical system to analyze, by using an enriched fault tree, the dysfunctional behavior of its components, by means of Markov processes, and the reconfiguration strategies that have been planned to ensure safety and availability, with Moore machines. This framework has been developed from BDMP (Boolean logic Driven Markov Processes), a previous framework for dynamic repairable systems. First, the contribution is motivated by pinpointing the limitations of BDMP to model complex reconfiguration strategies and the failures of the control of these strategies. The syntax and semantics of GBDMP (Generalized Boolean logic Driven Markov Processes) are then formally defined; in particular, an algorithm to analyze the dynamic behavior of a GBDMP model is developed. The modeling capabilities of this framework are illustrated on three representative examples. Last, qualitative and quantitative analysis of GDBMP models highlight the benefits of the approach.

1. 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.

2. Algebra

CERN Document Server

Sepanski, Mark R

2010-01-01

Mark Sepanski's Algebra is a readable introduction to the delightful world of modern algebra. Beginning with concrete examples from the study of integers and modular arithmetic, the text steadily familiarizes the reader with greater levels of abstraction as it moves through the study of groups, rings, and fields. The book is equipped with over 750 exercises suitable for many levels of student ability. There are standard problems, as well as challenging exercises, that introduce students to topics not normally covered in a first course. Difficult problems are broken into manageable subproblems

3. On generalized Melvin solution for the Lie algebra E6

International Nuclear Information System (INIS)

Bolokhov, S.V.; Ivashchuk, V.D.

2017-01-01

A multidimensional generalization of Melvin's solution for an arbitrary simple Lie algebra G is considered. The gravitational model in D dimensions, D ≥ 4, contains n 2-forms and l ≥ n scalar fields, where n is the rank of G. The solution is governed by a set of n functions H s (z) obeying n ordinary differential equations with certain boundary conditions imposed. It was conjectured earlier that these functions should be polynomials (the so-called fluxbrane polynomials). The polynomials H s (z), s = 1,.., 6, for the Lie algebra E 6 are obtained and a corresponding solution for l = n = 6 is presented. The polynomials depend upon integration constants Q s , s = 1,.., 6. They obey symmetry and duality identities. The latter ones are used in deriving asymptotic relations for solutions at large distances. The power-law asymptotic relations for E 6 -polynomials at large z are governed by the integer-valued matrix ν = A -1 (I + P), where A -1 is the inverse Cartan matrix, I is the identity matrix and P is a permutation matrix, corresponding to a generator of the Z 2 -group of symmetry of the Dynkin diagram. The 2-form fluxes Φ s , s = 1,.., 6, are calculated. (orig.)

4. Free Boolean Topological Groups

Directory of Open Access Journals (Sweden)

Ol’ga Sipacheva

2015-11-01

Full Text Available Known and new results on free Boolean topological groups are collected. An account of the properties that these groups share with free or free Abelian topological groups and properties specific to free Boolean groups is given. Special emphasis is placed on the application of set-theoretic methods to the study of Boolean topological groups.

5. The most general form of deformation of the Heisenberg algebra from the generalized uncertainty principle

Energy Technology Data Exchange (ETDEWEB)

Masood, Syed [Department of Physics, International Islamic University, H-10 Sector, Islamabad (Pakistan); Faizal, Mir, E-mail: mirfaizalmir@gmail.com [Irving K. Barber School of Arts and Sciences, University of British Columbia – Okanagan, Kelowna, BC V1V 1V7 (Canada); Department of Physics and Astronomy, University of Lethbridge, Lethbridge, AB T1K 3M4 (Canada); Zaz, Zaid [Department of Electronics and Communication Engineering, University of Kashmir, Srinagar, Kashmir, 190006 (India); Ali, Ahmed Farag [Department of Physics, Faculty of Science, Benha University, Benha, 13518 (Egypt); Raza, Jamil [Department of Physics, International Islamic University, H-10 Sector, Islamabad (Pakistan); Shah, Mushtaq B. [Department of Physics, National Institute of Technology, Srinagar, Kashmir, 190006 (India)

2016-12-10

In this paper, we will propose the most general form of the deformation of Heisenberg algebra motivated by the generalized uncertainty principle. This deformation of the Heisenberg algebra will deform all quantum mechanical systems. The form of the generalized uncertainty principle used to motivate these results will be motivated by the space fractional quantum mechanics, and non-locality in quantum mechanical systems. We also analyse a specific limit of this generalized deformation for one dimensional system, and in that limit, a nonlocal deformation of the momentum operator generates a local deformation of all one dimensional quantum mechanical systems. We analyse the low energy effects of this deformation on a harmonic oscillator, Landau levels, Lamb shift, and potential barrier. We also demonstrate that this deformation leads to a discretization of space.

6. The most general form of deformation of the Heisenberg algebra from the generalized uncertainty principle

International Nuclear Information System (INIS)

Masood, Syed; Faizal, Mir; Zaz, Zaid; Ali, Ahmed Farag; Raza, Jamil; Shah, Mushtaq B.

2016-01-01

In this paper, we will propose the most general form of the deformation of Heisenberg algebra motivated by the generalized uncertainty principle. This deformation of the Heisenberg algebra will deform all quantum mechanical systems. The form of the generalized uncertainty principle used to motivate these results will be motivated by the space fractional quantum mechanics, and non-locality in quantum mechanical systems. We also analyse a specific limit of this generalized deformation for one dimensional system, and in that limit, a nonlocal deformation of the momentum operator generates a local deformation of all one dimensional quantum mechanical systems. We analyse the low energy effects of this deformation on a harmonic oscillator, Landau levels, Lamb shift, and potential barrier. We also demonstrate that this deformation leads to a discretization of space.

7. The Adapted Ordering Method for Lie algebras and superalgebras and their generalizations

Energy Technology Data Exchange (ETDEWEB)

Gato-Rivera, Beatriz [Instituto de Matematicas y Fisica Fundamental, CSIC, Serrano 123, Madrid 28006 (Spain); NIKHEF-H, Kruislaan 409, NL-1098 SJ Amsterdam (Netherlands)

2008-02-01

In 1998 the Adapted Ordering Method was developed for the representation theory of the superconformal algebras in two dimensions. It allows us to determine maximal dimensions for a given type of space of singular vectors, to identify all singular vectors by only a few coefficients, to spot subsingular vectors and to set the basis for constructing embedding diagrams. In this paper we present the Adapted Ordering Method for general Lie algebras and superalgebras and their generalizations, provided they can be triangulated. We also review briefly the results obtained for the Virasoro algebra and for the N = 2 and Ramond N = 1 superconformal algebras.

8. Monotone Boolean functions

International Nuclear Information System (INIS)

Korshunov, A D

2003-01-01

Monotone Boolean functions are an important object in discrete mathematics and mathematical cybernetics. Topics related to these functions have been actively studied for several decades. Many results have been obtained, and many papers published. However, until now there has been no sufficiently complete monograph or survey of results of investigations concerning monotone Boolean functions. The object of this survey is to present the main results on monotone Boolean functions obtained during the last 50 years

9. Boolean integral calculus

Science.gov (United States)

Tucker, Jerry H.; Tapia, Moiez A.; Bennett, A. Wayne

1988-01-01

The concept of Boolean integration is developed, and different Boolean integral operators are introduced. Given the changes in a desired function in terms of the changes in its arguments, the ways of 'integrating' (i.e. realizing) such a function, if it exists, are presented. The necessary and sufficient conditions for integrating, in different senses, the expression specifying the changes are obtained. Boolean calculus has applications in the design of logic circuits and in fault analysis.

10. Peer Instruction in an Algebra-Based General Physics Course

Science.gov (United States)

Listerman, Thomas W.

1999-10-01

We have restructured our algebra-based general physics course to increase peer instruction. For the last three years each lecture has been followed by a recitation class. In recitation class students break up into small groups to work on "study guides" concerning the previous lecture. The recitation instructor is available to answer questions and to provide encouragement. The study guides ask qualitative and quantitative questions to lead students step-by-step through the material. Two completed study guides and a homework assignment are submitted each week for grading and the solutions are available later on the internet. Student surveys show the majority of students have a good attitude about the course, like to work in groups with their friends, and like the ready availability of the instructor for help. Both students and faculty seem to like the more frequent one-to-one contact of this format. We have also noticed that one student in each group tends to ask most of the questions and then "translates" the instructor's response into words the others understand. Lest you think "the millenium has arrived," student performance on multiple-choice tests has not improved markedly, some students strongly resist cooperation with others, and many students still think this is the hardest course they have ever taken.

11. (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.

12. 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…

13. Nilpotent algebras of the generalized differential forms and the geometry of superfield theories

International Nuclear Information System (INIS)

Zupnik, B.M.

1991-01-01

We consider a new algebraic approach in the geometry of supergauge theories and supergravity. An introduction of nilpotent algebras simplifies significantly the analysis of D = 3, 4, N = 1 supergravity constraints. Different terms in the invariant action functionals of SG- and SYM-theories are constructed as the integrals of corresponding generalized differential forms. (orig.)

14. A generalized variational algebra and conserved densities for linear evolution equations

International Nuclear Information System (INIS)

Abellanas, L.; Galindo, A.

1978-01-01

The symbolic algebra of Gel'fand and Dikii is generalized to the case of n variables. Using this algebraic approach a rigorous characterization of the polynomial kernel of the variational derivative is given. This is applied to classify all the conservation laws for linear polynomial evolution equations of arbitrary order. (Auth.)

15. Closure of the gauge algebra, generalized Lie equations and Feynman rules

International Nuclear Information System (INIS)

Batalin, I.A.

1984-01-01

A method is given by which an open gauge algebra can always be closed and even made abelian. As a preliminary the generalized Lie equations for the open group are obtained. The Feynman rules for gauge theories with open algebras are derived by reducing the gauge theory to a non-gauge one. (orig.)

16. Boolean representations of simplicial complexes and matroids

CERN Document Server

Rhodes, John

2015-01-01

This self-contained monograph explores a new theory centered around boolean representations of simplicial complexes leading to a new class of complexes featuring matroids as central to the theory. The book illustrates these new tools to study the classical theory of matroids as well as their important geometric connections. Moreover, many geometric and topological features of the theory of matroids find their counterparts in this extended context.   Graduate students and researchers working in the areas of combinatorics, geometry, topology, algebra and lattice theory will find this monograph appealing due to the wide range of new problems raised by the theory. Combinatorialists will find this extension of the theory of matroids useful as it opens new lines of research within and beyond matroids. The geometric features and geometric/topological applications will appeal to geometers. Topologists who desire to perform algebraic topology computations will appreciate the algorithmic potential of boolean represent...

17. Synchronization in an array of coupled Boolean networks

International Nuclear Information System (INIS)

Li, Rui; Chu, Tianguang

2012-01-01

This Letter presents an analytical study of synchronization in an array of coupled deterministic Boolean networks. A necessary and sufficient criterion for synchronization is established based on algebraic representations of logical dynamics in terms of the semi-tensor product of matrices. Some basic properties of a synchronized array of Boolean networks are then derived for the existence of transient states and the upper bound of the number of fixed points. Particularly, an interesting consequence indicates that a “large” mismatch between two coupled Boolean networks in the array may result in loss of synchrony in the entire system. Examples, including the Boolean model of coupled oscillations in the cell cycle, are given to illustrate the present results. -- Highlights: ► We analytically study synchronization in an array of coupled Boolean networks. ► The study is based on the algebraic representations of logical dynamics. ► A necessary and sufficient algebraic criterion for synchronization is established. ► It reveals some basic properties of a synchronized array of Boolean networks. ► A large mismatch between two coupled networks may result in the loss of synchrony.

18. Generalized space-time supersymmetries, division algebras and octonionic M-theory

International Nuclear Information System (INIS)

Lukierski, Jerzy; Toppan, Francesco

2002-03-01

We describe the set of generalized Poincare and conformal superalgebras in D= 4,5 and 7 dimensions as two sequences of superalgebraic structures, taking values in the division algebras R, C and H. The generalized conformal superalgebras are described for D = 4 by OSp(1;8|R), for D = 5 by SU(4,4;1) and for D = 7 by U α U (8;1|H). The relation with other schemes, in particular the framework of conformal spin (super) algebras and Jordan (super) algebras is discussed. By extending the division-algebra-valued super-algebras to octonions we get in D= 11 an octonionic generalized Poincare superalgebra, which we call octonionic M-algebra, describing the octonionic M-theory. It contains 32 real supercharges but, due to the octonionic structure only 52 real bosonic generators remain independent in place of the 528 bosonic charges of standard M-algebra. In octonionic M-theory there is a sort of equivalence between the octonionic M2 (supermembrane) and the octonionic M5 (super-5-brane) sectors. We also define the octonionic generalized conformal M-superalgebra with 239 bosonic generators. (author)

19. Algebraic features of some generalizations of the Lotka-Volterra system

Science.gov (United States)

Bibik, Yu. V.; Sarancha, D. A.

2010-10-01

For generalizations of the Lotka-Volterra system, an integration method is proposed based on the nontrivial algebraic structure of these generalizations. The method makes use of an auxiliary first-order differential equation derived from the phase curve equation with the help of this algebraic structure. Based on this equation, a Hamiltonian approach can be developed and canonical variables (moreover, action-angle variables) can be constructed.

20. More on PT-Symmetry in (Generalized Effect Algebras and Partial Groups

Directory of Open Access Journals (Sweden)

J. Paseka

2011-01-01

Full Text Available We continue in the direction of our paper on PT-Symmetry in (Generalized Effect Algebras and Partial Groups. Namely we extend our considerations to the setting of weakly ordered partial groups. In this setting, any operator weakly ordered partial group is a pasting of its partially ordered commutative subgroups of linear operators with a fixed dense domain over bounded operators. Moreover, applications of our approach for generalized effect algebras are mentioned.

1. To Boolean or Not To Boolean.

Science.gov (United States)

Hildreth, Charles R.

1983-01-01

This editorial addresses the issue of whether or not to provide free-text, keyword/boolean search capabilities in the information retrieval mechanisms of online public access catalogs and discusses online catalogs developed prior to 1980--keyword searching, phrase searching, and precoordination and postcoordination. (EJS)

2. Refinement monoids, equidecomposability types, and boolean inverse semigroups

CERN Document Server

Wehrung, Friedrich

2017-01-01

Adopting a new universal algebraic approach, this book explores and consolidates the link between Tarski's classical theory of equidecomposability types monoids, abstract measure theory (in the spirit of Hans Dobbertin's work on monoid-valued measures on Boolean algebras) and the nonstable K-theory of rings. This is done via the study of a monoid invariant, defined on Boolean inverse semigroups, called the type monoid. The new techniques contrast with the currently available topological approaches. Many positive results, but also many counterexamples, are provided.

3. Chiral W-gravities for general extended conformal algebras

International Nuclear Information System (INIS)

Hull, C.M.

1991-01-01

The gauging of any chiral extended conformal symmetry of any two-dimensional field theory is achieved by coupling to the appropriate chiral W-gravity. Only a linear coupling to the W-gravity gauge fields is needed. The gauging of algebras with central charges requires the introduction of spin-zero gauge fields corresponding to the central charges. The example of Liouville theory is discussed in detail and a new way of coupling it to gravity is obtained. (orig.)

4. Differential properties of the Zorn algebra in general relativity

International Nuclear Information System (INIS)

Oliveira, C.G.; Maia, M.D.

1977-01-01

The covariant differential properties of the split Cayley subalgebra of local quaternion tetrads is considered. Referred to this local quaternion tetrad the several geometrical objects are given in terms of Zorn-Weyl matrices. Associated to a pair of real null vectors, two-component spinor fields over the curved space and the associated Zorn-Weyl matrices are defined, which satisfy the Dirac equation written in terms of the Zorn algebra. (L.C.) [pt

5. Algebraic structure of a generalized coupled dispersionless system

International Nuclear Information System (INIS)

Victor, Kuetche Kamgang; Thomas, Bouetou Bouetou; Kofane, Timoleon Crepin

2006-01-01

We study a physical model of the O(3)-invariant coupled integrable dispersionless equations that describes the dynamic of a focused system within the background of a plane gravitational field. The investigation is carried out both numerically and analytically, and realized beneath some assumptions superseding the structure constant with the structure function implemented in Lie algebra and quasigroup theory, respectively. The energy density and topological structures such as loop soliton are examined

6. Developing Pre-Algebraic Thinking in Generalizing Repeating Pattern Using SOLO Model

Science.gov (United States)

Lian, Lim Hooi; Yew, Wun Thiam

2011-01-01

In this paper, researchers discussed the application of the generalization perspective in helping the primary school pupils to develop their pre-algebraic thinking in generalizing repeating pattern. There are two main stages of the generalization perspective had been adapted, namely investigating and generalizing the pattern. Since the Biggs and…

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

8. Generalization of the linear algebraic method to three dimensions

International Nuclear Information System (INIS)

Lynch, D.L.; Schneider, B.I.

1991-01-01

We present a numerical method for the solution of the Lippmann-Schwinger equation for electron-molecule collisions. By performing a three-dimensional numerical quadrature, this approach avoids both a basis-set representation of the wave function and a partial-wave expansion of the scattering potential. The resulting linear equations, analogous in form to the one-dimensional linear algebraic method, are solved with the direct iteration-variation method. Several numerical examples are presented. The prospect for using this numerical quadrature scheme for electron-polyatomic molecules is discussed

9. Generalized Lotka—Volterra systems connected with simple Lie algebras

International Nuclear Information System (INIS)

Charalambides, Stelios A; Damianou, Pantelis A; Evripidou, Charalambos A

2015-01-01

We devise a new method for producing Hamiltonian systems by constructing the corresponding Lax pairs. This is achieved by considering a larger subset of the positive roots than the simple roots of the root system of a simple Lie algebra. We classify all subsets of the positive roots of the root system of type A n for which the corresponding Hamiltonian systems are transformed, via a simple change of variables, to Lotka-Volterra systems. For some special cases of subsets of the positive roots of the root system of type A n , we produce new integrable Hamiltonian systems. (paper)

10. Generalized Lotka—Volterra systems connected with simple Lie algebras

Science.gov (United States)

Charalambides, Stelios A.; Damianou, Pantelis A.; Evripidou, Charalambos A.

2015-06-01

We devise a new method for producing Hamiltonian systems by constructing the corresponding Lax pairs. This is achieved by considering a larger subset of the positive roots than the simple roots of the root system of a simple Lie algebra. We classify all subsets of the positive roots of the root system of type An for which the corresponding Hamiltonian systems are transformed, via a simple change of variables, to Lotka-Volterra systems. For some special cases of subsets of the positive roots of the root system of type An, we produce new integrable Hamiltonian systems.

11. Solving the generalized Langevin equation with the algebraically correlated noise

International Nuclear Information System (INIS)

Srokowski, T.; Ploszajczak, M.

1997-01-01

The Langevin equation with the memory kernel is solved. The stochastic force possesses algebraic correlations, proportional to 1/t. The velocity autocorrelation function and related quantities characterizing transport properties are calculated at the assumption that the system is in the thermal equilibrium. Stochastic trajectories are simulated numerically, using the kangaroo process as a noise generator. Results of this simulation resemble Levy walks with divergent moments of the velocity distribution. The motion of a Brownian particle is considered both without any external potential and in the harmonic oscillator field, in particular the escape from a potential well. The results are compared with memory-free calculations for the Brownian particle. (author)

12. Algebraic structures in generalized Clifford analysis and applications to boundary value problems

Directory of Open Access Journals (Sweden)

José Játem

2015-12-01

Full Text Available The present article has a threefold purpose: First it is a survey of the algebraic structures of generalized Clifford-type algebras and shows the main results of the corresponding Clifford-type analysis and its application to boundary value problems known so far. Second it is aimed to implement algorithms to provide the fast and accurate computation of boundary value problems for inhomogeneous equations in the framework of the generalized Clifford analysis. Finally it is also aimed to encourage the development of a generalized discrete Clifford analysis.

13. The generalized algebraic modal combination (GAC) rule validation program

International Nuclear Information System (INIS)

Mertens, P.G.; Culot, M.V.; Sahgal, S.; Tinic, S.

1991-01-01

With R.G. 1.92 the NRC imposes to use the absolute values of the modal responses when performing Response Spectra modal combination with coupling factors derived from the current heuristic, stationary or pseudo-stationary random vibration models. This results in overly conservative calculations in the case of closely spaced modes of opposite signs, a case frequently encountered in dynamic analyses in particular when systems with close modal frequencies have a small mass ratio. A new generalised algebraic combination (GAC) formula and its associated coupling factor have been theoretically derived by the first author. It is based on a non-stationary, non-white noise random vibration model which fully accounts for all the time and frequency dependent aspects of the time histories. This should allow the conservative use of algebraic signs in the modal combination over the whole frequency range, and allow a derogation to the current NRC R.G. 1.92 practice to use absolute signs. The use of the industry wide accepted RS method with the GAC rule will result in more economical and safer NPPs through the reduction of an excessive and unrealistic number of seismic restraints and avoidance of prematurely fatigued plants. It is envisaged to use the GAC seismic response combination method for the evaluation of the seismic response of auxiliary class one lines attached to the primary coolant loop piping of the Beznau 1 and 2 nuclear power plants. Since the plant is in operation, it is imperative to use a methodology which is conservative but still as realistic as possible. The paper presents an introduction to the GAC rule and some aspects of the validation program, which will jointly be undertaken by WESI and NOK for obtaining acceptance by the Swiss Safety Authorities for a seismic qualification program. (author)

14. Algebraic and stochastic coding theory

CERN Document Server

Kythe, Dave K

2012-01-01

Using a simple yet rigorous approach, Algebraic and Stochastic Coding Theory makes the subject of coding theory easy to understand for readers with a thorough knowledge of digital arithmetic, Boolean and modern algebra, and probability theory. It explains the underlying principles of coding theory and offers a clear, detailed description of each code. More advanced readers will appreciate its coverage of recent developments in coding theory and stochastic processes. After a brief review of coding history and Boolean algebra, the book introduces linear codes, including Hamming and Golay codes.

15. On the Computation of Comprehensive Boolean Gröbner Bases

Science.gov (United States)

Inoue, Shutaro

We show that a comprehensive Boolean Gröbner basis of an ideal I in a Boolean polynomial ring B (bar A,bar X) with main variables bar X and parameters bar A can be obtained by simply computing a usual Boolean Gröbner basis of I regarding both bar X and bar A as variables with a certain block term order such that bar X ≫ bar A. The result together with a fact that a finite Boolean ring is isomorphic to a direct product of the Galois field mathbb{GF}_2 enables us to compute a comprehensive Boolean Gröbner basis by only computing corresponding Gröbner bases in a polynomial ring over mathbb{GF}_2. Our implementation in a computer algebra system Risa/Asir shows that our method is extremely efficient comparing with existing computation algorithms of comprehensive Boolean Gröbner bases.

16. Some properties of generalized biregular functions with values in a Clifford algebra

International Nuclear Information System (INIS)

Le Hung Son; Tran Quyet Thang.

1992-09-01

In this paper some properties of holomorphic functions such as the Identity Theorem, the Maximum Modulus Principle, the Hartogs Extension Theorem are proved for a class of more general functions taking values in a Clifford algebra than the regular and biregular functions. (author). 7 refs

17. A general conservative extension theorem in process algebras with inequalities

NARCIS (Netherlands)

d' Argenio, P.R.; Verhoef, Chris

1997-01-01

We prove a general conservative extension theorem for transition system based process theories with easy-to-check and reasonable conditions. The core of this result is another general theorem which gives sufficient conditions for a system of operational rules and an extension of it in order to

18. Stability of a Generalized Euler-Lagrange Type Additive Mapping and Homomorphisms in C∗-Algebras

Directory of Open Access Journals (Sweden)

Abbas Najati

2009-01-01

Full Text Available Let X,Y be Banach modules over a C∗-algebra and let r1,…,rn∈ℝ be given. We prove the generalized Hyers-Ulam stability of the following functional equation in Banach modules over a unital C∗-algebra: ∑j=1nf(−rjxj+∑1≤i≤n,i≠jrixi+2∑i=1nrif(xi=nf(∑i=1nrixi. We show that if ∑i=1nri≠0, ri,rj≠0 for some 1≤ialgebras.

19. Dynamics of random Boolean networks under fully asynchronous stochastic update based on linear representation.

Directory of Open Access Journals (Sweden)

Chao Luo

Full Text Available A novel algebraic approach is proposed to study dynamics of asynchronous random Boolean networks where a random number of nodes can be updated at each time step (ARBNs. In this article, the logical equations of ARBNs are converted into the discrete-time linear representation and dynamical behaviors of systems are investigated. We provide a general formula of network transition matrices of ARBNs as well as a necessary and sufficient algebraic criterion to determine whether a group of given states compose an attractor of length[Formula: see text] in ARBNs. Consequently, algorithms are achieved to find all of the attractors and basins in ARBNs. Examples are showed to demonstrate the feasibility of the proposed scheme.

20. Generalized spectral radius and its max algebra version

Czech Academy of Sciences Publication Activity Database

2013-01-01

Roč. 439, č. 4 (2013), s. 1006-1016 ISSN 0024-3795 R&D Projects: GA ČR GA201/09/0473; GA AV ČR IAA100190903 Institutional support: RVO:67985840 Keywords : generalized spectral radius * joint spectral radius * Berger-Wang formula Subject RIV: BA - General Mathematics Impact factor: 0.983, year: 2013 http://www.sciencedirect.com/science/article/pii/S0024379512007380

1. Evolutionary Algorithms for Boolean Queries Optimization

Czech Academy of Sciences Publication Activity Database

Húsek, Dušan; Snášel, Václav; Neruda, Roman; Owais, S.S.J.; Krömer, P.

2006-01-01

Roč. 3, č. 1 (2006), s. 15-20 ISSN 1790-0832 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * information retrieval * Boolean query Subject RIV: BA - General Mathematics

2. 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.

3. General construction of the Virasoro algebra from superalgebras

International Nuclear Information System (INIS)

Frappat, L.; Ragoucy, E.; Thuillier, F.

1991-02-01

The Master equations leading to a generalization of the Sugawara construction for superalgebras are given. The OSp(1|2) k case is worked out in detail. In particular, a new continuous one parameter solution is found at level k=4, which is related by K-conjugation to the continuous solution of SU(2) 4 . This new solution for OSp(1|2) 4 corresponds to the sum of a theory of a free boson (c=1) and of a model of a non-unitary minimal series with c=-14/11. (author) 13 refs., 2 tabs

4. Singular vectors and invariant equations for the Schroedinger algebra in n ≥ 3 space dimensions. The general case

International Nuclear Information System (INIS)

Dobrev, V. K.; Stoimenov, S.

2010-01-01

The singular vectors in Verma modules over the Schroedinger algebra s(n) in (n + 1)-dimensional space-time are found for the case of general representations. Using the singular vectors, hierarchies of equations invariant under Schroedinger algebras are constructed.

5. 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)

6. Computational complexity of Boolean functions

Energy Technology Data Exchange (ETDEWEB)

Korshunov, Aleksei D [Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk (Russian Federation)

2012-02-28

Boolean functions are among the fundamental objects of discrete mathematics, especially in those of its subdisciplines which fall under mathematical logic and mathematical cybernetics. The language of Boolean functions is convenient for describing the operation of many discrete systems such as contact networks, Boolean circuits, branching programs, and some others. An important parameter of discrete systems of this kind is their complexity. This characteristic has been actively investigated starting from Shannon's works. There is a large body of scientific literature presenting many fundamental results. The purpose of this survey is to give an account of the main results over the last sixty years related to the complexity of computation (realization) of Boolean functions by contact networks, Boolean circuits, and Boolean circuits without branching. Bibliography: 165 titles.

7. A Family of Finite-Dimensional Representations of Generalized Double Affine Hecke Algebras of Higher Rank

Science.gov (United States)

Fu, Yuchen; Shelley-Abrahamson, Seth

2016-06-01

We give explicit constructions of some finite-dimensional representations of generalized double affine Hecke algebras (GDAHA) of higher rank using R-matrices for U_q(sl_N). Our construction is motivated by an analogous construction of Silvia Montarani in the rational case. Using the Drinfeld-Kohno theorem for Knizhnik-Zamolodchikov differential equations, we prove that the explicit representations we produce correspond to Montarani's representations under a monodromy functor introduced by Etingof, Gan, and Oblomkov.

8. Generalized Boolean Functions as Combiners

Science.gov (United States)

2017-06-01

of large runs of ones [6]. The fifth test is the Binary Rank Matrix test. This test looks at the rank of disjoint sub- matrices of the entire sequence...matrices to be of size 32x32. The sub-matrices are filled in row by row from the original 17 sequence. The rank for each sub- matrix is then computed...amLeng t h : 57 #LFSRS 58 f o r i in range ( 0 , l en ( l f s r s ) ) : 59 x i = reduce ( lambda x , y : x^y , map ( lambda x : l f s r s [ i

9. Circulant Matrices and Affine Equivalence of Monomial Rotation Symmetric Boolean Functions

Science.gov (United States)

2015-01-01

degree of the MRS is, we have a similar result as [40, Theorem 1.1] for n = 4p (p prime), or squarefree integers n, which along with our Theorem 5.2...Boolean functions: Construction and analysis in terms of algebraic immunity, in: H. Gilbert, H. Handschuh (Eds.), Fast Software Encryption, in: LNCS...vol. 1403, Springer-Verlag, 1998, pp. 475–488. [20] J.E. Fuller, Analysis of affine equivalent Boolean functions for cryptography (Ph.D. thesis

10. A q-Schroedinger algebra, its lowest weight representations and generalized q-deformed heat equations

International Nuclear Information System (INIS)

Dobrev, V.K.; Doebner, H.D.; Mrugalla, C.

1995-12-01

We give a q-deformation S-perpendicular q of the centrally extended Schroedinger algebra. We construct the lowest weight representations of S-perpendicular q , starting from the Verma modules over S-perpendicular q , finding their singular vectors and factoring the Verma submodules built on the singular vectors. We also give a vector-field realization of S-perpendicular q which provides polynomial realization of the lowest weight representations and an infinite hierarchy of q-difference equations which may be called generalized q-deformed heat equations. We also apply our methods to the on-shell q-Schroedinger algebra proposed by Floreanini and Vinet. (author). 12 refs

11. Extension of relational event algebra to a general decision making setting

Energy Technology Data Exchange (ETDEWEB)

Goodman, I.R.; Kramer, G.F.

1996-12-31

Relational Event Algebra (REA) is a new mathematical tool which provides an explicit algebraic reconstruction of events (appropriately designated as relational events) when initially only the formal probability values of such events are given as functions of known contributing event probabilities. In turn, once such relational events are obtained, one can then determine the probability of any finite logical combination, and in particular, various probabilistic distance measures among the events. A basic application of REA is to test hypotheses for the similarity of distinct models attempting to describe the same events such as in data fusion and combination of evidence. This paper considers new motivation for the use of REA, as well as a more general decision-making framework where system performance and redundancy / consistency tradeoffs are considered.

12. Vectorial Resilient PC(l) of Order k Boolean Functions from AG-Codes

Institute of Scientific and Technical Information of China (English)

Hao CHEN; Liang MA; Jianhua LI

2011-01-01

Propagation criteria and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1- 4, 7, 8, 10, 11, 16]). Kurosawa, Stoh [8] and Carlet [1]gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper, the algebraic-geometric codes over GF(2m) are used to modify the Carlet and Kurosawa-Satoh's construction for giving vectorial resilient Boolean functions satisfying PC(l) of order k criterion. This new construction is compared with previously known results.

13. Distributivity of the algebra of regular open subsets of .beta. R / R

Czech Academy of Sciences Publication Activity Database

Balcar, Bohuslav; Hrušák, M.

2005-01-01

Roč. 149, č. 1 (2005), s. 1-7 ISSN 0166-8641 R&D Projects: GA ČR(CZ) GA201/03/0933; GA ČR(CZ) GA201/02/0857 Institutional research plan: CEZ:AV0Z10190503 Keywords : distributivity of Boolean algebras * cardinal invariants of the continuum * Čech-Stone compactification Subject RIV: BA - General Mathematics Impact factor: 0.297, year: 2005

14. Heisenberg XXX Model with General Boundaries: Eigenvectors from Algebraic Bethe Ansatz

Directory of Open Access Journals (Sweden)

Samuel Belliard

2013-11-01

Full Text Available We propose a generalization of the algebraic Bethe ansatz to obtain the eigenvectors of the Heisenberg spin chain with general boundaries associated to the eigenvalues and the Bethe equations found recently by Cao et al. The ansatz takes the usual form of a product of operators acting on a particular vector except that the number of operators is equal to the length of the chain. We prove this result for the chains with small length. We obtain also an off-shell equation (i.e. satisfied without the Bethe equations formally similar to the ones obtained in the periodic case or with diagonal boundaries.

15. (m,n-Semirings and a Generalized Fault-Tolerance Algebra of Systems

Directory of Open Access Journals (Sweden)

Syed Eqbal Alam

2013-01-01

Full Text Available We propose a new class of mathematical structures called (m,n-semirings (which generalize the usual semirings and describe their basic properties. We define partial ordering and generalize the concepts of congruence, homomorphism, and so forth, for (m,n-semirings. Following earlier work by Rao (2008, we consider systems made up of several components whose failures may cause them to fail and represent the set of such systems algebraically as an (m,n-semiring. Based on the characteristics of these components, we present a formalism to compare the fault-tolerance behavior of two systems using our framework of a partially ordered (m,n-semiring.

16. Study on generalized Toda mechanics system with loop algebra L(Dr)

International Nuclear Information System (INIS)

Zhu Qiao; Yang Zhanying; Shi Kangjie

2005-01-01

The authors generalize the Toda mechanics system with long range interaction to the case of Loop algebra L(D r ). By using a pair of ordered positive integer (X, Y) to describe Toda chains, authors extract the equation of motion and the Hamiltonian structure of this system for (3, 2) Toda chain. It turns out that both extra coordinates and standard Toda variables are Poisson non-commutative in the case of nontrivial generalization, and for some case, extra variables appear linearly on the right hand side of the Poisson bracket. (authors)

17. Cryptographic Boolean functions and applications

CERN Document Server

Cusick, Thomas W

2009-01-01

Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research.-Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions -Provides engineers and scient...

18. Geometric Operators on Boolean Functions

DEFF Research Database (Denmark)

In truth-functional propositional logic, any propositional formula represents a Boolean function (according to some valuation of the formula). We describe operators based on Decartes' concept of constructing coordinate systems, for translation of a propositional formula to the image of a Boolean...... function. With this image of a Boolean function corresponding to a propositional formula, we prove that the orthogonal projection operator leads to a theorem describing all rules of inference in propositional reasoning. In other words, we can capture all kinds of inference in propositional logic by means...... of a few geometric operators working on the images of Boolean functions. The operators we describe, arise from the niche area of array-based logic and have previously been tightly bound to an array-based representation of Boolean functions. We redefine the operators in an abstract form to make them...

19. 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.

20. 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.

1. On flux integrals for generalized Melvin solution related to simple finite-dimensional Lie algebra

Energy Technology Data Exchange (ETDEWEB)

Ivashchuk, V.D. [VNIIMS, Center for Gravitation and Fundamental Metrology, Moscow (Russian Federation); Peoples' Friendship University of Russia (RUDN University), Institute of Gravitation and Cosmology, Moscow (Russian Federation)

2017-10-15

A generalized Melvin solution for an arbitrary simple finite-dimensional Lie algebra G is considered. The solution contains a metric, n Abelian 2-forms and n scalar fields, where n is the rank of G. It is governed by a set of n moduli functions H{sub s}(z) obeying n ordinary differential equations with certain boundary conditions imposed. It was conjectured earlier that these functions should be polynomials - the so-called fluxbrane polynomials. These polynomials depend upon integration constants q{sub s}, s = 1,.., n. In the case when the conjecture on the polynomial structure for the Lie algebra G is satisfied, it is proved that 2-form flux integrals Φ{sup s} over a proper 2d submanifold are finite and obey the relations q{sub s} Φ{sup s} = 4πn{sub s}h{sub s}, where the h{sub s} > 0 are certain constants (related to dilatonic coupling vectors) and the n{sub s} are powers of the polynomials, which are components of a twice dual Weyl vector in the basis of simple (co-)roots, s = 1,.., n. The main relations of the paper are valid for a solution corresponding to a finite-dimensional semi-simple Lie algebra G. Examples of polynomials and fluxes for the Lie algebras A{sub 1}, A{sub 2}, A{sub 3}, C{sub 2}, G{sub 2} and A{sub 1} + A{sub 1} are presented. (orig.)

2. 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.

3. Modeling digital switching circuits with linear algebra

CERN Document Server

Thornton, Mitchell A

2014-01-01

Modeling Digital Switching Circuits with Linear Algebra describes an approach for modeling digital information and circuitry that is an alternative to Boolean algebra. While the Boolean algebraic model has been wildly successful and is responsible for many advances in modern information technology, the approach described in this book offers new insight and different ways of solving problems. Modeling the bit as a vector instead of a scalar value in the set {0, 1} allows digital circuits to be characterized with transfer functions in the form of a linear transformation matrix. The use of transf

4. Algebraic equations for the exceptional eigenspectrum of the generalized Rabi model

International Nuclear Information System (INIS)

Li, Zi-Min; Batchelor, Murray T

2015-01-01

We obtain the exceptional part of the eigenspectrum of the generalized Rabi model, also known as the driven Rabi model, in terms of the roots of a set of algebraic equations. This approach provides a product form for the wavefunction components and allows an explicit connection with recent results obtained for the wavefunction in terms of truncated confluent Heun functions. Other approaches are also compared. For particular parameter values the exceptional part of the eigenspectrum consists of doubly degenerate crossing points. We give a proof for the number of roots of the constraint polynomials and discuss the number of crossing points. (paper)

5. Operator algebras for general one-dimensional quantum mechanical potentials with discrete spectrum

International Nuclear Information System (INIS)

Wuensche, Alfred

2002-01-01

We define general lowering and raising operators of the eigenstates for one-dimensional quantum mechanical potential problems leading to discrete energy spectra and investigate their associative algebra. The Hamilton operator is quadratic in these lowering and raising operators and corresponding representations of operators for action and angle are found. The normally ordered representation of general operators using combinatorial elements such as partitions is derived. The introduction of generalized coherent states is discussed. Linear laws for the spacing of the energy eigenvalues lead to the Heisenberg-Weyl group and general quadratic laws of level spacing to unitary irreducible representations of the Lie group SU(1, 1) that is considered in detail together with a limiting transition from this group to the Heisenberg-Weyl group. The relation of the approach to quantum deformations is discussed. In two appendices, the classical and quantum mechanical treatment of the squared tangent potential is presented as a special case of a system with quadratic level spacing

6. Sensitivity theory for general non-linear algebraic equations with constraints

International Nuclear Information System (INIS)

Oblow, E.M.

1977-04-01

Sensitivity theory has been developed to a high state of sophistication for applications involving solutions of the linear Boltzmann equation or approximations to it. The success of this theory in the field of radiation transport has prompted study of possible extensions of the method to more general systems of non-linear equations. Initial work in the U.S. and in Europe on the reactor fuel cycle shows that the sensitivity methodology works equally well for those non-linear problems studied to date. The general non-linear theory for algebraic equations is summarized and applied to a class of problems whose solutions are characterized by constrained extrema. Such equations form the basis of much work on energy systems modelling and the econometrics of power production and distribution. It is valuable to have a sensitivity theory available for these problem areas since it is difficult to repeatedly solve complex non-linear equations to find out the effects of alternative input assumptions or the uncertainties associated with predictions of system behavior. The sensitivity theory for a linear system of algebraic equations with constraints which can be solved using linear programming techniques is discussed. The role of the constraints in simplifying the problem so that sensitivity methodology can be applied is highlighted. The general non-linear method is summarized and applied to a non-linear programming problem in particular. Conclusions are drawn in about the applicability of the method for practical problems

7. Generalization of the Greenberger-Horne-Zeilinger algebraic proof of nonlocality

International Nuclear Information System (INIS)

Clifton, R.K.; Redhead, M.L.G.; Butterfield, J.N.

1991-01-01

The authors further develop a recent new proof (by Greenberger, Horne, and Zeilinger - GHZ) that local deterministic hidden-variable theories are inconsistent with certain strict correlations predicted by quantum mechanics. First, they generalize GHZ's proof so that it applied to factorable stochastic theories in which apparatus hidden variables are casually relevant to measurement results, and theories in which the hidden variables evolve indeterministically prior to the particle-apparatus interactions. Then they adopt a more general measure-theoretic approach which requires that GHZ's argument be modified in order to produce a valid proof. Finally, they motivate the more general proof's assumptions in a somewhat different way from previous authors in order to strengthen the implications of the proof as much as possible. After developing GHZ's proof along these lines, they then consider the analogue, for their proof, of Bohr's reply to the EPR argument, and conclude (pace GHZ) that in at least one respect (viz, that of most concern to Bohr) the proof is no more powerful than Bell's. Nevertheless, they point out some new advantages of their proof over Bell's, and over other algebraic proofs of nonlocality. And they conclude by giving a modified version of their proof that, like Bell's does not rely on experimentally unrealizable strict correlations, but still leads to a testable quasi-algebraic locality inequality

8. Representations for the generalized Drazin inverse of the sum in a Banach algebra and its application for some operator matrices.

Science.gov (United States)

Liu, Xiaoji; Qin, Xiaolan

2015-01-01

We investigate additive properties of the generalized Drazin inverse in a Banach algebra A. We find explicit expressions for the generalized Drazin inverse of the sum a + b, under new conditions on a, b ∈ A. As an application we give some new representations for the generalized Drazin inverse of an operator matrix.

9. Computing preimages of Boolean networks.

Science.gov (United States)

Klotz, Johannes; Bossert, Martin; Schober, Steffen

2013-01-01

In this paper we present an algorithm based on the sum-product algorithm that finds elements in the preimage of a feed-forward Boolean networks given an output of the network. Our probabilistic method runs in linear time with respect to the number of nodes in the network. We evaluate our algorithm for randomly constructed Boolean networks and a regulatory network of Escherichia coli and found that it gives a valid solution in most cases.

10. On generalized Melvin solution for the Lie algebra E{sub 6}

Energy Technology Data Exchange (ETDEWEB)

Bolokhov, S.V. [Peoples' Friendship University of Russia (RUDN University), Moscow (Russian Federation); Ivashchuk, V.D. [VNIIMS, Center for Gravitation and Fundamental Metrology, Moscow (Russian Federation); Peoples' Friendship University of Russia (RUDN University), Moscow (Russian Federation)

2017-10-15

A multidimensional generalization of Melvin's solution for an arbitrary simple Lie algebra G is considered. The gravitational model in D dimensions, D ≥ 4, contains n 2-forms and l ≥ n scalar fields, where n is the rank of G. The solution is governed by a set of n functions H{sub s}(z) obeying n ordinary differential equations with certain boundary conditions imposed. It was conjectured earlier that these functions should be polynomials (the so-called fluxbrane polynomials). The polynomials H{sub s}(z), s = 1,.., 6, for the Lie algebra E{sub 6} are obtained and a corresponding solution for l = n = 6 is presented. The polynomials depend upon integration constants Q{sub s}, s = 1,.., 6. They obey symmetry and duality identities. The latter ones are used in deriving asymptotic relations for solutions at large distances. The power-law asymptotic relations for E{sub 6}-polynomials at large z are governed by the integer-valued matrix ν = A{sup -1}(I + P), where A{sup -1} is the inverse Cartan matrix, I is the identity matrix and P is a permutation matrix, corresponding to a generator of the Z{sub 2}-group of symmetry of the Dynkin diagram. The 2-form fluxes Φ{sup s}, s = 1,.., 6, are calculated. (orig.)

11. Z2×Z2 generalizations of 𝒩 =2 super Schrödinger algebras and their representations

Science.gov (United States)

Aizawa, N.; Segar, J.

2017-11-01

We generalize the real and chiral N =2 super Schrödinger algebras to Z2×Z2-graded Lie superalgebras. This is done by D-module presentation, and as a consequence, the D-module presentations of Z2×Z2-graded superalgebras are identical to the ones of super Schrödinger algebras. We then generalize the calculus over the Grassmann number to Z2×Z2 setting. Using it and the standard technique of Lie theory, we obtain a vector field realization of Z2×Z2-graded superalgebras. A vector field realization of the Z2×Z2 generalization of N =1 super Schrödinger algebra is also presented.

12. 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

13. General algebraic method applied to control analysis of complex engine types

Science.gov (United States)

Boksenbom, Aaron S; Hood, Richard

1950-01-01

A general algebraic method of attack on the problem of controlling gas-turbine engines having any number of independent variables was utilized employing operational functions to describe the assumed linear characteristics for the engine, the control, and the other units in the system. Matrices were used to describe the various units of the system, to form a combined system showing all effects, and to form a single condensed matrix showing the principal effects. This method directly led to the conditions on the control system for noninteraction so that any setting disturbance would affect only its corresponding controlled variable. The response-action characteristics were expressed in terms of the control system and the engine characteristics. The ideal control-system characteristics were explicitly determined in terms of any desired response action.

14. Microcanonical ensemble and algebra of conserved generators for generalized quantum dynamics

International Nuclear Information System (INIS)

1996-01-01

It has recently been shown, by application of statistical mechanical methods to determine the canonical ensemble governing the equilibrium distribution of operator initial values, that complex quantum field theory can emerge as a statistical approximation to an underlying generalized quantum dynamics. This result was obtained by an argument based on a Ward identity analogous to the equipartition theorem of classical statistical mechanics. We construct here a microcanonical ensemble which forms the basis of this canonical ensemble. This construction enables us to define the microcanonical entropy and free energy of the field configuration of the equilibrium distribution and to study the stability of the canonical ensemble. We also study the algebraic structure of the conserved generators from which the microcanonical and canonical ensembles are constructed, and the flows they induce on the phase space. copyright 1996 American Institute of Physics

15. Generalized Knizhnik-Zamolodchikov equation for Ding-Iohara-Miki algebra

Science.gov (United States)

Awata, Hidetoshi; Kanno, Hiroaki; Mironov, Andrei; Morozov, Alexei; Morozov, Andrey; Ohkubo, Yusuke; Zenkevich, Yegor

2017-07-01

We derive the generalization of the Knizhnik-Zamolodchikov equation (KZE) associated with the Ding-Iohara-Miki algebra Uq ,t(gl^ ^ 1) . We demonstrate that certain refined topological string amplitudes satisfy these equations and find that the braiding transformations are performed by the R matrix of Uq ,t(gl^ ^ 1) . The resulting system is the uplifting of the u^1 Wess-Zumino-Witten model. The solutions to the (q ,t ) KZE are identified with the (spectral dual of) building blocks of the Nekrasov partition function for five-dimensional linear quiver gauge theories. We also construct an elliptic version of the KZE and discuss its modular and monodromy properties, the latter being related to a dual version of the KZE.

16. The algebra of the general Markov model on phylogenetic trees and networks.

Science.gov (United States)

Sumner, J G; Holland, B R; Jarvis, P D

2012-04-01

It is known that the Kimura 3ST model of sequence evolution on phylogenetic trees can be extended quite naturally to arbitrary split systems. However, this extension relies heavily on mathematical peculiarities of the associated Hadamard transformation, and providing an analogous augmentation of the general Markov model has thus far been elusive. In this paper, we rectify this shortcoming by showing how to extend the general Markov model on trees to include incompatible edges; and even further to more general network models. This is achieved by exploring the algebra of the generators of the continuous-time Markov chain together with the “splitting” operator that generates the branching process on phylogenetic trees. For simplicity, we proceed by discussing the two state case and then show that our results are easily extended to more states with little complication. Intriguingly, upon restriction of the two state general Markov model to the parameter space of the binary symmetric model, our extension is indistinguishable from the Hadamard approach only on trees; as soon as any incompatible splits are introduced the two approaches give rise to differing probability distributions with disparate structure. Through exploration of a simple example, we give an argument that our extension to more general networks has desirable properties that the previous approaches do not share. In particular, our construction allows for convergent evolution of previously divergent lineages; a property that is of significant interest for biological applications.

17. Three-dimensional spin-3 theories based on general kinematical algebras

Energy Technology Data Exchange (ETDEWEB)

Bergshoeff, Eric [Van Swinderen Institute for Particle Physics and Gravity, University of Groningen,Nijenborgh 4, 9747 AG Groningen (Netherlands); Grumiller, Daniel; Prohazka, Stefan [Institute for Theoretical Physics, TU Wien,Wiedner Hauptstrasse 8-10/136, A-1040 Vienna (Austria); Rosseel, Jan [Albert Einstein Center for Fundamental Physics, University of Bern,Sidlerstrasse 5, 3012 Bern (Switzerland); Faculty of Physics, University of Vienna,Boltzmanngasse 5, A-1090 Vienna (Austria)

2017-01-25

We initiate the study of non- and ultra-relativistic higher spin theories. For sake of simplicity we focus on the spin-3 case in three dimensions. We classify all kinematical algebras that can be obtained by all possible Inönü-Wigner contraction procedures of the kinematical algebra of spin-3 theory in three dimensional (anti-) de Sitter space-time. We demonstrate how to construct associated actions of Chern-Simons type, directly in the ultra-relativistic case and by suitable algebraic extensions in the non-relativistic case. We show how to give these kinematical algebras an infinite-dimensional lift by imposing suitable boundary conditions in a theory we call “Carroll Gravity”, whose asymptotic symmetry algebra turns out to be an infinite-dimensional extension of the Carroll algebra.

18. 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.

19. 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

20. Differential-algebraic integrability analysis of the generalized Riemann type and Korteweg-de Vries hydrodynamical equations

Energy Technology Data Exchange (ETDEWEB)

Prykarpatsky, Anatoliy K [Department of Mining Geodesy, AGH University of Science and Technology, Cracow 30059 (Poland); Artemovych, Orest D [Department of Algebra and Topology, Faculty of Mathematics and Informatics of the Vasyl Stefanyk Pre-Carpathian National University, Ivano-Frankivsk (Ukraine); Popowicz, Ziemowit [Institute of Theoretical Physics, University of Wroclaw (Poland); Pavlov, Maxim V, E-mail: pryk.anat@ua.f, E-mail: artemo@usk.pk.edu.p, E-mail: ziemek@ift.uni.wroc.p, E-mail: M.V.Pavlov@lboro.ac.u [Department of Mathematical Physics, P.N. Lebedev Physical Institute, 53 Leninskij Prospekt, Moscow 119991 (Russian Federation)

2010-07-23

A differential-algebraic approach to studying the Lax-type integrability of the generalized Riemann-type hydrodynamic equations at N = 3, 4 is devised. The approach is also applied to studying the Lax-type integrability of the well-known Korteweg-de Vries dynamical system.

1. Differential-algebraic integrability analysis of the generalized Riemann type and Korteweg-de Vries hydrodynamical equations

International Nuclear Information System (INIS)

Prykarpatsky, Anatoliy K; Artemovych, Orest D; Popowicz, Ziemowit; Pavlov, Maxim V

2010-01-01

A differential-algebraic approach to studying the Lax-type integrability of the generalized Riemann-type hydrodynamic equations at N = 3, 4 is devised. The approach is also applied to studying the Lax-type integrability of the well-known Korteweg-de Vries dynamical system.

2. 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.

3. 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.

4. The Logical Properties of Lower and Upper Approximation Operations in Rough Sets%粗集中上下近似运算的逻辑性质

Institute of Scientific and Technical Information of China (English)

祝峰; 何华灿

2000-01-01

In this paper,we discuss the logical properties of rough sets through topological boolean algebras and closure topological boolean algebras.We get representation theorems of finite topological boolean algebras and closure topological boolean algebras under the upper-lower relation condition,which establish the relationship between topological boolean algebras or closure topological boolean algebras and rough sets in the general sets are similar to the Stone's representation theorem of boolean algebras.

5. Optical programmable Boolean logic unit.

Science.gov (United States)

2011-11-10

Logic units are the building blocks of many important computational operations likes arithmetic, multiplexer-demultiplexer, radix conversion, parity checker cum generator, etc. Multifunctional logic operation is very much essential in this respect. Here a programmable Boolean logic unit is proposed that can perform 16 Boolean logical operations from a single optical input according to the programming input without changing the circuit design. This circuit has two outputs. One output is complementary to the other. Hence no loss of data can occur. The circuit is basically designed by a 2×2 polarization independent optical cross bar switch. Performance of the proposed circuit has been achieved by doing numerical simulations. The binary logical states (0,1) are represented by the absence of light (null) and presence of light, respectively.

6. Algebraic computing

International Nuclear Information System (INIS)

MacCallum, M.A.H.

1990-01-01

The implementation of a new computer algebra system is time consuming: designers of general purpose algebra systems usually say it takes about 50 man-years to create a mature and fully functional system. Hence the range of available systems and their capabilities changes little between one general relativity meeting and the next, despite which there have been significant changes in the period since the last report. The introductory remarks aim to give a brief survey of capabilities of the principal available systems and highlight one or two trends. The reference to the most recent full survey of computer algebra in relativity and brief descriptions of the Maple, REDUCE and SHEEP and other applications are given. (author)

7. Boolean gates on actin filaments

International Nuclear Information System (INIS)

Siccardi, Stefano; Tuszynski, Jack A.; Adamatzky, Andrew

2016-01-01

Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications. - Highlights: • We simulate interaction between voltage pulses using on actin filaments. • We use a coupled nonlinear transmission line model. • We design Boolean logical gates via interactions between the voltage pulses. • We construct one-bit half-adder with interacting voltage pulses.

8. Boolean gates on actin filaments

Energy Technology Data Exchange (ETDEWEB)

Siccardi, Stefano, E-mail: ssiccardi@2ssas.it [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom); Tuszynski, Jack A., E-mail: jackt@ualberta.ca [Department of Oncology, University of Alberta, Edmonton, Alberta (Canada); Adamatzky, Andrew, E-mail: andrew.adamatzky@uwe.ac.uk [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom)

2016-01-08

Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications. - Highlights: • We simulate interaction between voltage pulses using on actin filaments. • We use a coupled nonlinear transmission line model. • We design Boolean logical gates via interactions between the voltage pulses. • We construct one-bit half-adder with interacting voltage pulses.

9. A new generalized algebra method and its application in the (2 + 1) dimensional Boiti-Leon-Pempinelli equation

International Nuclear Information System (INIS)

Ren Yujie; Liu Shutian; Zhang Hongqing

2007-01-01

In the present paper, some types of general solutions of a first-order nonlinear ordinary differential equation with six degree are given and a new generalized algebra method is presented to find more exact solutions of nonlinear differential equations. As an application of the method and the solutions of this equation, we choose the (2 + 1) dimensional Boiti Leon Pempinelli equation to illustrate the validity and advantages of the method. As a consequence, more new types and general solutions are found which include rational solutions and irrational solutions and so on. The new method can also be applied to other nonlinear differential equations in mathematical physics

10. Reliable dynamics in Boolean and continuous networks

International Nuclear Information System (INIS)

Ackermann, Eva; Drossel, Barbara; Peixoto, Tiago P

2012-01-01

We investigate the dynamical behavior of a model of robust gene regulatory networks which possess ‘entirely reliable’ trajectories. In a Boolean representation, these trajectories are characterized by being insensitive to the order in which the nodes are updated, i.e. they always go through the same sequence of states. The Boolean model for gene activity is compared with a continuous description in terms of differential equations for the concentrations of mRNA and proteins. We found that entirely reliable Boolean trajectories can be reproduced perfectly in the continuous model when realistic Hill coefficients are used. We investigate to what extent this high correspondence between Boolean and continuous trajectories depends on the extent of reliability of the Boolean trajectories, and we identify simple criteria that enable the faithful reproduction of the Boolean dynamics in the continuous description. (paper)

11. Quantum algorithms for testing Boolean functions

Directory of Open Access Journals (Sweden)

2010-06-01

Full Text Available We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.

12. GLOBAL CONVERGENCE FOR THE XOR BOOLEAN NETWORKS

OpenAIRE

Ho, Juei-Ling

2009-01-01

Shih and Ho have proved a global convergent theorem for boolean network: if a map from $\\{0,1\\}^{n}$ to itself defines a boolean network has the conditions: (1) each column of the discrete Jacobian matrix of each element of $\\{0,1\\}^{n}$ is either a unit vector or a zero vector; (2) all the boolean eigenvalues of the discrete Jacobian matrix of this map evaluated at each element of $\\{0,1\\}^{n}$ are zero, then it has a unique fixed point and this boolean network is global convergent to the fi...

13. Rational Verification in Iterated Electric Boolean Games

Directory of Open Access Journals (Sweden)

2016-07-01

Full Text Available Electric boolean games are compact representations of games where the players have qualitative objectives described by LTL formulae and have limited resources. We study the complexity of several decision problems related to the analysis of rationality in electric boolean games with LTL objectives. In particular, we report that the problem of deciding whether a profile is a Nash equilibrium in an iterated electric boolean game is no harder than in iterated boolean games without resource bounds. We show that it is a PSPACE-complete problem. As a corollary, we obtain that both rational elimination and rational construction of Nash equilibria by a supervising authority are PSPACE-complete problems.

14. Construction and uniqueness of the C*-Weyl algebra over a general pre-symplectic space

International Nuclear Information System (INIS)

Binz, Ernst; Honegger, Reinhard; Rieckers, Alfred

2004-01-01

A systematic approach to the C*-Weyl algebra W(E,σ) over a possibly degenerate pre-symplectic form σ on a real vector space E of possibly infinite dimension is elaborated in an almost self-contained manner. The construction is based on the theory of Kolmogorov decompositions for σ-positive-definite functions on involutive semigroups and their associated projective unitary group representations. The σ-positive-definite functions provide also the C*-norm of W(E,σ), the latter being shown to be *-isomorphic to the twisted group C*-algebra of the discrete vector group E. The connections to related constructions are indicated. The treatment of the fundamental symmetries is outlined for arbitrary pre-symplectic σ. The construction method is especially applied to the trivial symplectic form σ=0, leading to the commutative Weyl algebra over E, which is shown to be isomorphic to the C*-algebra of the almost periodic continuous function on the topological dual E τ ' of E with respect to an arbitrary locally convex Hausdorff topology τ on E. It is demonstrated that the almost periodic compactification aE τ ' of E τ ' is independent of the chosen locally convex τ on E, and that aE τ ' is continuously group isomorphic to the character group E of E. Applications of the results to the procedures of strict and continuous deformation quantizations are mentioned in the outlook

15. 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

16. Expected Number of Fixed Points in Boolean Networks with Arbitrary Topology.

Science.gov (United States)

Mori, Fumito; Mochizuki, Atsushi

2017-07-14

Boolean network models describe genetic, neural, and social dynamics in complex networks, where the dynamics depend generally on network topology. Fixed points in a genetic regulatory network are typically considered to correspond to cell types in an organism. We prove that the expected number of fixed points in a Boolean network, with Boolean functions drawn from probability distributions that are not required to be uniform or identical, is one, and is independent of network topology if only a feedback arc set satisfies a stochastic neutrality condition. We also demonstrate that the expected number is increased by the predominance of positive feedback in a cycle.

17. Linear-algebraic approach to electron-molecule collisions: General formulation

International Nuclear Information System (INIS)

Collins, L.A.; Schneider, B.I.

1981-01-01

We present a linear-algebraic approach to electron-molecule collisions based on an integral equations form with either logarithmic or asymptotic boundary conditions. The introduction of exchange effects does not alter the basic form or order of the linear-algebraic equations for a local potential. In addition to the standard procedure of directly evaluating the exchange integrals by numerical quadrature, we also incorporate exchange effects through a separable-potential approximation. Efficient schemes are developed for reducing the number of points and channels that must be included. The method is applied at the static-exchange level to a number of molecular systems including H 2 , N 2 , LiH, and CO 2

18. Boolean integral calculus for digital systems

Science.gov (United States)

Tucker, J. H.; Tapia, M. A.; Bennett, A. W.

1985-01-01

The concept of Boolean integration is introduced and developed. When the changes in a desired function are specified in terms of changes in its arguments, then ways of 'integrating' (i.e., realizing) the function, if it exists, are presented. Boolean integral calculus has applications in design of logic circuits.

19. 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

20. GENERAL: Application of Symplectic Algebraic Dynamics Algorithm to Circular Restricted Three-Body Problem

Science.gov (United States)

Lu, Wei-Tao; Zhang, Hua; Wang, Shun-Jin

2008-07-01

Symplectic algebraic dynamics algorithm (SADA) for ordinary differential equations is applied to solve numerically the circular restricted three-body problem (CR3BP) in dynamical astronomy for both stable motion and chaotic motion. The result is compared with those of Runge-Kutta algorithm and symplectic algorithm under the fourth order, which shows that SADA has higher accuracy than the others in the long-term calculations of the CR3BP.

1. Maiorana-McFarland class: Degree optimization and algebraic properties

DEFF Research Database (Denmark)

Pasalic, Enes

2006-01-01

degree of functions in the extended Maiorana-McFarland (MM) class (nonlinear resilient functions F : GF (2)(n) -> GF (2)(m) derived from linear codes). We also show that in the Boolean case, the same subclass seems not to have an optimized algebraic immunity, hence not providing a maximum resistance......In this paper, we consider a subclass of the Maiorana-McFarland class used in the design of resilient nonlinear Boolean functions. We show that these functions allow a simple modification so that resilient Boolean functions of maximum algebraic degree may be generated instead of suboptimized degree...... in the original class. Preserving a high-nonlinearity value immanent to the original construction method, together with the degree optimization gives in many cases functions with cryptographic properties superior to all previously known construction methods. This approach is then used to increase the algebraic...

2. Investigation of the Practical Possibility of Solving Problems on Generalized Cellular Automata Associated with Cryptanalysis by Mean Algebraic Methods

Directory of Open Access Journals (Sweden)

P. G. Klyucharev

2017-01-01

Full Text Available A number of previous author’s papers proposed methods for constructing various cryptographic algorithms, including block ciphers and cryptographic hash functions, based on generalized cellular automata. This one is aimed at studying a possibility to use the algebraic cryptanalysis methods related to the construction of Gröbner bases for the generalized cellular automata to be applied in cryptography, i.e. this paper studies the possibility for using algebraic cryptanalysis methods to solve the problems of inversion of a generalized cellular automaton and recovering the key of such an automaton.If the cryptographic algorithm is represented as a system of polynomial equations over a certain finite field, then its breach is reduced to solving this system with respect to the key. Although the problem of solving a system of polynomial equations in a finite field is NP-difficult in the general case, the solution of a particular system can have low computational cost.Cryptanalysis based on the construction of a system of polynomial equations that links plain text, cipher-text and key, and its solution by algebraic methods, is usually called algebraic cryptanalysis. Among the main methods to solve systems of polynomial equations are those to construct Gröbner bases.Cryptanalysis of ciphers and hash functions based on generalized cellular automata can be reduced to various problems. We will consider two such problems: the problem of inversion of a generalized cellular automaton, which, in case we know the values of the cells after k iterations, enables us to find the initial values. And the task of recovering the key, which is to find the initial values of the remaining cells, using the cell values after k steps and the initial values of a part of the cells.A computational experiment was carried out to solve the two problems above stated in order to determine the maximum size of a generalized cellular automaton for which the solution of these

3. Profinite algebras and affine boundedness

OpenAIRE

Schneider, Friedrich Martin; Zumbrägel, Jens

2015-01-01

We prove a characterization of profinite algebras, i.e., topological algebras that are isomorphic to a projective limit of finite discrete algebras. In general profiniteness concerns both the topological and algebraic characteristics of a topological algebra, whereas for topological groups, rings, semigroups, and distributive lattices, profiniteness turns out to be a purely topological property as it is is equivalent to the underlying topological space being a Stone space. Condensing the core...

4. 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

5. Mining TCGA data using Boolean implications.

Directory of Open Access Journals (Sweden)

Subarna Sinha

Full Text Available Boolean implications (if-then rules provide a conceptually simple, uniform and highly scalable way to find associations between pairs of random variables. In this paper, we propose to use Boolean implications to find relationships between variables of different data types (mutation, copy number alteration, DNA methylation and gene expression from the glioblastoma (GBM and ovarian serous cystadenoma (OV data sets from The Cancer Genome Atlas (TCGA. We find hundreds of thousands of Boolean implications from these data sets. A direct comparison of the relationships found by Boolean implications and those found by commonly used methods for mining associations show that existing methods would miss relationships found by Boolean implications. Furthermore, many relationships exposed by Boolean implications reflect important aspects of cancer biology. Examples of our findings include cis relationships between copy number alteration, DNA methylation and expression of genes, a new hierarchy of mutations and recurrent copy number alterations, loss-of-heterozygosity of well-known tumor suppressors, and the hypermethylation phenotype associated with IDH1 mutations in GBM. The Boolean implication results used in the paper can be accessed at http://crookneck.stanford.edu/microarray/TCGANetworks/.

6. Time-dependent automorphism-inducing diffeomorphisms, open algebras and the generality of the Kantowski-Sachs vacuum geometry

Science.gov (United States)

2002-10-01

Following the spirit of a previous work of ours, we investigate the group of those general coordinate transformations (GCTs) which preserve manifest spatial homogeneity. In contrast to the case of Bianchi type models, here we permit an isometry group of motions G4 = SO(3) ⊗ Tr, where Tr is the translations group, along the radial direction, while SO(3) acts multiply transitively on each hypersurface of simultaneity Σt. The basis 1-forms cannot be invariant under the action of the entire isometry group and hence produce an open Lie algebra. In order for these GCTs to exist and have a nontrivial, well-defined action, certain integrability conditions have to be satisfied; their solutions, exhibiting the maximum expected 'gauge' freedom, can be used to simplify the generic, spatially homogeneous, line element. In this way an alternative proof of the generality of the Kantowski-Sachs (KS) vacuum is given, while its most general, manifestly homogeneous, form is explicitly presented.

7. Boolean Functions with a Simple Certificate for CNF Complexity

Czech Academy of Sciences Publication Activity Database

Čepek, O.; Kučera, P.; Savický, Petr

2012-01-01

Roč. 160, 4-5 (2012), s. 365-382 ISSN 0166-218X R&D Projects: GA MŠk(CZ) 1M0545 Grant - others:GA ČR(CZ) GP201/07/P168; GA ČR(CZ) GAP202/10/1188 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean functions * CNF representations Subject RIV: BA - General Mathematics Impact factor: 0.718, year: 2012

8. Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games

Directory of Open Access Journals (Sweden)

Gijs Kant

2012-10-01

Full Text Available Parameterised Boolean Equation Systems (PBESs are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal mu-calculus formulae for process algebraic specifications with data. Solving a PBES is usually done by instantiation to a Parity Game and then solving the game. Practical game solvers exist, but the instantiation step is the bottleneck. We enhance the instantiation in two steps. First, we transform the PBES to a Parameterised Parity Game (PPG, a PBES with each equation either conjunctive or disjunctive. Then we use LTSmin, that offers transition caching, efficient storage of states and both distributed and symbolic state space generation, for generating the game graph. To that end we define a language module for LTSmin, consisting of an encoding of variables with parameters into state vectors, a grouped transition relation and a dependency matrix to indicate the dependencies between parts of the state vector and transition groups. Benchmarks on some large case studies, show that the method speeds up the instantiation significantly and decreases memory usage drastically.

9. Stability of Boolean multilevel networks.

Science.gov (United States)

Cozzo, Emanuele; Arenas, Alex; Moreno, Yamir

2012-09-01

The study of the interplay between the structure and dynamics of complex multilevel systems is a pressing challenge nowadays. In this paper, we use a semiannealed approximation to study the stability properties of random Boolean networks in multiplex (multilayered) graphs. Our main finding is that the multilevel structure provides a mechanism for the stabilization of the dynamics of the whole system even when individual layers work on the chaotic regime, therefore identifying new ways of feedback between the structure and the dynamics of these systems. Our results point out the need for a conceptual transition from the physics of single-layered networks to the physics of multiplex networks. Finally, the fact that the coupling modifies the phase diagram and the critical conditions of the isolated layers suggests that interdependency can be used as a control mechanism.

10. Generalized Weyl–Heisenberg Algebra, Qudit Systems and Entanglement Measure of Symmetric States via Spin Coherent States

Directory of Open Access Journals (Sweden)

Mohammed Daoud

2018-04-01

Full Text Available A relation is established in the present paper between Dicke states in a d-dimensional space and vectors in the representation space of a generalized Weyl–Heisenberg algebra of finite dimension d. This provides a natural way to deal with the separable and entangled states of a system of N = d − 1 symmetric qubit states. Using the decomposition property of Dicke states, it is shown that the separable states coincide with the Perelomov coherent states associated with the generalized Weyl–Heisenberg algebra considered in this paper. In the so-called Majorana scheme, the qudit (d-level states are represented by N points on the Bloch sphere; roughly speaking, it can be said that a qudit (in a d-dimensional space is describable by a N-qubit vector (in a N-dimensional space. In such a scheme, the permanent of the matrix describing the overlap between the N qubits makes it possible to measure the entanglement between the N qubits forming the qudit. This is confirmed by a Fubini–Study metric analysis. A new parameter, proportional to the permanent and called perma-concurrence, is introduced for characterizing the entanglement of a symmetric qudit arising from N qubits. For d = 3 ( ⇔ N = 2 , this parameter constitutes an alternative to the concurrence for two qubits. Other examples are given for d = 4 and 5. A connection between Majorana stars and zeros of a Bargmmann function for qudits closes this article.

11. 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.

12. 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

13. 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

14. 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.

15. Proposition algebra

NARCIS (Netherlands)

Bergstra, J.A.; Ponse, A.

2011-01-01

Sequential propositional logic deviates from conventional propositional logic by taking into account that during the sequential evaluation of a propositional statement, atomic propositions may yield different Boolean values at repeated occurrences. We introduce "free valuations" to capture this

16. 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

17. Current algebra

International Nuclear Information System (INIS)

Jacob, M.

1967-01-01

The first three chapters of these lecture notes are devoted to generalities concerning current algebra. The weak currents are defined, and their main properties given (V-A hypothesis, conserved vector current, selection rules, partially conserved axial current,...). The SU (3) x SU (3) algebra of Gell-Mann is introduced, and the general properties of the non-leptonic weak Hamiltonian are discussed. Chapters 4 to 9 are devoted to some important applications of the algebra. First one proves the Adler- Weisberger formula, in two different ways, by either the infinite momentum frame, or the near-by singularities method. In the others chapters, the latter method is the only one used. The following topics are successively dealt with: semi leptonic decays of K mesons and hyperons, Kroll- Ruderman theorem, non leptonic decays of K mesons and hyperons ( ΔI = 1/2 rule), low energy theorems concerning processes with emission (or absorption) of a pion or a photon, super-convergence sum rules, and finally, neutrino reactions. (author) [fr

18. Totally optimal decision trees for Boolean functions

KAUST Repository

Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail

2016-01-01

We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters

19. Random networks of Boolean cellular automata

Energy Technology Data Exchange (ETDEWEB)

Miranda, Enrique [Comision Nacional de Energia Atomica, San Carlos de Bariloche (Argentina). Centro Atomico Bariloche

1990-01-01

Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author).

20. Random networks of Boolean cellular automata

International Nuclear Information System (INIS)

Miranda, Enrique

1990-01-01

Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author)

1. Representing Boolean Functions by Decision Trees

KAUST Repository

Chikalov, Igor

2011-01-01

A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms

2. Contractions of quantum algebraic structures

International Nuclear Information System (INIS)

Doikou, A.; Sfetsos, K.

2010-01-01

A general framework for obtaining certain types of contracted and centrally extended algebras is reviewed. The whole process relies on the existence of quadratic algebras, which appear in the context of boundary integrable models. (Abstract Copyright [2010], Wiley Periodicals, Inc.)

3. 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...

4. Implicative Algebras

African Journals Online (AJOL)

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

5. 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...

6. Algebra for cryptologists

CERN Document Server

Meijer, Alko R

2016-01-01

This textbook provides an introduction to the mathematics on which modern cryptology is based. It covers not only public key cryptography, the glamorous component of modern cryptology, but also pays considerable attention to secret key cryptography, its workhorse in practice. Modern cryptology has been described as the science of the integrity of information, covering all aspects like confidentiality, authenticity and non-repudiation and also including the protocols required for achieving these aims. In both theory and practice it requires notions and constructions from three major disciplines: computer science, electronic engineering and mathematics. Within mathematics, group theory, the theory of finite fields, and elementary number theory as well as some topics not normally covered in courses in algebra, such as the theory of Boolean functions and Shannon theory, are involved. Although essentially self-contained, a degree of mathematical maturity on the part of the reader is assumed, corresponding to his o...

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

8. Hecke algebras with unequal parameters

CERN Document Server

Lusztig, G

2003-01-01

Hecke algebras arise in representation theory as endomorphism algebras of induced representations. One of the most important classes of Hecke algebras is related to representations of reductive algebraic groups over p-adic or finite fields. In 1979, in the simplest (equal parameter) case of such Hecke algebras, Kazhdan and Lusztig discovered a particular basis (the KL-basis) in a Hecke algebra, which is very important in studying relations between representation theory and geometry of the corresponding flag varieties. It turned out that the elements of the KL-basis also possess very interesting combinatorial properties. In the present book, the author extends the theory of the KL-basis to a more general class of Hecke algebras, the so-called algebras with unequal parameters. In particular, he formulates conjectures describing the properties of Hecke algebras with unequal parameters and presents examples verifying these conjectures in particular cases. Written in the author's precise style, the book gives rese...

9. Computer algebra applications

International Nuclear Information System (INIS)

Calmet, J.

1982-01-01

A survey of applications based either on fundamental algorithms in computer algebra or on the use of a computer algebra system is presented. Recent work in biology, chemistry, physics, mathematics and computer science is discussed. In particular, applications in high energy physics (quantum electrodynamics), celestial mechanics and general relativity are reviewed. (Auth.)

10. 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...

11. The Unitality of Quantum B-algebras

Science.gov (United States)

Han, Shengwei; Xu, Xiaoting; Qin, Feng

2018-02-01

Quantum B-algebras as a generalization of quantales were introduced by Rump and Yang, which cover the majority of implicational algebras and provide a unified semantic for a wide class of substructural logics. Unital quantum B-algebras play an important role in the classification of implicational algebras. The main purpose of this paper is to construct unital quantum B-algebras from non-unital quantum B-algebras.

12. 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.)

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.

14. Algebraic functions

CERN Document Server

Bliss, Gilbert Ames

1933-01-01

This book, immediately striking for its conciseness, is one of the most remarkable works ever produced on the subject of algebraic functions and their integrals. The distinguishing feature of the book is its third chapter, on rational functions, which gives an extremely brief and clear account of the theory of divisors.... A very readable account is given of the topology of Riemann surfaces and of the general properties of abelian integrals. Abel's theorem is presented, with some simple applications. The inversion problem is studied for the cases of genus zero and genus unity. The chapter on t

15. Lie algebraic approach to the time-dependent quantum general harmonic oscillator and the bi-dimensional charged particle in time-dependent electromagnetic fields

International Nuclear Information System (INIS)

Ibarra-Sierra, V.G.; Sandoval-Santana, J.C.; Cardoso, J.L.; Kunold, A.

2015-01-01

We discuss the one-dimensional, time-dependent general quadratic Hamiltonian and the bi-dimensional charged particle in time-dependent electromagnetic fields through the Lie algebraic approach. Such method consists in finding a set of generators that form a closed Lie algebra in terms of which it is possible to express a quantum Hamiltonian and therefore the evolution operator. The evolution operator is then the starting point to obtain the propagator as well as the explicit form of the Heisenberg picture position and momentum operators. First, the set of generators forming a closed Lie algebra is identified for the general quadratic Hamiltonian. This algebra is later extended to study the Hamiltonian of a charged particle in electromagnetic fields exploiting the similarities between the terms of these two Hamiltonians. These results are applied to the solution of five different examples: the linear potential which is used to introduce the Lie algebraic method, a radio frequency ion trap, a Kanai–Caldirola-like forced harmonic oscillator, a charged particle in a time dependent magnetic field, and a charged particle in constant magnetic field and oscillating electric field. In particular we present exact analytical expressions that are fitting for the study of a rotating quadrupole field ion trap and magneto-transport in two-dimensional semiconductor heterostructures illuminated by microwave radiation. In these examples we show that this powerful method is suitable to treat quadratic Hamiltonians with time dependent coefficients quite efficiently yielding closed analytical expressions for the propagator and the Heisenberg picture position and momentum operators. -- Highlights: •We deal with the general quadratic Hamiltonian and a particle in electromagnetic fields. •The evolution operator is worked out through the Lie algebraic approach. •We also obtain the propagator and Heisenberg picture position and momentum operators. •Analytical expressions for a

16. Lie algebraic approach to the time-dependent quantum general harmonic oscillator and the bi-dimensional charged particle in time-dependent electromagnetic fields

Energy Technology Data Exchange (ETDEWEB)

Ibarra-Sierra, V.G.; Sandoval-Santana, J.C. [Departamento de Física, Universidad Autónoma Metropolitana Iztapalapa, Av. San Rafael Atlixco 186, Col. Vicentina, 09340 México D.F. (Mexico); Cardoso, J.L. [Área de Física Teórica y Materia Condensada, Universidad Autónoma Metropolitana Azcapotzalco, Av. San Pablo 180, Col. Reynosa-Tamaulipas, Azcapotzalco, 02200 México D.F. (Mexico); Kunold, A., E-mail: akb@correo.azc.uam.mx [Área de Física Teórica y Materia Condensada, Universidad Autónoma Metropolitana Azcapotzalco, Av. San Pablo 180, Col. Reynosa-Tamaulipas, Azcapotzalco, 02200 México D.F. (Mexico)

2015-11-15

We discuss the one-dimensional, time-dependent general quadratic Hamiltonian and the bi-dimensional charged particle in time-dependent electromagnetic fields through the Lie algebraic approach. Such method consists in finding a set of generators that form a closed Lie algebra in terms of which it is possible to express a quantum Hamiltonian and therefore the evolution operator. The evolution operator is then the starting point to obtain the propagator as well as the explicit form of the Heisenberg picture position and momentum operators. First, the set of generators forming a closed Lie algebra is identified for the general quadratic Hamiltonian. This algebra is later extended to study the Hamiltonian of a charged particle in electromagnetic fields exploiting the similarities between the terms of these two Hamiltonians. These results are applied to the solution of five different examples: the linear potential which is used to introduce the Lie algebraic method, a radio frequency ion trap, a Kanai–Caldirola-like forced harmonic oscillator, a charged particle in a time dependent magnetic field, and a charged particle in constant magnetic field and oscillating electric field. In particular we present exact analytical expressions that are fitting for the study of a rotating quadrupole field ion trap and magneto-transport in two-dimensional semiconductor heterostructures illuminated by microwave radiation. In these examples we show that this powerful method is suitable to treat quadratic Hamiltonians with time dependent coefficients quite efficiently yielding closed analytical expressions for the propagator and the Heisenberg picture position and momentum operators. -- Highlights: •We deal with the general quadratic Hamiltonian and a particle in electromagnetic fields. •The evolution operator is worked out through the Lie algebraic approach. •We also obtain the propagator and Heisenberg picture position and momentum operators. •Analytical expressions for a

17. 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.)

18. Linear algebra

CERN Document Server

Said-Houari, Belkacem

2017-01-01

This self-contained, clearly written textbook on linear algebra is easily accessible for students. It begins with the simple linear equation and generalizes several notions from this equation for the system of linear equations and introduces the main ideas using matrices. It then offers a detailed chapter on determinants and introduces the main ideas with detailed proofs. The third chapter introduces the Euclidean spaces using very simple geometric ideas and discusses various major inequalities and identities. These ideas offer a solid basis for understanding general Hilbert spaces in functional analysis. The following two chapters address general vector spaces, including some rigorous proofs to all the main results, and linear transformation: areas that are ignored or are poorly explained in many textbooks. Chapter 6 introduces the idea of matrices using linear transformation, which is easier to understand than the usual theory of matrices approach. The final two chapters are more advanced, introducing t...

19. Information encryption systems based on Boolean functions

Directory of Open Access Journals (Sweden)

Aureliu Zgureanu

2011-02-01

Full Text Available An information encryption system based on Boolean functions is proposed. Information processing is done using multidimensional matrices, performing logical operations with these matrices. At the basis of ensuring high level security of the system the complexity of solving the problem of building systems of Boolean functions that depend on many variables (tens and hundreds is set. Such systems represent the private key. It varies both during the encryption and decryption of information, and during the transition from one message to another.

20. Generating Generalized Bessel Equations by Virtue of Bose Operator Algebra and Entangled State Representations

International Nuclear Information System (INIS)

Fan Hongyi; Wang Yong

2006-01-01

With the help of Bose operator identities and entangled state representation and based on our previous work [Phys. Lett. A 325 (2004) 188] we derive some new generalized Bessel equations which also have Bessel function as their solution. It means that for these intricate higher-order differential equations, we can get Bessel function solutions without using the expatiatory power-series expansion method.

1. The covariant linear oscillator and generalized realization of the dynamical SU(1,1) symmetry algebra

International Nuclear Information System (INIS)

Kagramanov, E.D.; Nagiyev, Sh.M.; Mir-Kasimov, R.M.

1989-03-01

An exactly soluble problem for the finite-difference Schroedinger equation in the relativistic configurational space is considered. The appropriate finite-difference generalization of the factorization method is developed. The theory of new special functions ''the relativistic Hermite polynomials'', in which the solutions are expressed, is constructed. (author). 14 refs

2. A Genetically Optimized Predictive System for Success in General Chemistry Using a Diagnostic Algebra Test

Science.gov (United States)

Cooper, Cameron I.; Pearson, Paul T.

2012-01-01

In higher education, many high-enrollment introductory courses have evolved into "gatekeeper" courses due to their high failure rates. These courses prevent many students from attaining their educational goals and often become graduation roadblocks. At the authors' home institution, general chemistry has become a gatekeeper course in which…

3. Elements of mathematics algebra

CERN Document Server

Bourbaki, Nicolas

2003-01-01

This is a softcover reprint of the English translation of 1990 of the revised and expanded version of Bourbaki's, Algèbre, Chapters 4 to 7 (1981). This completes Algebra, 1 to 3, by establishing the theories of commutative fields and modules over a principal ideal domain. Chapter 4 deals with polynomials, rational fractions and power series. A section on symmetric tensors and polynomial mappings between modules, and a final one on symmetric functions, have been added. Chapter 5 was entirely rewritten. After the basic theory of extensions (prime fields, algebraic, algebraically closed, radical extension), separable algebraic extensions are investigated, giving way to a section on Galois theory. Galois theory is in turn applied to finite fields and abelian extensions. The chapter then proceeds to the study of general non-algebraic extensions which cannot usually be found in textbooks: p-bases, transcendental extensions, separability criterions, regular extensions. Chapter 6 treats ordered groups and fields and...

4. 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.)

5. 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.)

6. The Centroid of a Lie Triple Algebra

Directory of Open Access Journals (Sweden)

Xiaohong Liu

2013-01-01

Full Text Available General results on the centroids of Lie triple algebras are developed. Centroids of the tensor product of a Lie triple algebra and a unitary commutative associative algebra are studied. Furthermore, the centroid of the tensor product of a simple Lie triple algebra and a polynomial ring is completely determined.

7. ALAM/CLAM and some applications of computer algebra systems to problems in general relativity

International Nuclear Information System (INIS)

Russell-Clark, R.A.

1973-01-01

This paper is divided into three parts. Part A presents a historical survey of the development of the system, a brief description of its features and, finally, a critical assessment. ALAM and CLAM have been used in many problems in General Relativity; the vast majority of these belong to a set of standard calculations termed ''metric applications''. However, four large non-standard applications have been attempted successfully and these are described in Part B. CAMAL is the only other system which has been used extensively for work in relativity. CAMAL has played an important role in two research projects and details of these are given in Part C

8. Efficient simulation of gas-liquid pipe flows using a generalized population balance equation coupled with the algebraic slip model

KAUST Repository

Icardi, Matteo; Ronco, Gianni; Marchisio, Daniele Luca; Labois, Mathieu

2014-01-01

The inhomogeneous generalized population balance equation, which is discretized with the direct quadrature method of moment (DQMOM), is solved to predict the bubble size distribution (BSD) in a vertical pipe flow. The proposed model is compared with a more classical approach where bubbles are characterized with a constant mean size. The turbulent two-phase flow field, which is modeled using a Reynolds-Averaged Navier-Stokes equation approach, is assumed to be in local equilibrium, thus the relative gas and liquid (slip) velocities can be calculated with the algebraic slip model, thereby accounting for the drag, lift, and lubrication forces. The complex relationship between the bubble size distribution and the resulting forces is described accurately by the DQMOM. Each quadrature node and weight represents a class of bubbles with characteristic size and number density, which change dynamically in time and space to preserve the first moments of the BSD. The predictions obtained are validated against previously published experimental data, thereby demonstrating the advantages of this approach for large-scale systems as well as suggesting future extensions to long piping systems and more complex geometries. © 2014 Elsevier Inc.

9. Efficient simulation of gas-liquid pipe flows using a generalized population balance equation coupled with the algebraic slip model

KAUST Repository

Icardi, Matteo

2014-09-01

The inhomogeneous generalized population balance equation, which is discretized with the direct quadrature method of moment (DQMOM), is solved to predict the bubble size distribution (BSD) in a vertical pipe flow. The proposed model is compared with a more classical approach where bubbles are characterized with a constant mean size. The turbulent two-phase flow field, which is modeled using a Reynolds-Averaged Navier-Stokes equation approach, is assumed to be in local equilibrium, thus the relative gas and liquid (slip) velocities can be calculated with the algebraic slip model, thereby accounting for the drag, lift, and lubrication forces. The complex relationship between the bubble size distribution and the resulting forces is described accurately by the DQMOM. Each quadrature node and weight represents a class of bubbles with characteristic size and number density, which change dynamically in time and space to preserve the first moments of the BSD. The predictions obtained are validated against previously published experimental data, thereby demonstrating the advantages of this approach for large-scale systems as well as suggesting future extensions to long piping systems and more complex geometries. © 2014 Elsevier Inc.

10. Beyond-CMOS Device Benchmarking for Boolean and Non-Boolean Logic Applications

OpenAIRE

2017-01-01

The latest results of benchmarking research are presented for a variety of beyond-CMOS charge- and spin-based devices. In addition to improving the device-level models, several new device proposals and a few majorly modified devices are investigated. Deep pipelining circuits are employed to boost the throughput of low-power devices. Furthermore, the benchmarking methodology is extended to interconnect-centric analyses and non-Boolean logic applications. In contrast to Boolean circuits, non-Bo...

11. Boolean Queries Optimization by Genetic Algorithms

Czech Academy of Sciences Publication Activity Database

Húsek, Dušan; Owais, S.S.J.; Krömer, P.; Snášel, Václav

2005-01-01

Roč. 15, - (2005), s. 395-409 ISSN 1210-0552 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * genetic programming * information retrieval * Boolean query Subject RIV: BB - Applied Statistics, Operational Research

12. Practical algorithms for linear boolean-width

NARCIS (Netherlands)

ten Brinke, C.B.; van Houten, F.J.P.; Bodlaender, H.L.

2015-01-01

In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms. The experimental evaluation shows that significant improvements can be made with respect to running time without increasing the width of the

13. Practical algorithms for linear Boolean-width

NARCIS (Netherlands)

ten Brinke, C.B.; van Houten, F.J.P.; Bodlaender, H.L.

2015-01-01

In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms. The experimental evaluation shows that significant improvements can be made with respect to running time without increasing the width of the

14. Elucidation of covariant proofs in general relativity: example of the use of algebraic software in the shear-free conjecture in MAPLE

Science.gov (United States)

Huf, P. A.; Carminati, J.

2018-01-01

In this paper we explore the use of a new algebraic software package in providing independent covariant proof of a conjecture in general relativity. We examine the proof of two sub-cases of the shear-free conjecture σ =0 => ω Θ =0 by Senovilla et al. (Gen. Relativ. Gravit 30:389-411, 1998): case 1: for dust; case 2: for acceleration parallel to vorticity. We use TensorPack, a software package recently released for the Maple environment. In this paper, we briefly summarise the key features of the software and then demonstrate its use by providing and discussing examples of independent proofs of the paper in question. A full set of our completed proofs is available online at http://www.bach2roq.com/science/maths/GR/ShearFreeProofs.html. We are in agreeance with the equations provided in the original paper, noting that the proofs often require many steps. Furthermore, in our proofs we provide fully worked algebraic steps in such a way that the proofs can be examined systematically, and avoiding hand calculation. It is hoped that the elucidated proofs may be of use to other researchers in verifying the algebraic consistency of the expressions in the paper in question, as well as related literature. Furthermore we suggest that the appropriate use of algebraic software in covariant formalism could be useful for developing research and teaching in GR theory.

15. Ordinary differential equations and Boolean networks in application to modelling of 6-mercaptopurine metabolism.

Science.gov (United States)

Lavrova, Anastasia I; Postnikov, Eugene B; Zyubin, Andrey Yu; Babak, Svetlana V

2017-04-01

We consider two approaches to modelling the cell metabolism of 6-mercaptopurine, one of the important chemotherapy drugs used for treating acute lymphocytic leukaemia: kinetic ordinary differential equations, and Boolean networks supplied with one controlling node, which takes continual values. We analyse their interplay with respect to taking into account ATP concentration as a key parameter of switching between different pathways. It is shown that the Boolean networks, which allow avoiding the complexity of general kinetic modelling, preserve the possibility of reproducing the principal switching mechanism.

16. The value of less connected agents in Boolean networks

Science.gov (United States)

Epstein, Daniel; Bazzan, Ana L. C.

2013-11-01

In multiagent systems, agents often face binary decisions where one seeks to take either the minority or the majority side. Examples are minority and congestion games in general, i.e., situations that require coordination among the agents in order to depict efficient decisions. In minority games such as the El Farol Bar Problem, previous works have shown that agents may reach appropriate levels of coordination, mostly by looking at the history of past decisions. Not many works consider any kind of structure of the social network, i.e., how agents are connected. Moreover, when structure is indeed considered, it assumes some kind of random network with a given, fixed connectivity degree. The present paper departs from the conventional approach in some ways. First, it considers more realistic network topologies, based on preferential attachments. This is especially useful in social networks. Second, the formalism of random Boolean networks is used to help agents to make decisions given their attachments (for example acquaintances). This is coupled with a reinforcement learning mechanism that allows agents to select strategies that are locally and globally efficient. Third, we use agent-based modeling and simulation, a microscopic approach, which allows us to draw conclusions about individuals and/or classes of individuals. Finally, for the sake of illustration we use two different scenarios, namely the El Farol Bar Problem and a binary route choice scenario. With this approach we target systems that adapt dynamically to changes in the environment, including other adaptive decision-makers. Our results using preferential attachments and random Boolean networks are threefold. First we show that an efficient equilibrium can be achieved, provided agents do experimentation. Second, microscopic analysis show that influential agents tend to consider few inputs in their Boolean functions. Third, we have also conducted measurements related to network clustering and centrality

17. 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.

18. Asymptotic aspect of derivations in Banach algebras

Directory of Open Access Journals (Sweden)

Jaiok Roh

2017-02-01

Full Text Available Abstract We prove that every approximate linear left derivation on a semisimple Banach algebra is continuous. Also, we consider linear derivations on Banach algebras and we first study the conditions for a linear derivation on a Banach algebra. Then we examine the functional inequalities related to a linear derivation and their stability. We finally take central linear derivations with radical ranges on semiprime Banach algebras and a continuous linear generalized left derivation on a semisimple Banach algebra.

19. Boolean-Like and Frequentistic Nonstandard Semantics for First-Order Predicate Calculus without Functions

Czech Academy of Sciences Publication Activity Database

Kramosil, Ivan

2001-01-01

Roč. 5, č. 1 (2001), s. 45-57 ISSN 1432-7643 R&D Projects: GA AV ČR IAA1030803 Institutional research plan: AV0Z1030915 Keywords : first-order predicate calculus * standard semantics * Boolean-like semantics * frequentistic semantics * completness theorems Subject RIV: BA - General Mathematics

20. Polynomials in algebraic analysis

OpenAIRE

Multarzyński, Piotr

2012-01-01

The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \\cite{DPR}. One of the elegant results corresponding with that notion is a purely algebraic version of the Taylor formula, being a generalization of its usual counterpart, well known for functions of one variable. In quantum calculus there are some specific discrete derivations analyzed, which are right invertible linear ...

1. Lukasiewicz-Moisil Many-Valued Logic Algebra of Highly-Complex Systems

Directory of Open Access Journals (Sweden)

James F. Glazebrook

2010-06-01

Full Text Available The fundamentals of Lukasiewicz-Moisil logic algebras and their applications to complex genetic network dynamics and highly complex systems are presented in the context of a categorical ontology theory of levels, Medical Bioinformatics and self-organizing, highly complex systems. Quantum Automata were defined in refs.[2] and [3] as generalized, probabilistic automata with quantum state spaces [1]. Their next-state functions operate through transitions between quantum states defined by the quantum equations of motions in the SchrÄodinger representation, with both initial and boundary conditions in space-time. A new theorem is proven which states that the category of quantum automata and automata-homomorphisms has both limits and colimits. Therefore, both categories of quantum automata and classical automata (sequential machines are bicomplete. A second new theorem establishes that the standard automata category is a subcategory of the quantum automata category. The quantum automata category has a faithful representation in the category of Generalized (M,R-Systems which are open, dynamic biosystem networks [4] with de¯ned biological relations that represent physiological functions of primordial(s, single cells and the simpler organisms. A new category of quantum computers is also defined in terms of reversible quantum automata with quantum state spaces represented by topological groupoids that admit a local characterization through unique, quantum Lie algebroids. On the other hand, the category of n-Lukasiewicz algebras has a subcategory of centered n-Lukasiewicz algebras (as proven in ref. [2] which can be employed to design and construct subcategories of quantum automata based on n-Lukasiewicz diagrams of existing VLSI. Furthermore, as shown in ref. [2] the category of centered n-Lukasiewicz algebras and the category of Boolean algebras are naturally equivalent. A no-go' conjecture is also proposed which states that Generalized (M

2. TensorPack: a Maple-based software package for the manipulation of algebraic expressions of tensors in general relativity

International Nuclear Information System (INIS)

Huf, P A; Carminati, J

2015-01-01

In this paper we: (1) introduce TensorPack, a software package for the algebraic manipulation of tensors in covariant index format in Maple; (2) briefly demonstrate the use of the package with an orthonormal tensor proof of the shearfree conjecture for dust. TensorPack is based on the Riemann and Canon tensor software packages and uses their functions to express tensors in an indexed covariant format. TensorPack uses a string representation as input and provides functions for output in index form. It extends the functionality to basic algebra of tensors, substitution, covariant differentiation, contraction, raising/lowering indices, symmetry functions and other accessory functions. The output can be merged with text in the Maple environment to create a full working document with embedded dynamic functionality. The package offers potential for manipulation of indexed algebraic tensor expressions in a flexible software environment. (paper)

3. 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

4. Classical Boolean logic gates with quantum systems

International Nuclear Information System (INIS)

Renaud, N; Joachim, C

2011-01-01

An analytical method is proposed to implement any classical Boolean function in a small quantum system by taking the advantage of its electronic transport properties. The logical input, α = {α 1 , ..., α N }, is used to control well-identified parameters of the Hamiltonian of the system noted H 0 (α). The logical output is encoded in the tunneling current intensity passing through the quantum system when connected to conducting electrodes. It is demonstrated how to implement the six symmetric two-input/one-output Boolean functions in a quantum system. This system can be switched from one logic function to another by changing its structural parameters. The stability of the logic gates is discussed, perturbing the Hamiltonian with noise sources and studying the effect of decoherence.

5. Totally optimal decision trees for Boolean functions

KAUST Repository

Chikalov, Igor

2016-07-28

We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters characterizing both time (in the worst- and average-case) and space complexity of decision trees, i.e., depth, total path length (average depth), and number of nodes. We have created tools based on extensions of dynamic programming to study totally optimal trees. These tools are applicable to both exact and approximate decision trees, and allow us to make multi-stage optimization of decision trees relative to different parameters and to count the number of optimal trees. Based on the experimental results we have formulated the following hypotheses (and subsequently proved): for almost all Boolean functions there exist totally optimal decision trees (i) relative to the depth and number of nodes, and (ii) relative to the depth and average depth.

6. Algebra: A Challenge at the Crossroads of Policy and Practice

Science.gov (United States)

Stein, Mary Kay; Kaufman, Julia Heath; Sherman, Milan; Hillen, Amy F.

2011-01-01

The authors review what is known about early and universal algebra, including who is getting access to algebra and student outcomes associated with algebra course taking in general and specifically with universal algebra policies. The findings indicate that increasing numbers of students, some of whom are underprepared, are taking algebra earlier.…

7. Particle-like structure of Lie algebras

Science.gov (United States)

2017-07-01

If a Lie algebra structure 𝔤 on a vector space is the sum of a family of mutually compatible Lie algebra structures 𝔤i's, we say that 𝔤 is simply assembled from the 𝔤i's. Repeating this procedure with a number of Lie algebras, themselves simply assembled from the 𝔤i's, one obtains a Lie algebra assembled in two steps from 𝔤i's, and so on. We describe the process of modular disassembling of a Lie algebra into a unimodular and a non-unimodular part. We then study two inverse questions: which Lie algebras can be assembled from a given family of Lie algebras, and from which Lie algebras can a given Lie algebra be assembled. We develop some basic assembling and disassembling techniques that constitute the elements of a new approach to the general theory of Lie algebras. The main result of our theory is that any finite-dimensional Lie algebra over an algebraically closed field of characteristic zero or over R can be assembled in a finite number of steps from two elementary constituents, which we call dyons and triadons. Up to an abelian summand, a dyon is a Lie algebra structure isomorphic to the non-abelian 2-dimensional Lie algebra, while a triadon is isomorphic to the 3-dimensional Heisenberg Lie algebra. As an example, we describe constructions of classical Lie algebras from triadons.

8. Cluster algebras bases on vertex operator algebras

Czech Academy of Sciences Publication Activity Database

Zuevsky, Alexander

2016-01-01

Roč. 30, 28-29 (2016), č. článku 1640030. ISSN 0217-9792 Institutional support: RVO:67985840 Keywords : cluster alegbras * vertex operator algebras * Riemann surfaces Subject RIV: BA - General Mathematics Impact factor: 0.736, year: 2016 http://www.worldscientific.com/doi/abs/10.1142/S0217979216400300

9. 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...

10. 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.)

11. Optimal stabilization of Boolean networks through collective influence

Science.gov (United States)

Wang, Jiannan; Pei, Sen; Wei, Wei; Feng, Xiangnan; Zheng, Zhiming

2018-03-01

Boolean networks have attracted much attention due to their wide applications in describing dynamics of biological systems. During past decades, much effort has been invested in unveiling how network structure and update rules affect the stability of Boolean networks. In this paper, we aim to identify and control a minimal set of influential nodes that is capable of stabilizing an unstable Boolean network. For locally treelike Boolean networks with biased truth tables, we propose a greedy algorithm to identify influential nodes in Boolean networks by minimizing the largest eigenvalue of a modified nonbacktracking matrix. We test the performance of the proposed collective influence algorithm on four different networks. Results show that the collective influence algorithm can stabilize each network with a smaller set of nodes compared with other heuristic algorithms. Our work provides a new insight into the mechanism that determines the stability of Boolean networks, which may find applications in identifying virulence genes that lead to serious diseases.

12. 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

13. Boolean network identification from perturbation time series data combining dynamics abstraction and logic programming.

Science.gov (United States)

Ostrowski, M; Paulevé, L; Schaub, T; Siegel, A; Guziolowski, C

2016-11-01

Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most efficient and scalable training methods focus on the comparison of two time-points and assume that the system has reached an early steady state. In this paper, we generalize such a learning procedure to take into account the time series traces of phosphoproteomics data in order to discriminate Boolean networks according to their transient dynamics. To that end, we identify a necessary condition that must be satisfied by the dynamics of a Boolean network to be consistent with a discretized time series trace. Based on this condition, we use Answer Set Programming to compute an over-approximation of the set of Boolean networks which fit best with experimental data and provide the corresponding encodings. Combined with model-checking approaches, we end up with a global learning algorithm. Our approach is able to learn logic models with a true positive rate higher than 78% in two case studies of mammalian signaling networks; for a larger case study, our method provides optimal answers after 7min of computation. We quantified the gain in our method predictions precision compared to learning approaches based on static data. Finally, as an application, our method proposes erroneous time-points in the time series data with respect to the optimal learned logic models. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

14. Colored Quantum Algebra and Its Bethe State

International Nuclear Information System (INIS)

Wang Jin-Zheng; Jia Xiao-Yu; Wang Shi-Kun

2014-01-01

We investigate the colored Yang—Baxter equation. Based on a trigonometric solution of colored Yang—Baxter equation, we construct a colored quantum algebra. Moreover we discuss its algebraic Bethe ansatz state and highest wight representation. (general)

15. 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

16. 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

17. Topological أ-algebras with Cأ-enveloping algebras II

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.

18. Chiral algebras of class S

CERN Document Server

Beem, Christopher; Rastelli, Leonardo; van Rees, Balt C.

2015-01-01

Four-dimensional N=2 superconformal field theories have families of protected correlation functions that possess the structure of two-dimensional chiral algebras. In this paper, we explore the chiral algebras that arise in this manner in the context of theories of class S. The class S duality web implies nontrivial associativity properties for the corresponding chiral algebras, the structure of which is best summarized in the language of generalized topological quantum field theory. We make a number of conjectures regarding the chiral algebras associated to various strongly coupled fixed points.

19. 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.

20. Large Sets in Boolean and Non-Boolean Groups and Topology

Directory of Open Access Journals (Sweden)

Ol’ga V. Sipacheva

2017-10-01

Full Text Available Various notions of large sets in groups, including the classical notions of thick, syndetic, and piecewise syndetic sets and the new notion of vast sets in groups, are studied with emphasis on the interplay between such sets in Boolean groups. Natural topologies closely related to vast sets are considered; as a byproduct, interesting relations between vast sets and ultrafilters are revealed.

1. 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.

2. 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.

3. 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.

4. Double-partition Quantum Cluster Algebras

DEFF Research Database (Denmark)

Jakobsen, Hans Plesner; Zhang, Hechun

2012-01-01

A family of quantum cluster algebras is introduced and studied. In general, these algebras are new, but sub-classes have been studied previously by other authors. The algebras are indexed by double parti- tions or double flag varieties. Equivalently, they are indexed by broken lines L. By grouping...... together neighboring mutations into quantum line mutations we can mutate from the cluster algebra of one broken line to another. Compatible pairs can be written down. The algebras are equal to their upper cluster algebras. The variables of the quantum seeds are given by elements of the dual canonical basis....

5. Anyons, deformed oscillator algebras and projectors

International Nuclear Information System (INIS)

Engquist, Johan

2009-01-01

We initiate an algebraic approach to the many-anyon problem based on deformed oscillator algebras. The formalism utilizes a generalization of the deformed Heisenberg algebras underlying the operator solution of the Calogero problem. We define a many-body Hamiltonian and an angular momentum operator which are relevant for a linearized analysis in the statistical parameter ν. There exists a unique ground state and, in spite of the presence of defect lines, the anyonic weight lattices are completely connected by the application of the oscillators of the algebra. This is achieved by supplementing the oscillator algebra with a certain projector algebra.

6. Vector Boolean Functions: applications in symmetric cryptography

OpenAIRE

Álvarez Cubero, José Antonio

2015-01-01

Esta tesis establece los fundamentos teóricos y diseña una colección abierta de clases C++ denominada VBF (Vector Boolean Functions) para analizar funciones booleanas vectoriales (funciones que asocian un vector booleano a otro vector booleano) desde una perspectiva criptográfica. Esta nueva implementación emplea la librería NTL de Victor Shoup, incorporando nuevos módulos que complementan a las funciones de NTL, adecuándolas para el análisis criptográfico. La clase fundamental que representa...

7. Boolean Factor Analysis by Attractor Neural Network

Czech Academy of Sciences Publication Activity Database

Frolov, A. A.; Húsek, Dušan; Muraviev, I. P.; Polyakov, P.Y.

2007-01-01

Roč. 18, č. 3 (2007), s. 698-707 ISSN 1045-9227 R&D Projects: GA AV ČR 1ET100300419; GA ČR GA201/05/0079 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * dimensionality reduction * features clustering * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.769, year: 2007

8. Logical Attractors: a Boolean Approach to the Dynamics of Psychosis

Science.gov (United States)

Kupper, Z.; Hoffmann, H.

A Boolean modeling approach to attractors in the dynamics of psychosis is presented: Kinetic Logic, originating from R. Thomas, describes systems on an intermediate level between a purely verbal, qualitative description and a description using nonlinear differential equations. With this method we may model impact, feedback and temporal evolution, as well as analyze the resulting attractors. In our previous research the method has been applied to general and more specific questions in the dynamics of psychotic disorders. In this paper a model is introduced that describes different dynamical patterns of chronic psychosis in the context of vocational rehabilitation. It also shows to be useful in formulating and exploring possible treatment strategies. Finally, some of the limitations and benefits of Kinetic Logic as a modeling tool for psychology and psychiatry are discussed.

9. Unlimited multistability and Boolean logic in microbial signalling

DEFF Research Database (Denmark)

Kothamachu, Varun B; Feliu, Elisenda; Cardelli, Luca

2015-01-01

The ability to map environmental signals onto distinct internal physiological states or programmes is critical for single-celled microbes. A crucial systems dynamics feature underpinning such ability is multistability. While unlimited multistability is known to arise from multi-site phosphorylation...... seen in the signalling networks of eukaryotic cells, a similarly universal mechanism has not been identified in microbial signalling systems. These systems are generally known as two-component systems comprising histidine kinase (HK) receptors and response regulator proteins engaging in phosphotransfer...... further prove that sharing of downstream components allows a system with n multi-domain hybrid HKs to attain 3n steady states. We find that such systems, when sensing distinct signals, can readily implement Boolean logic functions on these signals. Using two experimentally studied examples of two...

10. 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

11. 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)

12. An adaptable Boolean net trainable to control a computing robot

International Nuclear Information System (INIS)

Lauria, F. E.; Prevete, R.; Milo, M.; Visco, S.

1999-01-01

We discuss a method to implement in a Boolean neural network a Hebbian rule so to obtain an adaptable universal control system. We start by presenting both the Boolean neural net and the Hebbian rule we have considered. Then we discuss, first, the problems arising when the latter is naively implemented in a Boolean neural net, second, the method consenting us to overcome them and the ensuing adaptable Boolean neural net paradigm. Next, we present the adaptable Boolean neural net as an intelligent control system, actually controlling a writing robot, and discuss how to train it in the execution of the elementary arithmetic operations on operands represented by numerals with an arbitrary number of digits

13. (L,M-Fuzzy σ-Algebras

Directory of Open Access Journals (Sweden)

Fu-Gui Shi

2010-01-01

Full Text Available The notion of (L,M-fuzzy σ-algebras is introduced in the lattice value fuzzy set theory. It is a generalization of Klement's fuzzy σ-algebras. In our definition of (L,M-fuzzy σ-algebras, each L-fuzzy subset can be regarded as an L-measurable set to some degree.

14. On Elementary and Algebraic Cellular Automata

Science.gov (United States)

Gulak, Yuriy

In this paper we study elementary cellular automata from an algebraic viewpoint. The goal is to relate the emergent complex behavior observed in such systems with the properties of corresponding algebraic structures. We introduce algebraic cellular automata as a natural generalization of elementary ones and discuss their applications as generic models of complex systems.

15. 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.)

16. 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.)

17. Lie Algebras and Integrable Systems

International Nuclear Information System (INIS)

Zhang Yufeng; Mei Jianqin

2012-01-01

A 3 × 3 matrix Lie algebra is first introduced, its subalgebras and the generated Lie algebras are obtained, respectively. Applications of a few Lie subalgebras give rise to two integrable nonlinear hierarchies of evolution equations from their reductions we obtain the nonlinear Schrödinger equations, the mKdV equations, the Broer-Kaup (BK) equation and its generalized equation, etc. The linear and nonlinear integrable couplings of one integrable hierarchy presented in the paper are worked out by casting a 3 × 3 Lie subalgebra into a 2 × 2 matrix Lie algebra. Finally, we discuss the elliptic variable solutions of a generalized BK equation. (general)

18. Finite W-algebras and intermediate statistics

International Nuclear Information System (INIS)

Barbarin, F.; Ragoucy, E.; Sorba, P.

1995-01-01

New realizations of finite W-algebras are constructed by relaxing the usual constraint conditions. Then finite W-algebras are recognized in the Heisenberg quantization recently proposed by Leinaas and Myrheim, for a system of two identical particles in d dimensions. As the anyonic parameter is directly associated to the W-algebra involved in the d=1 case, it is natural to consider that the W-algebra framework is well adapted for a possible generalization of the anyon statistics. ((orig.))

19. The large N=4 superconformal W∞ algebra

International Nuclear Information System (INIS)

Beccaria, Matteo; Candu, Constantin; Gaberdiel, Matthias R.

2014-01-01

The most general large N=4 superconformal W ∞ algebra, containing in addition to the superconformal algebra one supermultiplet for each integer spin, is analysed in detail. It is found that the W ∞ algebra is uniquely determined by the levels of the two su(2) algebras, a conclusion that holds both for the linear and the non-linear case. We also perform various cross-checks of our analysis, and exhibit two different types of truncations in some detail.

20. (Super)conformal algebra on the (super)torus

International Nuclear Information System (INIS)

Mezincescu, L.; Nepomechie, R.I.; Zachos, C.K.

1989-01-01

A generalization of the Virasoro algebra has recently been introduced by Krichever and Novikov (KN). The KN algebra describes the algebra of general conformal transformations in a basis appropriate to a genus-g Riemann surface. We examine in detail the genus-one KN algebra, and find explicit expressions for the central extension. We, further, construct explicitly the superconformal algebra of the supertorus, which yields supersymmetric generalizations of the genus-one KN algebra. A novel feature of the odd-spin-structure case is that the algebra includes a central element which is anticommuting. We comment on possible applications to string theory. (orig.)

1. Algebraic K-theory

CERN Document Server

Swan, R G

1968-01-01

From the Introduction: "These notes are taken from a course on algebraic K-theory [given] at the University of Chicago in 1967. They also include some material from an earlier course on abelian categories, elaborating certain parts of Gabriel's thesis. The results on K-theory are mostly of a very general nature."

2. Polynomial Heisenberg algebras

International Nuclear Information System (INIS)

Carballo, Juan M; C, David J Fernandez; Negro, Javier; Nieto, Luis M

2004-01-01

Polynomial deformations of the Heisenberg algebra are studied in detail. Some of their natural realizations are given by the higher order susy partners (and not only by those of first order, as is already known) of the harmonic oscillator for even-order polynomials. Here, it is shown that the susy partners of the radial oscillator play a similar role when the order of the polynomial is odd. Moreover, it will be proved that the general systems ruled by such kinds of algebras, in the quadratic and cubic cases, involve Painleve transcendents of types IV and V, respectively

3. 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

4. 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...

5. 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

6. One-particle many-body Green's function theory: Algebraic recursive definitions, linked-diagram theorem, irreducible-diagram theorem, and general-order algorithms.

Science.gov (United States)

Hirata, So; Doran, Alexander E; Knowles, Peter J; Ortiz, J V

2017-07-28

A thorough analytical and numerical characterization of the whole perturbation series of one-particle many-body Green's function (MBGF) theory is presented in a pedagogical manner. Three distinct but equivalent algebraic (first-quantized) recursive definitions of the perturbation series of the Green's function are derived, which can be combined with the well-known recursion for the self-energy. Six general-order algorithms of MBGF are developed, each implementing one of the three recursions, the ΔMPn method (where n is the perturbation order) [S. Hirata et al., J. Chem. Theory Comput. 11, 1595 (2015)], the automatic generation and interpretation of diagrams, or the numerical differentiation of the exact Green's function with a perturbation-scaled Hamiltonian. They all display the identical, nondivergent perturbation series except ΔMPn, which agrees with MBGF in the diagonal and frequency-independent approximations at 1≤n≤3 but converges at the full-configuration-interaction (FCI) limit at n=∞ (unless it diverges). Numerical data of the perturbation series are presented for Koopmans and non-Koopmans states to quantify the rate of convergence towards the FCI limit and the impact of the diagonal, frequency-independent, or ΔMPn approximation. The diagrammatic linkedness and thus size-consistency of the one-particle Green's function and self-energy are demonstrated at any perturbation order on the basis of the algebraic recursions in an entirely time-independent (frequency-domain) framework. The trimming of external lines in a one-particle Green's function to expose a self-energy diagram and the removal of reducible diagrams are also justified mathematically using the factorization theorem of Frantz and Mills. Equivalence of ΔMPn and MBGF in the diagonal and frequency-independent approximations at 1≤n≤3 is algebraically proven, also ascribing the differences at n = 4 to the so-called semi-reducible and linked-disconnected diagrams.

7. Higher regulators, algebraic

CERN Document Server

Bloch, Spencer J

2000-01-01

This book is the long-awaited publication of the famous Irvine lectures. Delivered in 1978 at the University of California at Irvine, these lectures turned out to be an entry point to several intimately-connected new branches of arithmetic algebraic geometry, such as regulators and special values of L-functions of algebraic varieties, explicit formulas for them in terms of polylogarithms, the theory of algebraic cycles, and eventually the general theory of mixed motives which unifies and underlies all of the above (and much more). In the 20 years since, the importance of Bloch's lectures has not diminished. A lucky group of people working in the above areas had the good fortune to possess a copy of old typewritten notes of these lectures. Now everyone can have their own copy of this classic work.

8. Algebraic topology a primer

CERN Document Server

Deo, Satya

2018-01-01

This book presents the first concepts of the topics in algebraic topology such as the general simplicial complexes, simplicial homology theory, fundamental groups, covering spaces and singular homology theory in greater detail. Originally published in 2003, this book has become one of the seminal books. Now, in the completely revised and enlarged edition, the book discusses the rapidly developing field of algebraic topology. Targeted to undergraduate and graduate students of mathematics, the prerequisite for this book is minimal knowledge of linear algebra, group theory and topological spaces. The book discusses about the relevant concepts and ideas in a very lucid manner, providing suitable motivations and illustrations. All relevant topics are covered, including the classical theorems like the Brouwer’s fixed point theorem, Lefschetz fixed point theorem, Borsuk-Ulam theorem, Brouwer’s separation theorem and the theorem on invariance of the domain. Most of the exercises are elementary, but sometimes chal...

9. Linear algebra

CERN Document Server

Stoll, R R

1968-01-01

Linear Algebra is intended to be used as a text for a one-semester course in linear algebra at the undergraduate level. The treatment of the subject will be both useful to students of mathematics and those interested primarily in applications of the theory. The major prerequisite for mastering the material is the readiness of the student to reason abstractly. Specifically, this calls for an understanding of the fact that axioms are assumptions and that theorems are logical consequences of one or more axioms. Familiarity with calculus and linear differential equations is required for understand

10. Lie algebras

CERN Document Server

Jacobson, Nathan

1979-01-01

Lie group theory, developed by M. Sophus Lie in the 19th century, ranks among the more important developments in modern mathematics. Lie algebras comprise a significant part of Lie group theory and are being actively studied today. This book, by Professor Nathan Jacobson of Yale, is the definitive treatment of the subject and can be used as a textbook for graduate courses.Chapter I introduces basic concepts that are necessary for an understanding of structure theory, while the following three chapters present the theory itself: solvable and nilpotent Lie algebras, Carlan's criterion and its

11. Basic algebra

CERN Document Server

Jacobson, Nathan

2009-01-01

A classic text and standard reference for a generation, this volume and its companion are the work of an expert algebraist who taught at Yale for two decades. Nathan Jacobson's books possess a conceptual and theoretical orientation, and in addition to their value as classroom texts, they serve as valuable references.Volume I explores all of the topics typically covered in undergraduate courses, including the rudiments of set theory, group theory, rings, modules, Galois theory, polynomials, linear algebra, and associative algebra. Its comprehensive treatment extends to such rigorous topics as L

12. Introduction to algebraic quantum field theory

International Nuclear Information System (INIS)

Horuzhy, S.S.

1990-01-01

This volume presents a systematic introduction to the algebraic approach to quantum field theory. The structure of the contents corresponds to the way the subject has advanced. It is shown how the algebraic approach has developed from the purely axiomatic theory of observables via superselection rules into the dynamical formalism of fields and observables. Chapter one discusses axioms and their consequences -many of which are now classical theorems- and deals, in general, with the axiomatic theory of local observable algebras. The absence of field concepts makes this theory incomplete and, in chapter two, superselection rules are shown to be the key to the reconstruction of fields from observables. Chapter three deals with the algebras of Wightman fields, first unbounded operator algebras, then Von Neumann field algebras (with a special section on wedge region algebras) and finally local algebras of free and generalised free fields. (author). 447 refs.; 4 figs

13. Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography.

Science.gov (United States)

Picek, Stjepan; Carlet, Claude; Guilley, Sylvain; Miller, Julian F; Jakobovic, Domagoj

2016-01-01

The role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of design criteria left unexplored and in this matter evolutionary computation can play a distinct role. This article concentrates on two scenarios for the use of Boolean functions in cryptography. The first uses Boolean functions as the source of the nonlinearity in filter and combiner generators. Although relatively well explored using evolutionary algorithms, it still presents an interesting goal in terms of the practical sizes of Boolean functions. The second scenario appeared rather recently where the objective is to find Boolean functions that have various orders of the correlation immunity and minimal Hamming weight. In both these scenarios we see that evolutionary algorithms are able to find high-quality solutions where genetic programming performs the best.

14. Representing Boolean Functions by Decision Trees

KAUST Repository

Chikalov, Igor

2011-01-01

A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms, and in some cases it is more compact than values table or even the formula [44]. Representing a function in the form of decision tree allows applying graph algorithms for various transformations [10]. Decision trees and branching programs are used for effective hardware [15] and software [5] implementation of functions. For the implementation to be effective, the function representation should have minimal time and space complexity. The average depth of decision tree characterizes the expected computing time, and the number of nodes in branching program characterizes the number of functional elements required for implementation. Often these two criteria are incompatible, i.e. there is no solution that is optimal on both time and space complexity. © Springer-Verlag Berlin Heidelberg 2011.

15. Message passing for quantified Boolean formulas

International Nuclear Information System (INIS)

Zhang, Pan; Ramezanpour, Abolfazl; Zecchina, Riccardo; Zdeborová, Lenka

2012-01-01

We introduce two types of message passing algorithms for quantified Boolean formulas (QBF). The first type is a message passing based heuristics that can prove unsatisfiability of the QBF by assigning the universal variables in such a way that the remaining formula is unsatisfiable. In the second type, we use message passing to guide branching heuristics of a Davis–Putnam–Logemann–Loveland (DPLL) complete solver. Numerical experiments show that on random QBFs our branching heuristics give robust exponential efficiency gain with respect to state-of-the-art solvers. We also manage to solve some previously unsolved benchmarks from the QBFLIB library. Apart from this, our study sheds light on using message passing in small systems and as subroutines in complete solvers

16. Synthesizing biomolecule-based Boolean logic gates.

Science.gov (United States)

Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari

2013-02-15

One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, and hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications.

17. Multipath Detection Using Boolean Satisfiability Techniques

Directory of Open Access Journals (Sweden)

2011-01-01

Full Text Available A new technique for multipath detection in wideband mobile radio systems is presented. The proposed scheme is based on an intelligent search algorithm using Boolean Satisfiability (SAT techniques to search through the uncertainty region of the multipath delays. The SAT-based scheme utilizes the known structure of the transmitted wideband signal, for example, pseudo-random (PN code, to effectively search through the entire space by eliminating subspaces that do not contain a possible solution. The paper presents a framework for modeling the multipath detection problem as a SAT application. It also provides simulation results that demonstrate the effectiveness of the proposed scheme in detecting the multipath components in frequency-selective Rayleigh fading channels.

18. Synthesizing Biomolecule-based Boolean Logic Gates

Science.gov (United States)

Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari

2012-01-01

One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications. PMID:23526588

19. Optical reversible programmable Boolean logic unit.

Science.gov (United States)

2012-07-20

Computing with reversibility is the only way to avoid dissipation of energy associated with bit erase. So, a reversible microprocessor is required for future computing. In this paper, a design of a simple all-optical reversible programmable processor is proposed using a polarizing beam splitter, liquid crystal-phase spatial light modulators, a half-wave plate, and plane mirrors. This circuit can perform 16 logical operations according to three programming inputs. Also, inputs can be easily recovered from the outputs. It is named the "reversible programmable Boolean logic unit (RPBLU)." The logic unit is the basic building block of many complex computational operations. Hence the design is important in sense. Two orthogonally polarized lights are defined here as two logical states, respectively.

20. Pure homology of algebraic varieties

OpenAIRE

Weber, Andrzej

2003-01-01

We show that for a complete complex algebraic variety the pure component of homology coincides with the image of intersection homology. Therefore pure homology is topologically invariant. To obtain slightly more general results we introduce "image homology" for noncomplete varieties.

1. Algebraic structure of chiral anomalies

International Nuclear Information System (INIS)

Stora, R.

1985-09-01

I will describe first the algebraic aspects of chiral anomalies, exercising however due care about the topological delicacies. I will illustrate the structure and methods in the context of gauge anomalies and will eventually make contact with results obtained from index theory. I will go into two sorts of generalizations: on the one hand, generalizing the algebraic set up yields e.g. gravitational and mixed gauge anomalies, supersymmetric gauge anomalies, anomalies in supergravity theories; on the other hand most constructions applied to the cohomologies which characterize anomalies easily extend to higher cohomologies. Section II is devoted to a description of the general set up as it applies to gauge anomalies. Section III deals with a number of algebraic set ups which characterize more general types of anomalies: gravitational and mixed gauge anomalies, supersymmetric gauge anomalies, anomalies in supergravity theories. It also includes brief remarks on σ models and a reminder on the full BRST algebra of quantized gauge theories

2. ALGEBRAIC TOPOLOGY

tion - 6. How Architectural Features Affect. Building During Earthquakes? C VRMurty. 48 Turbulence and Dispersion. K 5 Gandhi. BOOK REVIEWS. 86 Algebraic Topology. Siddhartha Gadgil. Front Cover. - .. ..-.......... -. Back Cover. Two-dimensional vertical section through a turbulent plume. (Courtesy: G S Shat, CAOS, IISc.).

3. Algebraic stacks

Deligne, Mumford and Artin [DM, Ar2]) and consider algebraic stacks, then we can cons- truct the 'moduli ... the moduli scheme and the moduli stack of vector bundles. First I will give ... 1–31. © Printed in India. 1 ...... Cultura, Spain. References.

4. Invariants of triangular Lie algebras

International Nuclear Information System (INIS)

Boyko, Vyacheslav; Patera, Jiri; Popovych, Roman

2007-01-01

Triangular Lie algebras are the Lie algebras which can be faithfully represented by triangular matrices of any finite size over the real/complex number field. In the paper invariants ('generalized Casimir operators') are found for three classes of Lie algebras, namely those which are either strictly or non-strictly triangular, and for so-called special upper triangular Lie algebras. Algebraic algorithm of Boyko et al (2006 J. Phys. A: Math. Gen.39 5749 (Preprint math-ph/0602046)), developed further in Boyko et al (2007 J. Phys. A: Math. Theor.40 113 (Preprint math-ph/0606045)), is used to determine the invariants. A conjecture of Tremblay and Winternitz (2001 J. Phys. A: Math. Gen.34 9085), concerning the number of independent invariants and their form, is corroborated

5. Representations of affine Hecke algebras

CERN Document Server

Xi, Nanhua

1994-01-01

Kazhdan and Lusztig classified the simple modules of an affine Hecke algebra Hq (q E C*) provided that q is not a root of 1 (Invent. Math. 1987). Ginzburg had some very interesting work on affine Hecke algebras. Combining these results simple Hq-modules can be classified provided that the order of q is not too small. These Lecture Notes of N. Xi show that the classification of simple Hq-modules is essentially different from general cases when q is a root of 1 of certain orders. In addition the based rings of affine Weyl groups are shown to be of interest in understanding irreducible representations of affine Hecke algebras. Basic knowledge of abstract algebra is enough to read one third of the book. Some knowledge of K-theory, algebraic group, and Kazhdan-Lusztig cell of Cexeter group is useful for the rest

6. Superalgebras with Grassmann algebra-valued structure constants from superfields

International Nuclear Information System (INIS)

Azcarraga, J.A. de; Lukierski, J.

1987-05-01

We introduce generalized Lie algebras and superalgebras with generators and structure constants taking values in a Grassmann algebra. Such algebraic structures describe the equal time algebras in the superfield formalism. As an example we consider the equal time commutators and anticommutators among bilinears made out of the D=1 quantum superfields describing the supersymmetric harmonic oscillator. (author). 10 refs

7. Certain extensions of vertex operator algebras of affine type

International Nuclear Information System (INIS)

Li Haisheng

2001-01-01

We generalize Feigin and Miwa's construction of extended vertex operator (super)algebras A k (sl(2)) for other types of simple Lie algebras. For all the constructed extended vertex operator (super)algebras, irreducible modules are classified, complete reducibility of every module is proved and fusion rules are determined modulo the fusion rules for vertex operator algebras of affine type. (orig.)

8. More on the linearization of W-algebras

International Nuclear Information System (INIS)

Krivonos, S.; Sorin, A.

1995-01-01

We show that a wide class of W-(super)algebras, including W N (N-1) , U(N)-superconformal as well as W N nonlinear algebras, can be linearized by embedding them as subalgebras into some linear (super)conformal algebras with finite sets of currents. The general construction is illustrated by the example of W 4 algebra. 16 refs

9. The Work of Lagrange in Number Theory and Algebra

GENERAL I ARTICLE. The Work of Lagrange in Number Theory and Algebra. D P Patil, C R Pranesachar and Renuka RafJindran. (left) D P Patil got his Ph.D from the School of Math- ematics, TIFR and joined. IISc in 1992. His interests are commutative algebra, algebraic geometry and algebraic number theory. (right) C R ...

10. On the classification of quantum W-algebras

International Nuclear Information System (INIS)

Bowcock, P.; Watts, G.T.M.

1992-01-01

In this paper we consider the structure of general quantum W-algebras. We introduce the notions of deformability, positive-definiteness, and reductivity of a W-algebra. We show that one can associate a reductive finite Lie algebra to each reductive W-algebra. The finite Lie algebra is also endowed with a preferred sl(2) subalgebra, which gives the conformal weights of the W-algebra. We extend this to cover W-algebras containing both bosonic and fermionic fields, and illustrate our ideas with the Poisson bracket algebras of generalised Drinfeld-Sokolov hamiltonian systems. We then discuss the possibilities of classifying deformable W-algebras which fall outside this class in the context of automorphisms of Lie algebras. In conclusion we list the cases in which the W-algebra has no weight-one fields, and further, those in which it has only one weight-two field. (orig.)

11. 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...

12. A short Boolean derivation of mean failure frequency for any (also non-coherent) system

International Nuclear Information System (INIS)

Schneeweiss, Winfrid G.

2009-01-01

For stationary repairable systems it is shown that the probabilistic weights for the individual components' mean failure frequencies (MFFs) that can be added to yield the system's MFF are found easily from the first step of the Boolean fault tree function's Shannon decomposition. This way one finds a general theory of a system's MFF and the case of coherence covered in standard textbooks is shown to be a subcase. Unfortunately, elegant rules for calculating system MFF from any polynomial form of the fault tree's Boolean function are only known for the coherent case, but repeated here, because they are not yet found in many textbooks. An example known from literature is treated extensively with great care.

13. 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.)

14. 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

15. Linear algebra as an alternative approach to the synthesis of digital devices of automation and control systems

Directory of Open Access Journals (Sweden)

Nikolay Chernov

2018-01-01

Full Text Available The article considers linear algebra as an alternative mathematical tool of logic synthesis of digital structures to Boolean algebra and synthesis methods of digital electronic component base (ECB on its ground. The methods of solving the applied problems of logic synthesis are shown, including the expansion of an arbitrary logic function by means of monotonic functions. The proposed mathematical apparatus actually provides the creation of digital structures on the principles of analog circuitry. It can find application in the design of multivalued digital ECB, specialized system-on-chip and analog-digital sensors with current output. The examples of synthesis of the combinational and sequential two-valued and multivalued digital devices are given. In conclusion, the advantages of linear algebra in comparison with Boolean algebra are formulated.

16. Characterizations of locally C*-algebras

International Nuclear Information System (INIS)

1991-08-01

We seek the generalization of the Gelfand-Naimark theorems for locally C*-algebras. Precisely, if A is a unital commutative locally C*-algebra, then it is shown that A is *-isomorphic (topologically and algebraically) to C(Δ). Further, if A is any locally C*-algebra, then it is realized as a closed *-subalgebra of some L(H) up to a topological algebraic *-isomorphism. Also, a brief exposition of the Gelfand-Naimark-Segal construction is given and some of its consequences are discussed. (author). 16 refs

17. On 2-Banach algebras

International Nuclear Information System (INIS)

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

18. A transition calculus for Boolean functions. [logic circuit analysis

Science.gov (United States)

Tucker, J. H.; Bennett, A. W.

1974-01-01

A transition calculus is presented for analyzing the effect of input changes on the output of logic circuits. The method is closely related to the Boolean difference, but it is more powerful. Both differentiation and integration are considered.

19. Clifford algebras and the minimal representations of the 1D N-extended supersymmetry algebra

International Nuclear Information System (INIS)

Toppan, Francesco

2008-01-01

The Atiyah-Bott-Shapiro classification of the irreducible Clifford algebra is used to derive general properties of the minimal representations of the 1D N-Extended Supersymmetry algebra (the Z 2 -graded symmetry algebra of the Supersymmetric Quantum Mechanics) linearly realized on a finite number of fields depending on a real parameter t, the time. (author)

20. 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.

1. Nonlinear threshold Boolean automata networks and phase transitions

OpenAIRE

Demongeot, Jacques; Sené, Sylvain

2010-01-01

In this report, we present a formal approach that addresses the problem of emergence of phase transitions in stochastic and attractive nonlinear threshold Boolean automata networks. Nonlinear networks considered are informally defined on the basis of classical stochastic threshold Boolean automata networks in which specific interaction potentials of neighbourhood coalition are taken into account. More precisely, specific nonlinear terms compose local transition functions that define locally t...

2. Grassmann, super-Kac-Moody and super-derivation algebras

International Nuclear Information System (INIS)

Frappat, L.; Ragoucy, E.; Sorba, P.

1989-05-01

We study the cyclic cocycles of degree one on the Grassmann algebra and on the super-circle with N supersymmetries (i.e. the tensor product of the algebra of functions on the circle times a Grassmann algebra with N generators). They are related to central extensions of graded loop algebras (i.e. super-Kac-Moody algebras). The corresponding algebras of super-derivations have to be compatible with the cocycle characterizing the extension; we give a general method for determining these algebras and examine in particular the cases N = 1,2,3. We also discuss their relations with the Ademollo et al. algebras, and examine the possibility of defining new kinds of super-conformal algebras, which, for N > 1, generalize the N = 1 Ramond-Neveu-Schwarz algebra

3. Remarks on finite W algebras

International Nuclear Information System (INIS)

Barbarin, F.; Sorba, P.; Ragoucy, E.

1996-01-01

The property of some finite W algebras to be the commutant of a particular subalgebra of a simple Lie algebra G is used to construct realizations of G. When G ≅ so (4,2), unitary representations of the conformal and Poincare algebras are recognized in this approach, which can be compared to the usual induced representation technique. When G approx=(2, R), the anyonic parameter can be seen as the eigenvalue of a W generator in such W representations of G. The generalization of such properties to the affine case is also discussed in the conclusion, where an alternative of the Wakimoto construction for sl(2) k is briefly presented. (authors)

4. 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.

5. SYNTHESIS METHODS OF ALGEBRAIC NORMAL FORM OF MANY-VALUED LOGIC FUNCTIONS

Directory of Open Access Journals (Sweden)

A. V. Sokolov

2016-01-01

Full Text Available The rapid development of methods of error-correcting coding, cryptography, and signal synthesis theory based on the principles of many-valued logic determines the need for a more detailed study of the forms of representation of functions of many-valued logic. In particular the algebraic normal form of Boolean functions, also known as Zhegalkin polynomial, that well describe many of the cryptographic properties of Boolean functions is widely used. In this article, we formalized the notion of algebraic normal form for many-valued logic functions. We developed a fast method of synthesis of algebraic normal form of 3-functions and 5-functions that work similarly to the Reed-Muller transform for Boolean functions: on the basis of recurrently synthesized transform matrices. We propose the hypothesis, which determines the rules of the synthesis of these matrices for the transformation from the truth table to the coefficients of the algebraic normal form and the inverse transform for any given number of variables of 3-functions or 5-functions. The article also introduces the definition of algebraic degree of nonlinearity of the functions of many-valued logic and the S-box, based on the principles of many-valued logic. Thus, the methods of synthesis of algebraic normal form of 3-functions applied to the known construction of recurrent synthesis of S-boxes of length N = 3k, whereby their algebraic degrees of nonlinearity are computed. The results could be the basis for further theoretical research and practical applications such as: the development of new cryptographic primitives, error-correcting codes, algorithms of data compression, signal structures, and algorithms of block and stream encryption, all based on the perspective principles of many-valued logic. In addition, the fast method of synthesis of algebraic normal form of many-valued logic functions is the basis for their software and hardware implementation.

6. PARAMETER ESTIMATION IN NON-HOMOGENEOUS BOOLEAN MODELS: AN APPLICATION TO PLANT DEFENSE RESPONSE

Directory of Open Access Journals (Sweden)

Maria Angeles Gallego

2014-11-01

Full Text Available Many medical and biological problems require to extract information from microscopical images. Boolean models have been extensively used to analyze binary images of random clumps in many scientific fields. In this paper, a particular type of Boolean model with an underlying non-stationary point process is considered. The intensity of the underlying point process is formulated as a fixed function of the distance to a region of interest. A method to estimate the parameters of this Boolean model is introduced, and its performance is checked in two different settings. Firstly, a comparative study with other existent methods is done using simulated data. Secondly, the method is applied to analyze the longleaf data set, which is a very popular data set in the context of point processes included in the R package spatstat. Obtained results show that the new method provides as accurate estimates as those obtained with more complex methods developed for the general case. Finally, to illustrate the application of this model and this method, a particular type of phytopathological images are analyzed. These images show callose depositions in leaves of Arabidopsis plants. The analysis of callose depositions, is very popular in the phytopathological literature to quantify activity of plant immunity.

7. On Deformations and Contractions of Lie Algebras

Directory of Open Access Journals (Sweden)

Marc de Montigny

2006-05-01

Full Text Available In this contributed presentation, we discuss and compare the mutually opposite procedures of deformations and contractions of Lie algebras. We suggest that with appropriate combinations of both procedures one may construct new Lie algebras. We first discuss low-dimensional Lie algebras and illustrate thereby that whereas for every contraction there exists a reverse deformation, the converse is not true in general. Also we note that some Lie algebras belonging to parameterized families are singled out by the irreversibility of deformations and contractions. After reminding that global deformations of the Witt, Virasoro, and affine Kac-Moody algebras allow one to retrieve Lie algebras of Krichever-Novikov type, we contract the latter to find new infinite dimensional Lie algebras.

8. Filiform Lie algebras of order 3

International Nuclear Information System (INIS)

Navarro, R. M.

2014-01-01

The aim of this work is to generalize a very important type of Lie algebras and superalgebras, i.e., filiform Lie (super)algebras, into the theory of Lie algebras of order F. Thus, the concept of filiform Lie algebras of order F is obtained. In particular, for F = 3 it has been proved that by using infinitesimal deformations of the associated model elementary Lie algebra it can be obtained families of filiform elementary lie algebras of order 3, analogously as that occurs into the theory of Lie algebras [M. Vergne, “Cohomologie des algèbres de Lie nilpotentes. Application à l’étude de la variété des algèbres de Lie nilpotentes,” Bull. Soc. Math. France 98, 81–116 (1970)]. Also we give the dimension, using an adaptation of the sl(2,C)-module Method, and a basis of such infinitesimal deformations in some generic cases

9. Filiform Lie algebras of order 3

Science.gov (United States)

Navarro, R. M.

2014-04-01

The aim of this work is to generalize a very important type of Lie algebras and superalgebras, i.e., filiform Lie (super)algebras, into the theory of Lie algebras of order F. Thus, the concept of filiform Lie algebras of order F is obtained. In particular, for F = 3 it has been proved that by using infinitesimal deformations of the associated model elementary Lie algebra it can be obtained families of filiform elementary lie algebras of order 3, analogously as that occurs into the theory of Lie algebras [M. Vergne, "Cohomologie des algèbres de Lie nilpotentes. Application à l'étude de la variété des algèbres de Lie nilpotentes," Bull. Soc. Math. France 98, 81-116 (1970)]. Also we give the dimension, using an adaptation of the {sl}(2,{C})-module Method, and a basis of such infinitesimal deformations in some generic cases.

10. Operator theory, operator algebras and applications

CERN Document Server

Lebre, Amarino; Samko, Stefan; Spitkovsky, Ilya

2014-01-01

This book consists of research papers that cover the scientific areas of the International Workshop on Operator Theory, Operator Algebras and Applications, held in Lisbon in September 2012. The volume particularly focuses on (i) operator theory and harmonic analysis (singular integral operators with shifts; pseudodifferential operators, factorization of almost periodic matrix functions; inequalities; Cauchy type integrals; maximal and singular operators on generalized Orlicz-Morrey spaces; the Riesz potential operator; modification of Hadamard fractional integro-differentiation), (ii) operator algebras (invertibility in groupoid C*-algebras; inner endomorphisms of some semi group, crossed products; C*-algebras generated by mappings which have finite orbits; Folner sequences in operator algebras; arithmetic aspect of C*_r SL(2); C*-algebras of singular integral operators; algebras of operator sequences) and (iii) mathematical physics (operator approach to diffraction from polygonal-conical screens; Poisson geo...

11. The Lie algebra of the N=2-string

International Nuclear Information System (INIS)

Kugel, K.

2006-01-01

The theory of generalized Kac-Moody algebras is a generalization of the theory of finite dimensional simple Lie algebras. The physical states of some compactified strings give realizations of generalized Kac-Moody algebras. For example the physical states of a bosonic string moving on a 26 dimensional torus form a generalized Kac-Moody algebra and the physical states of a N=1 string moving on a 10 dimensional torus form a generalized Kac-Moody superalgebra. A natural question is whether the physical states of the compactified N=2-string also realize such an algebra. In this thesis we construct the Lie algebra of the compactified N=2-string, study its properties and show that it is not a generalized Kac-Moody algebra. The Fock space of a N=2-string moving on a 4 dimensional torus can be described by a vertex algebra constructed from a rational lattice of signature (8,4). Here 6 coordinates with signature (4,2) come from the matter part and 6 coordinates with signature (4,2) come from the ghost part. The physical states are represented by the cohomology of the BRST-operator. The vertex algebra induces a product on the vector space of physical states that defines the structure of a Lie algebra on this space. This Lie algebra shares many properties with generalized Kac-Moody algebra but we will show that it is not a generalized Kac-Moody algebra. (orig.)

12. The Lie algebra of the N=2-string

Energy Technology Data Exchange (ETDEWEB)

Kugel, K

2006-07-01

The theory of generalized Kac-Moody algebras is a generalization of the theory of finite dimensional simple Lie algebras. The physical states of some compactified strings give realizations of generalized Kac-Moody algebras. For example the physical states of a bosonic string moving on a 26 dimensional torus form a generalized Kac-Moody algebra and the physical states of a N=1 string moving on a 10 dimensional torus form a generalized Kac-Moody superalgebra. A natural question is whether the physical states of the compactified N=2-string also realize such an algebra. In this thesis we construct the Lie algebra of the compactified N=2-string, study its properties and show that it is not a generalized Kac-Moody algebra. The Fock space of a N=2-string moving on a 4 dimensional torus can be described by a vertex algebra constructed from a rational lattice of signature (8,4). Here 6 coordinates with signature (4,2) come from the matter part and 6 coordinates with signature (4,2) come from the ghost part. The physical states are represented by the cohomology of the BRST-operator. The vertex algebra induces a product on the vector space of physical states that defines the structure of a Lie algebra on this space. This Lie algebra shares many properties with generalized Kac-Moody algebra but we will show that it is not a generalized Kac-Moody algebra. (orig.)

13. Quantum algebra of N superspace

International Nuclear Information System (INIS)

Hatcher, Nicolas; Restuccia, A.; Stephany, J.

2007-01-01

We identify the quantum algebra of position and momentum operators for a quantum system bearing an irreducible representation of the super Poincare algebra in the N>1 and D=4 superspace, both in the case where there are no central charges in the algebra, and when they are present. This algebra is noncommutative for the position operators. We use the properties of superprojectors acting on the superfields to construct explicit position and momentum operators satisfying the algebra. They act on the projected wave functions associated to the various supermultiplets with defined superspin present in the representation. We show that the quantum algebra associated to the massive superparticle appears in our construction and is described by a supermultiplet of superspin 0. This result generalizes the construction for D=4, N=1 reported recently. For the case N=2 with central charges, we present the equivalent results when the central charge and the mass are different. For the κ-symmetric case when these quantities are equal, we discuss the reduction to the physical degrees of freedom of the corresponding superparticle and the construction of the associated quantum algebra

14. Algebra of Majorana doubling.

Science.gov (United States)

Lee, Jaehoon; Wilczek, Frank

2013-11-27

Motivated by the problem of identifying Majorana mode operators at junctions, we analyze a basic algebraic structure leading to a doubled spectrum. For general (nonlinear) interactions the emergent mode creation operator is highly nonlinear in the original effective mode operators, and therefore also in the underlying electron creation and destruction operators. This phenomenon could open up new possibilities for controlled dynamical manipulation of the modes. We briefly compare and contrast related issues in the Pfaffian quantum Hall state.

15. 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.

16. On d -Dimensional Lattice (co)sine n -Algebra

International Nuclear Information System (INIS)

Yao Shao-Kui; Zhang Chun-Hong; Zhao Wei-Zhong; Ding Lu; Liu Peng

2016-01-01

We present the (co)sine n-algebra which is indexed by the d-dimensional integer lattice. Due to the associative operators, this generalized (co)sine n-algebra is the higher order Lie algebra for the n even case. The particular cases are the d-dimensional lattice sine 3 and cosine 5-algebras with the special parameter values. We find that the corresponding d-dimensional lattice sine 3 and cosine 5-algebras are the Nambu 3-algebra and higher order Lie algebra, respectively. The limiting case of the d-dimensional lattice (co)sine n-algebra is also discussed. Moreover we construct the super sine n-algebra, which is the super higher order Lie algebra for the n even case. (paper)

17. 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)

18. Vertex ring-indexed Lie algebras

International Nuclear Information System (INIS)

Fairlie, David; Zachos, Cosmas

2005-01-01

Infinite-dimensional Lie algebras are introduced, which are only partially graded, and are specified by indices lying on cyclotomic rings. They may be thought of as generalizations of the Onsager algebra, but unlike it, or its sl(n) generalizations, they are not subalgebras of the loop algebras associated with sl(n). In a particular interesting case associated with sl(3), their indices lie on the Eisenstein integer triangular lattice, and these algebras are expected to underlie vertex operator combinations in CFT, brane physics, and graphite monolayers

19. 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...

20. 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...

1. Algebra for Enterprise Ontology: towards analysis and synthesis of enterprise models

Science.gov (United States)

Suga, Tetsuya; Iijima, Junichi

2018-03-01

Enterprise modeling methodologies have made enterprises more likely to be the object of systems engineering rather than craftsmanship. However, the current state of research in enterprise modeling methodologies lacks investigations of the mathematical background embedded in these methodologies. Abstract algebra, a broad subfield of mathematics, and the study of algebraic structures may provide interesting implications in both theory and practice. Therefore, this research gives an empirical challenge to establish an algebraic structure for one aspect model proposed in Design & Engineering Methodology for Organizations (DEMO), which is a major enterprise modeling methodology in the spotlight as a modeling principle to capture the skeleton of enterprises for developing enterprise information systems. The results show that the aspect model behaves well in the sense of algebraic operations and indeed constructs a Boolean algebra. This article also discusses comparisons with other modeling languages and suggests future work.

2. L_∞ algebras and field theory

International Nuclear Information System (INIS)

Hohm, Olaf; Zwiebach, Barton

2017-01-01

We review and develop the general properties of L_∞ algebras focusing on the gauge structure of the associated field theories. Motivated by the L_∞ homotopy Lie algebra of closed string field theory and the work of Roytenberg and Weinstein describing the Courant bracket in this language we investigate the L_∞ structure of general gauge invariant perturbative field theories. We sketch such formulations for non-abelian gauge theories, Einstein gravity, and for double field theory. We find that there is an L_∞ algebra for the gauge structure and a larger one for the full interacting field theory. Theories where the gauge structure is a strict Lie algebra often require the full L_∞ algebra for the interacting theory. The analysis suggests that L_∞ algebras provide a classification of perturbative gauge invariant classical field theories. (copyright 2017 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

3. Yoneda algebras of almost Koszul algebras

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

4. Equivalency of two-dimensional algebras

International Nuclear Information System (INIS)

Santos, Gildemar Carneiro dos; Pomponet Filho, Balbino Jose S.

2011-01-01

Full text: Let us consider a vector z = xi + yj over the field of real numbers, whose basis (i,j) satisfy a given algebra. Any property of this algebra will be reflected in any function of z, so we can state that the knowledge of the properties of an algebra leads to more general conclusions than the knowledge of the properties of a function. However structural properties of an algebra do not change when this algebra suffers a linear transformation, though the structural constants defining this algebra do change. We say that two algebras are equivalent to each other whenever they are related by a linear transformation. In this case, we have found that some relations between the structural constants are sufficient to recognize whether or not an algebra is equivalent to another. In spite that the basis transform linearly, the structural constants change like a third order tensor, but some combinations of these tensors result in a linear transformation, allowing to write the entries of the transformation matrix as function of the structural constants. Eventually, a systematic way to find the transformation matrix between these equivalent algebras is obtained. In this sense, we have performed the thorough classification of associative commutative two-dimensional algebras, and find that even non-division algebra may be helpful in solving non-linear dynamic systems. The Mandelbrot set was used to have a pictorial view of each algebra, since equivalent algebras result in the same pattern. Presently we have succeeded in classifying some non-associative two-dimensional algebras, a task more difficult than for associative one. (author)

5. 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.)

6. The central extensions of Kac-Moody-Malcev algebras

International Nuclear Information System (INIS)

Osipov, E.P.

1989-01-01

The authors introduce a class of infinite-dimensional Kac-Moody-Malcev algebras. The Kac-Moody-Malcev algebras are the generalization of Lie algebras of Kac-Moody type to the Malcev algebras. They demonstrate that the central extensions of Kac-Moody-Malcev algebras are given by the same cocycles as in the case of Lie algebras. It is given a construction of Virasoro algebra in terms of bilinear combinations of currents satisfying the Kac-Moody-Malcev commutation relations. Thus, it is given the generalization of the Sugawara Construction to the case of Kac-Moody-Malcev algebras. Analogues of Kac-Moody-Malcev algebras may be also introduced in the case of arbitrary Riemann surface

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

8. Quantization and representation theory of finite W algebras

International Nuclear Information System (INIS)

Boer, J. de; Tjin, T.

1993-01-01

In this paper we study the finitely generated algebras underlying W algebras. These so called 'finite W algebras' are constructed as Poisson reductions of Kirillov Poisson structures on simple Lie algebras. The inequivalent reductions are labeled by the inequivalent embeddings of sl 2 into the simple Lie algebra in question. For arbitrary embeddings a coordinate free formula for the reduced Poisson structure is derived. We also prove that any finite W algebra can be embedded into the Kirillov Poisson algebra of a (semi)simple Lie algebra (generalized Miura map). Furthermore it is shown that generalized finite Toda systems are reductions of a system describing a free particle moving on a group manifold and that they have finite W symmetry. In the second part we BRST quantize the finite W algebras. The BRST cohomoloy is calculated using a spectral sequence (which is different from the one used by Feigin and Frenkel). This allows us to quantize all finite W algebras in one stroke. Examples are given. In the last part of the paper we study the representation theory of finite W algebras. It is shown, using a quantum inversion of the generalized Miura transformation, that the representations of finite W algebras can be constructed from the representations of a certain Lie subalgebra of the original simple Lie algebra. As a byproduct of this we are able to construct the Fock realizations of arbitrary finite W algebras. (orig.)

9. 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.

10. Color-charge algebras in Adler's chromodynamics

International Nuclear Information System (INIS)

Cvitanovic, P.; Gonsalves, R.J.; Neville, D.E.

1978-01-01

We show that the color-charge algebra in the three-quark sector generated by the matrices of the fundamental representation of U(n) does not have the trace properties required in Adler's extension of chromodynamics. We also discuss a diagrammatic representation of algebras generated by quark and antiquark charges in general, and an embedding of the N-quark algebra in the symmetric group S/sub N/+1

11. Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams

DEFF Research Database (Denmark)

Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif

1999-01-01

The combinational logic-level equivalence problem is to determine whether two given combinational circuits implement the same Boolean function. This problem arises in a number of CAD applications, for example when checking the correctness of incremental design changes (performed either manually...... or by a design automation tool).This paper introduces a data structure called Boolean Expression Diagrams (BEDs) and two algorithms for transforming a BED into a Reduced Ordered Binary Decision Diagram (OBDD). BEDs are capable of representing any Boolean circuit in linear space and can exploit structural...... similarities between the two circuits that are compared. These properties make BEDs suitable for verifying the equivalence of combinational circuits. BEDs can be seen as an intermediate representation between circuits (which are compact) and OBDDs (which are canonical).Based on a large number of combinational...

12. Exploiting Surroundedness for Saliency Detection: A Boolean Map Approach.

Science.gov (United States)

Zhang, Jianming; Sclaroff, Stan

2016-05-01

We demonstrate the usefulness of surroundedness for eye fixation prediction by proposing a Boolean Map based Saliency model (BMS). In our formulation, an image is characterized by a set of binary images, which are generated by randomly thresholding the image's feature maps in a whitened feature space. Based on a Gestalt principle of figure-ground segregation, BMS computes a saliency map by discovering surrounded regions via topological analysis of Boolean maps. Furthermore, we draw a connection between BMS and the Minimum Barrier Distance to provide insight into why and how BMS can properly captures the surroundedness cue via Boolean maps. The strength of BMS is verified by its simplicity, efficiency and superior performance compared with 10 state-of-the-art methods on seven eye tracking benchmark datasets.

13. Algebraic Side-Channel Attack on Twofish

Directory of Open Access Journals (Sweden)

Chujiao Ma

2017-05-01

Full Text Available While algebraic side-channel attack (ASCA has been successful in breaking simple cryptographic algorithms, it has never been done on larger or more complex algorithms such as Twofish. Compared to other algorithms that ASCA has been used on, Twofish is more difficult to attack due to the key-dependent S-boxes as well as the complex key scheduling. In this paper, we propose the first algebraic side-channel attack on Twofish, and examine the importance of side-channel information in getting past the key-dependent S-boxes and the complex key scheduling. The cryptographic algorithm and side-channel information are both expressed as boolean equations and a SAT solver is used to recover the key. While algebraic attack by itself is not sufficient to break the algorithm, with the help of side-channel information such as Hamming weights, we are able to correctly solve for 96 bits of the 128 bits key in under 2 hours with known plaintext/ciphertext.

14. Biderivations of finite dimensional complex simple Lie algebras

OpenAIRE

Tang, Xiaomin

2016-01-01

In this paper, we prove that a biderivation of a finite dimensional complex simple Lie algebra without the restriction of skewsymmetric is inner. As an application, the biderivation of a general linear Lie algebra is presented. In particular, we find a class of a non-inner and non-skewsymmetric biderivations. Furthermore, we also get the forms of linear commuting maps on the finite dimensional complex simple Lie algebra or general linear Lie algebra.

15. Coset realization of unifying W-algebras

International Nuclear Information System (INIS)

Blumenhagen, R.; Huebel, R.

1994-06-01

We construct several quantum coset W-algebras, e.g. sl(2,R)/U(1) and sl(2,R)+sl(2,R)/sl(2,R), and argue that they are finitely nonfreely generated. Furthermore, we discuss in detail their role as unifying W-algebras of Casimir W-algebras. We show that it is possible to give coset realizations of various types of unifying W-algebras, e.g. the diagonal cosets based on the symplectic Lie algebras sp(2n) realize the unifying W-algebras which have previously been introduced as 'WD -n '. In addition, minimal models of WD -n are studied. The coset realizations provide a generalization of level-rank-duality of dual coset pairs. As further examples of finitely nonfreely generated quantum W-algebras we discuss orbifolding of W-algebras which on the quantum level has different properties than in the classical case. We demonstrate in some examples that the classical limit according to Bowcock and Watts of these nonfreely finitely generated quantum W-algebras probably yields infinitely nonfreely generated classical W-algebras. (orig.)

16. Computations in finite-dimensional Lie algebras

Directory of Open Access Journals (Sweden)

A. M. Cohen

1997-12-01

Full Text Available This paper describes progress made in context with the construction of a general library of Lie algebra algorithms, called ELIAS (Eindhoven Lie Algebra System, within the computer algebra package GAP. A first sketch of the package can be found in Cohen and de Graaf[1]. Since then, in a collaborative effort with G. Ivanyos, the authors have continued to develop algorithms which were implemented in ELIAS by the second author. These activities are part of a bigger project, called ACELA and financed by STW, the Dutch Technology Foundation, which aims at an interactive book on Lie algebras (cf. Cohen and Meertens [2]. This paper gives a global description of the main ways in which to present Lie algebras on a computer. We focus on the transition from a Lie algebra abstractly given by an array of structure constants to a Lie algebra presented as a subalgebra of the Lie algebra of n×n matrices. We describe an algorithm typical of the structure analysis of a finite-dimensional Lie algebra: finding a Levi subalgebra of a Lie algebra.

17. 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

18. 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.

19. The algebras of large N matrix mechanics

Energy Technology Data Exchange (ETDEWEB)

Halpern, M.B.; Schwartz, C.

1999-09-16

Extending early work, we formulate the large N matrix mechanics of general bosonic, fermionic and supersymmetric matrix models, including Matrix theory: The Hamiltonian framework of large N matrix mechanics provides a natural setting in which to study the algebras of the large N limit, including (reduced) Lie algebras, (reduced) supersymmetry algebras and free algebras. We find in particular a broad array of new free algebras which we call symmetric Cuntz algebras, interacting symmetric Cuntz algebras, symmetric Bose/Fermi/Cuntz algebras and symmetric Cuntz superalgebras, and we discuss the role of these algebras in solving the large N theory. Most important, the interacting Cuntz algebras are associated to a set of new (hidden!) local quantities which are generically conserved only at large N. A number of other new large N phenomena are also observed, including the intrinsic nonlocality of the (reduced) trace class operators of the theory and a closely related large N field identification phenomenon which is associated to another set (this time nonlocal) of new conserved quantities at large N.

20. Novikov-Jordan algebras

OpenAIRE

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.

1. A class of algebraically general solutions of the Einstein-Maxwell equations for non-null electromagnetic fields

International Nuclear Information System (INIS)

Tupper, B.O.J.

1976-01-01

In a previous article (Gen. Rel. Grav.; 6 : 345 (1975)) the Einstein-Maxwell field equations for non-null electromagnetic fields were studied under the conditions that the null tetrad is parallel-propagated along both principal null congruences. A solution with twist and shear, but no expansion, was found and was conjectured to be the only expansion-free solution. Here it is shown that this conjecture is false; the general expansion-free solution is found to be a family of space-times depending on a single constant parameter which is the ratio of the (constant) twists of the two principal null congruences. (author)

2. Further Results on Constructions of Generalized Bent Boolean Functions

Science.gov (United States)

2016-03-01

China; 2Naval Postgraduate School, Applied Mathematics Department, Monterey, CA 93943, USA; 3Science and Technology on Communication Security...in 1976 as an interesting combinatorial object with the important property of having op- timal nonlinearity [1]. Since bent functions have many...77–94 10 Zhao Y, Li H L. On bent functions with some symmet- ric properties. Discret Appl Math, 2006, 154: 2537– 2543

3. A Boolean Approach to Airline Business Model Innovation

DEFF Research Database (Denmark)

Hvass, Kristian Anders

Research in business model innovation has identified its significance in creating a sustainable competitive advantage for a firm, yet there are few empirical studies identifying which combination of business model activities lead to success and therefore deserve innovative attention. This study...... analyzes the business models of North America low-cost carriers from 2001 to 2010 using a Boolean minimization algorithm to identify which combinations of business model activities lead to operational profitability. The research aim is threefold: complement airline literature in the realm of business model...... innovation, introduce Boolean minimization methods to the field, and propose alternative business model activities to North American carriers striving for positive operating results....

4. On Kolmogorov's superpositions and Boolean functions

Energy Technology Data Exchange (ETDEWEB)

Beiu, V.

1998-12-31

The paper overviews results dealing with the approximation capabilities of neural networks, as well as bounds on the size of threshold gate circuits. Based on an explicit numerical (i.e., constructive) algorithm for Kolmogorov's superpositions they will show that for obtaining minimum size neutral networks for implementing any Boolean function, the activation function of the neurons is the identity function. Because classical AND-OR implementations, as well as threshold gate implementations require exponential size (in the worst case), it will follow that size-optimal solutions for implementing arbitrary Boolean functions require analog circuitry. Conclusions and several comments on the required precision are ending the paper.

5. Optimization-Based Approaches to Control of Probabilistic Boolean Networks

Directory of Open Access Journals (Sweden)

Koichi Kobayashi

2017-02-01

Full Text Available Control of gene regulatory networks is one of the fundamental topics in systems biology. In the last decade, control theory of Boolean networks (BNs, which is well known as a model of gene regulatory networks, has been widely studied. In this review paper, our previously proposed methods on optimal control of probabilistic Boolean networks (PBNs are introduced. First, the outline of PBNs is explained. Next, an optimal control method using polynomial optimization is explained. The finite-time optimal control problem is reduced to a polynomial optimization problem. Furthermore, another finite-time optimal control problem, which can be reduced to an integer programming problem, is also explained.

6. 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

7. Further linear algebra

CERN Document Server

Blyth, T S

2002-01-01

Most of the introductory courses on linear algebra develop the basic theory of finite­ dimensional vector spaces, and in so doing relate the notion of a linear mapping to that of a matrix. Generally speaking, such courses culminate in the diagonalisation of certain matrices and the application of this process to various situations. Such is the case, for example, in our previous SUMS volume Basic Linear Algebra. The present text is a continuation of that volume, and has the objective of introducing the reader to more advanced properties of vector spaces and linear mappings, and consequently of matrices. For readers who are not familiar with the contents of Basic Linear Algebra we provide an introductory chapter that consists of a compact summary of the prerequisites for the present volume. In order to consolidate the student's understanding we have included a large num­ ber of illustrative and worked examples, as well as many exercises that are strategi­ cally placed throughout the text. Solutions to the ex...

8. 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

9. N=2 current algebra and coset models

International Nuclear Information System (INIS)

Hull, C.M.; Spence, B.

1990-01-01

The N=2 supersymmetric extension of the Kac-Moody algebra and the corresponding Sugawara construction of the N=2 superconformal algebra are discussed both in components and in N=1 superspace. A formulation of the Kac-Moody algebra and Sugawara construction is given in N=2 superspace in terms of supercurrents satisfying a non-linear chiral constraint. The operator product of two supercurrents includes terms that are non-linear in the supercurrents. The N=2 generalization of the GKO coset construction is then given and the conditions found by Kazama and Suzuki are seen to arise from the non-linearity of the algebra. (orig.)

10. Blocks and families for cyclotomic Hecke algebras

CERN Document Server

Chlouveraki, Maria

2009-01-01

The definition of Rouquier for the families of characters introduced by Lusztig for Weyl groups in terms of blocks of the Hecke algebras has made possible the generalization of this notion to the case of complex reflection groups. The aim of this book is to study the blocks and to determine the families of characters for all cyclotomic Hecke algebras associated to complex reflection groups. This volume offers a thorough study of symmetric algebras, covering topics such as block theory, representation theory and Clifford theory, and can also serve as an introduction to the Hecke algebras of complex reflection groups.

11. Finite W-algebras and intermediate statistics

International Nuclear Information System (INIS)

Barbarin, F.; Ragoucy, E.; Sorba, P.

1994-09-01

New realizations of finite W-algebras are constructed by relaxing the usual conditions. Then finite W-algebras are recognized in the Heisenberg quantization recently proposed by Leinaas and Myrheim, for a system of two identical particles in d dimensions. As the anyonic parameter is directly associated to the W-algebra involved in the d=1 case, it is natural to consider that the W-algebra framework is well adapted for a possible generalization of the anyon statistics. (author). 13 refs

12. Casimir elements of epsilon Lie algebras

International Nuclear Information System (INIS)

Scheunert, M.

1982-10-01

The classical framework for investigating the Casimir elements of a Lie algebra is generalized to the case of an epsilon Lie algebra L. We construct the standard L-module isomorphism of the epsilon-symmetric algebra of L onto its enveloping algebra and we introduce the Harish-Chandra homomorphism. In case the generators of L can be written in a canonical two-index form, we construct the associated standard sequence of Casimir elements and derive a formula for their eigenvalues in an arbitrary highest weight module. (orig.)

13. Algebra, Geometry and Mathematical Physics Conference

CERN Document Server

Paal, Eugen; Silvestrov, Sergei; Stolin, Alexander

2014-01-01

This book collects the proceedings of the Algebra, Geometry and Mathematical Physics Conference, held at the University of Haute Alsace, France, October 2011. Organized in the four areas of algebra, geometry, dynamical symmetries and conservation laws and mathematical physics and applications, the book covers deformation theory and quantization; Hom-algebras and n-ary algebraic structures; Hopf algebra, integrable systems and related math structures; jet theory and Weil bundles; Lie theory and applications; non-commutative and Lie algebra and more. The papers explore the interplay between research in contemporary mathematics and physics concerned with generalizations of the main structures of Lie theory aimed at quantization, and discrete and non-commutative extensions of differential calculus and geometry, non-associative structures, actions of groups and semi-groups, non-commutative dynamics, non-commutative geometry and applications in physics and beyond. The book benefits a broad audience of researchers a...

14. Prime alternative algebras that are nearly commutative

International Nuclear Information System (INIS)

Pchelintsev, S V

2004-01-01

We prove that by deforming the multiplication in a prime commutative alternative algebra using a C-operation we obtain a prime non-commutative alternative algebra. Under certain restrictions on non-commutative algebras this relation between algebras is reversible. Isotopes are special cases of deformations. We introduce and study a linear space generated by the Bruck C-operations. We prove that the Bruck space is generated by operations of rank 1 and 2 and that 'general' Bruck operations of rank 2 are independent in the following sense: a sum of n operations of rank 2 cannot be written as a linear combination of (n-1) operations of rank 2 and an arbitrary operation of rank 1. We describe infinite series of non-isomorphic prime non-commutative algebras of bounded degree that are deformations of a concrete prime commutative algebra

15. Generalized fault tree analysis combined with state analysis

International Nuclear Information System (INIS)

Caldarola, L.

1980-02-01

An analytical theory has been developed which allows one to calculate the occurrence probability of the top event of a fault tree with multistate (two or more than two states) components. It is shown that, in order to correctly describe a system with multistate components, a special type of boolean algebra is required. This is called 'boolean algebra with restrictions on variables' and its basic rules are the same as those of the traditional boolean algebra with some additional restrictions on the variables. These restrictions are extensively discussed in the paper. It is also shown that the boolean algebra with restrictions on variables facilitates the task of formally combining fault tree analysis with state analysis. The computer program MUSTAFA 1 based on the above theory has been developed. It can analyse fault trees of system containing statistically independent as well as dependent components with two or more than two states. MUSTAFA 1 can handle coherent as well as non coherent boolean functions. (orig.) 891 HP/orig. 892 MB [de

16. Parsing with Regular Expressions & Extensions to Kleene Algebra

DEFF Research Database (Denmark)

Grathwohl, Niels Bjørn Bugge

. In the second part of this thesis, we study two extensions to Kleene algebra. Chomsky algebra is an algebra with a structure similar to Kleene algebra, but with a generalized mu-operator for recursion instead of the Kleene star. We show that the axioms of idempotent semirings along with continuity of the mu......-operator completely axiomatize the equational theory of the context-free languages. KAT+B! is an extension to Kleene algebra with tests (KAT) that adds mutable state. We describe a test algebra B! for mutable tests and give a commutative coproduct between KATs. Combining the axioms of B! with those of KAT and some...

17. Boundary Lax pairs from non-ultra-local Poisson algebras

International Nuclear Information System (INIS)

Avan, Jean; Doikou, Anastasia

2009-01-01

We consider non-ultra-local linear Poisson algebras on a continuous line. Suitable combinations of representations of these algebras yield representations of novel generalized linear Poisson algebras or 'boundary' extensions. They are parametrized by a boundary scalar matrix and depend, in addition, on the choice of an antiautomorphism. The new algebras are the classical-linear counterparts of the known quadratic quantum boundary algebras. For any choice of parameters, the non-ultra-local contribution of the original Poisson algebra disappears. We also systematically construct the associated classical Lax pair. The classical boundary principal chiral model is examined as a physical example.

18. Lie algebra of conformal Killing–Yano forms

International Nuclear Information System (INIS)

Ertem, Ümit

2016-01-01

We provide a generalization of the Lie algebra of conformal Killing vector fields to conformal Killing–Yano forms. A new Lie bracket for conformal Killing–Yano forms that corresponds to slightly modified Schouten–Nijenhuis bracket of differential forms is proposed. We show that conformal Killing–Yano forms satisfy a graded Lie algebra in constant curvature manifolds. It is also proven that normal conformal Killing–Yano forms in Einstein manifolds also satisfy a graded Lie algebra. The constructed graded Lie algebras reduce to the graded Lie algebra of Killing–Yano forms and the Lie algebras of conformal Killing and Killing vector fields in special cases. (paper)

19. Cartan calculus on quantum Lie algebras

International Nuclear Information System (INIS)

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

1993-01-01

A generalization of the differential geometry of forms and vector fields to the case of quantum Lie algebras is given. In an abstract formulation that incorporates many existing examples of differential geometry on quantum spaces we combine an exterior derivative, inner derivations, Lie derivatives, forms and functions au into one big algebra, the ''Cartan Calculus.''

20. 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

1. Drinfeld currents of dynamical elliptic algebra

International Nuclear Information System (INIS)

Hou Boyu; Fan Heng; Yang Wenli; Cao Junpeng

2000-01-01

From the generalized Yang-Baxter relations RLL=LLR*, where R and R* are the dynamical R-matrix of A n-1 (1) type face model with the elliptic module shifted by the center of the algebra, using the Ding-Frenkel correspondence, the authors obtain the Drinfeld currents of dynamical elliptic algebra

2. Coherent states for polynomial su(2) algebra

International Nuclear Information System (INIS)

2007-01-01

A class of generalized coherent states is constructed for a polynomial su(2) algebra in a group-free manner. As a special case, the coherent states for the cubic su(2) algebra are discussed. The states so constructed reduce to the usual SU(2) coherent states in the linear limit

3. Fredholm theory in ordered Banach algebras | Benjamin ...

African Journals Online (AJOL)

This paper illustrates some initial steps taken in the effort of unifying the theory of positivity in ordered Banach algebas (OBAs) with the general Fred-holm theory in Banach algebras. We introduce here upper Weyl and upper Browder elements in an OBA relative to an arbitrary Banach algebra homomorphism and investigate ...

4. Commuting quantum traces for quadratic algebras

International Nuclear Information System (INIS)

Nagy, Zoltan; Avan, Jean; Doikou, Anastasia; Rollet, Genevieve

2005-01-01

Consistent tensor products on auxiliary spaces, hereafter denoted 'fusion procedures', and commuting transfer matrices are defined for general quadratic algebras, nondynamical and dynamical, inspired by results on reflection algebras. Applications of these procedures then yield integer-indexed families of commuting Hamiltonians

5. Algebraic geometry and effective lagrangians

International Nuclear Information System (INIS)

Martinec, E.J.; Chicago Univ., IL

1989-01-01

N=2 supersymmetric Landau-Ginsburg fixed points describe nonlinear models whose target spaces are algebraic varieties in certain generalized projective spaces; the defining equation is precisely the zero set of the superpotential, considered as a condition in the projective space. The ADE classification of modular invariants arises as the classification of projective descriptions of P 1 ; in general, the hierarchy of fixed points is conjectured to be isomorphic to the classification of quasihomogeneous singularities. The condition of vanishing first Chern class is an integrality condition on the Virasoro central charge; the central charge is determined by the superpotential. The operator algebra is given by the algebra of Wick contractions of perturbations of the superpotential. (orig.)

6. Modeling integrated cellular machinery using hybrid Petri-Boolean networks.

Directory of Open Access Journals (Sweden)

Natalie Berestovsky

Full Text Available The behavior and phenotypic changes of cells are governed by a cellular circuitry that represents a set of biochemical reactions. Based on biological functions, this circuitry is divided into three types of networks, each encoding for a major biological process: signal transduction, transcription regulation, and metabolism. This division has generally enabled taming computational complexity dealing with the entire system, allowed for using modeling techniques that are specific to each of the components, and achieved separation of the different time scales at which reactions in each of the three networks occur. Nonetheless, with this division comes loss of information and power needed to elucidate certain cellular phenomena. Within the cell, these three types of networks work in tandem, and each produces signals and/or substances that are used by the others to process information and operate normally. Therefore, computational techniques for modeling integrated cellular machinery are needed. In this work, we propose an integrated hybrid model (IHM that combines Petri nets and Boolean networks to model integrated cellular networks. Coupled with a stochastic simulation mechanism, the model simulates the dynamics of the integrated network, and can be perturbed to generate testable hypotheses. Our model is qualitative and is mostly built upon knowledge from the literature and requires fine-tuning of very few parameters. We validated our model on two systems: the transcriptional regulation of glucose metabolism in human cells, and cellular osmoregulation in S. cerevisiae. The model produced results that are in very good agreement with experimental data, and produces valid hypotheses. The abstract nature of our model and the ease of its construction makes it a very good candidate for modeling integrated networks from qualitative data. The results it produces can guide the practitioner to zoom into components and interconnections and investigate them

7. Confluence of an extension of combinatory logic by Boolean constants

DEFF Research Database (Denmark)

Czajka, Łukasz

2017-01-01

We show confluence of a conditional term rewriting system CL-pc1, which is an extension of Combinatory Logic by Boolean constants. This solves problem 15 from the RTA list of open problems. The proof has been fully formalized in the Coq proof assistant....

8. On the Road to Genetic Boolean Matrix Factorization

Czech Academy of Sciences Publication Activity Database

Snášel, V.; Platoš, J.; Krömer, P.; Húsek, Dušan; Frolov, A.

2007-01-01

Roč. 17, č. 6 (2007), s. 675-688 ISSN 1210-0552 Institutional research plan: CEZ:AV0Z10300504 Keywords : data mining * genetic algorithms * Boolean factorization * binary data * machine learning * feature extraction Subject RIV: IN - Informatics, Computer Science Impact factor: 0.280, year: 2007

9. Document Ranking in E-Extended Boolean Logic

Czech Academy of Sciences Publication Activity Database

Holub, M.; Húsek, Dušan; Pokorný, J.

1996-01-01

Roč. 4, č. 7 (1996), s. 3-17 ISSN 1310-0513. [Annual Colloquium on IR Research /19./. Aberdeen, 08.04.1997-09.04.1997] R&D Projects: GA ČR GA102/94/0728 Keywords : information retrieval * document ranking * extended Boolean logic

10. Boolean comparative analysis of qualitative data : a methodological note

NARCIS (Netherlands)

Romme, A.G.L.

1995-01-01

This paper explores the use of Boolean logic in the analysis of qualitative data, especially on the basis of so-called process theories. Process theories treat independent variables as necessary conditions which are binary rather than variable in nature, while the dependent variable is a final

11. Parallel object-oriented term rewriting : the booleans

NARCIS (Netherlands)

Rodenburg, P.H.; Vrancken, J.L.M.

As a first case study in parallel object-oriented term rewriting, we give two implementations of term rewriting algorithms for boolean terms, using the parallel object-oriented features of the language Pool-T. The term rewriting systems are specified in the specification formalism

12. A Construction of Boolean Functions with Good Cryptographic Properties

Science.gov (United States)

2014-01-01

be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. 1. REPORT...2008, LNCS 5350, Springer–Verlag, 2008, pp. 425–440. [10] C. Carlet and K. Feng, “An Infinite Class of Balanced Vectorial Boolean Functions with Optimum

13. 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...

14. Algebra in Cuneiform

DEFF Research Database (Denmark)

Høyrup, Jens

with basic Assyriology but otherwise philological details are avoided. All of these texts are from the second half of the Old Babylonian period, that is, 1800–1600 BCE. It is indeed during this period that the “algebraic” discipline, and Babylonian mathematics in general, culminates. Even though a few texts...... particular culture. Finally, it describes the origin of the discipline and its impact in later mathematics, not least Euclid’s geometry and genuine algebra as created in medieval Islam and taken over in European medieval and Renaissance mathematics....

15. A linear algebraic approach to electron-molecule collisions

International Nuclear Information System (INIS)

Collins, L.A.; Schnieder, B.I.

1982-01-01

The linear algebraic approach to electron-molecule collisions is examined by firstly deriving the general set of coupled integrodifferential equations that describe electron collisional processes and then describing the linear algebraic approach for obtaining a solution to the coupled equations. Application of the linear algebraic method to static-exchange, separable exchange and effective optical potential, is examined. (U.K.)

16. A note on the transition probability over Csup(*)-algebras

International Nuclear Information System (INIS)

Alberti, P.M.; Karl-Marx-Universitaet, Leipzig

1983-01-01

The algebraic structure of Uhlmann's transition probability between mixed states on unital Csup(*)-algebras is analyzed. Several improvements of methods to calculate the transition probability are fixed, examples are given (e.g., the case of quasi-local Csup(*)-algebras is dealt with) and two more functional characterizations are proved in general. (orig.)

17. Computing the Algebraic Immunity of Boolean Functions on the SRC-6 Reconfigurable Computer

Science.gov (United States)

2012-03-01

INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE...BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR...additional amount of logic and delay is negligible for a four-input transeunt triangle, the increases become overwhelming for significantly larger

18. Evaluating the Performance of Multiple Classifier Systems: A Matrix Algebra Representation of Boolean Fusion Rules

National Research Council Canada - National Science Library

Hill, Justin

2003-01-01

...., a logical OR, AND, or a majority vote of the classifiers in the system). An established method for evaluating a classifier is measuring some aspect of its Receiver Operating Characteristic (ROC...

19. 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

20. 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

1. 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.

2. 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

3. Semicrossed products of operator algebras by semigroups

CERN Document Server

Davidson, Kenneth R; Kakariadis, Evgenios T A

2017-01-01

The authors examine the semicrossed products of a semigroup action by *-endomorphisms on a C*-algebra, or more generally of an action on an arbitrary operator algebra by completely contractive endomorphisms. The choice of allowable representations affects the corresponding universal algebra. The authors seek quite general conditions which will allow them to show that the C*-envelope of the semicrossed product is (a full corner of) a crossed product of an auxiliary C*-algebra by a group action. Their analysis concerns a case-by-case dilation theory on covariant pairs. In the process we determine the C*-envelope for various semicrossed products of (possibly nonselfadjoint) operator algebras by spanning cones and lattice-ordered abelian semigroups.

4. Higher spin fields and the Gelfand-Dickey algebra

International Nuclear Information System (INIS)

Bakas, I.

1989-01-01

We show that in 2-dimensional field theory, higher spin algebras are contained in the algebra of formal pseudodifferential operators introduced by Gelfand and Dickey to describe integrable nonlinear differential equations in Lax form. The spin 2 and 3 algebras are discussed in detail and the generalization to all higher spins is outlined. This provides a conformal field theory approach to the representation theory of Gelfand-Dickey algebras. (orig.)

5. Inhomogeneous linear equation in Rota-Baxter algebra

OpenAIRE

Pietrzkowski, Gabriel

2014-01-01

We consider a complete filtered Rota-Baxter algebra of weight $\\lambda$ over a commutative ring. Finding the unique solution of a non-homogeneous linear algebraic equation in this algebra, we generalize Spitzer's identity in both commutative and non-commutative cases. As an application, considering the Rota-Baxter algebra of power series in one variable with q-integral as the Rota-Baxter operator, we show certain Eulerian identities.

6. On criteria for algebraic independence of collections of functions satisfying algebraic difference relations

Directory of Open Access Journals (Sweden)

Hiroshi Ogawara

2017-01-01

Full Text Available This paper gives conditions for algebraic independence of a collection of functions satisfying a certain kind of algebraic difference relations. As applications, we show algebraic independence of two collections of special functions: (1 Vignéras' multiple gamma functions and derivatives of the gamma function, (2 the logarithmic function, \\(q\\-exponential functions and \\(q\\-polylogarithm functions. In a similar way, we give a generalization of Ostrowski's theorem.

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

8. Algebraic Methods in Plane Geometry

Home; Journals; Resonance – Journal of Science Education; Volume 13; Issue 10. Algebraic Methods in ... General Article Volume 13 Issue 10 October 2008 pp 916-928 ... Keywords. Conics; family of curves; Pascal's theorem; homogeneous coordinates; Butterfly theorem; abelian group; associativity of addition; group law.

9. Max Algebraic Complementary Basic Matrices

Czech Academy of Sciences Publication Activity Database

Fiedler, Miroslav; Hall, F.J.

2014-01-01

Roč. 457, 15 September (2014), s. 287-292 ISSN 0024-3795 Institutional support: RVO:67985807 Keywords : CB-matrix * Max algebra * Max permanent * Max eigenvalues Subject RIV: BA - General Mathematics Impact factor: 0.939, year: 2014

10. Fusion algebra and fusing matrices

International Nuclear Information System (INIS)

Gao Yihong; Li Miao; Yu Ming.

1989-09-01

We show that the Wilson line operators in topological field theories form a fusion algebra. In general, the fusion algebra is a relation among the fusing (F) matrices. In the case of the SU(2) WZW model, some special F matrix elements are found in this way, and the remaining F matrix elements are then determined up to a sign. In addition, the S(j) modular transformation of the one point blocks on the torus is worked out. Our results are found to agree with those obtained from the quantum group method. (author). 24 refs

11. Feedback topology and XOR-dynamics in Boolean networks with varying input structure

Science.gov (United States)

Ciandrini, L.; Maffi, C.; Motta, A.; Bassetti, B.; Cosentino Lagomarsino, M.

2009-08-01

We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter γ . We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying γ , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

12. Feedback topology and XOR-dynamics in Boolean networks with varying input structure.

Science.gov (United States)

Ciandrini, L; Maffi, C; Motta, A; Bassetti, B; Cosentino Lagomarsino, M

2009-08-01

We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter gamma. We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying gamma , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

13. Endomorphisms of the Cuntz algebras

DEFF Research Database (Denmark)

Conti, Roberto; Hong, Jeong Hee; Szymanski, Wojciech

2012-01-01

This mainly expository article is devoted to recent advances in the study of dynamical aspects of the Cuntz algebras O_n, ngenerally, endomorphisms. A combinatorial description of permutative automorphisms of O_n in terms of labeled, rooted trees is prese......This mainly expository article is devoted to recent advances in the study of dynamical aspects of the Cuntz algebras O_n, ntrees...... is presented. This in turn gives rise to an algebraic characterization of the restricted Weyl group of O_n. It is shown how this group is related to certain classical dynamical systems on the Cantor set. An identification of the image in Out(O_n) of the restricted Weyl group with the group of automorphisms...

14. Clifford Algebras and magnetic monopoles

International Nuclear Information System (INIS)

Recami, E.

1987-01-01

It is known that the introduction of magnetic monopolies in electromagnetism does still present formal problems from the point of view of classical field theory. The author attempts to overcome at least some of them by making recourse to the Clifford Algebra formalism. In fact, while the events of a two-dimensional Minkowski space-time M(1,1) are sufficiently well represented by ordinary Complex Numbers, when dealing with the events of the four-dimensional Minkowski space M(1,3)identical to M/sub 4/ one has of course to look for hypercomplex numbers or, more generally, for the elements of a Clifford Algebra. The author uses the Clifford Algebras in terms of ''multivectors'', and in particular by Hestenes' language, which suits space-time quite well. He recalls that the Clifford product chiγ is the sum of the internal product chi . γ and of the wedge product chiΛγ

15. Dynamical systems of algebraic origin

CERN Document Server

Schmidt, Klaus

1995-01-01

Although much of classical ergodic theory is concerned with single transformations and one-parameter flows, the subject inherits from statistical mechanics not only its name, but also an obligation to analyze spatially extended systems with multidimensional symmetry groups. However, the wealth of concrete and natural examples which has contributed so much to the appeal and development of classical dynamics, is noticeably absent in this more general theory. The purpose of this book is to help remedy this scarcity of explicit examples by introducing a class of continuous Zd-actions diverse enough to exhibit many of the new phenomena encountered in the transition from Z to Zd, but which nevertheless lends itself to systematic study: the Zd-actions by automorphisms of compact, abelian groups. One aspect of these actions, not surprising in itself but quite striking in its extent and depth nonetheless, is the connection with commutative algebra and arithmetical algebraic geometry. The algebraic framework resulting...

16. Krichever-Novikov type algebras theory and applications

CERN Document Server

Schlichenmaier, Martin

2014-01-01

Krichever and Novikov introduced certain classes of infinite dimensionalLie algebrasto extend the Virasoro algebra and its related algebras to Riemann surfaces of higher genus. The author of this book generalized and extended them toa more general setting needed by the applications. Examples of applications are Conformal Field Theory, Wess-Zumino-Novikov-Witten models, moduli space problems, integrable systems, Lax operator algebras, and deformation theory of Lie algebra. Furthermore they constitute an important class of infinite dimensional Lie algebras which due to their geometric origin are

17. Differential geometry on Hopf algebras and quantum groups

International Nuclear Information System (INIS)

Watts, P.

1994-01-01

The differential geometry on a Hopf algebra is constructed, by using the basic axioms of Hopf algebras and noncommutative differential geometry. The space of generalized derivations on a Hopf algebra of functions is presented via the smash product, and used to define and discuss quantum Lie algebras and their properties. The Cartan calculus of the exterior derivative, Lie derivative, and inner derivation is found for both the universal and general differential calculi of an arbitrary Hopf algebra, and, by restricting to the quasitriangular case and using the numerical R-matrix formalism, the aforementioned structures for quantum groups are determined

18. Families talen en algebra

NARCIS (Netherlands)

Asveld, P.R.J.

1976-01-01

Operaties op formele talen geven aanleiding tot bijbehorende operatoren op families talen. Bepaalde onderwerpen uit de algebra (universele algebra, tralies, partieel geordende monoiden) kunnen behulpzaam zijn in de studie van verzamelingen van dergelijke operatoren.

19. Rudiments of algebraic geometry

CERN Document Server

Jenner, WE

2017-01-01

Aimed at advanced undergraduate students of mathematics, this concise text covers the basics of algebraic geometry. Topics include affine spaces, projective spaces, rational curves, algebraic sets with group structure, more. 1963 edition.

20. Continuous time Boolean modeling for biological signaling: application of Gillespie algorithm.

Science.gov (United States)

Stoll, Gautier; Viara, Eric; Barillot, Emmanuel; Calzone, Laurence

2012-08-29

Mathematical modeling is used as a Systems Biology tool to answer biological questions, and more precisely, to validate a network that describes biological observations and predict the effect of perturbations. This article presents an algorithm for modeling biological networks in a discrete framework with continuous time. There exist two major types of mathematical modeling approaches: (1) quantitative modeling, representing various chemical species concentrations by real numbers, mainly based on differential equations and chemical kinetics formalism; (2) and qualitative modeling, representing chemical species concentrations or activities by a finite set of discrete values. Both approaches answer particular (and often different) biological questions. Qualitative modeling approach permits a simple and less detailed description of the biological systems, efficiently describes stable state identification but remains inconvenient in describing the transient kinetics leading to these states. In this context, time is represented by discrete steps. Quantitative modeling, on the other hand, can describe more accurately the dynamical behavior of biological processes as it follows the evolution of concentration or activities of chemical species as a function of time, but requires an important amount of information on the parameters difficult to find in the literature. Here, we propose a modeling framework based on a qualitative approach that is intrinsically continuous in time. The algorithm presented in this article fills the gap between qualitative and quantitative modeling. It is based on continuous time Markov process applied on a Boolean state space. In order to describe the temporal evolution of the biological process we wish to model, we explicitly specify the transition rates for each node. For that purpose, we built a language that can be seen as a generalization of Boolean equations. Mathematically, this approach can be translated in a set of ordinary differential

1. Categories and Commutative Algebra

CERN Document Server

Salmon, P

2011-01-01

L. Badescu: Sur certaines singularites des varietes algebriques.- D.A. Buchsbaum: Homological and commutative algebra.- S. Greco: Anelli Henseliani.- C. Lair: Morphismes et structures algebriques.- B.A. Mitchell: Introduction to category theory and homological algebra.- R. Rivet: Anneaux de series formelles et anneaux henseliens.- P. Salmon: Applicazioni della K-teoria all'algebra commutativa.- M. Tierney: Axiomatic sheaf theory: some constructions and applications.- C.B. Winters: An elementary lecture on algebraic spaces.

2. Ternary q-Virasoro-Witt Hom-Nambu-Lie algebras

International Nuclear Information System (INIS)

Ammar, F; Makhlouf, A; Silvestrov, S

2010-01-01

In this paper we construct ternary q-Virasoro-Witt algebras which q-deform the ternary Virasoro-Witt algebras constructed by Curtright, Fairlie and Zachos using su(1, 1) enveloping algebra techniques. The ternary Virasoro-Witt algebras constructed by Curtright, Fairlie and Zachos depend on a parameter and are not Nambu-Lie algebras for all but finitely many values of this parameter. For the parameter values for which the ternary Virasoro-Witt algebras are Nambu-Lie, the corresponding ternary q-Virasoro-Witt algebras constructed in this paper are also Hom-Nambu-Lie because they are obtained from the ternary Nambu-Lie algebras using the composition method. For other parameter values this composition method does not yield a Hom-Nambu-Lie algebra structure for q-Virasoro-Witt algebras. We show however, using a different construction, that the ternary Virasoro-Witt algebras of Curtright, Fairlie and Zachos, as well as the general ternary q-Virasoro-Witt algebras we construct, carry a structure of the ternary Hom-Nambu-Lie algebra for all values of the involved parameters.

3. Abstract algebra for physicists

International Nuclear Information System (INIS)

Zeman, J.

1975-06-01

Certain recent models of composite hadrons involve concepts and theorems from abstract algebra which are unfamiliar to most theoretical physicists. The algebraic apparatus needed for an understanding of these models is summarized here. Particular emphasis is given to algebraic structures which are not assumed to be associative. (2 figures) (auth)

4. 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.

5. Attractor controllability of Boolean networks by flipping a subset of their nodes

Science.gov (United States)

2018-04-01

The controllability analysis of Boolean networks (BNs), as models of biomolecular regulatory networks, has drawn the attention of researchers in recent years. In this paper, we aim at governing the steady-state behavior of BNs using an intervention method which can easily be applied to most real system, which can be modeled as BNs, particularly to biomolecular regulatory networks. To this end, we introduce the concept of attractor controllability of a BN by flipping a subset of its nodes, as the possibility of making a BN converge from any of its attractors to any other one, by one-time flipping members of a subset of BN nodes. Our approach is based on the algebraic state-space representation of BNs using semi-tensor product of matrices. After introducing some new matrix tools, we use them to derive necessary and sufficient conditions for the attractor controllability of BNs. A forward search algorithm is then suggested to identify the minimal perturbation set for attractor controllability of a BN. Next, a lower bound is derived for the cardinality of this set. Two new indices are also proposed for quantifying the attractor controllability of a BN and the influence of each network variable on the attractor controllability of the network and the relationship between them is revealed. Finally, we confirm the efficiency of the proposed approach by applying it to the BN models of some real biomolecular networks.

6. Toward robust scalable algebraic multigrid solvers

International Nuclear Information System (INIS)

Waisman, Haim; Schroder, Jacob; Olson, Luke; Hiriyur, Badri; Gaidamour, Jeremie; Siefert, Christopher; Hu, Jonathan Joseph; Tuminaro, Raymond Stephen

2010-01-01

This talk highlights some multigrid challenges that arise from several application areas including structural dynamics, fluid flow, and electromagnetics. A general framework is presented to help introduce and understand algebraic multigrid methods based on energy minimization concepts. Connections between algebraic multigrid prolongators and finite element basis functions are made to explored. It is shown how the general algebraic multigrid framework allows one to adapt multigrid ideas to a number of different situations. Examples are given corresponding to linear elasticity and specifically in the solution of linear systems associated with extended finite elements for fracture problems.

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

8. 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)

9. Residues and duality for projective algebraic varieties

CERN Document Server

Kunz, Ernst; Dickenstein, Alicia

2008-01-01

This book, which grew out of lectures by E. Kunz for students with a background in algebra and algebraic geometry, develops local and global duality theory in the special case of (possibly singular) algebraic varieties over algebraically closed base fields. It describes duality and residue theorems in terms of K�hler differential forms and their residues. The properties of residues are introduced via local cohomology. Special emphasis is given to the relation between residues to classical results of algebraic geometry and their generalizations. The contribution by A. Dickenstein gives applications of residues and duality to polynomial solutions of constant coefficient partial differential equations and to problems in interpolation and ideal membership. D. A. Cox explains toric residues and relates them to the earlier text. The book is intended as an introduction to more advanced treatments and further applications of the subject, to which numerous bibliographical hints are given.

10. Towards a classification of rational Hopf algebras

International Nuclear Information System (INIS)

Fuchs, J.; Ganchev, A.; Vecsernyes, P.

1994-02-01

Rational Hopf algebras, i.e. certain quasitriangular weak quasi-Hopf *-algebras, are expected to describe the quantum symmetry of rational field theories. In this paper methods are developed which allow for a classification of all rational Hopf algebras that are compatible with some prescribed set of fusion rules. The algebras are parametrized by the solutions of the square, pentagon and hexagon identities. As examples, we classify all solutions for fusion rules with not more than three sectors, as well as for the level three affine A 1 (1) fusion rules. We also establish several general properties of rational Hopf algebras and present a graphical description of the coassociator in terms of labelled tetrahedra. The latter construction allows to make contact with conformal field theory fusing matrices and with invariants of three-manifolds and topological lattice field theory. (orig.)

11. Q-systems as cluster algebras

International Nuclear Information System (INIS)

Kedem, Rinat

2008-01-01

Q-systems first appeared in the analysis of the Bethe equations for the XXX model and generalized Heisenberg spin chains (Kirillov and Reshetikhin 1987 Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst. Steklov. 160 211-21, 301). Such systems are known to exist for any simple Lie algebra and many other Kac-Moody algebras. We formulate the Q-system associated with any simple, simply-laced Lie algebras g in the language of cluster algebras (Fomin and Zelevinsky 2002 J. Am. Math. Soc. 15 497-529), and discuss the relation of the polynomiality property of the solutions of the Q-system in the initial variables, which follows from the representation-theoretical interpretation, to the Laurent phenomenon in cluster algebras (Fomin and Zelevinsky 2002 Adv. Appl. Math. 28 119-44)

12. 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....

13. 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.)

14. q-deformations of noncompact Lie (super-) algebras: The examples of q-deformed Lorentz, Weyl, Poincare' and (super-) conformal algebras

International Nuclear Information System (INIS)

Dobrev, V.K.

1992-01-01

We review and explain a canonical procedure for the q-deformation of the real forms G of complex Lie (super-) algebras associated with (generalized) Cartan matrices. Our procedure gives different q-deformations for the non-conjugate Cartan subalgebras of G. We give several in detail the q-deformed Lorentz and conformal (super-) algebras. The q-deformed conformal algebra contains as a subalgebra a q-deformed Poincare algebra and as Hopf subalgebras two conjugate 11-generator q-deformed Weyl algebras. The q-deformed Lorentz algebra in Hopf subalgebra of both Weyl algebras. (author). 24 refs

15. Boolean network representation of contagion dynamics during a financial crisis

Science.gov (United States)

Caetano, Marco Antonio Leonel; Yoneyama, Takashi

2015-01-01

This work presents a network model for representation of the evolution of certain patterns of economic behavior. More specifically, after representing the agents as points in a space in which each dimension associated to a relevant economic variable, their relative "motions" that can be either stationary or discordant, are coded into a boolean network. Patterns with stationary averages indicate the maintenance of status quo, whereas discordant patterns represent aggregation of new agent into the cluster or departure from the former policies. The changing patterns can be embedded into a network representation, particularly using the concept of autocatalytic boolean networks. As a case study, the economic tendencies of the BRIC countries + Argentina were studied. Although Argentina is not included in the cluster formed by BRIC countries, it tends to follow the BRIC members because of strong commercial ties.

16. 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

17. 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)

18. 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

19. Computer algebra and operators

Science.gov (United States)

Fateman, Richard; Grossman, Robert

1989-01-01

The symbolic computation of operator expansions is discussed. Some of the capabilities that prove useful when performing computer algebra computations involving operators are considered. These capabilities may be broadly divided into three areas: the algebraic manipulation of expressions from the algebra generated by operators; the algebraic manipulation of the actions of the operators upon other mathematical objects; and the development of appropriate normal forms and simplification algorithms for operators and their actions. Brief descriptions are given of the computer algebra computations that arise when working with various operators and their actions.

20. Boolean Models of Biological Processes Explain Cascade-Like Behavior.

Science.gov (United States)

Chen, Hao; Wang, Guanyu; Simha, Rahul; Du, Chenghang; Zeng, Chen

2016-01-29

Biological networks play a key role in determining biological function and therefore, an understanding of their structure and dynamics is of central interest in systems biology. In Boolean models of such networks, the status of each molecule is either "on" or "off" and along with the molecules interact with each other, their individual status changes from "on" to "off" or vice-versa and the system of molecules in the network collectively go through a sequence of changes in state. This sequence of changes is termed a biological process. In this paper, we examine the common perception that events in biomolecular networks occur sequentially, in a cascade-like manner, and ask whether this is likely to be an inherent property. In further investigations of the budding and fission yeast cell-cycle, we identify two generic dynamical rules. A Boolean system that complies with these rules will automatically have a certain robustness. By considering the biological requirements in robustness and designability, we show that those Boolean dynamical systems, compared to an arbitrary dynamical system, statistically present the characteristics of cascadeness and sequentiality, as observed in the budding and fission yeast cell- cycle. These results suggest that cascade-like behavior might be an intrinsic property of biological processes.

1. SETS, Boolean Manipulation for Network Analysis and Fault Tree Analysis

International Nuclear Information System (INIS)

Worrell, R.B.

1985-01-01

Description of problem or function - SETS is used for symbolic manipulation of set (or Boolean) equations, particularly the reduction of set equations by the application of set identities. It is a flexible and efficient tool for performing probabilistic risk analysis (PRA), vital area analysis, and common cause analysis. The equation manipulation capabilities of SETS can also be used to analyze non-coherent fault trees and determine prime implicants of Boolean functions, to verify circuit design implementation, to determine minimum cost fire protection requirements for nuclear reactor plants, to obtain solutions to combinatorial optimization problems with Boolean constraints, and to determine the susceptibility of a facility to unauthorized access through nullification of sensors in its protection system. 4. Method of solution - The SETS program is used to read, interpret, and execute the statements of a SETS user program which is an algorithm that specifies the particular manipulations to be performed and the order in which they are to occur. 5. Restrictions on the complexity of the problem - Any properly formed set equation involving the set operations of union, intersection, and complement is acceptable for processing by the SETS program. Restrictions on the size of a set equation that can be processed are not absolute but rather are related to the number of terms in the disjunctive normal form of the equation, the number of literals in the equation, etc. Nevertheless, set equations involving thousands and even hundreds of thousands of terms can be processed successfully

2. Controllability and observability of Boolean networks arising from biology

Science.gov (United States)

Li, Rui; Yang, Meng; Chu, Tianguang

2015-02-01

Boolean networks are currently receiving considerable attention as a computational scheme for system level analysis and modeling of biological systems. Studying control-related problems in Boolean networks may reveal new insights into the intrinsic control in complex biological systems and enable us to develop strategies for manipulating biological systems using exogenous inputs. This paper considers controllability and observability of Boolean biological networks. We propose a new approach, which draws from the rich theory of symbolic computation, to solve the problems. Consequently, simple necessary and sufficient conditions for reachability, controllability, and observability are obtained, and algorithmic tests for controllability and observability which are based on the Gröbner basis method are presented. As practical applications, we apply the proposed approach to several different biological systems, namely, the mammalian cell-cycle network, the T-cell activation network, the large granular lymphocyte survival signaling network, and the Drosophila segment polarity network, gaining novel insights into the control and/or monitoring of the specific biological systems.

3. 3D Boolean operations in virtual surgical planning.

Science.gov (United States)

Charton, Jerome; Laurentjoye, Mathieu; Kim, Youngjun

2017-10-01

Boolean operations in computer-aided design or computer graphics are a set of operations (e.g. intersection, union, subtraction) between two objects (e.g. a patient model and an implant model) that are important in performing accurate and reproducible virtual surgical planning. This requires accurate and robust techniques that can handle various types of data, such as a surface extracted from volumetric data, synthetic models, and 3D scan data. This article compares the performance of the proposed method (Boolean operations by a robust, exact, and simple method between two colliding shells (BORES)) and an existing method based on the Visualization Toolkit (VTK). In all tests presented in this article, BORES could handle complex configurations as well as report impossible configurations of the input. In contrast, the VTK implementations were unstable, do not deal with singular edges and coplanar collisions, and have created several defects. The proposed method of Boolean operations, BORES, is efficient and appropriate for virtual surgical planning. Moreover, it is simple and easy to implement. In future work, we will extend the proposed method to handle non-colliding components.

4. 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.

5. 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)

6. 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

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

8. 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...

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

10. Hurwitz Algebras and the Octonion Algebra

Science.gov (United States)

Burdik, Čestmir; Catto, Sultan

2018-02-01

We explore some consequences of a theory of internal symmetries for elementary particles constructed on exceptional quantum mechanical spaces based on Jordan algebra formulation that admit exceptional groups as gauge groups.

11. 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.

12. On boolean combinations forming piecewise testable languages

Czech Academy of Sciences Publication Activity Database

Masopust, Tomáš; Thomazo, M.

2017-01-01

Roč. 682, June 19 (2017), s. 165-179 ISSN 0304-3975 Institutional support: RVO:67985840 Keywords : automata * language s * k-piecewise testability 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.698, year: 2016 http://www.sciencedirect.com/science/article/pii/S030439751730066X

13. The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate

International Nuclear Information System (INIS)

Dridi, G; Julien, R; Hliwa, M; Joachim, C

2015-01-01

The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor. (paper)

14. The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate.

Science.gov (United States)

Dridi, G; Julien, R; Hliwa, M; Joachim, C

2015-08-28

The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor.

15. Dirac calculus for modules over Grassmann algebra

International Nuclear Information System (INIS)

Plyushchay, M.S.; Razumov, A.V.

1983-01-01

The main ideas of the theory of the modules over a Grassmann algebra are given. The presentation is intended for physicists, therefore acquaintance only with main ideas of the linear algebra including the concept of a tensor product is assumed. Proofs of statements are not given as a rule due to their elementariness. The main result of the work the generalization of case of the modules over a Grassmann algebra. As an example of utilization of this formalism the construction of the oherent states for fermions is considered

16. Strong Bisimilarity of Simple Process Algebras

DEFF Research Database (Denmark)

Srba, Jirí

2003-01-01

We study bisimilarity and regularity problems of simple process algebras. In particular, we show PSPACE-hardness of the following problems: (i) strong bisimilarity of Basic Parallel Processes (BPP), (ii) strong bisimilarity of Basic Process Algebra (BPA), (iii) strong regularity of BPP, and (iv......) strong regularity of BPA. We also demonstrate NL-hardness of strong regularity problems for the normed subclasses of BPP and BPA. Bisimilarity problems of simple process algebras are introduced in a general framework of process rewrite systems, and a uniform description of the new techniques used...

17. Space-time algebra

CERN Document Server

Hestenes, David

2015-01-01

This small book started a profound revolution in the development of mathematical physics, one which has reached many working physicists already, and which stands poised to bring about far-reaching change in the future. At its heart is the use of Clifford algebra to unify otherwise disparate mathematical languages, particularly those of spinors, quaternions, tensors and differential forms. It provides a unified approach covering all these areas and thus leads to a very efficient ‘toolkit’ for use in physical problems including quantum mechanics, classical mechanics, electromagnetism and relativity (both special and general) – only one mathematical system needs to be learned and understood, and one can use it at levels which extend right through to current research topics in each of these areas. These same techniques, in the form of the ‘Geometric Algebra’, can be applied in many areas of engineering, robotics and computer science, with no changes necessary – it is the same underlying mathematics, a...

18. Current algebra for parafields

International Nuclear Information System (INIS)

Palev, Ch.D.

1976-01-01

Within the framework of the Lagrangean QFT a generalization of canonical commutation and anticommutation relations in terms of three-linear commutation relations, corresponding to the parastatistics, s discussed. A detailed derivation of these three-linear relations for a set of parafermi fields is presented. Then for a Lagrangean, depending of a family of parabose fields and a family of paraferm fields, is shown that the fundamental hypothesis of current algebra is valid. In other words, the currents corresponding to the linear gauge transformations are found to meet the commutation relation: [Jsub(f)sup(0)(x), Jsub(g)sup(0)]sub(x 0 =y 0 ) = -idelta(x vector - y vector)Jsub([f,g])sup(0) (x), where Jsub(f)sup(0) is a time component of the current, corresponding to transformation f. (S.P.)

19. 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...

20. 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)

1. Representations of quantum bicrossproduct algebras

International Nuclear Information System (INIS)

Arratia, Oscar; Olmo, Mariano A del

2002-01-01

We present a method to construct induced representations of quantum algebras which have a bicrossproduct structure. We apply this procedure to some quantum kinematical algebras in (1+1) dimensions with this kind of structure: null-plane quantum Poincare algebra, non-standard quantum Galilei algebra and quantum κ-Galilei algebra

2. International Conference on Algebra and its Applications

CERN Document Server

Ali, Asma; Filippis, Vincenzo

2016-01-01

This book discusses recent developments and the latest research in algebra and related topics. The book allows aspiring researchers to update their understanding of prime rings, generalized derivations, generalized semiderivations, regular semigroups, completely simple semigroups, module hulls, injective hulls, Baer modules, extending modules, local cohomology modules, orthogonal lattices, Banach algebras, multilinear polynomials, fuzzy ideals, Laurent power series, and Hilbert functions. All the contributing authors are leading international academicians and researchers in their respective fields. Most of the papers were presented at the international conference on Algebra and its Applications (ICAA-2014), held at Aligarh Muslim University, India, from December 15–17, 2014. The conference has emerged as a powerful forum offering researchers a venue to meet and discuss advances in algebra and its applications, inspiring further research directions. <.

3. Lie algebras and applications

CERN Document Server

Iachello, Francesco

2015-01-01

This course-based primer provides an introduction to Lie algebras and some of their applications to the spectroscopy of molecules, atoms, nuclei and hadrons. In the first part, it concisely presents the basic concepts of Lie algebras, their representations and their invariants. The second part includes a description of how Lie algebras are used in practice in the treatment of bosonic and fermionic systems. Physical applications considered include rotations and vibrations of molecules (vibron model), collective modes in nuclei (interacting boson model), the atomic shell model, the nuclear shell model, and the quark model of hadrons. One of the key concepts in the application of Lie algebraic methods in physics, that of spectrum generating algebras and their associated dynamic symmetries, is also discussed. The book highlights a number of examples that help to illustrate the abstract algebraic definitions and includes a summary of many formulas of practical interest, such as the eigenvalues of Casimir operators...

4. Twisted classical Poincare algebras

International Nuclear Information System (INIS)

Lukierski, J.; Ruegg, H.; Tolstoy, V.N.; Nowicki, A.

1993-11-01

We consider the twisting of Hopf structure for classical enveloping algebra U(g), where g is the inhomogeneous rotations algebra, with explicite formulae given for D=4 Poincare algebra (g=P 4 ). The comultiplications of twisted U F (P 4 ) are obtained by conjugating primitive classical coproducts by F element of U(c)xU(c), where c denotes any Abelian subalgebra of P 4 , and the universal R-matrices for U F (P 4 ) are triangular. As an example we show that the quantum deformation of Poincare algebra recently proposed by Chaichian and Demiczev is a twisted classical Poincare algebra. The interpretation of twisted Poincare algebra as describing relativistic symmetries with clustered 2-particle states is proposed. (orig.)

5. Two Types of Expanding Lie Algebra and New Expanding Integrable Systems

International Nuclear Information System (INIS)

Dong Huanhe; Yang Jiming; Wang Hui

2010-01-01

From a new Lie algebra proposed by Zhang, two expanding Lie algebras and its corresponding loop algebras are obtained. Two expanding integrable systems are produced with the help of the generalized zero curvature equation. One of them has complex Hamiltion structure with the help of generalized Tu formula (GTM). (general)

6. Quasi-superconformal algebras in two dimensions and hamiltonian reduction

International Nuclear Information System (INIS)

Romans, L.J.

1991-01-01

In the standard quantum hamiltonian reduction, constraining the SL(3, R) WZNW model leads to a model of Zamolodchikov's W 3 -symmetry. In recent work, Polyakov and Bershadsky have considered an alternative reduction which leads to a new algebra, W 3 2 , a nonlinear extension of the Virasoro algebra by a spin-1 current and two bosonic spin-3/2 currents. Motivated by this result, we display two new infinite series of nonlinear extended conformal algebras, containing 2N bosonic spin-3/2 currents and spin-1 Kac-Moody currents for either U(N) or Sp(2 N); the W 3 2 algebra appears as the N = 1 member of the U(N) series. We discuss the relationship between these algebras and the Knizhnik-Bershadsky superconformal algebras, and provide realisations in terms of free fields coupled to Kac-Moody currents. We propose a specific procedure for obtaining the algebras for general N through hamiltonian reduction. (orig.)

7. Representations of Lie algebras and partial differential equations

CERN Document Server

Xu, Xiaoping

2017-01-01

This book provides explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic codes, combinatorics and algebraic varieties, summarizing the author’s works and his joint works with his former students.  Further, it presents various oscillator generalizations of the classical representation theorem on harmonic polynomials, and highlights new functors from the representation category of a simple Lie algebra to that of another simple Lie algebra. Partial differential equations play a key role in solving certain representation problems. The weight matrices of the minimal and adjoint representations over the simple Lie algebras of types E and F are proved to generate ternary orthogonal linear codes with large minimal distances. New multi-variable hypergeometric functions related to the root systems of simple Lie algebras are introduced in connection with quantum many-body systems in one dimension. In addition, the book identifies certai...

8. Quantum field theories on algebraic curves. I. Additive bosons

International Nuclear Information System (INIS)

Takhtajan, Leon A

2013-01-01

Using Serre's adelic interpretation of cohomology, we develop a 'differential and integral calculus' on an algebraic curve X over an algebraically closed field k of constants of characteristic zero, define algebraic analogues of additive multi-valued functions on X and prove the corresponding generalized residue theorem. Using the representation theory of the global Heisenberg algebra and lattice Lie algebra, we formulate quantum field theories of additive and charged bosons on an algebraic curve X. These theories are naturally connected with the algebraic de Rham theorem. We prove that an extension of global symmetries (Witten's additive Ward identities) from the k-vector space of rational functions on X to the vector space of additive multi-valued functions uniquely determines these quantum theories of additive and charged bosons.

9. 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.

10. Basic notions of algebra

CERN Document Server

Shafarevich, Igor Rostislavovich

2005-01-01

This book is wholeheartedly recommended to every student or user of mathematics. Although the author modestly describes his book as 'merely an attempt to talk about' algebra, he succeeds in writing an extremely original and highly informative essay on algebra and its place in modern mathematics and science. From the fields, commutative rings and groups studied in every university math course, through Lie groups and algebras to cohomology and category theory, the author shows how the origins of each algebraic concept can be related to attempts to model phenomena in physics or in other branches

11. 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

12. Algebraically special perturbations of the Schwarzschild solution in higher dimensions

International Nuclear Information System (INIS)

Dias, Óscar J C; Reall, Harvey S

2013-01-01

We study algebraically special perturbations of a generalized Schwarzschild solution in any number of dimensions. There are two motivations. First, to learn whether there exist interesting higher-dimensional algebraically special solutions beyond the known ones. Second, algebraically special perturbations present an obstruction to the unique reconstruction of general metric perturbations from gauge-invariant variables analogous to the Teukolsky scalars and it is desirable to know the extent of this non-uniqueness. In four dimensions, our results generalize those of Couch and Newman, who found infinite families of time-dependent algebraically special perturbations. In higher dimensions, we find that the only regular algebraically special perturbations are those corresponding to deformations within the Myers–Perry family. Our results are relevant for several inequivalent definitions of ‘algebraically special’. (paper)

13. 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

14. 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

15. Algebraic proofs over noncommutative formulas

Czech Academy of Sciences Publication Activity Database

Tzameret, Iddo

2011-01-01

Roč. 209, č. 10 (2011), s. 1269-1292 ISSN 0890-5401 R&D Projects: GA MŠk LC505 Institutional research plan: CEZ:AV0Z10190503 Keywords : proof complexity * algebraic proof system s * frege proofs Subject RIV: BA - General Mathematics Impact factor: 0.560, year: 2011 http://www.sciencedirect.com/science/article/pii/S089054011100109X

16. Bebop to the Boolean boogie an unconventional guide to electronics

CERN Document Server

Maxfield, Clive

2003-01-01

From reviews of the first edition:""If you want to be reminded of the joy of electronics, take a look at Clive (Max) Maxfield's book Bebop to the Boolean Boogie.""--Computer Design ""Lives up to its title as a useful and entertaining technical guide....well-suited for students, technical writers, technicians, and sales and marketing people.""--Electronic Design""Writing a book like this one takes audacity! ... Maxfield writes lucidly on a variety of complex topics without 'writing down' to his audience."" --EDN""A highly readable, well-illustrated guided tour

17. Two Expectation-Maximization Algorithms for Boolean Factor Analysis

Czech Academy of Sciences Publication Activity Database

Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.

2014-01-01

Roč. 130, 23 April (2014), s. 83-97 ISSN 0925-2312 R&D Projects: GA ČR GAP202/10/0262 Grant - others:GA MŠk(CZ) ED1.1.00/02.0070; GA MŠk(CZ) EE.2.3.20.0073 Program:ED Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean Factor analysis * Binary Matrix factorization * Neural networks * Binary data model * Dimension reduction * Bars problem Subject RIV: IN - Informatics, Computer Science Impact factor: 2.083, year: 2014

International Nuclear Information System (INIS)

Misse Nseke, Theophile.

1982-04-01

We attempt to solve the problem of optimal reloading of fuel assemblies in a PWR, without any assumption on the fuel nature. Any loading is marked by n 2 boolean variables usub(ij). The state of the reactor is characterized by his Ksub(eff) and the related power distribution. The resulting non-linear allocation problems are solved throught mathematical programming technics combining the simplex algorithm and an extension of the Balas-Geoffrion's one. Some optimal solutions are given for PWR with assemblies of different enrichment [fr

19. 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...

20. G-identities of non-associative algebras

International Nuclear Information System (INIS)

Bakhturin, Yu A; Zaitsev, M V; Sehgal, S K

1999-01-01

The main class of algebras considered in this paper is the class of algebras of Lie type. This class includes, in particular, associative algebras, Lie algebras and superalgebras, Leibniz algebras, quantum Lie algebras, and many others. We prove that if a finite group G acts on such an algebra A by automorphisms and anti-automorphisms and A satisfies an essential G-identity, then A satisfies an ordinary identity of degree bounded by a function that depends on the degree of the original identity and the order of G. We show in the case of ordinary Lie algebras that if L is a Lie algebra, a finite group G acts on L by automorphisms and anti-automorphisms, and the order of G is coprime to the characteristic of the field, then the existence of an identity on skew-symmetric elements implies the existence of an identity on the whole of L, with the same kind of dependence between the degrees of the identities. Finally, we generalize Amitsur's theorem on polynomial identities in associative algebras with involution to the case of alternative algebras with involution

1. JB*-Algebras of Topological Stable Rank 1

Directory of Open Access Journals (Sweden)

Akhlaq A. Siddiqui

2007-01-01

Full Text Available In 1976, Kaplansky introduced the class JB*-algebras which includes all C*-algebras as a proper subclass. The notion of topological stable rank 1 for C*-algebras was originally introduced by M. A. Rieffel and was extensively studied by various authors. In this paper, we extend this notion to general JB*-algebras. We show that the complex spin factors are of tsr 1 providing an example of special JBW*-algebras for which the enveloping von Neumann algebras may not be of tsr 1. In the sequel, we prove that every invertible element of a JB*-algebra is positive in certain isotope of ; if the algebra is finite-dimensional, then it is of tsr 1 and every element of is positive in some unitary isotope of . Further, it is established that extreme points of the unit ball sufficiently close to invertible elements in a JB*-algebra must be unitaries and that in any JB*-algebras of tsr 1, all extreme points of the unit ball are unitaries. In the end, we prove the coincidence between the λ-function and λu-function on invertibles in a JB*-algebra.

2. Logarithmic sℓ-hat (2) CFT models from Nichols algebras: I

International Nuclear Information System (INIS)

Semikhatov, A M; Tipunin, I Yu

2013-01-01

We construct chiral algebras that centralize rank-2 Nichols algebras with at least one fermionic generator. This gives ‘logarithmic’ W-algebra extensions of a fractional-level sℓ-hat (2) algebra. We discuss crucial aspects of the emerging general relation between Nichols algebras and logarithmic conformal field theory (CFT) models: (i) the extra input, beyond the Nichols algebra proper, needed to uniquely specify a conformal model; (ii) a relation between the CFT counterparts of Nichols algebras connected by Weyl groupoid maps; and (iii) the common double bosonization U(X) of such Nichols algebras. For an extended chiral algebra, candidates for its simple modules that are counterparts of the U(X) simple modules are proposed, as a first step toward a functorial relation between U(X) and W-algebra representation categories. (paper)

3. n-ary algebras: a review with applications

International Nuclear Information System (INIS)

De Azcarraga, J A; Izquierdo, J M

2010-01-01

This paper reviews the properties and applications of certain n-ary generalizations of Lie algebras in a self-contained and unified way. These generalizations are algebraic structures in which the two-entry Lie bracket has been replaced by a bracket with n entries. Each type of n-ary bracket satisfies a specific characteristic identity which plays the role of the Jacobi identity for Lie algebras. Particular attention will be paid to generalized Lie algebras, which are defined by even multibrackets obtained by antisymmetrizing the associative products of its n components and that satisfy the generalized Jacobi identity, and to Filippov (or n-Lie) algebras, which are defined by fully antisymmetric n-brackets that satisfy the Filippov identity. 3-Lie algebras have surfaced recently in multi-brane theory in the context of the Bagger-Lambert-Gustavsson model. As a result, Filippov algebras will be discussed at length, including the cohomology complexes that govern their central extensions and their deformations (it turns out that Whitehead's lemma extends to all semisimple n-Lie algebras). When the skewsymmetry of the Lie or n-Lie algebra bracket is relaxed, one is led to a more general type of n-algebras, the n-Leibniz algebras. These will be discussed as well, since they underlie the cohomological properties of n-Lie algebras. The standard Poisson structure may also be extended to the n-ary case. We shall review here the even generalized Poisson structures, whose generalized Jacobi identity reproduces the pattern of the generalized Lie algebras, and the Nambu-Poisson structures, which satisfy the Filippov identity and determine Filippov algebras. Finally, the recent work of Bagger-Lambert and Gustavsson on superconformal Chern-Simons theory will be briefly discussed. Emphasis will be made on the appearance of the 3-Lie algebra structure and on why the A 4 model may be formulated in terms of an ordinary Lie algebra, and on its Nambu bracket generalization. (topical

4. (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.

5. Complexity classifications for different equivalence and audit problems for Boolean circuits

OpenAIRE

BÃ¶hler, Elmar; Creignou, Nadia; Galota, Matthias; Reith, Steffen; Schnoor, Henning; Vollmer, Heribert

2010-01-01

We study Boolean circuits as a representation of Boolean functions and conskier different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all other gate types we show these problems are at least NP-hard.

6. BEAT: A Web-Based Boolean Expression Fault-Based Test Case Generation Tool

Science.gov (United States)

Chen, T. Y.; Grant, D. D.; Lau, M. F.; Ng, S. P.; Vasa, V. R.

2006-01-01

BEAT is a Web-based system that generates fault-based test cases from Boolean expressions. It is based on the integration of our several fault-based test case selection strategies. The generated test cases are considered to be fault-based, because they are aiming at the detection of particular faults. For example, when the Boolean expression is in…

Science.gov (United States)

Levy, Alissa Beth

2012-01-01

The California Department of Education (CDE) has long asserted that success Algebra I by Grade 8 is the goal for all California public school students. In fact, the state's accountability system penalizes schools that do not require all of their students to take the Algebra I end-of-course examination by Grade 8 (CDE, 2009). In this dissertation,…

8. Learning Activity Package, Algebra.

Science.gov (United States)

Evans, Diane

A set of ten teacher-prepared Learning Activity Packages (LAPs) in beginning algebra and nine in intermediate algebra, these units cover sets, properties of operations, number systems, open expressions, solution sets of equations and inequalities in one and two variables, exponents, factoring and polynomials, relations and functions, radicals,…

9. Who Takes College Algebra?

Science.gov (United States)

Herriott, Scott R.; Dunbar, Steven R.

2009-01-01

The common understanding within the mathematics community is that the role of the college algebra course is to prepare students for calculus. Though exceptions are emerging, the curriculum of most college algebra courses and the content of most textbooks on the market both reflect that assumption. This article calls that assumption into question…

10. Analytic real algebras.

Science.gov (United States)

Seo, Young Joo; Kim, Young Hee

2016-01-01

In this paper we construct some real algebras by using elementary functions, and discuss some relations between several axioms and its related conditions for such functions. We obtain some conditions for real-valued functions to be a (edge) d -algebra.

11. Pre-Algebra Lexicon.

Science.gov (United States)

Hayden, Dunstan; Cuevas, Gilberto

The pre-algebra lexicon is a set of classroom exercises designed to teach the technical words and phrases of pre-algebra mathematics, and includes the terms most commonly found in related mathematics courses. The lexicon has three parts, each with its own introduction. The first introduces vocabulary items in three groups forming a learning…

12. Algebraic Description of Motion

Science.gov (United States)

Davidon, William C.

1974-01-01

An algebraic definition of time differentiation is presented and used to relate independent measurements of position and velocity. With this, students can grasp certain essential physical, geometric, and algebraic properties of motion and differentiation before undertaking the study of limits. (Author)

13. 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.

14. Proposition algebra with projective limits

NARCIS (Netherlands)

Bergstra, J.A.; Ponse, A.

2008-01-01

Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a proposition, atomic propositions may yield different Boolean values at repeated occurrences. We introduce free reactive valuations' to capture this dynamics of

15. Operator algebras and conformal field theory

International Nuclear Information System (INIS)

Gabbiani, F.; Froehlich, J.

1993-01-01

We define and study two-dimensional, chiral conformal field theory by the methods of algebraic field theory. We start by characterizing the vacuum sectors of such theories and show that, under very general hypotheses, their algebras of local observables are isomorphic to the unique hyperfinite type III 1 factor. The conformal net determined by the algebras of local observables is proven to satisfy Haag duality. The representation of the Moebius group (and presumably of the entire Virasoro algebra) on the vacuum sector of a conformal field theory is uniquely determined by the Tomita-Takesaki modular operators associated with its vacuum state and its conformal net. We then develop the theory of Mebius covariant representations of a conformal net, using methods of Doplicher, Haag and Roberts. We apply our results to the representation theory of loop groups. Our analysis is motivated by the desire to find a 'background-independent' formulation of conformal field theories. (orig.)

16. Boolean models of biosurfactants production in Pseudomonas fluorescens.

Directory of Open Access Journals (Sweden)

Full Text Available Cyclolipopeptides (CLPs are biosurfactants produced by numerous Pseudomonas fluorescens strains. CLP production is known to be regulated at least by the GacA/GacS two-component pathway, but the full regulatory network is yet largely unknown. In the clinical strain MFN1032, CLP production is abolished by a mutation in the phospholipase C gene (plcC and not restored by plcC complementation. Their production is also subject to phenotypic variation. We used a modelling approach with Boolean networks, which takes into account all these observations concerning CLP production without any assumption on the topology of the considered network. Intensive computation yielded numerous models that satisfy these properties. All models minimizing the number of components point to a bistability in CLP production, which requires the presence of a yet unknown key self-inducible regulator. Furthermore, all suggest that a set of yet unexplained phenotypic variants might also be due to this epigenetic switch. The simplest of these Boolean networks was used to propose a biological regulatory network for CLP production. This modelling approach has allowed a possible regulation to be unravelled and an unusual behaviour of CLP production in P. fluorescens to be explained.

17. Complex network analysis of state spaces for random Boolean networks

Energy Technology Data Exchange (ETDEWEB)

Shreim, Amer [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Berdahl, Andrew [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Sood, Vishal [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Grassberger, Peter [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Paczuski, Maya [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada)

2008-01-15

We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 {<=} K {<=} 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2{sup N}, for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two.

18. Complex network analysis of state spaces for random Boolean networks

International Nuclear Information System (INIS)

Shreim, Amer; Berdahl, Andrew; Sood, Vishal; Grassberger, Peter; Paczuski, Maya

2008-01-01

We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 ≤ K ≤ 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2 N , for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two

19. Comparison of Boolean analysis and standard phylogenetic methods using artificially evolved and natural mt-tRNA sequences from great apes.

Science.gov (United States)

Ari, Eszter; Ittzés, Péter; Podani, János; Thi, Quynh Chi Le; Jakó, Eena

2012-04-01

Boolean analysis (or BOOL-AN; Jakó et al., 2009. BOOL-AN: A method for comparative sequence analysis and phylogenetic reconstruction. Mol. Phylogenet. Evol. 52, 887-97.), a recently developed method for sequence comparison uses the Iterative Canonical Form of Boolean functions. It considers sequence information in a way entirely different from standard phylogenetic methods (i.e. Maximum Parsimony, Maximum-Likelihood, Neighbor-Joining, and Bayesian analysis). The performance and reliability of Boolean analysis were tested and compared with the standard phylogenetic methods, using artificially evolved - simulated - nucleotide sequences and the 22 mitochondrial tRNA genes of the great apes. At the outset, we assumed that the phylogeny of Hominidae is generally well established, and the guide tree of artificial sequence evolution can also be used as a benchmark. These offer a possibility to compare and test the performance of different phylogenetic methods. Trees were reconstructed by each method from 2500 simulated sequences and 22 mitochondrial tRNA sequences. We also introduced a special re-sampling method for Boolean analysis on permuted sequence sites, the P-BOOL-AN procedure. Considering the reliability values (branch support values of consensus trees and Robinson-Foulds distances) we used for simulated sequence trees produced by different phylogenetic methods, BOOL-AN appeared as the most reliable method. Although the mitochondrial tRNA sequences of great apes are relatively short (59-75 bases long) and the ratio of their constant characters is about 75%, BOOL-AN, P-BOOL-AN and the Bayesian approach produced the same tree-topology as the established phylogeny, while the outcomes of Maximum Parsimony, Maximum-Likelihood and Neighbor-Joining methods were equivocal. We conclude that Boolean analysis is a promising alternative to existing methods of sequence comparison for phylogenetic reconstruction and congruence analysis. Copyright Â© 2012 Elsevier Inc. All

20. Twisted vertex algebras, bicharacter construction and boson-fermion correspondences

International Nuclear Information System (INIS)

Anguelova, Iana I.

2013-01-01

The boson-fermion correspondences are an important phenomena on the intersection of several areas in mathematical physics: representation theory, vertex algebras and conformal field theory, integrable systems, number theory, cohomology. Two such correspondences are well known: the types A and B (and their super extensions). As a main result of this paper we present a new boson-fermion correspondence of type D-A. Further, we define a new concept of twisted vertex algebra of order N, which generalizes super vertex algebra. We develop the bicharacter construction which we use for constructing classes of examples of twisted vertex algebras, as well as for deriving formulas for the operator product expansions, analytic continuations, and normal ordered products. By using the underlying Hopf algebra structure we prove general bicharacter formulas for the vacuum expectation values for two important groups of examples. We show that the correspondences of types B, C, and D-A are isomorphisms of twisted vertex algebras