Related papers: Crossing Numbers of Random Two-Bridge Knots
Extending upon our previous work, we verify the Jones Unknot Conjecture for all knots up to $24$ crossings. We describe the method of our approach and analyze the growth of the computational complexity of its different components.
We determine the set of all genus g bridge numbers of many iterated torus knots, listing these numbers in a sequence called the bridge spectrum. In addition, we prove a structural lemma about the decomposition of a strongly irreducible…
In this paper, we give an analytic solution for graphs with n nodes and E edges for which the probability of obtaining a given graph G is specified in terms of the degree sequence of G. We describe how this model naturally appears in the…
We will strengthen the known upper and lower bounds on the delta-crossing number of knots in therms of the triple-crossing number. The latter bound turns out to be strong enough to obtain (unknown values of) triple-crossing numbers for a…
We prove that for any zero {\alpha} of the Alexander polynomial of a two-bridge knot, -3 < Re({\alpha}) < 6. Furthermore, for a large class of two-bridge knots we prove -1<Re({\alpha}).
We show that the triple-crossing number of any knot is greater or equal to twice its (canonical) genus and we show an even stronger bound in the case of links. As an application we show that this bound is strong enough to obtain the…
The paper is devoted to the spreading of a message within the random graph evolving by the Norros-Reittu preferential attachment model. The latter model forms random Poissonian numbers of edges between newly added nodes and existing ones.…
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable structured class, such as the class of all planar graphs. Here we consider a general 'bridge-addable' class of graphs - if a graph…
The billiard table is modeled as an $n$-dimensional box $[0,a_1]\times [0,a_2]\times \ldots \times [0,a_n] \subset \mathbb{R}^n$, with each side having real-valued lengths $a_i$ that are pairwise commensurable. A ball is launched from the…
In this paper we prove an analogue of the Koml\'os-Major-Tusn\'ady (KMT) embedding theorem for random walk bridges. The random bridges we consider are constructed through random walks with i.i.d jumps that are conditioned on the locations…
We give a closed formula for the volume of a two-bridge knot, more precisely for its Bloch invariant. We obtain this formula without triangulating the complement: instead, we derive it from the Hopf formula for the second homology of the…
This paper studies an optimal trading problem that incorporates the trader's market view on the terminal asset price distribution and uninformative noise embedded in the asset price dynamics. We model the underlying asset price evolution by…
A knot theory for two-dimensional square lattice is proposed, which sheds light on design of new two-dimensional material with high topological numbers. We consider a two-band model, focusing on the Hall conductance {\sigma}xy = e^2/hbar*P,…
Using a recently developed method to simulate percolation on large clusters of distributed machines [N. R. Moloney and G. Pruessner, Phys. Rev. E 67, 037701 (2003)], we have numerically calculated crossing, spanning and wrapping…
This paper investigates the relationship between the signature and the crossing number of knots and links. We refine existing theorems and provide a comprehensive classification of links with specific properties, particularly those with…
A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…
We show that every two-bridge knot $K$ of crossing number $N$ admits a polynomial parametrization $x=T_3(t), y = T_b(t), z =C(t)$ where $T_k(t)$ are the Chebyshev polynomials and $b+\deg C = 3N$. If $C (t)= T_c(t)$ is a Chebyshev…
In this paper, we consider a random geometric graph (RGG)~\(G\) on~\(n\) nodes with adjacency distance~\(r_n\) just below the Hamiltonicity threshold and construct Hamiltonian cycles using additional edges called bridges. The bridges by…
In this paper we study a model of random knots obtained by fixing a space curve in $n$-dimensional Euclidean space with $n>3$, and orthogonally projecting the space curve on to random $3$ dimensional subspaces. By varying the space curve we…
We study the asymptotic distributions of the number of crossings and the number of simple chords in a random chord diagram. Using size-bias coupling and Stein's method, we obtain bounds on the Kolmogorov distance between the distribution of…