On circuit functionality in boolean networks.

It has been proved, for several classes of continuous and discrete dynamical systems, that the presence of a positive (resp. negative) circuit in the interaction graph of a system is a necessary condition for the presence of multiple stable states (resp. a cyclic attractor). A positive (resp. negative) circuit is said to be functional when it "generates" several stable states (resp. a cyclic attractor). However, there are no definite mathematical frameworks translating the underlying meaning of "generates." Focusing on Boolean networks, we recall and propose some definitions concerning the notion of functionality along with associated mathematical results.

Graded algebra automorphisms

We consider the Clifford algebra C(q) of a regular quadratic space (V, q) over a field K with its structure of Z/2Z-graded K-algebra. We give a characterization of the group of graded automorphisms of C(q). In the last section we introduce the Z/nZ-graded algebras and we study as well as the group of graded automorphisms for some of them.

Vertailun vuoksi? : Boolen algebra alueellisen vertailun välineenä

English abstract

1.° Francisci Maurolyci de centro solidi parabolae demonstratio : praemittuntur catalogus ejusdem operum et observationes de ordine quo singula legenda sunt. — 2.° Descriptio hyperbolarum contrapositarum, diametrorum, tangentium, linearum continuè proportionalium et triangulorum aequalium : authore eodem. — 3.° Ejusdem algebra, sive potiùs, regulae calculi litteralis ad inveniendum terminum quemlibet proportionis geometricè continuae.

Colbertinus

Implicit methods for qualitative modeling of gene regulatory networks.

Advancements in high-throughput technologies to measure increasingly complex biological phenomena at the genomic level are rapidly changing the face of biological research from the single-gene single-protein experimental approach to studying the behavior of a gene in the context of the entire genome (and proteome). This shift in research methodologies has resulted in a new field of network biology that deals with modeling cellular behavior in terms of network structures such as signaling pathways and gene regulatory networks. In these networks, different biological entities such as genes, proteins, and metabolites interact with each other, giving rise to a dynamical system. Even though there exists a mature field of dynamical systems theory to model such network structures, some technical challenges are unique to biology such as the inability to measure precise kinetic information on gene-gene or gene-protein interactions and the need to model increasingly large networks comprising thousands of nodes. These challenges have renewed interest in developing new computational techniques for modeling complex biological systems. This chapter presents a modeling framework based on Boolean algebra and finite-state machines that are reminiscent of the approach used for digital circuit synthesis and simulation in the field of very-large-scale integration (VLSI). The proposed formalism enables a common mathematical framework to develop computational techniques for modeling different aspects of the regulatory networks such as steady-state behavior, stochasticity, and gene perturbation experiments.

A Cartan-Eilenberg approach to Homotopical Algebra

In this paper we propose an approach to homotopical algebra where the basic ingredient is a category with two classes of distinguished morphisms: strong and weak equivalences. These data determine the cofibrant objects by an extension property analogous to the classical lifting property of projective modules. We define a Cartan-Eilenberg category as a category with strong and weak equivalences such that there is an equivalence of categories between its localisation with respect to weak equivalences and the relative localisation of the subcategory of cofibrant objects with respect to strong equivalences. This equivalence of categories allows us to extend the classical theory of derived additive functors to this non additive setting. The main examples include Quillen model categories and categories of functors defined on a category endowed with a cotriple (comonad) and taking values on a category of complexes of an abelian category. In the latter case there are examples in which the class of strong equivalences is not determined by a homotopy relation. Among other applications of our theory, we establish a very general acyclic models theorem.

代數學Dai shu xue.De Morgan's Algebra.

Traduction Chinoise par Alexander Wylie (1815-1887), rédigée par Li Shan lan, de Hai ning. Préface Chinoise par Wylie (1859) ; préface anglaise, écrite par le même à Shang hai (octobre 1859), contenant un historique des mathématiques en Chine. Imprimé en caractères mobiles, dans la maison Mo hai (1859).Livre préliminaire + 13 livres.

ReAlM - a system to manipulate relations

Given a heterogeneous relation algebra R, it is well known that the algebra of matrices with coefficient from R is relation algebra with relational sums that is not necessarily finite. When a relational product exists or the point axiom is given, we can represent the relation algebra by concrete binary relations between sets, which means the algebra may be seen as an algebra of Boolean matrices. However, it is not possible to represent every relation algebra. It is well known that the smallest relation algebra that is not representable has only 16 elements. Such an algebra can not be put in a Boolean matrix form.[15] In [15, 16] it was shown that every relation algebra R with relational sums and sub-objects is equivalent to an algebra of matrices over a suitable basis. This basis is given by the integral objects of R, and is, compared to R, much smaller. Aim of my thesis is to develop a system called ReAlM - Relation Algebra Manipulator - that is capable of visualizing computations in arbitrary relation algebras using the matrix approach.

Generating finite integral relation algebras

Relation algebras and categories of relations in particular have proven to be extremely useful as a fundamental tool in mathematics and computer science. Since relation algebras are Boolean algebras with some well-behaved operations, every such algebra provides an atom structure, i.e., a relational structure on its set of atoms. In the case of complete and atomic structure (e.g. finite algebras), the original algebra can be recovered from its atom structure by using the complex algebra construction. This gives a representation of relation algebras as the complex algebra of a certain relational structure. This property is of particular interest because storing the atom structure requires less space than the entire algebra. In this thesis I want to introduce and implement three structures representing atom structures of integral heterogeneous relation algebras, i.e., categorical versions of relation algebras. The first structure will simply embed a homogeneous atom structure of a relation algebra into the heterogeneous context. The second structure is obtained by splitting all symmetric idempotent relations. This new algebra is in almost all cases an heterogeneous structure having more objects than the original one. Finally, I will define two different union operations to combine two algebras into a single one.

RelMDD-A Library for Manipulating Relations Based on MDDs

Relation algebras is one of the state-of-the-art means used by mathematicians and computer scientists for solving very complex problems. As a result, a computer algebra system for relation algebras called RelView has been developed at Kiel University. RelView works within the standard model of relation algebras. On the other hand, relation algebras do have other models which may have different properties. For example, in the standard model we always have L;L=L (the composition of two (heterogeneous) universal relations yields a universal relation). This is not true in some non-standard models. Therefore, any example in RelView will always satisfy this property even though it is not true in general. On the other hand, it has been shown that every relation algebra with relational sums and subobjects can be seen as matrix algebra similar to the correspondence of binary relations between sets and Boolean matrices. The aim of my research is to develop a new system that works with both standard and non-standard models for arbitrary relations using multiple-valued decision diagrams (MDDs). This system will implement relations as matrix algebras. The proposed structure is a library written in C which can be imported by other languages such as Java or Haskell.

Validación matemática de un nuevo método para salvación de algunos tipos de problemas relacionados con algebra lineal

Tesis (Maestría en Ingenieria Industrial con Especialidad en Sistemas) UANL