188 MATRIX GENETICS, HADAMARD MATRICES, AND ALGEBRAIC BIOLOGY
degeneracy can be called a tetra - reproduction transformation . Due to this
tetra - reproduction, the cyclic - generated genomatrix
P
231
CAUG
has a quantity of
pattern units four times greater than that of the initial genomatrix
P
123
CAUG
(Figures 8.2 to 8.4 ).
This fact is interesting because an analogical tetra - reproduction (or a tetra -
division) exists in living nature in the course of the division of gametal cells,
which are transmitters of genetic information. In this mysterious act of meiosis,
one gamete is divided into four new gametes. This fact was mentioned notably
in a famous book by Schr ö dinger ( 1955 , Sec. 13). The tetra - reproduction of
the mosaics of the genomatrices that was described can be utilized, in particu-
lar, in formal models of meiosis.
Permutations of elements play an important role in the theory of signals
processing (Ahmed and Rao, 1975 ; Trahtman and Trahtman, 1975 ). Only six
variants of permutations of positions in triplets are possible: 1 – 2 – 3, 2 – 3 – 1,
3 – 1 – 2, 1 – 3 – 2, 2 – 1 – 3, and 3 – 2 – 1. The genomatrices
P
123
CAUG
and
P
231
CAUG
for the
fi rst two of these permutations were considered above (see Figures 8.2 and
8.4 ). Let us consider the other four variants that lead to genomatrices:
P
312
CAUG
,
P
132
CAUG
,
P
213
CAUG
, and
P
321
CAUG
, presented in Figure 8.5 . It is an unexpected
phenomenological fact that each row of all these genomatrices is connected
with a relevant Rademacher function again, and that these new genomatrices
have symmetrical peculiarities which are similar to the symmetrical peculiari-
ties of
P
123
CAUG
and
P
231
CAUG
. It means that the basic scheme considered for the
degeneracy of the genetic code is in close agreement with these types of per-
mutations and with the Rademacher functions.
The revelation of the permutation group of the six symmetric genomatrices
P
123
3CAUG
()
,
P
231
3CAUG
()
,
P
213
3CAUG
()
,
P
321
3CAUG
()
,
P
312
3CAUG
()
,
P
132
3CAUG
()
seems to be the essential
fact because of heuristic associations with the mathematical theory of digital
signal processing, where similar permutations have long been utilized as a
useful tool. For example, the book (Ahmed and Rao, 1975 , Sec. 4.6) gives an
example of the important role of the method of data permutations and of the
binary inversion for one of variants of the algorithm of a fast Fourier trans-
formation. In this example the numeric sequence 0, 1, 2, 3, 4, 5, 6, 7 is re - formed
into the sequence 0, 4, 2, 6, 1, 5, 3, 7. But the same change of numeration of
the columns and the rows takes place in our case (Figure 8.5 ), where the
genomatrix
P
123
CAUG
is re - formed into the genomatrix
P
321
CAUG
as a result of the
inversion of binary numbering of the columns and the rows (or of the inver-
sion of the positions in the triplets). These and other facts permit one to think
that the genetic system has a connection with a fast Fourier transformation
(or with a fast Hadamard transformation) (Petoukhov, 2006 , 2008a – c ) .
Until now we have considered the Kronecker family of genomatrices with
the kernel [C A; U G] and have revealed some interesting properties of the
mosaic genomatrices [C A; U G]
(3)
. But one can consider other variants of
kernels for genetic matrices:
P
123
3
CAGU
CA GU=
[]
()
;
,
P
123
3
GCAU
GC AU=
[]
()
;
,
and so on. These new variants of kernels of the Kronecker families of
genomatrices are produced by alphabetic permutations of the four letters C,