The work reported in this paper refers to Massey’s proof of the surface classification theorem based on the standard word-rewriting treatment of surfaces. We arrange this approach into a formal rewriting system R and provide a new version of Massey’s argument. Moreover, we study the computational properties of two subsystems of R: Ror for dealing with words denoting orientable surfaces and Rnor for dealing with words denoting non-orientable surfaces. We show how such properties induce an alternative proof for the surface classification in which the basic homeomorphism between the connected sum of three projective planes and the connected sum of a torus with a projective plane is not required.

Rewriting systems for the surface classification theorem

PULCINI, GABRIELE
2010-01-01

Abstract

The work reported in this paper refers to Massey’s proof of the surface classification theorem based on the standard word-rewriting treatment of surfaces. We arrange this approach into a formal rewriting system R and provide a new version of Massey’s argument. Moreover, we study the computational properties of two subsystems of R: Ror for dealing with words denoting orientable surfaces and Rnor for dealing with words denoting non-orientable surfaces. We show how such properties induce an alternative proof for the surface classification in which the basic homeomorphism between the connected sum of three projective planes and the connected sum of a torus with a projective plane is not required.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11584/64584
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact