Related papers: Estimating trisection genus via gem theory
The Heegaard genus of a 3-manifold, as well as the growth of Heegaard genus in its finite sheeted cover spaces, has extensively been studied in terms of algebraic, geometric and topological properties of the 3-manifold. This note shows that…
In 2018, M. Chu and S. Tillmann gave a lower bound for the trisection genus of a closed 4-manifold in terms of the Euler characteristic of $M$ and the rank of its fundamental group. We show that given a group $G$, there exist a 4-manifold…
A trisection of a smooth, closed, oriented 4-manifold is a decomposition into three 4-dimensional 1-handlebodies meeting pairwise in 3-dimensional 1-handlebodies, with triple intersection a closed surface. The fundamental groups of the…
A representation for compact 3-manifolds with non-empty non-spherical boundary via 4-colored graphs (i.e., 4-regular graphs endowed with a proper edge-coloration with four colors) has been recently introduced by two of the authors, and an…
We give a procedure to construct (quasi-)trisection diagrams for closed (pseudo-)manifolds generated by colored tensor models without restrictions on the number of simplices in the triangulation, therefore generalizing previous works in the…
We study trisections of smooth, compact non-orientable 4-manifolds, and introduce trisections of non-orientable 4-manifolds with boundary. In particular, we prove a non-orientable analogue of a classical theorem of Laudenbach-Po\'enaru. As…
We give diagrammatic algorithms for computing the group trisection, homology groups, and intersection form of a closed, orientable, smooth 4-manifold, presented as a branched cover of a bridge-trisected surface in $\mathbb{S}^{4}$. The…
Trisections of closed 4-manifolds, first defined and studied by Gay and Kirby, have proved to be a useful tool in the systematic analysis of 4-manifolds via handlebodies. Subsequent work of Abrams, Gay, and Kirby established a connection…
This article focuses on a class of properly edge-colored graphs, which arise from topological combinatorics, and investigates their embeddings onto surfaces. Specifically, these graphs are known as the dual graphs of balanced normal…
A simplified trisection is a trisection map on a 4-manifold such that, in its critical value set, there is no double point and cusps only appear in triples on innermost fold circles. We give a necessary and sufficient condition for a…
We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…
Given a diagram for a trisection of a 4-manifold $X$, we describe the homology and the intersection form of $X$ in terms of the three subgroups of $H_1(\Sigma;\mathbb{Z})$ generated by the three sets of curves and the intersection pairing…
In this paper, we introduce a class of graphs which we call average hereditary graphs. Many graphs that occur in the usual graph theory applications belong to this class of graphs. Many popular types of graphs fall under this class, such as…
The genus of a graph is a topological invariant that measures the minimum genus of a surface on which the graph can be embedded without any edges crossing. Graph genus plays a fundamental role in topological graph theory, used to classify…
The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable…
In a graph $G$ of maximum degree 3, let $\gamma(G)$ denote the largest fraction of edges that can be 3 edge-coloured. Rizzi \cite{Riz09} showed that $\gamma(G) \geq 1-\frac{2\strut}{\strut 3 g_{odd}(G)}$ where $g_{odd}(G)$ is the odd girth…
In a graph $G$ of maximum degree $\Delta$ let $\gamma$ denote the largest fraction of edges that can be $\Delta$ edge-coloured. Albertson and Haas showed that $\gamma \geq 13/15$ when $G$ is cubic . We show here that this result can be…
Slimness of a graph measures the local deviation of its metric from a tree metric. In a graph $G=(V,E)$, a geodesic triangle $\bigtriangleup(x,y,z)$ with $x, y, z\in V$ is the union $P(x,y) \cup P(x,z) \cup P(y,z)$ of three shortest paths…
Algorithms that decompose a manifold into simple pieces reveal the geometric and topological structure of the manifold, showing how complicated structures are constructed from simple building blocks. This note describes a way to…
Simple crystallizations are edge-coloured graphs representing PL 4-manifolds with the property that the 1-skeleton of the associated triangulation equals the 1-skeleton of a 4-simplex. In the present paper, we prove that any…