arXiv research

Lehmer's question is equivalent to one about generalized growth rates of Lefschetz numbers of iterated pseudo-Anosov surface homeomorphisms. One need consider only homeomorphisms that arise as monodromies of fibered knots in lens spaces L(n,1), n>0. Lehmer's question for Perron polynomials is equivalent to one about ge…

New Lehmer constants computed for free groups, improving bounds.

This paper addresses a long standing open problem due to Lehmer in which the triple 2,3,7 plays a notable role. Lehmer's problem asks whether there is a gap between 1 and the next smallest algebraic integer with respect to Mahler measure. The question has been studied in a wide range of contexts including number theory…

Study on mapping classes of real rational surface automorphisms, focusing on reducible maps and pseudo-Anosov maps.

We propose a new class of transforms that we call {\it Lehmer Transform} which is motivated by the {\it Lehmer mean function}. The proposed {\it Lehmer transform} decomposes a function of a sample into their constituting statistical moments. Theoretical properties of the proposed transform are presented. This transform…

In this report I discuss the relations between systoles and volumes of hyperbolic manifolds and a conjecture of Lehmer about the Mahler measure of non-cyclotomic polynomials.

From a simple observation about a construction of Thurston, we derive several interesting facts about subgroups of the mapping class group generated by two positive multi-twists. In particular, we identify all configurations of curves for which the corresponding groups fail to be free, and show that a subset of these d…

In this paper we prove that there is a direct relationship between Salem numbers and translation lengths of hyperbolic elements of arithmetic hyperbolic groups that are determined by a quadratic form over a totally real number field. As an application we determine a sharp lower bound for the length of a closed geodesic…

Study Veech groups in fibered 3-manifolds, proving no parabolics for fibers.

Estimates the degree of trace fields of hyperbolic Dehn fillings.

Complexity of signed graphs linked to Alexander polynomials and Lehmer's question.

The study computes trace fields and minimal polynomials for specific knots and links.

A new neural network model using weighted Lehmer means and multiplets.

SmartDCA improves investment returns by adjusting purchases based on prices.

We reformulate Lehmer's question from 1933 and a question due to Schinzel and Zassenhaus from 1965 in terms of a comparison of the Mahler measures and the houses, respectively, of monic integer reciprocal and skew-reciprocal polynomials of the same degree. This entails that understanding the difference between orientat…

Lueck expressed the Gromov norm of a knot complement in terms of an infinite series that can be computed from a presentation of the fundamental group of the knot complement. In this note we show that Lueck's formula, applied to torus knots, yields surprising power series expansions for the logarithm function. This gene…

This paper presents a construction of fibered links $(K,Σ)$ out of chord diagrams $\sL$. Let $Γ$ be the incidence graph of $\sL$. Under certain conditions on $\sL$ the symmetrized Seifert matrix of $(K,Σ)$ equals the bilinear form of the simply-laced Coxeter system $(W,S)$ associated to $Γ$; and the monodromy of $(K,Σ)…

The (torsion) complexity of a finite edge-weighted graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When G is d-periodic (i.e., G has a free action of the rank-d free abelian group by graph automorphisms, with finite quotient) the Mahler measure of its Lap…

We define and compare several natural ways to compute the bridge number of a knot diagram. We study bridge numbers of crossing number minimizing diagrams, as well as the behavior of diagrammatic bridge numbers under the connected sum operation. For each notion of diagrammatic bridge number considered, we find crossing …

Spatial embeddings of planar graphs can have higher unknotting numbers than crossing numbers.

The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander polynomial-one knot. We work with a generalization of unknotting number due to Math…

The paper bounds the handle number of sutured manifolds using Morse-Novikov numbers and tunnel numbers.

New measure shows how links can be untangled as twists increase.

New number bounds knot complexity, including unknotting and crosscap numbers.

We give an upper bound for the dealternating number of a closed 3-braid. As applications, we determine the dealternating numbers, the alternation numbers and the Turaev genera of some closed positive 3-braids. We also show that there exist infinitely many positive knots with any dealternating number (or any alternation…

Paper shows that for torus knots, the pinch number equals the unoriented band unknotting number.

The paper studies tunnel and bridge numbers of composite genus 2 spatial graphs.

Delta-unlinking number measures how to unlink algebraically split links.

Study on knot properties, showing relation between unknotting and crossing numbers.

Odd crossing numbers and even rotation numbers for cycles in plane immersions.

The aim of the present paper is to prove that the minimal number of virtual crossings for some families of virtual knots grows quadratically with respect to the minimal number of classical crossings. All previously known estimates for virtual crossing number were principally no more than linear in the number of classic…

Study computability of real numbers from group properties.

We define the basket number, the flat plumbing number and the flat plumbing basket number of a link. Then we provide some upperbounds for these plumbing numbers by using Seifert's algorithm. We study the relation between these plumbing numbers and the genera of links.

This paper calculates stick numbers for rail arcs and knot classes.

The (ordinary) unknotting-number of 1-dimensional knots, which is defined by using the crossing-change, is a very basic and important invariant. It is very natural to consider the `unknotting-number' associated with other local-moves on n-dimensional knots, where n is a natural number. In this paper we prove the follow…

In this paper we investigate the unlinking numbers of 10-crossing links. We make use of various link invariants and explore their behaviour when crossings are changed. The methods we describe have been used previously to compute unlinking numbers of links with crossing number at most 9. Ultimately, we find the unlinkin…

This paper is about the clock number of a knot. First we define the clock number by using states of a knot defined by Kauffman. Next we show that if K is a prime knot, its clock number is greater than or equal to its crossing number. Finally we prove that its clock number is equal to its crossing number if and only if …

We study three knot invariants related to smoothly immersed disks in the four-ball. These are the four-ball crossing number, which is the minimal number of normal double points of such a disk bounded by a given knot; the slicing number, which is the minimal number of crossing changes to a slice knot; and the concordanc…

For a knot $K$ the cube number is a knot invariant defined to be the smallest $n$ for which there is a cube diagram of size $n$ for $K$. There is also a Legendrian version of this invariant called the \emph{Legendrian cube number}. We will show that the Legendrian cube number distinguishes the Legendrian left hand toru…

Jablan and Radović originally defined two invariants called the Meander number and OGC number of knots for certain classes of knots. We generalize these definitions to all knots and name the straight number and contained straight number of a knot, respectively, and prove they are well defined. We answer two questions a…

New insights into knot fusion numbers via cabling.

Links with minimum tunnel number have one less component than their number of parts.

New bounds and examples for sphere unknotting numbers.

A rational linear combination of Chern numbers is an oriented diffeomorphism invariant of smooth complex projective varieties if and only if it is a linear combination of the Euler and Pontryagin numbers. In dimension at least three only multiples of the top Chern number, which is the Euler characteristic, are invarian…

We give lower bounds for the tunnel number of knots and handlebody-knots. We also give a lower bound for the cutting number, which is a "dual" notion to the tunnel number in the handlebody-knot theory. We provide necessary conditions for constituent handlebody-knots by using $G$-family of quandles colorings. The above …

An $n$-crossing is a point in the projection of a knot where $n$ strands cross so that each strand bisects the crossing. An übercrossing projection has a single $n$-crossing and a petal projection has a single $n$-crossing such that there are no loops nested within others. The übercrossing number, $\text{ü}(K)$, is the…

In the 1950's Milnor defined a family of higher order invariants generalizing the linking number. Even the first of these new invariants, the triple linking number, has received and fruitful study since its inception. In the case that $L$ has vanishing pairwise linking numbers, this triple linking number gives an integ…

The paper tabulates and computes the number of alternating pretzel links up to a given crossing number.