Matrix Representation of the Stationary Measure for the Multispecies TASEP

In this work we construct the stationary measure of the N species totally asymmetric simple exclusion process in a matrix product formulation. We make the connection between the matrix product formulation and the queueing theory picture of Ferrari and Martin. In particular, in the standard representation, the matrices act on the space of queue lengths. For N > 2 the matrices in fact become tensor products of elements of quadratic algebras. This enables us to give a purely algebraic proof of the stationary measure which we present for N=3.

Symmetry breaking in the genetic code: Finite groups

We investigate the possibility of interpreting the degeneracy of the genetic code, i.e., the feature that different codons (base triplets) of DNA are transcribed into the same amino acid, as the result of a symmetry breaking process, in the context of finite groups. In the first part of this paper, we give the complete list of all codon representations (64-dimensional irreducible representations) of simple finite groups and their satellites (central extensions and extensions by outer automorphisms). In the second part, we analyze the branching rules for the codon representations found in the first part by computational methods, using a software package for computational group theory. The final result is a complete classification of the possible schemes, based on finite simple groups, that reproduce the multiplet structure of the genetic code. (C) 2010 Elsevier Ltd. All rights reserved.

Symmetry in biology: from genetic code to stochastic gene regulation

Mathematical models, as instruments for understanding the workings of nature, are a traditional tool of physics, but they also play an ever increasing role in biology - in the description of fundamental processes as well as that of complex systems. In this review, the authors discuss two examples of the application of group theoretical methods, which constitute the mathematical discipline for a quantitative description of the idea of symmetry, to genetics. The first one appears, in the form of a pseudo-orthogonal (Lorentz like) symmetry, in the stochastic modelling of what may be regarded as the simplest possible example of a genetic network and, hopefully, a building block for more complicated ones: a single self-interacting or externally regulated gene with only two possible states: ` on` and ` off`. The second is the algebraic approach to the evolution of the genetic code, according to which the current code results from a dynamical symmetry breaking process, starting out from an initial state of complete symmetry and ending in the presently observed final state of low symmetry. In both cases, symmetry plays a decisive role: in the first, it is a characteristic feature of the dynamics of the gene switch and its decay to equilibrium, whereas in the second, it provides the guidelines for the evolution of the coding rules.

THE LOWER CENTRAL AND DERIVED SERIES OF THE BRAID GROUPS OF THE FINITELY-PUNCTURED SPHERE

Motivated in part by the study of Fadell-Neuwirth short exact sequences, we determine the lower central and derived series for the braid groups of the finitely-punctured sphere. For n >= 1, the class of m-string braid groups B(m)(S(2)\{x(1), ... , x(n)}) of the n-punctured sphere includes the usual Artin braid groups B(m) (for n = 1), those of the annulus, which are Artin groups of type B (for n = 2), and affine Artin groups of type (C) over tilde (for n = 3). We first consider the case n = 1. Motivated by the study of almost periodic solutions of algebraic equations with almost periodic coefficients, Gorin and Lin calculated the commutator subgroup of the Artin braid groups. We extend their results, and show that the lower central series (respectively, derived series) of B(m) is completely determined for all m is an element of N (respectively, for all m not equal 4). In the exceptional case m = 4, we obtain some higher elements of the derived series and its quotients. When n >= 2, we prove that the lower central series (respectively, derived series) of B(m)(S(2)\{x(1), ... , x(n)}) is constant from the commutator subgroup onwards for all m >= 3 (respectively, m >= 5). The case m = 1 is that of the free group of rank n - 1. The case n = 2 is of particular interest notably when m = 2 also. In this case, the commutator subgroup is a free group of infinite rank. We then go on to show that B(2)(S(2)\{x(1), x(2)}) admits various interpretations, as the Baumslag-Solitar group BS(2, 2), or as a one-relator group with non-trivial centre for example. We conclude from this latter fact that B(2)(S(2)\{x(1), x(2)}) is residually nilpotent, and that from the commutator subgroup onwards, its lower central series coincides with that of the free product Z(2) * Z. Further, its lower central series quotients Gamma(i)/Gamma(i+1) are direct sums of copies of Z(2), the number of summands being determined explicitly. In the case m >= 3 and n = 2, we obtain a presentation of the derived subgroup, from which we deduce its Abelianization. Finally, in the case n = 3, we obtain partial results for the derived series, and we prove that the lower central series quotients Gamma(i)/Gamma(i+1) are 2-elementary finitely-generated groups.

Polynomial identities for the ternary cyclic sum

We simplify the results of Bremner and Hentzel [J. Algebra 231 (2000) 387-405] on polynomial identities of degree 9 in two variables satisfied by the ternary cyclic sum [a, b, c] abc + bca + cab in every totally associative ternary algebra. We also obtain new identities of degree 9 in three variables which do not follow from the identities in two variables. Our results depend on (i) the LLL algorithm for lattice basis reduction, and (ii) linearization operators in the group algebra of the symmetric group which permit efficient computation of the representation matrices for a non-linear identity. Our computational methods can be applied to polynomial identities for other algebraic structures.

On moduli spaces for abelian categories

We show that if A is an abelian category satisfying certain mild conditions, then one can introduce the concept of a moduli space of (semi)stable objects which has the structure of a projective algebraic variety. This idea is applied to several important abelian categories in representation theory, like highest weight categories.

The classification and the conjugacy classes of the finite subgroups of the sphere braid groups

Let n >= 3. We classify the finite groups which are realised as subgroups of the sphere braid group B(n)(S(2)). Such groups must be of cohomological period 2 or 4. Depending on the value of n, we show that the following are the maximal finite subgroups of B(n)(S(2)): Z(2(n-1)); the dicyclic groups of order 4n and 4(n - 2); the binary tetrahedral group T*; the binary octahedral group O*; and the binary icosahedral group I(*). We give geometric as well as some explicit algebraic constructions of these groups in B(n)(S(2)) and determine the number of conjugacy classes of such finite subgroups. We also reprove Murasugi`s classification of the torsion elements of B(n)(S(2)) and explain how the finite subgroups of B(n)(S(2)) are related to this classification, as well as to the lower central and derived series of B(n)(S(2)).

Free groups in central simple algebras without Tits` theorem

Let R be a noncommutative central simple algebra, the center k of which is not absolutely algebraic, and consider units a,b of R such that {a,a(b)} freely generate a free group. It is shown that such b can be chosen from suitable Zariski dense open subsets of R, while the a can be chosen from a set of cardinality \k\ (which need not be open).

REALIZING PROFINITE REDUCED SPECIAL GROUPS

Special groups are an axiomatization of the algebraic theory of quadratic forms over fields. It is known that any finite reduced special group is the special group of some field. We show that any special group that is the projective limit of a projective system of finite reduced special groups is also the special group of some field.

Abelian torsion groups with a countably compact group topology

Comfort and Remus [W.W. Comfort, D. Remus, Abelian torsion groups with a pseudo-compact group topology, Forum Math. 6 (3) (1994) 323-337] characterized algebraically the Abelian torsion groups that admit a pseudocompact group topology using the Ulm-Kaplansky invariants. We show, under a condition weaker than the Generalized Continuum Hypothesis, that an Abelian torsion group (of any cardinality) admits a pseudocompact group topology if and only if it admits a countably compact group topology. Dikranjan and Tkachenko [D. Dikranjan. M. Tkachenko, Algebraic structure of small countably compact Abelian groups, Forum Math. 15 (6) (2003) 811-837], and Dikranjan and Shakhmatov [D. Dikranjan. D. Shakhmatov, Forcing hereditarily separable compact-like group topologies on Abelian groups, Topology Appl. 151 (1-3) (2005) 2-54] showed this equivalence for groups of cardinality not greater than 2(c). We also show, from the existence of a selective ultrafilter, that there are countably compact groups without non-trivial convergent sequences of cardinality kappa(omega), for any infinite cardinal kappa. In particular, it is consistent that for every cardinal kappa there are countably compact groups without non-trivial convergent sequences whose weight lambda has countable cofinality and lambda > kappa. (C) 2009 Elsevier B.V. All rights reserved.

Generalized solutions of a nonlinear parabolic equation with generalized functions as initial data

In [H. Brezis, A. Friedman, Nonlinear parabolic equations involving measures as initial conditions, J. Math. Pure Appl. (9) (1983) 73-97.] Brezis and Friedman prove that certain nonlinear parabolic equations, with the delta-measure as initial data, have no solution. However in [J.F. Colombeau, M. Langlais, Generalized solutions of nonlinear parabolic equations with distributions as initial conditions, J. Math. Anal. Appl (1990) 186-196.] Colombeau and Langlais prove that these equations have a unique solution even if the delta-measure is substituted by any Colombeau generalized function of compact support. Here we generalize Colombeau and Langlais` result proving that we may take any generalized function as the initial data. Our approach relies on recent algebraic and topological developments of the theory of Colombeau generalized functions and results from [J. Aragona, Colombeau generalized functions on quasi-regular sets, Publ. Math. Debrecen (2006) 371-399.]. (C) 2009 Elsevier Ltd. All rights reserved.

Protein Assembly onto Cationic Supported Bilayers

Cationic supported bilayers on latex are useful to isolate and immobilize oppositely charged proteins as a monomolecular layer over a range of low protein concentrations and particle number densities. Cholera toxin (CT) from Vibrio cholerae, an 87 kDa AB(5) hexameric protein and bovine serum albumin (BSA) self-assembled on dioctadecyldimethylammonium bromide (DODAB) supported bilayers with high affinity yielding highly organized and monodisperse particulates at 5 x 10(9) particles/mL, over a range of low protein concentrations (0-0.025 mg/mL BSA or CT). Protein association onto the bilayer-covered polystyrene sulfate (PSS) was determined from adsorption isotherms, dynamic light scattering for size distributions and zeta-potential analysis revealing a monomolecular, thin and highly organized protein layer surrounding each particle with potential for biospecific recognition such as antigen-antibody, receptor-ligand, hybridization of oligonucleotide sequences, all of them important in immunodiagnosis, selective biomolecular chromatographic separations, microarrays design and others.

Förlorad i övergången från aritmetik till algebra : Hur gymnasieelever översätter aritmetik till algebra

The aim of this thesis is to look for signs of students’ understanding of algebra by studying how they make the transition from arithmetic to algebra. Students in an Upper Secondary class on the Natural Science program and Science and Technology program were given a questionnaire with a number of algebraic problems of different levels of difficulty. Especially important for the study was that students leave comments and explanations of how they solved the problems. According to earlier research, transitions are the most critical steps in problem solving. The Algebraic Cycle is a theoretical tool that can be used to make different phases in problem solving visible. To formulate and communicate how the solution was made may lead to students becoming more aware of their thought processes. This may contribute to students gaining more understanding of the different phases involved in mathematical problem solving, and to students becoming more successful in mathematics in general.The study showed that the students could solve mathematical problems correctly, but that they in just over 50% of the cases, did not give any explanations to their solutions.

GHP: a maple package for performing calculations in the Geroch-Held-Penrose formalism

We present a new symbolic algebra package, written for Maple, for performing computations in the Geroch-Held-Penrose formalism. We demonstrate the essential features and capabilities of our package by investigating Petrov-D vacuum solutions of Einstein's field equations.

Reduced-order output feedback controllers for discrete-time systems

This article considers the stabilization by output feedback controllers for discrete-time systems. The controller can place all of the closed-loop poles within a specified disk D(-α, 1/β), centred at (-α,0) with radius 1/β, where | - α|  + 1/β < 1. The design method involves the decomposition of the system into two portions. The first portion comprises of all of the poles that are lying outside of the specified disk. A reduced-order model is constructed for this portion. The second portion comprises of all of the remaining poles of the system and is characterized by an H_∞-norm bound. The controller design is then accomplished by using H_∞-control theory. It is shown that, subject to the solvability of an algebraic Riccati equation, output feedback controllers can be systematically derived. The order of the controller is low, and can be as low as the number of the open-loop poles that are lying outside of the specified disk. A step-by-step design algorithm is provided. Numerical examples are given to illustrate the attractiveness of the design method.