arXiv subjects
Publications and source records attributed to Justin Murray.
We investigate discretized graph configuration spaces as defined by Aaron Abrams in his PhD thesis in 2000. Specifically, we extend Abrams' work by completely classifying which ones admitted by simple graphs are homeomorphic to closed manifolds. In the process of doing so, we develop techniques to translate topological properties of these spaces into graph theoretic ones.
Machine Learning for aviation weather is a growing area of research for providing low-cost alternatives for traditional, expensive weather sensors; however, in the area of atmospheric visibility estimation, publicly available datasets, tagged with visibility estimates, of distances relevant for aviation, of diverse locations, of sufficient size for use in supervised learning, are absent. This paper introduces a new dataset which represents the culmination of a year-long data collection campaign of images from the FAA weather camera network suitable for this purpose. We also present a benchmark when applying three commonly used approaches and a general-purpose baseline when trained and tested on three publicly available datasets, in addition to our own, when compared against a recently ratified ASTM standard.
Given a Legendrian knot in $(\mathbb{R}^3, \ker(dz-ydx))$ one can assign a combinatorial invariants called ruling polynomials. These invariants have been shown to recover not only a (normalized) count of augmentations but are also closely related to a categorical count of augmentations in the form of the homotopy cardinality of the augmentation category. In this article, we prove that that the homotopy cardinality of the $n$-dimensional representation category is a multiple of the $n$-colored ruling polynomial. Along the way, we establish that two $n$-dimensional representations are equivalent in the representation category if they are conjugate DGA homotopic. We also provide some applications to Lagrangian concordance.
For any Legendrian knot $K$ in standard contact ${\mathbb R}^3$ we relate counts of ungraded ($1$-graded) representations of the Legendrian contact homology DG-algebra $(\mathcal{A}(K),\partial)$ with the $n$-colored Kauffman polynomial. To do this, we introduce an ungraded $n$-colored ruling polynomial, $R^1_{n,K}(q)$, as a linear combination of reduced ruling polynomials of positive permutation braids and show that (i) $R^1_{n,K}(q)$ arises as a specialization $F_{n,K}(a,q)\big|_{a^{-1}=0}$ of the $n$-colored Kauffman polynomial and (ii) when $q$ is a power of two $R^1_{n,K}(q)$ agrees with the total ungraded representation number, $\operatorname{Rep}_1\big(K, \mathbb{F}_q^n\big)$, which is a normalized count of $n$-dimensional representations of $(\mathcal{A}(K),\partial)$ over the finite field $\mathbb{F}_q$. This complements results from [Leverson C., Rutherford D., Quantum Topol. 11 (2020), 55-118, arXiv:1802.10531] concerning the colored HOMFLY-PT polynomial, $m$-graded representation numbers, and $m$-graded ruling polynomials with $m \neq 1$.