Related papers: Crossing Numbers of Random Two-Bridge Knots

We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…

A multi-crossing (or n-crossing) is a singular point in a projection at which n strands cross so that each strand bisects the crossing. We generalize the classic result of Kauffman, Murasugi, and Thistlethwaite, which gives the upper bound…

We investigate the level spacing distribution for the quantum spectrum of the square billiard. Extending work of Connors--Keating, and Smilansky, we formulate an analog of the Hardy--Littlewood prime $k$-tuple conjecture for sums of two…

We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…

Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram…

We study the geometric structure of the statistical models for two-by-two contingency tables. One or two odds ratios are fixed and the corresponding models are shown to be a portion of a ruled quadratic surface or a segment. Some pointers…

The probability current statistics of two-dimensional open chaotic ballistic billiards is studied both analytically and numerically. Assuming that the real and imaginary parts of the scattering wave function are both random Gaussian fields,…

The coherent tunneling phenomenon is investigated in rectangular billiards divided into two domains by a classically unclimbable potential barrier. We show that by placing a pointlike scatterer inside the billiard, we can control the…

In this paper we investigate the behavior of the bridges of a Markov counting process in several directions. We first characterize convexity(concavity) in time of the mean value in terms of lower (upper) bounds on the so called…

Residual torsion-free nilpotence has proven to be an important property for knot groups with applications to bi-orderability and ribbon concordance. Mayland proposed a strategy to show that a two-bridge knot group has a commutator subgroup…

We derive explicit formulas for probabilities of Brownian motion with jumps crossing linear or piecewise linear boundaries in any finite interval. We then use these formulas to approximate the boundary crossing probabilities for general…

An upper bound of the superbridge index of the connected sum of two knots is given in terms of the braid index of the summands. Using this upper bound and minimal polygonal presentations, we give an upper bound in terms of the superbridge…

Given any closed, connected, orientable $3$--manifold and integers $g\geq g(M), D > 0$, we show the existence of knots in $M$ whose genus $g$ bridge number is greater than $D$. These knots lie in a page of an open book decomposition of $M$,…

Generating function equation has been derived for the probability distribution of the number of nodes with $k \ge 0$ outgoing lines in randomly evolving special trees. The stochastic properties of end-nodes (k=0) have been analyzed, and it…

Fox conjectured the Alexander polynomial of an alternating knot is trapezoidal, i.e. the coefficients first increase, then stabilize and finally decrease in a symmetric way. Recently, Hirasawa and Murasugi further conjectured a relation…

We show that a two-bridge ribbon knot $K(m^2 , m k \pm 1)$ with $m > k >0$ and $(m,k)=1$ admits a symmetric union presentation with partial knot which is a two-bridge knot $K(m,k)$. Similar descriptions for all the other two-bridge ribbon…

An analysis of extensive simulations of interacting self-avoiding polygons on cubic lattice shows that the frequencies of different knots realized in a random, collapsed polymer ring decrease as a negative power of the ranking order, and…

Using unknotting number, we introduce a link diagram invariant of Hass and Nowik type, which changes at most by 2 under a Reidemeister move. As an application, we show that a certain infinite sequence of diagrams of the trivial…

In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth two, does it represent the unknot? We also show that for a…

This paper, to be regularly updated, lists those prime knots with the fewest possible number of crossings for which values of basic knot invariants, such as the unknotting number or the smooth 4-genus, are unknown. This list is being…