ON AMINO ACID AND CODON ASSIGNMENT IN ALGEBRAIC MODELS FOR THE GENETIC CODE

We give a list of all possible schemes for performing amino acid and codon assignments in algebraic models for the genetic code, which are consistent with a few simple symmetry principles, in accordance with the spirit of the algebraic approach to the evolution of the genetic code proposed by Hornos and Hornos. Our results are complete in the sense of covering all the algebraic models that arise within this approach, whether based on Lie groups/Lie algebras, on Lie superalgebras or on finite groups.

An application of lattice basis reduction to polynomial identities for algebraic structures

The authors` recent classification of trilinear operations includes, among other cases, a fourth family of operations with parameter q epsilon Q boolean OR {infinity}, and weakly commutative and weakly anticommutative operations. These operations satisfy polynomial identities in degree 3 and further identities in degree 5. For each operation, using the row canonical form of the expansion matrix E to find the identities in degree 5 gives extremely complicated results. We use lattice basis reduction to simplify these identities: we compute the Hermite normal form H of E(t), obtain a basis of the nullspace lattice from the last rows of a matrix U for which UE(t) = H, and then use the LLL algorithm to reduce the basis. (C) 2008 Elsevier Inc. All rights reserved.

ALGEBRAIC AND GEOMETRIC THEORY OF THE TOPOLOGICAL RING OF COLOMBEAU GENERALIZED FUNCTIONS

We continue the investigation of the algebraic and topological structure of the algebra of Colombeau generalized functions with the aim of building up the algebraic basis for the theory of these functions. This was started in a previous work of Aragona and Juriaans, where the algebraic and topological structure of the Colombeau generalized numbers were studied. Here, among other important things, we determine completely the minimal primes of (K) over bar and introduce several invariants of the ideals of 9(Q). The main tools we use are the algebraic results obtained by Aragona and Juriaans and the theory of differential calculus on generalized manifolds developed by Aragona and co-workers. The main achievement of the differential calculus is that all classical objects, such as distributions, become Cl-functions. Our purpose is to build an independent and intrinsic theory for Colombeau generalized functions and place them in a wider context.

Polar orthogonal representations of real reductive algebraic groups

We prove that a polar orthogonal representation of a real reductive algebraic group has the same closed orbits as the isotropy representation of a pseudo-Riemannian symmetric space. We also develop a partial structural theory of polar orthogonal representations of real reductive algebraic groups which slightly generalizes some results of the structural theory of real reductive Lie algebras. (c) 2008 Elsevier Inc. All rights reserved.

Algebraic Bol loops

In this paper, we study the category of algebraic Bol loops over an algebraically closed field of definition. On the one hand, we apply techniques from the theory of algebraic groups in order to prove structural theorems for this category. On the other hand, we present some examples showing that these loops lack some nice properties of algebraic groups; for example, we construct local algebraic Bol loops which are not birationally equivalent to global algebraic loops.

An algebraic theory for generalized Jordan chains and partial signatures in the Lagrangian Grassmannian

We discuss an algebraic theory for generalized Jordan chains and partial signatures, that are invariants associated to sequences of symmetric bilinear forms on a vector space. We introduce an intrinsic notion of partial signatures in the Lagrangian Grassmannian of a symplectic space that does not use local coordinates, and we give a formula for the Maslov index of arbitrary real analytic paths in terms of partial signatures.

On the problem of algebraic completeness for the invariants of the Riemann Tensor: I

We present a new determining set, CZ, of Riemann invariants which possesses the minimum degree property. From an analysis on the possible independence of CZ, we are led to the division of all space-times into two distinct, invariantly characterized, classes: a general class M_G+, and a special, singular class M_S For each class, we provide an independent set of invariants (I_G+) ⊂ CZ and I_S ⊂ CZ, respectively) which, with the results of a sequel paper, will be shown to be algebraically complete.

On the problem of algebraic completeness for the invariants of the Riemann tensor. III.

We study the set CZ of invariants [Zakhary and Carminati, J. Math. Phys. 42, 1474 (2001)] for the class of space-times whose Ricci tensors possess a null eigenvector. We show that all cases are maximally backsolvable, in terms of sets of invariants from CZ, but that some cases are not completely backsolvable and these all possess an alignment between an eigenvector of the Ricci tensor with a repeated principal null vector of the Weyl tensor. We provide algebraically complete sets for each canonically different space-time and hence conclude with these results and those of a previous article [Carminati, Zakhary, and McLenaghan, J. Math. Phys. 43, 492 (2002)] that the CZ set is determining or maximal.

Algebraic attacks over GF(q)

Recent algebraic attacks on LFSR-based stream ciphers and S-boxes have generated much interest as they appear to be extremely powerful. Theoretical work has been developed focusing around the Boo- lean function case. In this paper, we generalize this theory to arbitrary finite fields and extend the theory of annihilators and ideals introduced at Eurocrypt 2004 by Meier, Pasalic and Carlet. In particular, we prove that for any function f in the multivariate polynomial ring over GF(q), f has a low degree multiple precisely when two low degree functions appear in the same coset of the annihilator of f ^{q – 1} – 1. In this case, many such low degree multiples exist.

Algebraic attacks on clock-controlled stream ciphers

We present an algebraic attack approach to a family of irregularly clock-controlled bit-based linear feedback shift register systems. In the general set-up, we assume that the output bit of one shift register controls the clocking of other registers in the system and produces a family of equations relating the output bits to the internal state bits. We then apply this general theory to four specific stream ciphers: the (strengthened) stop-and-go generator, the alternating step generator, the self-decimated generator and the step1/step2 generator. In the case of the strengthened stop-and-go generator and of the self-decimated generator, we obtain the initial state of the registers in a significantly faster time than any other known attack. In the other two situations, we do better than or as well as all attacks but the correlation attack. In all cases, we demonstrate that the degree of a functional relationship between the registers can be bounded by two. Finally, we determine the effective key length of all four systems.

Algebraic attacks on clock-controlled cascade ciphers

In this paper, we mount the first algebraic attacks against clock controlled cascade stream ciphers. We first show how to obtain relations between the internal state bits and the output bits of the Gollmann clock controlled cascade stream ciphers. We demonstrate that the initial states of the last two shift registers can be determined by the initial states of the others. An alternative attack on the Gollmann cascade is also described, which requires solving quadratic equations. We then present an algebraic analysis of Pomaranch, one of the phase two proposals to eSTREAM. A system of equations of maximum degree four that describes the full cipher is derived. We also present weaknesses in the filter functions of Pomaranch by successfully computing annihilators and low degree multiples of the functions.