We present two families of knots which have straight number higher than crossing number. In the case of the second family, we have computed the straight number explicitly. We also give a general theorem about alternating knots that states adding an even number of crossings to a twist region will not change whether the knots are perfectly straight or not perfectly straight.
We describe a new random model for links based on meanders. Random meander diagrams correspond to matching pairs of parentheses, a well-studied problem in combinatorics. Hence tools from combinatorics can be used to investigate properties of links. We prove that unlinks appear with vanishing probability, no link L is obtained with probability 1, and there is a lower bound for the number of non-isotopic knots obtained on every step. Then we give expected twist number of a diagram, and bound expected hyperbolic and simplicial volume of links.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.