Fréchet, strongly Fréchet, productively Fréchet, weakly bisequential and bisequential filters (i.e., neighborhood filters in spaces of the same name) are characterized in a unified manner in terms of their images in the Stone space of ultrafilters. These characterizations involve closure structures on the set of ultrafilters. The case of productively Fréchet filters answers a question of S. Dolecki and turns out to be the only one involving a non topological closure structure.

We study the AJ conjecture that relates the A-polynomial and the colored Jones polynomial of a knot in S³. We confirm the AJ conjecture for (r,2)-cables of the m-twist knot, for all odd integers r satisfying
⎧ (r+8)(r−8m) > 0 if m > 0,
⎨
⎩ r(r+8m−4) > 0 if m < 0.

A ranking on a graph is an assignment of positive integers to its vertices such that any path between two vertices with the same label contains a vertex with a larger label. The rank number of a graph is the fewest number of labels that can be used in a ranking. The rank number of a graph is known for many families, including the ladder graph P2 × Pn. We consider how ”bending” a ladder affects the rank number. We prove that in certain cases the rank number does not change, and in others the rank...

Download Results (CSV)