Search arXivSearch

arXiv · 2011.00761

On regular genus and G-degree of PL 4-manifolds with boundary

Abstract

In this article, we introduce two new PL-invariants: weighted regular genus and weighted G-degree for manifolds with boundary. We first prove two inequalities involving some PL-invariants which state that for any PL-manifold $M$ with non spherical boundary components, the regular genus $\mathcal{G}(M)$ of $M$ is at least the weighted regular genus $\tilde{G}(M)$ of $M$ which is again at least the generalized regular genus $\bar{G}(M)$ of $M$. Another inequality states that the weighted G-degree $\tilde{D}_G (M)$ of $M$ is always greater than or equal to the G-degree $D_G (M)$ of $M$. Let $M$ be any compact connected PL $4$-manifold with $h$ number of non spherical boundary components. Then we compute the following: $$\tilde{G} (M) \geq 2 χ(M)+3m+2h-4+2 \hat{m} \mbox{ and } \tilde{D}_G (M) \geq 12(2 χ(M)+3m+2h-4+2 \hat{m}),$$ where $m$ and $\hat{m}$ are the ranks of the fundamental groups of $M$ and the corresponding singular manifold $\widehat{M}$ (obtained by coning off the boundary components of $M$) respectively. As a consequence we prove that the regular genus $\mathcal{G}(M)$ satisfies the following inequality: $$\mathcal{G} (M) \geq 2 χ(M)+3m+2h-4+2 \hat{m},$$ which improves the previous known lower bounds for the regular genus $\mathcal{G}(M)$ of $M$. Then we define two classes of gems for PL $4$-manifold $M$ with boundary: one consists of semi-simple gems and the other consists of weak semi-simple gems, and prove that the lower bounds for the weighted G-degree and weighted regular genus are attained in these two classes respectively.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Biplab Basak, Manisha Binjola. 2022-12-02. On regular genus and G-degree of PL 4-manifolds with boundary. https://doi.org/10.18311/jims%2F2024%2F30716

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT