Topological steps toward the Homflypt skein module of the lens spaces L(p,1)L(p,1) via braids

In this paper we work toward the Homflypt skein module of the lens spaces $L(p,1)$, $\mathcal{S}(L(p,1))$, using braids. In particular, we establish the connection between $\mathcal{S}({\rm ST})$, the Homflypt skein module of the solid torus ST, and $\mathcal{S}(L(p,1))$ and arrive at an infinite system, whose solution corresponds to the computation of $\mathcal{S}(L(p,1))$. We start from the Lambropoulou invariant $X$ for knots and links in ST, the universal analogue of the Homflypt polynomial in ST, and a new basis, $\Lambda$, of $\mathcal{S}({\rm ST})$ presented in \cite{DL1}. We show that $\mathcal{S}(L(p,1))$ is obtained from $\mathcal{S}({\rm ST})$ by considering relations coming from the performance of braid band moves (bbm) on elements in the basis $\Lambda$, where the braid band moves are performed on any moving strand of each element in $\Lambda$. We do that by proving that the system of equations obtained from diagrams in ST by performing bbm on any moving strand is equivalent to the system obtained if we only consider elements in the basic set $\Lambda$. The importance of our approach is that it can shed light to the problem of computing skein modules of arbitrary c.c.o. $3$-manifolds, since any $3$-manifold can be obtained by surgery on $S^3$ along unknotted closed curves. The main difficulty of the problem lies in selecting from the infinitum of band moves some basic ones and solving the infinite system of equations.Comment: 24 pages, 16 figures. arXiv admin note: text overlap with arXiv:1412.364

A Conversation on Divine Infinity and Cantorian Set Theory

This essay is written as a drama that opens with Aristotle, St. Augustine of Hippo, St. Thomas Aquinas, and Nicholas of Cusa debating the nature and reality of infinity, introducing historical concepts such as potential, actual, and divine infinity. Georg Cantor, founder of set theory, then gives a lecture on set theory and transfinite numbers. The lecture concludes with a discussion of the theological motivations and implications of set theory and Cantor\'s absolute infinity. The paradoxes inherent in analyzing absolute infinity seem to provide a useful analogy for understanding God\'s unknowable nature and the divine relation to creation

Triangles and Girth in Disk Graphs and Transmission Graphs

Let S subset R^2 be a set of n sites, where each s in S has an associated radius r_s > 0. The disk graph D(S) is the undirected graph with vertex set S and an undirected edge between two sites s, t in S if and only if |st| <= r_s + r_t, i.e., if the disks with centers s and t and respective radii r_s and r_t intersect. Disk graphs are used to model sensor networks. Similarly, the transmission graph T(S) is the directed graph with vertex set S and a directed edge from a site s to a site t if and only if |st| <= r_s, i.e., if t lies in the disk with center s and radius r_s. We provide algorithms for detecting (directed) triangles and, more generally, computing the length of a shortest cycle (the girth) in D(S) and in T(S). These problems are notoriously hard in general, but better solutions exist for special graph classes such as planar graphs. We obtain similarly efficient results for disk graphs and for transmission graphs. More precisely, we show that a shortest (Euclidean) triangle in D(S) and in T(S) can be found in O(n log n) expected time, and that the (weighted) girth of D(S) can be found in O(n log n) expected time. For this, we develop new tools for batched range searching that may be of independent interest