๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some bounds for the regular genus of PL-manifolds

โœ Scribed by Rossana Chiavacci; Giuseppe Pareschi

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
928 KB
Volume
82
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper is devoted to extend some well-known facts on the genus of a surface and on the Heegaard genus of a 3-manifold to manifolds of arbitrary dimension. More precisely, we prove that the genus of non-orientable manifolds is always even and we compare the genus of a manifold with the rank of its fundamental group and with the genus of its boundary.

๐Ÿ“œ SIMILAR VOLUMES

Bounds for the Genus of Space Curves
Bounds for the Genus of Space Curves
โœ Valentina Beorchia ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 537 KB

## Abstract We compute the following upper bounds for the maximal arithmetic genus __P~a~(d,t__) over all locally Cohen โ€ Macaulay space curves of degree __d__, which are not contained in a surface of degree magnified image These bounds are sharp for t โ‰ค 4 abd any d โ‰ฅ t.

Bounds for Eigenfunctions of the Laplaci
Bounds for Eigenfunctions of the Laplacian on Compact Riemannian Manifolds
โœ Harold Donnelly ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 188 KB

Suppose that f is an eigenfunction of -D with eigenvalue l ] 0. It is proved that where n is the dimension of M and c 1 depends only upon a bound for the absolute value of the sectional curvature of M and a lower bound for the injectivity radius of M. It is then shown that if M admits an isometric

Bounds for the average genus of the vert
Bounds for the average genus of the vertex-amalgamation of graphs
โœ Saul Stahl ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 628 KB

The average orientable genus of graphs has been the subject of a considerable number of recent investigations. It is the purpose of this article to examine the extent to which the average genus of the amalgamation of graphs fails to be additive over its constituent subgraphs. This discrepancy is bou

Some Bounds for the Number of Blocks
Some Bounds for the Number of Blocks
โœ Ryuzaburou Noda ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 65 KB

Some natural upper bounds for the number of blocks are given. Only a few block sets achieving the bounds except trivial ones are known. Necessary conditions for the existence of such block sets are given.