arXiv research

We provide a proof for an inequality between volume and L2-Betti numbers of aspherical manifolds for which Gromov outlined a strategy based on general ideas of Connes. The implementation of that strategy involves measured equivalence relations, Gaboriau's theory of L2-Betti numbers of R-simplicial complexes, and other …

We show that the Novikov-Shubin invariant of an element of the integral group ring of the lamplighter group Z_2 \wr Z can be irrational. This disproves a conjecture of Lott and Lueck. Furthermore we show that every positive real number is equal to the Novikov-Shubin invariant of some element of the real group ring of Z…

We use elementary methods to compute the L2-dimension of the eigenspaces of the Markov operator on the lamplighter group and of generalizations of this operator on other groups. In particular, we give a transparent explanation of the spectral measure of the Markov operator on the lamplighter group found by Grigorchuk-Z…

Study computability of real numbers from group properties.

The Atiyah conjecture predicts that the L2-Betti numbers of a finite CW-complex with torsion-free fundamental group are integers. We show that the Atiyah conjecture holds (with an additional technical condition) for direct and inverse limits of directed systems of groups for which it is true. As a corollary it holds fo…

A standing conjecture in L2-cohomology is that every finite CW-complex X is of L2-determinant class. In this paper, we prove this whenever the fundamental group belongs to a large class of groups containing e.g. all extensions of residually finite groups with amenable quotients, all residually amenable groups and free …

Paper withdrawn because of a gap in the proof of Proposition 3 of Thomas Schick: "Integrality of L2-Betti numbers", Math. Ann. 317, 727-750 (arXiv.org/abs/math.gt/0001101). Most results of the withdrawn paper were based on this proposition.

Let G be a torsion free discrete group and let \bar{Q} denote the field of algebraic numbers in C. We prove that \bar{Q}[G] fulfills the Atiyah conjecture if G lies in a certain class of groups D, which contains in particular all groups which are residually torsion free elementary amenable or which are residually free.…

The paper computes special values of combinatorial zeta functions to reveal topological properties of manifolds.

New groups algebraically fibre with high-dimensional hyperbolic groups.

Let G be a finitely presented group, and let p be a prime. Then G is 'large' (respectively, 'p-large') if some normal subgroup with finite index (respectively, index a power of p) admits a non-abelian free quotient. This paper provides a variety of new methods for detecting whether G is large or p-large. These relate t…

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.

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.

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.

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…

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…

Connected sum and trivalent vertex sum are natural operations on genus 2 spatial graphs and, as with knots, tunnel number behaves in interesting ways under these operations. We prove sharp Scharlemann-Schultens type bounds for the tunnel number of a composite genus 2 spatial graph. For the tunnel number of a composite …

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

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…

New method to untangle knots using null-homologous twists.

The triple linking number of an oriented surface link was defined as an analogical notion of the linking number of a classical link. We consider a certain $m$-component $T^2$-link ($m \geq 3$) determined from two commutative pure $m$-braids $a$ and $b$. We present the triple linking number of such a $T^2$-link, by usin…

Improved bounds on stick numbers of knots up to 13 crossings.

We prove that the number of combinatorially distinct causal 3-dimensional triangulations homeomorphic to the 3-dimensional sphere is bounded by an exponential function of the number of tetrahedra. It is also proven that the number of combinatorially distinct causal 4-dimensional triangulations homeomorphic to the 4-sph…

Positive braids minimize knot untangling steps.

We define the concordance crosscap number of a knot as the minimum crosscap number among all the knots concordant to the knot. The four-dimensional crosscap number is the minimum first Betti number of non-orientable surfaces smoothly embedded in 4-dimensional ball, bounding the knot. Clearly the 4-dimensional crosscap …

The paper studies how the crossing number of graphs changes with a specific transformation called ΔY-move.

In this paper we introduce the concept of a space-efficient knot mosaic. That is, we seek to determine how to create knot mosaics using the least number of non-blank tiles necessary to depict the knot. This least number is called the tile number of the knot. We determine strict bounds for the tile number of a knot in t…