991 resultados para Real Projective Plane
Resumo:
The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006.
Resumo:
We present an elementary combinatorial proof of the existence and uniqueness of the 9-vertex triangulation of C P2. The original proof of existence, due to Kuhnel, as well as the original proof of uniqueness, due to Kuhnel and Lassmann, were based on extensive computer search. Recently Arnoux and Marin have used cohomology theory to present a computer-free proof. Our proof has the advantage of displaying a canonical copy of the affine plane over the three-element field inside this complex in terms of which the entire complex has a very neat and short description. This explicates the full automorphism group of the Kuhnel complex as a subgroup of the automorphism group of this affine plane. Our method also brings out the rich combinatorial structure inside this complex.
Resumo:
By a theorem of Gromov, for an almost complex structure J on CP2 tamed by the standard symplectic structure, the J-holomorphic curves representing the positive generator of homology form a projective plane. We show that this satisfies the Theorem of Desargues if and only if J is isomorphic to the standard complex structure. This answers a question of Ghys. (C) 2013 Published by Elsevier Masson SAS on behalf of Academie des sciences.
Resumo:
In this work we compute the fundamental group of each connected component of the function space of maps from it closed surface into the projective space
Resumo:
In this paper, we determine the lower central and derived series for the braid groups of the projective plane. We are motivated in part by the study of Fadell-Neuwirth short exact sequences, but the problem is interesting in its own right. The n-string braid groups B(n)(RP(2)) of the projective plane RP(2) were originally studied by Van Buskirk during the 1960s. and are of particular interest due to the fact that they have torsion. The group B(1)(RP(2)) (resp. B(2)(RP(2))) is isomorphic to the cyclic group Z(2) of order 2 (resp. the generalised quaternion group of order 16) and hence their lower central and derived series are known. If n > 2, we first prove that the lower central series of B(n)(RP(2)) is constant from the commutator subgroup onwards. We observe that Gamma(2)(B(3)(RP(2))) is isomorphic to (F(3) X Q(8)) X Z(3), where F(k) denotes the free group of rank k, and Q(8) denotes the quaternion group of order 8, and that Gamma(2)(B(4)(RP(2))) is an extension of an index 2 subgroup K of P(4)(RP(2)) by Z(2) circle plus Z(2). As for the derived series of B(n)(RP(2)), we show that for all n >= 5, it is constant from the derived subgroup onwards. The group B(n)(RP(2)) being finite and soluble for n <= 2, the critical cases are n = 3, 4. We are able to determine completely the derived series of B(3)(RP(2)). The subgroups (B(3)(RP(2)))((1)), (B(3)(RP(2)))((2)) and (B(3)(RP(2)))((3)) are isomorphic respectively to (F(3) x Q(8)) x Z(3), F(3) X Q(8) and F(9) X Z(2), and we compute the derived series quotients of these groups. From (B(3)(RP(2)))((4)) onwards, the derived series of B(3)(RP(2)), as well as its successive derived series quotients, coincide with those of F(9). We analyse the derived series of B(4)(RP(2)) and its quotients up to (B(4)(RP(2)))((4)), and we show that (B(4)(RP(2)))((4)) is a semi-direct product of F(129) by F(17). Finally, we give a presentation of Gamma(2)(B(n)(RP(2))). (C) 2011 Elsevier Inc. All rights reserved.
Resumo:
We classify the ( finite and infinite) virtually cyclic subgroups of the pure braid groups P(n)(RP(2)) of the projective plane. The maximal finite subgroups of P(n)(RP(2)) are isomorphic to the quaternion group of order 8 if n = 3, and to Z(4) if n >= 4. Further, for all n >= 3, the following groups are, up to isomorphism, the infinite virtually cyclic subgroups of P(n)(RP(2)): Z, Z(2) x Z and the amalgamated product Z(4)*(Z2)Z(4).
Resumo:
One of the most outstanding problems in combinatorial mathematics and geometry is the problem of existence of finite projective planes whose order is not a prime power.
Resumo:
We present two constructions in this paper: (a) a 10-vertex triangulation CP(10)(2) of the complex projective plane CP(2) as a subcomplex of the join of the standard sphere (S(4)(2)) and the standard real projective plane (RP(6)(2), the decahedron), its automorphism group is A(4); (b) a 12-vertex triangulation (S(2) x S(2))(12) of S(2) x S(2) with automorphism group 2S(5), the Schur double cover of the symmetric group S(5). It is obtained by generalized bistellar moves from a simplicial subdivision of the standard cell structure of S(2) x S(2). Both constructions have surprising and intimate relationships with the icosahedron. It is well known that CP(2) has S(2) x S(2) as a two-fold branched cover; we construct the triangulation CP(10)(2) of CP(2) by presenting a simplicial realization of this covering map S(2) x S(2) -> CP(2). The domain of this simplicial map is a simplicial subdivision of the standard cell structure of S(2) x S(2), different from the triangulation alluded to in (b). This gives a new proof that Kuhnel's CP(9)(2) triangulates CP(2). It is also shown that CP(10)(2) and (S(2) x S(2))(12) induce the standard piecewise linear structure on CP(2) and S(2) x S(2) respectively.
Resumo:
Pós-graduação em Matemática Universitária - IGCE
Resumo:
El objetivo de la tesis es identificar una familia de argumentos que comparten una estructura con el principio de dualidad de la geometría proyectiva. Esta familia la denomino "argumentos duales". Para lograr este objetivo, tomo cuatro argumentos importantes de la filosofía analítica e identifico en ellos la estructura que comparten. Los cuatro argumentos son: (i) el acertijo de la inducción de Goodman; (ii) la indeterminación de la referencia Putnam; (iii) la indeterminación de la traducción de Quine; (iv) la paradoja del seguimiento de reglas de Wittgenstein.
Resumo:
Brehm and Kuhnel proved that if M-d is a combinatorial d-manifold with 3d/2 + 3 vertices and \ M-d \ is not homeomorphic to Sd then the combinatorial Morse number of M-d is three and hence d is an element of {0, 2, 4, 8, 16} and \ M-d \ is a manifold like a projective plane in the sense of Eells and Kuiper. We discuss the existence and uniqueness of such combinatorial manifolds. We also present the following result: ''Let M-n(d) be a combinatorial d-manifold with n vertices. M-n(d) satisfies complementarity if and only if d is an element of {0, 2, 4, 8, 16} with n = 3d/2 + 3 and \ M-n(d) \ is a manifold like a projective plane''.
Resumo:
The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakalo ff , Sofia, July, 2006.
Resumo:
This paper deals with new results obtained in regard to the reconstruction properties of side-band Fresnel holograms (SBFH) of self-imaging type objects (for example, gratings) as compared with those of general objects. The major finding is that a distribution I2, which appears on the real-image plane along with the conventional real-image I1, remains a 2Z distribution (where 2Z is the axial distance between the object and its self-imaging plane) under a variety of situations, while its nature and focusing properties differ from one situation to another. It is demonstrated that the two distributions I1 and I2 can be used in the development of a novel technique for image subtraction.
Resumo:
Dispersing a data object into a set of data shares is an elemental stage in distributed communication and storage systems. In comparison to data replication, data dispersal with redundancy saves space and bandwidth. Moreover, dispersing a data object to distinct communication links or storage sites limits adversarial access to whole data and tolerates loss of a part of data shares. Existing data dispersal schemes have been proposed mostly based on various mathematical transformations on the data which induce high computation overhead. This paper presents a novel data dispersal scheme where each part of a data object is replicated, without encoding, into a subset of data shares according to combinatorial design theory. Particularly, data parts are mapped to points and data shares are mapped to lines of a projective plane. Data parts are then distributed to data shares using the point and line incidence relations in the plane so that certain subsets of data shares collectively possess all data parts. The presented scheme incorporates combinatorial design theory with inseparability transformation to achieve secure data dispersal at reduced computation, communication and storage costs. Rigorous formal analysis and experimental study demonstrate significant cost-benefits of the presented scheme in comparison to existing methods.
Resumo:
We propose a keyless and lightweight message transformation scheme based on the combinatorial design theory for the confidentiality of a message transmitted in multiple parts through a network with multiple independent paths, or for data stored in multiple parts by a set of independent storage services such as the cloud providers. Our combinatorial scheme disperses a message into v output parts so that (k-1) or less parts do not reveal any information about any message part, and the message can only be recovered by the party who possesses all v output parts. Combinatorial scheme generates an xor transformation structure to disperse the message into v output parts. Inversion is done by applying the same xor transformation structure on output parts. The structure is generated using generalized quadrangles from design theory which represents symmetric point and line incidence relations in a projective plane. We randomize our solution by adding a random salt value and dispersing it together with the message. We show that a passive adversary with capability of accessing (k-1) communication links or storage services has no advantage so that the scheme is indistinguishable under adaptive chosen ciphertext attack (IND-CCA2).