相关论文: C-boundary links up to six crossings

Boileau and Rudolph called a link $L$ in the $3$-sphere a $\bf C$-boundary if it can be realized as the intersection of an algebraic curve $A$ in $\bf C^2$ with the boundary of a smooth embedded $4$-ball $B$. They showed that some links are…

In the 1980's Daryl Cooper introduced the notion of a C-complex (or clasp-complex) bounded by a link and explained how to compute signatures and polynomial invariants using a C-complex. Since then this was extended by works of Cimasoni,…

An oriented link L in a 3-sphere S in complex 2-space is a C-boundary if it bounds a piece of algebraic curve in the 4-ball bounded by S. Using Kronheimer and Mrowka's proof of the Thom Conjecture, we construct many oriented knots which are…

A bounded curvature path is a continuously differentiable piece-wise $C^2$ path with bounded absolute curvature connecting two points in the tangent bundle of a surface. These paths have been widely considered in computer science and…

We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number is the minimum number of bundled crossings that group all…

Given a convex domain $C$, a $C$-polygon is an intersection of $n\geq 2$ homothets of $C$. If the homothets are translates of $C$ then we call the intersection a translative $C$-polygon. This paper proves that if $C$ is a strictly convex…

Boundary labeling is a well-known method for displaying short textual labels for a set of point features in a figure alongside the boundary of that figure. Labels and their corresponding points are connected via crossing-free leaders. We…

Boundary labeling is a technique in computational geometry used to label sets of features in an illustration. It involves placing labels along an axis-parallel bounding box and connecting each label with its corresponding feature using…

A graph G is an a-angle crossing (aAC) graph if every pair of crossing edges in G intersect at an angle of at least a. The concept of right angle crossing (RAC) graphs (a=Pi/2) was recently introduced by Didimo et. al. It was shown that any…

The triple linking number of an oriented surface link was defined as an analogical notion of the linking number of a classical link. We consider a certain $m$-component $T^2$-link ($m \geq 3$) determined from two commutative pure $m$-braids…

Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…

Let $\Delta$ be an infinite, locally finite tree with more than two ends. Let $\Gamma<\aut(\Delta)$ be an acylindrical uniform lattice. Then the boundary algebra $\cl A_\Gamma = C(\partial\Delta)\rtimes \Gamma$ is a simple Cuntz-Krieger…

A graph is $1$-planar, if it can be drawn in the plane such that there is at most one crossing on every edge. It is known, that $1$-planar graphs have at most $4n-8$ edges. We prove the following odd-even generalization. If a graph can be…

A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove…

The clustered planarity problem (c-planarity) asks whether a hierarchically clustered graph admits a planar drawing such that the clusters can be nicely represented by regions. We introduce the cd-tree data structure and give a new…

A graph is called 1-planar if it can be drawn in the plane so that each of its edges is crossed by at most one other edge. In this paper we decompose the set of all 1-planar graphs into three classes $\mathcal C_0, \mathcal C_1$ and…

All operator algebras have (not necessarily irreducible) boundary representations. A unital operator algebra has enough such boundary representations to generate its C*-envelope.

The notion of bounded element of C*-inductive locally convex spaces (or C*-inductive partial *-algebras) is introduced and discussed in two ways: the first one takes into account the inductive structure provided by certain families of…

We prove that curves indicated in the title exist. This results answers to a question posed by A.G.Vitushkin about 30 years ago. We also discuss the minimal number of boundary components of a curve in the unit ball passing through the…

We study $c$-crossing-critical graphs, which are the minimal graphs that require at least $c$ edge-crossings when drawn in the plane. For every fixed pair of integers with $c\ge 13$ and $d\ge 1$, we give first explicit constructions of…