Related papers: Divides with cusps and symmetric links
This study of properly or strictly convex real projective manifolds introduces notions of parabolic, horosphere and cusp. Results include a Margulis lemma and in the strictly convex case a thick-thin decomposition. Finite volume cusps are…
A digraph is $3$-dicritical if it cannot be vertex-partitioned into two sets inducing acyclic digraphs, but each of its proper subdigraphs can. We give a human-readable proof that the number of 3-dicritical semi-complete digraphs is finite.…
A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…
We show that if a split link is obtained from a split link $L$ in $S^3$ by $1/n$-Dehn surgery along a trivial knot $C$, then the link $L\cup C$ is splittable. That is to say, it is impossible to obtain a split link from a split link via a…
Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djokovi\'{c}'s and Winkler's relations play an important role in the theory of partial cubes. These structures are employed in the…
Let $\mathscr{S}$ denote the set of integer partitions into parts that differ by at least $3$, with the added constraint that no two consecutive multiples of $3$ occur as parts. We derive trivariate generating functions of Andrews--Gordon…
A hyperlink is a finite set of non-intersecting simple closed curves in $\mathbb{R} \times \mathbb{R}^3$. We compute the Wilson Loop observable using a path integral with an Einstein-Hilbert action. Using axial-gauge fixing, we can write…
A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…
Partial cubes are graphs isometrically embeddable into hypercubes. In this paper it is proved that every cubic, vertex-transitive partial cube is isomorphic to one of the following graphs: $K_2 \, \square \, C_{2n}$, for some $n\geq 2$, the…
In 1930, Ramsey proved that every large graph contains either a large clique or a large edgeless graph as an induced subgraph. It is well known that every large connected graph contains a long path, a large clique, or a large star as an…
In this paper we study fundamental connectivity properties of hypergraphs from a graph-theoretic perspective, with the emphasis on cut edges, cut vertices, and blocks. To prepare the ground, we define various types of subhypergraphs, as…
We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of…
We classify the symmetric association schemes with faithful spherical embedding in 3-dimensional Euclidean space. Our result is based on previous research on primitive association schemes with $m_1 = 3$.
Generalizing the notion of split graphs to uniform hypergraphs, we prove that the class of these hypergraphs can be characterized by a finite list of excluded induced subhypergraphs. We show that a characterization by generalized degree…
Cube categories are used to encode higher-dimensional categorical structures. They have recently gained significant attention in the community of homotopy type theory and univalent foundations, where types carry the structure of such higher…
We establish splitter theorems for graph immersions for two families of graphs, $k$-edge-connected graphs, with $k$ even, and 3-edge-connected, internally 4-edge-connected graphs. As a corollary, we prove that every $3$-edge-connected,…
In 1833 Gauss defined the linking number of two disjoint curves in 3-space. For open curves this double integral over the parameterised curves is real-valued and invariant modulo rigid motions or isometries that preserve distances between…
We give an alternative proof of a result of Miyazaki and Yasuhara that there exists links that are not smoothly slice in $S^2 \times S^2$. We discuss potential applications to the detection of exotic $S^2 \times S^2$. This is a follow-up…
Trivial links are unique up to number of link components, but they can be hard to recognize from arbitrary diagrams. We define a new measure of the complexity of a link embedding, the crumple, and show how this may be used to measure…
This paper concerns on linked periodic orbits of orientation-preserving homeomorphisms of the $2$-disc in the sense of Gambaudo. We interpret the linking of periodic orbits by using their induced braids. Then based on the forcing relation…