[[missing key: loading-pdf-error]] [[missing key: loading-pdf-link]]
Abstract
This thesis will be directed towards the analysis of a construction known as the polyhedral product functor. The polyhedral product functor is a subspace of a product space obtained by gluing certain topological spaces in a combinatorial way dictated by a simplicial complex K[Buchstaber and Panov, 2000]. The thesis will be divided into 6 parts as follows.
In the first part, we study the equivariance of the stable decomposition formula for the polyhedral product functor ZK( X,A) given by A. Bahri, M. Bendersky, F. R. Cohen and S. Gitler [Bahri et al., 2010],}, under the action of Aut( K), which is the automorphism group of the simiplicial complex K. In the second part, we analyze the module structure of H*(Σ(ZKn(D 1,S0))), for K n the boundary of the n-gon and Σ(ZKn( D1,S0)) is the reduced suspension of ZKn(D1, S0) as defined in 1.0.5, under the action of the cyclic group Cn. induced by the action of the cyclic group Cn on the n-gon Kn. In part 3 we introduce branched covers of the polyhedral product ZKn(D1,S 0) arising from the action of the cyclic group Cn and its different subgroups. We use the Riemann-Hurwitz formula to calculate the genus for the quotient spaces involved. There are special maps called Strickland maps: St: ZK( X,A) → ZL(X,A) , where X is a commutative topological monoid, and Λ a submonoid. Part 4 proposes a geometric method for calculating the Strickland map in homology in the special case: St: ZKn+1(D 1,S0) → ZKn(D 1,S0), where D 1 is a topological monoid under multiplication.
In part 5 we see that, in certain cases, maps on polyhedral products are completely determined by what they do on the maximal full faces of the simplicial complex K. In the last part, we give computational evidence supporting the collapse of the Eilenberg-Moore spectral sequence when computing the cohomology of the space X = U(m) X_Tm Z K(D2,S 1)
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer