Connected sums of $Z$-knotted triangulations
Mark Pankov, Adam Tyc

TL;DR
This paper characterizes when the connected sum of two $z$-knotted triangulations results in a $z$-knotted triangulation, expanding understanding of zigzag properties in embedded graphs.
Contribution
It provides a complete description of conditions under which the connected sum of two $z$-knotted triangulations remains $z$-knotted.
Findings
Identifies all cases where connected sums preserve $z$-knottedness.
Provides a classification of $z$-knotted triangulations under connected sum operations.
Enhances understanding of zigzag structures in embedded graphs.
Abstract
An embedded graph is called -knotted if it contains the unique zigzag (up to reversing). We consider -knotted triangulations, i.e. -knotted embedded graphs whose faces are triangles, and describe all cases when the connected sum of two -knotted triangulations is -knotted.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Combinatorial Mathematics · graph theory and CDMA systems
Connected sums of -knotted triangulations
Mark Pankov, Adam Tyc
Faculty of Mathematics and Computer Science, University of Warmia and Mazury, Słoneczna 54, Olsztyn, Poland
[email protected], [email protected]
Abstract.
An embedded graph is called -knotted if it contains a unique zigzag (up to reversing). We consider -knotted triangulations, i.e. -knotted embedded graphs whose faces are triangles, and describe all cases when the connected sum of two -knotted triangulations is -knotted.
Key words and phrases:
embeded graph, triangulation, zigzag
To the memory of Michel Marie Deza
1. Introduction
The notion of Petrie polygon for polytopes was introduced in Coxeter’s book [1] (see also [4, 6, 11] and [5, Chapter 8] for some generalizations). For graphs embedded in -dimensional surfaces the same objects appear as zigzags in [2, 3, 5], geodesics in [7] and left-right paths in [10]. Following [2, 3, 4, 5] we call them zigzags.
A zigzag is a cyclic sequence of vertices in an embedded graph , where any two consecutive vertices form an edge, any three consecutive vertices are mutually distinct vertices on a face and any four consecutive vertices are not on the same face. For every zigzag the reversed sequence also is a zigzag and we do not distinguish such two zigzags. When there is a unique zigzag (up to reversing), we say that is -knotted.
The notion of zigzag is closely connected to the notion of central circuit in a -regular embedded graph. Zigzags and central circuits are interesting for many reasons. For example, there is an application to knot theory related to projections of links [5, Section 1.3]. In particular, -knotted embedded graphs connect to the Gauss code problem as follows. The medial graph of such a graph has a unique central circuit, and this medial graph can be considered as a closed curve having simple self-intersections only, i.e. it is a realization of a certain Gauss code on the corresponding surface (see [9]).
The main objects of this paper are -knotted triangulations (-knotted embedded graphs whose faces are triangles). Note that the dual objects, i.e. -knotted -regular graphs, are considered in [5, Section 2.3]. A simple example of -knotted triangulation is the graph of the -gonal bipyramid when is odd (this graph is not -knotted if is even). Examples of -knotted fullerenes can be found in [5, Section 2.3] (the dual graphs are triangulations). In this paper, we show how construct more examples.
The connected sum of manifolds is a well-known topological notion. In a similar way, we define the connected sum of triangulations and as the gluing by two distinguished faces and (in and , respectively). This is a triangulation in the connected sum of the surfaces containing and , and it depends on an identification homeomorphism between and . We describe all cases when the connected sum of two -knotted triangulations is -knotted.
2. Zigzags in embedded graphs
Let be a connected closed -dimensional surface (not necessarily orientable). Let also be a finite simple connected graph embedded in such that every vertex of is a point on , every edge is homeomorphic to the segment and any two edges are disjoint or intersecting in a vertex. The faces of are defined as the closures of the connected components of . We suppose that our graph embedding is a closed -cell embedding, i.e. every face is homeomorphic to a closed -dimensional disc. Also, we require that the following two conditions hold:
every edge is contained in precisely two distinct faces, 2.
the intersection of two distinct faces is an edge or a vertex or empty.
A zigzag in is a sequence of vertices satisfying the following three conditions for every :
- (Z1)
are distinct vertices on a certain edge, 2. (Z2)
there is a unique face containing , 3. (Z3)
the faces containing and are distinct.
Let be a zigzag in . Since our graph is finite, there is a natural number such that for every . The smallest number satisfying this condition is called the length of . So, our zigzag is the cyclic sequence , where is the length of . For every natural the sequence is a zigzag, and all such zigzags are identified with .
Suppose that are three distinct vertices on a certain face and is adjacent to both . Consider the second face containing . It contains the unique vertex adjacent to and distinct from . We apply the same arguments to and get a vertex . Step by step, we construct a sequence satisfying the conditions (Z1) – (Z3). Therefore, every zigzag is completely determined by any three consecutive vertices .
If is a sequence of vertices in , then denotes the reversed sequence . If is a zigzag, then the same holds for . If contains a sequence , then the sequence is contained the reversed zigzag . A sequence of type cannot be a zigzag (see, for example, [6]), i.e. a zigzag is not reversed to itself. Every zigzag will be identified with its reverse.
Example 1**.**
See Fig.1 for examples of zigzags in the complete graph and the cube graph .
For a zigzag in the sequence , where is the face containing , is a zigzag in the dual graph . There is a one-to-one correspondence between zigzags in and .
3. -knotted graphs
The graph is called -knotted if it contains the unique zigzag (up to reversing).
Let be an edge in and let be the vertices on this edge. We take one of the two faces containing . This face contains a unique vertex adjacent to and the unique vertex adjacent to (if , then the face is a triangle). The sequences and define some zigzags (not necessarily distinct) and the reversed zigzags correspond to the sequences and , respectively. See Fig.2. If is -knotted, then the zigzags determined by and must coincide (up to reversal), and so the unique zigzag contains, say, and either or , i.e. one of the following possibilities is realized:
- (1)
the unique zigzag is a sequence , 2. (2)
the unique zigzag is a sequence .
The edge is said to be of first or of second type if the corresponding case is realized. So, the zigzag in a -knotted graph passes through every edge twice in different directions (first type) or in the same direction (second type). Conversely, if there is a zigzag of passing through every edge twice, then is -knotted.
Example 2**.**
Consider the graph of the -gonal bipyramid , which consists of an -gone whose vertices are denoted by and connected with two disjoint vertices . Suppose that . If is odd, then the sequence
[TABLE]
[TABLE]
is a zigzag. In the case when is even, one of the zigzags is if and
[TABLE]
if . Each of these sequences passes through the edge joining and only ones. This means that is not -knotted if is even. Consider the case when is odd, i.e. and . If , then
[TABLE]
is a zigzag. Similarly, if is odd and not less than , then
[TABLE]
[TABLE]
is a zigzag. In the case when , the sequence
[TABLE]
[TABLE]
is a zigzag. If is even and not less than , then
[TABLE]
[TABLE]
is a zigzag. The length of these zigzags is . Since contains precisely edges, each of these zigzags passes through all edges twice. This guarantees that there are no other zigzags (except the reverse) and is -knotted if is odd. Every edge joining and is of first type and all edges in the -gon are of second type. Each face of is a triangle formed by two edges of first type and one edge of second type. The zigzag passes through each face thrice. Suppose that and are the vertices on a certain face. An immediate verification shows that the zigzag is a sequence
[TABLE]
if is odd and it is a sequence
[TABLE]
if is even.
Suppose that is -knotted. This is equivalent to the dual graph being -knotted. If is an edge of first type in , then the zigzag is a sequence
[TABLE]
see Fig.2. Denote by and the faces containing and , respectively. The edge corresponds to the edge of joining and . The zigzag in is a sequence , i.e. the edge of corresponding to is of second type.
Similarly, every edge of second type in corresponds to an edge of first type in .
4. Two types of faces in -knotted triangulations
In this section, we suppose that is -knotted and every face of is a triangle, i.e. is a -knotted triangulation.
Lemma 1**.**
For every face one of the following possibilities is realized:
- (1)
only one edge in is of second type, 2. (2)
all edges in are of second type.
In the cases (1) and (2), we say that is a -face or a -face, respectively.
Proof of Lemma 1.
Observe that the zigzag passes through the face thrice; i.e. there are precisely three intersections of the zigzag with which contain more than one vertex. Every such intersection consists of two edges.
This observation shows that the following possibilities cannot be realized: contains precisely two edges of second type (see Fig.3 (a) and (b)) and all edges in are of first type (see Fig.3 (c)). ∎
Suppose that is a -face. Let be the vertices of . We assume that the vertices are on a unique edge of second type and the zigzag goes twice from to , see Fig.4.
Then the zigzag contains the sequences and . The zigzag passes through thrice and the third sequence formed by the vertices of is . Since the zigzag is a cyclic sequence, we can suppose are the first three consecutive vertices in the zigzag. The remaining two sequences associated to are and . There are precisely the following two possibilities for the zigzag:
- (od)
, 2. (ev)
.
The first case is realized for all faces in the bipyramid graph if is odd. In this case, we say that is a -face of odd type. The second case corresponds to all faces in if is even, and is said to be a -face of even type in this case.
Let be a -face and let be the vertices on . Formally, we have two possibilities (Fig.5); but the second cannot happen because the zigzag passes through each face thrice. So, the zigzag defines the orientation on . We suppose that this orientation coincides with the order of vertices in the sequence (the first triangle on Fig.5).
The zigzag contains the sequences and and . Since the zigzag is a cyclic sequence, we can suppose that the first three consecutive vertices are . Then there are only the following two possibilities for the zigzag:
- (1)
, 2. (2)
.
We say that is a -face of first or of second type if the corresponding case is realized. See Examples 4 and 5 for -knotted triangulations containing -faces of first type. In Section 7, we construct a -knotted triangulation with a -face of second type.
5. Main result
Let and be triangulations of closed connected -dimensional surfaces and , respectively. Suppose that is a face in and is a face in . These faces both are homeomorphic to a closed -dimensional disc and each of the boundaries and is the sum of three edges. Let be a homeomorphism transferring every vertex of to a vertex of , i.e. if , are the vertices of , then , are the vertices of . The connected sum is the graph whose vertex set is the union of the vertex sets of and , where every is identified with , and the edge set is the union of the edge sets of and , where the edge containing is identified with the edge containing . This is a triangulation in the connected sum of and .
Example 3**.**
Any connected sum of two exemplars of is the bipyramid graph . One of the connected sums of two exemplars of is presented on Fig.6.
Later, we show that it is a -knotted triangulation containing -faces of first type.
Theorem 1**.**
Suppose that and are -knotted. Then the following assertions are fulfilled:
- (1)
If and are -faces in and (respectively), then there is a homeomorphism transferring vertices to vertices and such that the connected sum is -knotted. 2. (2)
If is a -face of first type in , then for every face in and every homeomorphism transferring vertices to vertices the connected sum is -knotted. 3. (3)
Suppose that is a -face of second type in and is a face in such that the connected sum is -knotted for a certain homeomorphism transferring vertices to vertices. Then is a -face of first type or a -face of odd type. In these cases, is -knotted for every homeomorphism transferring vertices to vertices.
Using this result we construct the following examples of -knotted triangulations containing -faces of first type:
If is a -face of odd type in a -knotted triangulation and is a face in the bipyramid graph , where is odd, then for some homeomorphisms transferring vertices to vertices the connected sum is -knotted and contains -faces of first type (Example 4). 2.
If is a -face of even type in a -knotted triangulation and is a face in the bipyramid graph , where is even, then for some homeomorphisms transferring vertices to vertices the connected sum is -knotted and contains -faces of first type (Example 5).
Remark 1**.**
Examples of -knotted fullerenes can be found in [5, p.31, Fig 2.2]. The dual graphs are -knotted triangulations whose vertices are of degree or . Observe that each vertex of degree is adjacent to every vertex of a certain -gone, but there is no other vertex adjacent to all vertices of this -gone. This means that these triangulations cannot be presented as the connected sums of some collections of -knotted bipyramids.
Remark 2**.**
If is the edge set of a -knotted embedded graph, then the cyclic ordering of (associated to the zigzag) induces two linear transformations of (considered as a vector space over ) [8]. It will be interesting to describe relations between such transformations for and (if this connected sum is -knotted).
6. Proof of Theorem 1
6.1. General construction of zigzags in the connected sum
From this moment, we will suppose that and are -knotted triangulations. Let and be faces in and , respectively. If are the vertices of , then the zigzag of is a sequence
[TABLE]
where and are permutations on the set . Let us consider this zigzag as the union of the following three segments
[TABLE]
[TABLE]
[TABLE]
i.e. as the cyclic sequence . It must be pointed out that any two consecutive segments have the same vertex (for example, the segments and are joined in the vertex ). Similarly, if are the vertices of , then the zigzag of is a sequence
[TABLE]
where and are permutations on the set . We consider this zigzag as the cyclic sequence , where
[TABLE]
[TABLE]
[TABLE]
Let be a homeomorphism transferring vertices to vertices. Zigzags in the connected sum can be constructed as follows. We start from a segment . Let be the last two vertices in (the order of the vertices is important). There is a unique segment
[TABLE]
such that are the first two vertices in (as above, the order of the vertices is important). Indeed, if is the element of distinct from and there are two segments satisfying this condition, then the zigzag in contains the sequence twice or it contains this sequence together with the reversed sequence ; each of these cases is impossible.
Let be the last two vertices in . There is a unique segment
[TABLE]
such that are the first two vertices in . If , then is a zigzag in . In the case when and are distinct, we apply the same arguments to and, as above, choose a certain segment
[TABLE]
Step by step, we construct a cyclic sequence which defines a zigzag in . The intersection of any two consecutive segments in this sequence consists of precisely two vertices. There are the following three possibilities for the associated zigzag:
[TABLE]
where and are distinct elements of
[TABLE]
respectively. In the third case, the connected sum is -knotted. Otherwise, contains three zigzags of type or one zigzag of type and one zigzag of type .
6.2. Proof of the statement (1)
In this subsection, we suppose that and both are -faces, i.e. similar to faces in the -knotted bipyramids. As in Example 2, we denote by and the vertices of and (respectively) which do not belong to the edges of second type. Also, we write and for the vertices on the edge of second type in and , respectively. We will assume that the zigzags in and go from and to and , respectively.
Case 1 (). If and are of odd type, then the zigzags in and are sequences
[TABLE]
and
[TABLE]
(respectively) and we have
[TABLE]
[TABLE]
There are precisely distinct bijections between the vertex sets of and . In the case when is identified with , the corresponding connected sums are -knotted. If are identified with (respectively), then the unique zigzag in the connected sum is
[TABLE]
If is identified with and is identified with , then this is
[TABLE]
In the remaining four cases, the connected sum contains precisely two zigzags and is not -knotted (Tab.1).
Example 4**.**
Suppose that is the -bipyramid graph considered in Example 2, and is odd. Then
[TABLE]
[TABLE]
If are identified with (respectively), then the unique zigzag in the connected sum is . The face containing appears in this zigzag as follows
[TABLE]
which means that it is a -face of first type. The same holds for the case when are identified with , respectively.
Case 2 (). If and are of even type, then the zigzags in and are sequences
[TABLE]
and
[TABLE]
(respectively) and
[TABLE]
[TABLE]
In contrast to the previous case, the connected sum is -knotted if is not identified with (Tab.2).
In the case when is identified with , the connected sum contains precisely three zigzags and is not -knotted. If is identified with (respectively), then these zigzags are and and . If is identified with and is identified with , then we get the zigzags and and .
Example 5**.**
Suppose that is the -bipyramid graph considered in Example 2, and is even. Then
[TABLE]
[TABLE]
If are identified with (respectively), then the unique zigzag in the connected sum is . The face containing appears in this zigzag as follows
[TABLE]
i.e. this is a -face of first type. The same holds for the other three cases when is not identified with .
Case 3 (). If is of even type and is of odd type, then
[TABLE]
[TABLE]
The connected sum is -knotted if is identified with (Tab.3).
For each of the remaining four cases, the connected sum contains precisely two zigzags and is not -knotted (Tab.4).
Remark 3**.**
Suppose that and are the -bipyramid and -bipyramid graphs (respectively), where , , is odd and is even. Then all faces in any -knotted connected sum of and are -faces.
6.3. Proof of the statement (2)
In this subsection, we suppose that is a -face of first type. We denote by the vertices of and assume that the orientation on defined by the zigzag coincides with the order of vertices in the sequence . Then the zigzag is a sequence
[TABLE]
and we have
[TABLE]
We show that for every homeomorphism the connected sum is -knotted.
Consider the case when is a -face. As in the previous subsection, we assume that is the vertex which do not belong to the edges of second type, and are the vertices on the edge of second type and the zigzag goes from to . If is of odd type, then
[TABLE]
and the zigzags in the corresponding connected sums are presented in Tab.5.
In the case when is of even type, we have
[TABLE]
and the zigzags in the connected sums can be found in Tab.6.
Suppose that is a -face whose vertices are and the orientation coincides with the order of vertices in the sequence . If is of first type, then
[TABLE]
and the zigzags in the connected sums are described in Tab.7.
If is of second type, then the zigzag in is a sequence
[TABLE]
and
[TABLE]
The zigzags in the connected sums are presented in Tab.8.
6.4. Proof of the statement (3)
In this subsection, we suppose that is a -face of second type. As in the previous subsection, we denote by the vertices of and assume that the orientation on defined by the zigzag coincides with the order of vertices in the sequence . Then
[TABLE]
If is a -face of first type, then the connected sum is -knotted for any homeomorphism (see the previous subsection). If is a -face of second type, then
[TABLE]
In this case, for every of the segments the first two vertices coincides with the last two vertices. Therefore, for any homeomorphism all zigzags in the connected sum are of type , where
[TABLE]
So, the connected sum is not -knotted.
Consider the case when is a -face whose vertices are and is the vertex which does not belong to the edge of second type. As above, we suppose that the zigzag goes from to . If is of odd type, then
[TABLE]
and for every homeomorphism the connected sum is -knotted (Tab. 9).
If is of even type, then
[TABLE]
and for every homeomorphism the connected sum is not -knotted (Tab.10).
7. -faces of second type
Consider the bipyramid graph , where and is odd. As in Example 2, we denote by the vertices on the -gone and write for the remaining two vertices. There precisely two zigzags in . These are the sequences
[TABLE]
and
[TABLE]
Let be the face containing . Following Subsection 6.1, we present zigzags as the unions of segments which are parts of zigzags between two edges of , i.e. each of these segments contains precisely two edges of . The first zigzag is the sum of the following two segments
[TABLE]
The second zigzag passes ones through the edges and , and it does not contain the edge . So, it will be identified with the segment
[TABLE]
Now, we take the bipyramid graph , where and is odd. Let be the vertices on the -gone, and let be the remaining two vertices. Denote by the face containing . As above, one of the zigzags is the union of two segments and the other zigzag is identified with the segment .
We identify the vertices with the vertices (respectively). The corresponding connected sum of and contains the unique zigzag
[TABLE]
i.e. it is -knotted. The face containing appears in this zigzag as follows
[TABLE]
This is a -face of second type.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Coxeter H.S.M., Regular polytopes , Dover Publications, New York 1973 (3rd ed).
- 2[2] Deza M., Dutour Sikirić M., Zigzag Structure of Simple Bifaced Polyhedra , Comb. Probab. Comput. 14(2005), 31–57.
- 3[3] Deza M., Dutour Sikirić M., Zigzags, Railroads, and Knots in Fullerenes , J. Chem. Inf. Comput. Sci. 44(2004), 1282–293.
- 4[4] Deza M., Dutour Sikirić M., Zigzag structure of complexes , Southeast Asian Bulletin of Math. 29(2005), 301–320.
- 5[5] Deza M., Dutour Sikirić M., Shtogrin M., Geometric Structure of Chemistry-relevant Graphs: zigzags and central circuit , Springer 2015.
- 6[6] Deza M., Pankov M., Zigzag structure of thin chamber complexes , ar Xiv:math/1509.03754.
- 7[7] Grünbaum B., Motzkin T.S. The number of hexagons and the simplicity of geodesics on certain polyhedra , Canadian J. Math. 15(1963), 744–751.
- 8[8] Lins S., Silva V., On maps with a single zigzag , Cubo Mat. Educ. 5(2003), 333–344.
