相关论文: On the fibration of augmented link complements

We give a combinatorial proof of a recent result of B\'ona by constructing a bijection from the set of all neighbors of leaves of increasing trees of size $n$ to the set of derangements of length $n$.

Let $A$ be an abelian variety and $G$ a finite group of automorphisms of $A$ fixing the origin such that $A/G$ is smooth. The quotient $A/G$ can be seen as a fibration over an abelian variety whose fibers are isomorphic to a product of…

We derive a new upper bound on the algebraic connectivity of a regular graph using the Higman-Sims technique. Together with a new result on the connectivity of the neighbourhood graph of strongly regular graphs, our result gives a…

We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…

Additive deformations of bialgebras in the sense of J. Wirth, i.e. deformations of the multiplication map fulfilling a certain compatibility condition w.r.t. the coalgebra structure, can be generalized to braided bialgebras. The theorems…

We study the geometry of fully augmented link complements in $S^3$ by looking at their link diagrams. We extend the method introduced by Thistlethwaite and Tsvietkova to fully augmented links and define a system of algebraic equations in…

We study the patterns of multipartite entanglement in Chern-Simons theory with compact simple gauge group $G$ and level $k$ for states defined by the path integral on ``link complements'', i.e., compact manifolds whose boundaries consist of…

Soft elastic filaments that can be stretched, bent and twisted exhibit a range of topologically and geometrically complex morphologies that include plectonemes, solenoids, knot-like and braid-like structures. We combine numerical…

In this paper we study the geometry of fully augmented link complements in the thickened torus and describe their geometric properties, generalizing the study of fully augmented links in $S^3$. We classify which fully augmented links in the…

For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components and a minimum vertex separator is a vertex separator of least cardinality. The vertex connectivity refers to the size of a minimum…

We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an $n$-vertex graph embedded on a surface of genus $g$ with at most…

Rigidity, arising in discrete geometry, is the property of a structure that does not flex. Laman provides a combinatorial characterization of rigid graphs in the Euclidean plane, and thus rigid graphs in the Euclidean plane have…

Cells moving on a two dimensional substrate generate motion by polymerizing actin filament networks inside a flat membrane protrusion. New filaments are generated by branching off existing ones, giving rise to branched network structures.…

This paper considers the conjecture by Gr\"unbaum that every planar 3-connected graph has a spanning tree $T$ such that both $T$ and its co-tree have maximum degree at most 3. Here, the co-tree of $T$ is the spanning tree of the dual…

For a given multigraph H, a graph G is H-linked, if |G| \geq |H| and for every injective map {\tau}: V (H) \rightarrow V (G), we can find internally disjoint paths in G, such that every edge from uv in H corresponds to a {\tau} (u) - {\tau}…

A graph is $1$-planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges…

Natural and man-made networks often possess locally tree-like sub-structures. Taking such tree networks as our starting point, we show how the addition of links changes the synchronization properties of the network. We focus on two…

For an oriented surface link $S$, we can take a satellite construction called a 2-dimensional braid over $S$, which is a surface link in the form of a covering over $S$. We demonstrate that 2-dimensional braids over surface links are useful…

In his Ph.D. thesis, Farber proved that every strongly chordal graph can be represented as intersection graph of subtrees of a weighted tree, and these subtrees are ``compatible''. Moreover, this is an equivalent characterization of…

We deepen the link between two classic areas of combinatorial optimization: augmentation and packing arborescences. We consider the following type of questions: What is the minimum number of arcs to be added to a digraph so that in the…