相关论文: On the fibration of augmented link complements
We develop a combinatorial framework to study certain polyhedral maps which are higher-dimensional analogues of tropical covers between metric graphs. Under a mild combinatorial assumption, we show that a map satisfies the so-called…
Let $L$ be an oriented link with an alternating diagram $D$. It is known that $L$ is a fibered link if and only if the surface $R$ obtained by applying Seifert's algorithm to $D$ is a Hopf plumbing. Here, we call $R$ a Hopf plumbing if $R$…
Using a new tool called lassos, we establish a new correspondence between cellular link {diagrams} on closed surfaces and equivalence classes of virtual link {diagrams}. This is analogous to a well-known correspondence among the links…
We take advantage of the correspondence between fibered links, open book decompositions and contact structures on a closed connected 3-dimensional manifold to determine a mixed link diagram presentation for a particular fibered link $L$ in…
Let T1, T2,.... Tk be spanning trees in a graph G. If for any pair of vertices u and v of G, the paths between u and v in every Ti( 0 < i < k+1) do not contain common edges then T1, T2,.... Tk are called edge-disjoint spanning trees in G.…
In this paper, we explore the structure of the Hitchin map for higher dimensional varieties with emphasis on the case of algebraic surfaces.
We show that the complement of arithmetic modular links found in arXiv:2307.09409 is homeomorphic to the complement of augmented chainlinks. In particular, these link complements arise as n-fold cyclic covers of the Whitehead link…
We show that if a graph is k-edge-connected, and we adjoin to it another graph satisfying a "contracted diameter less or equal to 2" condition, with minimal degree greater or equal to k, and some natural hypothesis on the edges connecting…
An $r$-augmented tree is a rooted tree plus $r$ edges added from each leaf to ancestors. For $d,g,r\in\mathbb{N}$, we construct a bipartite $r$-augmented complete $d$-ary tree having girth at least $g$. The height of such trees must grow…
We observe that an enriched right adjoint functor between model categories which preserves acyclic fibrations and fibrant objects is quite generically a right Quillen functor.
In recent years, graph neural networks (GNNs) have become a popular tool for solving various problems over graphs. In these models, the link structure of the graph is typically exploited and nodes' embeddings are iteratively updated based…
A rack is a set with a binary operation that is right-invertible and self-distributive, properties diagrammatically corresponding to Reidemeister moves II and III, respectively. A rack is said to be an {\it augmented rack} if the operation…
A generalized augmented link of a knot $K$ is a link obtained by adding trivial components to $K$ that bound $n$-punctured disks. In this paper we consider that $K$ is given by a positive braid with at least one full twist. We characterize…
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…
We study non-compact surfaces obtained by gluing strips $\mathbb{R}\times(-1,1)$ with at most countably many boundary intervals along some these intervals. Every such strip possesses a foliation by parallel lines, which gives a foliation on…
We study biplane graphs drawn on a finite point set $S$ in the plane in general position. This is the family of geometric graphs whose vertex set is $S$ and which can be decomposed into two plane graphs. We show that every sufficiently…
Every Kauffman state \sigma of a link diagram D(K) naturally defines a state surface S_\sigma whose boundary is K. For a homogeneous state \sigma, we show that K is a fibered link with fiber surface S_\sigma if and only if an associated…
A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…
We propose to generalize the volume conjecture to knotted trivalent graphs and we prove the conjecture for all augmented knotted trivalent graphs. As a corollary we find that for any link L there is a link containing L for which the volume…
We prove almost sure convergence of the maximum degree in an evolving graph model combining a growing number of local choices with sublinear preferential attachment. At each step in the growth of the graph, a new vertex is introduced. Then…