Related papers: Cataloguing PL 4-manifolds by gem-complexity
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…
There are three kinds of Lie superalgebras for each differentiable manifold. In this note, we shall show an application of the homology groups of those superalgebras in order to classify 4 dimensional Engel-like Lie algebras.
The aim of this work is to investigate the properties and classification of an interesting class of $4$-dimensional $3$-Hom-Lie algebras with a nilpotent twisting map $\alpha$ and eight structure constants as parameters. Derived series and…
We study lower bounds for the number of vertices in a PL-triangulation of a given manifold $M$. While most of the previous estimates are based on the dimension and the connectivity of $M$, we show that further information can be extracted…
We introduce a new generalization of Gompf nuclei and give applications. We construct infinitely many exotic smooth structures for a large class of compact 4-manifolds with boundary, regarding topological invariants. We prove that a large…
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…
We completely classify the computational complexity of the list H-colouring problem for graphs (with possible loops) in combinatorial and algebraic terms: for every graph H the problem is either NP-complete, NL-complete, L-complete or is…
We consider the following problem for a fixed graph H: given a graph G and two H-colorings of G, i.e. homomorphisms from G to H, can one be transformed (reconfigured) into the other by changing one color at a time, maintaining an H-coloring…
We present an algorithm taking a Kirby diagram of a closed oriented $4$-manifold to a trisection diagram of the same manifold. This algorithm provides us with a large number of examples for trisection diagrams of closed oriented…
Gay and Kirby recently introduced the concept of a trisection for arbitrary smooth, oriented closed 4-manifolds, and with it a new topological invariant, called the trisection genus. This paper improves and implements an algorithm due to…
Deciding whether a planar graph (even of maximum degree $4$) is $3$-colorable is NP-complete. Determining subclasses of planar graphs being $3$-colorable has a long history, but since Gr\"{o}tzsch's result that triangle-free planar graphs…
This paper establishes the separation of complexity classes $\mathbf{P}$ and $\mathbf{NP}$ through a novel homological algebraic approach grounded in category theory. We construct the computational category $\mathbf{Comp}$, embedding…
In a recent paper, {\it Algorithms for Deforming and Contracting Simply Connected Discrete Closed Manifolds (II)}, we discussed two algorithms for deforming and contracting a simply connected discrete closed manifold into a discrete sphere.…
Suppose M is a noncompact connected PL 2-manifold. In this paper we study the topological property of the triple (H(M)_0, H^PL(M)_0, H^PL, c(M)_0), where H(M)_0 is the identity component of the homeomorphism group {\cal H}(M) of M with the…
We compute the cohomology groups of the spaces of colorings of cycles, i.e., of the prodsimplicial complexes Hom(C_m,K_n). We perform the computation first with Z_2, and then with integer coefficients. The main technical tool is to use…
List colouring is an NP-complete decision problem even if the total number of colours is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving list colouring of permutation graphs with a bounded…
We give a criterion on a group $\pi$ and a homomorphism $w \colon \pi \to C_2$ under which closed $4$-manifolds with fundamental group $\pi$ and orientation character $w$ are classified up to homotopy equivalence by their quadratic…
We prove that a closed 4-manifold has shadow-complexity zero if and only if it is a kind of 4-dimensional graph manifold, which decomposes into some particular blocks along embedded copies of S^2 x S^1, plus some complex projective spaces.…
Understanding the role of randomness when solving locally checkable labeling (LCL) problems in the LOCAL model has been one of the top priorities in the research on distributed graph algorithms in recent years. For LCL problems in…
A strong interaction is known to exist between edge-colored graphs (which encode PL pseudo-manifolds of arbitrary dimension) and random tensor models (as a possible approach to the study of Quantum Gravity). The key tool is the {\it…