相关论文: Crossing number of links formed by edges of a tria…

For each integer $n\ge 2$, we construct infinitely many $n$-component Brunnian links of 3-balls in $S^4$. Our main tool is the third author's result on the existence of splitting spheres for the trivial two-component link of $2$-spheres in…

We seek to connect ideas in the theory of bridge trisections with other well-studied facets of classical knotted surface theory. First, we show how the normal Euler number can be computed from a tri-plane diagram, and we use this to give a…

By use of a variety of techniques (most based on constructions of quasipositive knots and links, some old and others new), many smooth 3-manifolds are realized as transverse intersections of complex surfaces in complex 3-space with strictly…

The crossing number of a graph $G$ is the minimum number of pairwise intersections of edges among all drawings of $G$. In this paper, we study the crossing number of $K_{n,n}-nK_2$, $K_n\times P_2$, $K_n\times P_3$ and $K_n\times C_4$.

We show that $O(n^2)$ exchanging flips suffice to transform any edge-labelled pointed pseudo-triangulation into any other with the same set of labels. By using insertion, deletion and exchanging flips, we can transform any edge-labelled…

We analyze the orbifolds that can be obtained as quotients of hyperbolic 3-manifolds admitting a Heegaard splitting of genus two by their orientation preserving isometry groups. The genus two hyperbolic 3-manifolds are exactly the…

We provide the twisted Alexander polynomials of finite abelian covers over three-dimensional manifolds whose boundary is a finite union of tori. This is a generalization of a well-known formula for the usual Alexander polynomial of knots in…

Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A multi-crossing is a crossing where more than two strands meet at a single point, such that each strand bisects the…

We bound the number of minimal hypergraph transversals that arise in tri-partite 3-uniform hypergraphs, a class commonly found in applications dealing with data. Let H be such a hypergraph on a set of vertices V. We give a lower bound of…

We extend the theory of hyperbolicity of links in the 3-sphere to tg-hyperbolicity of virtual links, using the fact that the theory of virtual links can be translated into the theory of links living in closed orientable thickened surfaces.…

Consider a M\"obius strip with $n$ chosen points on its edge. A triangulation is a maximal collection of arcs among these points and cuts the strip into triangles. In this paper, we proved the number of all triangulations that one can…

We establish a bijective correspondence between the set T(n) of 3-dimensional triangulations with n tetrahedra and a certain class H(n) of relative handlebodies (i.e. handlebodies with boundary loops, as defined by Johannson) of genus n+1.…

It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is…

In this note we provide an improved upper bound on the biplanar crossing number of the 8-dimensional hypercube. The $k$-planar crossing number of a graph $cr_k(G)$ is the number of crossings required when every edge of $G$ must be drawn in…

A graph is crossing-critical if the removal of any of its edges decreases its crossing number. This work is motivated by the following question: to what extent is crossing- criticality a property that is inherent to the structure of a…

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

We prove that in the complement of a highly twisted link, all closed, essential, meridionally incompressible surfaces must have high genus. The genus bound is proportional to the number of crossings per twist region. A similar result holds…

By pairwise gluing of edges of a polygon, one produces two-dimensional surfaces with handles and boundaries. In this paper, we count the number ${\cal N}_{g,L}(n_1, n_2, ..., n_L)$ of different ways to produce a surface of given genus $g$…

Let $\Omega$ be a bounded domain of $\mathbb{R}^3$ whose closure $\overline{\Omega}$ is polyhedral, and let $\mathcal{T}$ be a triangulation of $\overline{\Omega}$. Assuming that the boundary of $\Omega$ is sufficiently regular, we provide…

Three-dimensional three-colour percolation on a lattice made of tetrahedra is a direct generalization of two-dimensional two-colour percolation on the triangular lattice. The interfaces between one-colour clusters are made of bicolour…