arXiv subjects

Andrew Manion

Publications and source records attributed to Andrew Manion.

24 records · Page 2Linked to original sources

arXiv2015

On bordered theories for Khovanov homology

We describe how to formulate Khovanov's functor-valued invariant of tangles in the language of bordered Heegaard Floer homology. We then give an alternate construction of Lawrence Roberts' Type D and Type A structures in Khovanov homology, and his algebra $\mathcal{B}Γ_n$, in terms of Khovanov's theory of modules over the ring $H^n$. We reprove invariance and pairing properties of Roberts' bordered modules in this language. Along the way, we obtain an explicit generators-and-relations description of $H^n$ which may be of independent interest.

math.GT↗

arXiv2013

The Khovanov homology of 3-strand pretzels, revisited

We compute the reduced Khovanov homology of 3-stranded pretzel links. The coefficients are the integers with the "even" sign assignment. In particular, we show that the only homologically thin, non-quasi-alternating 3-stranded pretzels are P(-p,p,r) with p an odd integer and r greater than or equal to p (these were shown to be homologically thin by Starkston and Qazaqzeh).

math.GT↗

arXiv2011

The rational Khovanov homology of 3-strand pretzel links

The 3-strand pretzel knots and links are a well-studied source of examples in knot theory. However, while there have been computations of the Khovanov homology of some sub-families of 3-strand pretzel knots, no general formula has been given for all of them. We give a general formula for the unreduced Khovanov homology of all 3-strand pretzel links, over the rational numbers.

math.GT↗

arXiv2011

A sign assignment in totally twisted Khovanov homology

We lift the characteristic-2 totally twisted Khovanov homology of Roberts and Jaeger to a theory with integer coefficients. The result is a complex computing reduced odd Khovanov homology for knots. This complex is equivalent to a spanning-tree complex whose differential is explicit modulo a sign ambiguity coming from the need to choose a sign assignment in the definition of odd Khovanov homology.

math.GT↗

arXiv2010

The critical group of a line graph

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. This paper provides three basic structural results on the critical group of a line graph. The first deals with connected graphs containing no cut-edge. Here the number of independent cycles in the graph, which is known to bound the number of generators for the critical group of the graph, is shown also to bound the number of generators for the critical group of its line graph. The second gives, for each prime p, a constraint on the p-primary structure of the critical group, based on the largest power of p dividing all sums of degrees of two adjacent vertices. The third deals with connected graphs whose line graph is regular. Here known results relating the number of spanning trees of the graph and of its line graph are sharpened to exact sequences which relate their critical groups. The first two results interact extremely well with the third. For example, they imply that in a regular nonbipartite graph, the critical group of the graph and that of its line graph determine each other uniquely in a simple fashion.

math.CO↗

arXiv2008

The Virtually Cyclic Classifying Space of the Heisenberg Group

We are interested in the relationship between the virtual cohomological dimension (or vcd) of a discrete group Gamma and the smallest possible dimension of a model for the classifying space of Gamma relative to its family of virtually cyclic subgroups. In this paper we construct a model for the virtually cyclic classifying space of the Heisenberg group. This model has dimension 3, which equals the vcd of the Heisenberg group. We also prove that there exists no model of dimension less than 3.

math.AT↗