Biplanes (56, 11, 2) with automorphism group Z2 × Z2 fixing some point

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Smooth Structures on Complex Surfaces with Fundamental Group Z2

It is shown that the quotients of a complex surface under free holomorphic and anti-holomorphic involutions are homeomorphic but not diffeomorphic. This gives a way to construct exotic smooth structures on some complex surfaces.

متن کامل

Grand Unification of Flavor by Orbifold Twisting Z2 and Z2 × Z ′ 2

Gauge coupling unification–The simplest(rank 4) GUT SU(5) classifies the 15 chiral fields in two SU(5) representations, 10 plus 5. Of course, one can introduce SU(5) singlet(s) which must be electrically neutral, and guarantees the GUT value of the weak mixing angle 3/8. The next simplest GUT is a rank 5 group SO(10). Its rank 5 subgroup SU(5)× U(1) can be a GUT group(the so-called flipped-SU(5...

متن کامل

Transversality for Z2-orbifolds

Equivariant transversality phenomena are studied for PL locally linear actions of the group with two elements. In this setting with stability assumptions, the obstruction to making a given map f : M ! N transverse to the xed set N Z 2 is given by an element of Sect(BL(M ; N) # M Z 2), i.e. a generalized cohomology class with twisted coeecients. Here BL(M ; N) is a spectrum whose homotopy groups...

متن کامل

Z2-double cyclic codes

A binary linear code C is a Z2-double cyclic code if the set of coordinates can be partitioned into two subsets such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be identified as submodules of the Z2[x]-module Z2[x]/(x r −1)×Z2[x]/(x − 1). We determine the structure of Z2-double cyclic codes giving the generator polynomials of these codes. ...

متن کامل

Constrained Percolation on Z2

We study a constrained percolation process on Z, and prove the almost sure nonexistence of infinite clusters and contours for a large class of probability measures. Unlike the unconstrained case, in the constrained case no stochastic monotonicity is known. We prove the nonexistence of infinite clusters and contours for the constrained percolation by developing new combinatorial techniques which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1988

ISSN: 0097-3165

DOI: 10.1016/0097-3165(88)90010-6