Related papers: A 2-chain can interlock with a k-chain
For any given number of crossings $c$, there exists a formula to determine the number of 2-bridge knots of $c$ crossings, and indeed it is a simple matter to actually construct presentations of these knots. However, the determination of…
In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. The tractability or intractability of computing a solution to such a minimal network was a long standing open question. Dechter…
Let $c(K)$ denote the crossing number of a knot $K$ and let $K_1\# K_2$ denote the connected sum of two oriented knots $K_1$ and $K_2$. It is a very old unsolved question that whether $c(K_1\# K_2)=c(K_1)+c(K_2)$. In this paper we show that…
We classify all finite linear spaces on at most 15 points admitting a blocking set. There are no such spaces on 11 or fewer points, one on 12 points, one on 13 points, two on 14 points, and five on 15 points. The proof makes extensive use…
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…
This short note is the result of a French "Hippocampe internship" that aims at introducing the world of research to young undergraduate French students. The problem studied is the following: imagine yourself locked in a cage barred with $n$…
Research in blockchain systems has mainly focused on improving security and bridging the performance gaps between blockchains and databases. Despite many promising results, we observe a worrying trend that the blockchain landscape is…
In this paper, we show the trivializing number of all minimal diagrams of positive 2-bridge knots and study the relation between the trivializing number and the unknotting number for a part of these knots.
In this paper, we give the trivializing number of all minimal diagrams of positive 2-bridge knots, and study the relation between the trivializing number and the unknotting number for a part of these knots.
We establish one-to-one correspondences between maximal antichains in products of two finite linear orders and other mathematical objects, such as certain alignments of two strings, walks on a grid, lattice paths, words of two or three…
For a multigraph $H$, a graph $G$ is $H$-linked if every injective mapping $\phi: V(H)\to V(G)$ can be extended to an $H$-subdivision in $G$. We study the minimum connectivity required for a graph to be $H$-linked. A $k$-fat-triangle $F_k$…
A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…
Natural materials often feature a combination of soft and stiff phases, arranged to achieve excellent mechanical properties, such as high strength and toughness. Many natural materials have even independently evolved to have similar…
In 2008, Kauffman and Lomonaco introduce the concepts of a knot mosaic and the mosaic number of a knot or link, the smallest integer $n$ such that a knot or link can be represented on an $n$-mosaic. In arXiv:1702.06462, the authors explore…
Combination locks are widely used to secure bicycles. We consider a combination lock consisting of adjacent rotating dials with the first nonnegative integers printed on each of them. Assuming that we know the correct combination and we…
A graph G is called (2k, k)-connected if G is 2k-edge-connected and G-v is k-edge-connected for every vertex v. The study of (2k, k)-connected graphs is motivated by a conjecture of Frank which states that a graph has a 2-vertex-connected…
Suppose that every non-minimal bridge position of a knot $K$ is perturbed. We show that if $L$ is a $(2, 2q)$-cable link of $K$, then every non-minimal bridge position of $L$ is also perturbed.
To this day, the two-slit electron interference pattern remains shrouded in an inordinate mystery. It continues to defy a logical and rational explanation. This paper will postulate a new "characteristic" pertaining to the electron. If this…
Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…
We study two variants of the shortest path problem. Given an integer k, the k-color-constrained and the k-interchange-constrained shortest path problems, respectively seek a shortest path that uses no more than k colors and one that makes…