Related papers: Links and Hurwitz curves
We classify Nichols algebras of irreducible Yetter-Drinfeld modules over groups such that the underlying rack is braided and the homogeneous component of degree three of the Nichols algebra satisfies a given inequality. This assumption…
Every link in R^3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams.
We give an upper bound on the list chromatic number of a 2-colorable hypergraph which generalizes the bound of Schauz on $k$-partite $k$-uniform hypergraphs. It makes sense for sparse hypergraphs: in particular we show that a $k$-uniform…
If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…
The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. A connected graph is Eulerian if its vertex degrees are all even. In [Gutman, Cruz, Rada, Wiener index of Eulerian Graphs, Discrete…
We give upper and lower bounds on the leading coefficients of the $L^2$-Alexander torsions of a $3$-manifold $M$ in terms of hyperbolic volumes and of relative $L^2$-torsions of sutured manifolds obtained by cutting $M$ along certain…
We prove Euler's theorem of number theory developing an argument based on quandles. A quandle is an algebraic structure whose axioms mimic the three Reidemeister moves of knot theory.
Every link is shown to be presentable as a boundary of an unknotted flat banded surface. A (flat) banded link is defined as a boundary of an unknotted (flat) banded surface. A link's (flat) band index is defined as the minimum number of…
We characterise positive braid links with positive Seifert form via a finite number of forbidden minors. From this we deduce a one-to-one correspondence between prime positive braid links with positive Seifert form and simply laced Dynkin…
It is shown that if a link in 3-space bounds a proper oriented surface (without closed component) in the upper half 4-space, then the link bounds a proper oriented ribbon surface in the upper half 4-space which is a renewal embedding of the…
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…
In this paper we announce some results obtained for certain algebraic functions, which we call of cyclotomic type. The main results properly resemble von Staudt-Clausen's theorem and Kummer's congruence for the Bernoulli numbers, and such…
In the 1970s, Williams developed an algorithm that has been used to construct and study modular links in the Lorenz template. We introduce an improved algorithm, which we call the bunch algorithm, to provide more insights into the geometry…
We obtain an upper bound on the expected supremum of a Bernoulli process indexed by the image of an index set under a uniformly Lipschitz function class in terms of properties of the index set and the function class, extending an earlier…
We introduce framed versions of the $L$-moves and prove a one move theorem for the extension of the Markov theorem for framed braids. We further introduce framed versions of the Hilden and Pure Hilden groups, we give presentations and we…
R. Kashaev and N. Reshetikhin introduced the notion of holonomy braiding extending V. Turaev's homotopy braiding to describe the behavior of cyclic representations of the unrestricted quantum group $U_qsl_2$ at root of unity. In this paper,…
This paper explores the connection between two central results in the proof theory of classical logic: Gentzen's cut-elimination for the sequent calculus and Herbrands "fundamental theorem". Starting from Miller's expansion-tree-proofs, a…
We derive a lower bound for all Levine-Tristram signatures of positive braid links, linear in terms of the first Betti number. As a consequence, we obtain upper and lower bounds on the ratio of fixed pairs of Levine-Tristram signature…
A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.
In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generalization of early results of Hopf and Pannwitz [12],…