<s>
The	O
MIXMAX	B-Algorithm
generator	I-Algorithm
is	O
a	O
family	O
of	O
pseudorandom	B-Algorithm
number	I-Algorithm
generators	I-Algorithm
(	O
PRNG	O
)	O
and	O
is	O
based	O
on	O
Anosov	O
C-systems	O
(	O
Anosov	O
diffeomorphism	O
)	O
and	O
Kolmogorov	O
K-systems	O
(	O
Kolmogorov	O
automorphism	O
)	O
.	O
</s>
<s>
A	O
fast	O
implementation	O
in	O
C/C	O
++	O
of	O
the	O
generator	O
was	O
developed	O
by	O
Konstantin	O
Savvidy	O
.	O
</s>
<s>
It	O
has	O
also	O
been	O
tested	O
on	O
PPC	B-Architecture
and	O
ARM	B-Architecture
architectures	I-Architecture
.	O
</s>
<s>
The	O
generator	O
is	O
equally	O
usable	O
with	O
C++	B-Language
programs	I-Language
,	O
has	O
been	O
chosen	O
as	O
the	O
default	O
generator	O
in	O
CLHEP	B-Application
for	O
use	O
in	O
Geant4	B-Application
and	O
there	O
exists	O
a	O
ROOT	O
interface	O
and	O
a	O
PYTHIA	B-Language
interface	O
.	O
</s>
<s>
It	O
has	O
been	O
recently	O
tested	O
extensively	O
on	O
very	O
wide	O
variety	O
of	O
platforms	O
,	O
as	O
part	O
of	O
the	O
CLHEP/Geant4	O
release	O
.	O
</s>
<s>
An	O
analysis	O
by	O
L’Ecuyer	O
,	O
Wambergue	O
and	O
Bourceret	O
,	O
see	O
also	O
,	O
showed	O
that	O
MIXMAX	B-Algorithm
generators	I-Algorithm
has	O
a	O
lattice	O
structure	O
when	O
the	O
produced	O
random	O
numbers	O
are	O
considered	O
in	O
n	O
-	O
dimensional	O
space	O
larger	O
than	O
the	O
dimension	O
N	O
of	O
the	O
matrix	O
generator	O
,	O
and	O
only	O
in	O
that	O
high	O
dimensions	O
n	O
>	O
N	O
they	O
lie	O
on	O
a	O
set	O
of	O
parallel	O
hyperplanes	O
and	O
determined	O
the	O
maximum	O
distance	O
between	O
the	O
covering	O
hyperplanes	O
.	O
</s>
