arXiv subjects

Daniel E. Martin

Publications and source records attributed to Daniel E. Martin.

10 recordsLinked to original sources

arXiv2025

Markoff triples and Nielsen equivalence in $\text{SL}_2(\mathbb{F}_p)$

In 2013, Darryl McCullough and Marcus Wanderley made a series of conjectures that describe the Nielsen equivalence classes and $T_2$-equivalence classes of pairs of generators for $\text{SL}_2(\mathbb{F}_q)$ and the Markoff equivalence classes of triples in $\mathbb{F}_q^3$ that solve $x^2+y^2+z^2=xyz+κ$ for some $κ\in\mathbb{F}_q$. (The case $κ=0$ was originally conjectured by Baragar in 1991.) We prove that one of the McCullough-Wanderley conjectures, the "Q-Classification Conjecture" on Markoff triples, implies the others. Then we prove that the Q-Classification Conjecture holds if $q=p$ is a prime such that $24{,}504{,}480$ does not divide $p^2-1$. More generally, for any integer $d$, we reduce the Q-Classification Conjecture for all primes $p\not\equiv \pm 1\,\text{mod}\,d$ to checking whether a roughly $2d\times 2d$ matrix with entries in $\mathbb{Q}[κ]$ is invertible. We (and SageMath) perform this invertibility check for all prime powers $d$ up to $17$, hence the modulus $24{,}504{,}480=2\text{lcm}(1,2,\dots,17)$.

math.NT↗

arXiv2025

A new proof of Chen's theorem for Markoff graphs

In 2021, Chen proved a congruence for the degree of a certain map on the space of covers of elliptic curves. He concluded as a corollary that the size of any connected component of the Markoff mod $p$ graph is divisible by $p$. In combination with the work of Bourgain, Gamburd, and Sarnak, Chen's result proves a conjecture of Baragar for all but finitely many primes: the Markoff mod $p$ graph is connected. In this note, we provide an alternative proof for the Markoff corollary of Chen's theorem.

math.NT↗

arXiv2025

Lower bounds on the $\ell$-rank of ideal class groups

For a prime number $\ell$ and an extension of number fields $K/F$, we prove new lower bounds on the $\ell$-rank of the ideal class group of $K$ based on prime ramification in $K/F$. Unlike related results from the literature, our bound is supported on prime ideals in $F$ over which at least one (rather than each) prime in $K$ has ramification index divisible by $\ell$. This bound holds with a proviso on the Galois group of the normal closure of $K/F$, which is satisfied by towers of Galois extensions, intermediate fields in nilpotent extensions, and intermediate fields in dihedral extensions of degree $8n$, to name a few. We also use our lower bound to prove a new density result on number fields with infinite class field towers.

math.NT↗

arXiv2022

Assessing The Performance of YOLOv5 Algorithm for Detecting Volunteer Cotton Plants in Corn Fields at Three Different Growth Stages

The boll weevil (Anthonomus grandis L.) is a serious pest that primarily feeds on cotton plants. In places like Lower Rio Grande Valley of Texas, due to sub-tropical climatic conditions, cotton plants can grow year-round and therefore the left-over seeds from the previous season during harvest can continue to grow in the middle of rotation crops like corn (Zea mays L.) and sorghum (Sorghum bicolor L.). These feral or volunteer cotton (VC) plants when reach the pinhead squaring phase (5-6 leaf stage) can act as hosts for the boll weevil pest. The Texas Boll Weevil Eradication Program (TBWEP) employs people to locate and eliminate VC plants growing by the side of roads or fields with rotation crops but the ones growing in the middle of fields remain undetected. In this paper, we demonstrate the application of computer vision (CV) algorithm based on You Only Look Once version 5 (YOLOv5) for detecting VC plants growing in the middle of corn fields at three different growth stages (V3, V6, and VT) using unmanned aircraft systems (UAS) remote sensing imagery. All the four variants of YOLOv5 (s, m, l, and x) were used and their performances were compared based on classification accuracy, mean average precision (mAP), and F1-score. It was found that YOLOv5s could detect VC plants with a maximum classification accuracy of 98% and mAP of 96.3 % at the V6 stage of corn while YOLOv5s and YOLOv5m resulted in the lowest classification accuracy of 85% and YOLOv5m and YOLOv5l had the least mAP of 86.5% at the VT stage on images of size 416 x 416 pixels. The developed CV algorithm has the potential to effectively detect and locate VC plants growing in the middle of corn fields as well as expedite the management aspects of TBWEP.

cs.CV↗

arXiv2022

Fundamental polyhedra of projective elementary groups

For $O$ an imaginary quadratic ring, we compute a fundamental polyhedron of $\text{PE}_2(O)$, the projective elementary subgroup of $\text{PSL}_2(O)$. This allows for new, simplified proofs of theorems of Cohn, Nica, Fine, and Frohman. Namely, we obtain a presentation for $\text{PE}_2(O)$, show that it has infinite-index and is its own normalizer in $\text{PSL}_2(O)$, and split $\text{PSL}_2(O)$ into a free product with amalgamation that has $\text{PE}_2(O)$ as one of its factors.

math.GR↗

arXiv2022

Computer Vision for Volunteer Cotton Detection in a Corn Field with UAS Remote Sensing Imagery and Spot Spray Applications

To control boll weevil (Anthonomus grandis L.) pest re-infestation in cotton fields, the current practices of volunteer cotton (VC) (Gossypium hirsutum L.) plant detection in fields of rotation crops like corn (Zea mays L.) and sorghum (Sorghum bicolor L.) involve manual field scouting at the edges of fields. This leads to many VC plants growing in the middle of fields remain undetected that continue to grow side by side along with corn and sorghum. When they reach pinhead squaring stage (5-6 leaves), they can serve as hosts for the boll weevil pests. Therefore, it is required to detect, locate and then precisely spot-spray them with chemicals. In this paper, we present the application of YOLOv5m on radiometrically and gamma-corrected low resolution (1.2 Megapixel) multispectral imagery for detecting and locating VC plants growing in the middle of tasseling (VT) growth stage of cornfield. Our results show that VC plants can be detected with a mean average precision (mAP) of 79% and classification accuracy of 78% on images of size 1207 x 923 pixels at an average inference speed of nearly 47 frames per second (FPS) on NVIDIA Tesla P100 GPU-16GB and 0.4 FPS on NVIDIA Jetson TX2 GPU. We also demonstrate the application of a customized unmanned aircraft systems (UAS) for spot-spray applications based on the developed computer vision (CV) algorithm and how it can be used for near real-time detection and mitigation of VC plants growing in corn fields for efficient management of the boll weevil pests.

eess.IV↗

arXiv2022

Detecting Volunteer Cotton Plants in a Corn Field with Deep Learning on UAV Remote-Sensing Imagery

The cotton boll weevil, Anthonomus grandis Boheman is a serious pest to the U.S. cotton industry that has cost more than 16 billion USD in damages since it entered the United States from Mexico in the late 1800s. This pest has been nearly eradicated; however, southern part of Texas still faces this issue and is always prone to the pest reinfestation each year due to its sub-tropical climate where cotton plants can grow year-round. Volunteer cotton (VC) plants growing in the fields of inter-seasonal crops, like corn, can serve as hosts to these pests once they reach pin-head square stage (5-6 leaf stage) and therefore need to be detected, located, and destroyed or sprayed . In this paper, we present a study to detect VC plants in a corn field using YOLOv3 on three band aerial images collected by unmanned aircraft system (UAS). The two-fold objectives of this paper were : (i) to determine whether YOLOv3 can be used for VC detection in a corn field using RGB (red, green, and blue) aerial images collected by UAS and (ii) to investigate the behavior of YOLOv3 on images at three different scales (320 x 320, S1; 416 x 416, S2; and 512 x 512, S3 pixels) based on average precision (AP), mean average precision (mAP) and F1-score at 95% confidence level. No significant differences existed for mAP among the three scales, while a significant difference was found for AP between S1 and S3 (p = 0.04) and S2 and S3 (p = 0.02). A significant difference was also found for F1-score between S2 and S3 (p = 0.02). The lack of significant differences of mAP at all the three scales indicated that the trained YOLOv3 model can be used on a computer vision-based remotely piloted aerial application system (RPAAS) for VC detection and spray application in near real-time.

cs.CV↗

arXiv2022

Continued fractions over non-Euclidean imaginary quadratic rings

We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued fractions are shown to be retained, including exponential convergence, best-of-the-second-kind approximation quality (up to a constant), periodicity of quadratic irrational expansions, and polynomial time complexity.

math.NT↗

arXiv2022

Bounds on entries in Bianchi group generators

Upper and lower bounds are given for the maximum Euclidean curvature among faces in Bianchi's fundamental polyhedron for $PSL_2(O)$ in the upper-half space model of hyperbolic space, where $O$ is an imaginary quadratic ring of integers with discriminant $Δ$. We prove these bounds are asymptotically within $(\log |Δ|)^{8.54}$ of one another. This improves on the previous best upper-bound, which is roughly off by a factor between $Δ^2$ and $|Δ|^{5/2}$ depending on the smallest prime dividing $Δ$. The gap between our upper and lower bounds is determined by an analog of Jacobsthal's function, introduced here for imaginary quadratic fields.

math.NT↗

arXiv2020

Reductions between short vector problems and simultaneous approximation

In 1982, Lagarias showed that solving the approximate Shortest Vector Problem also solves the problem of finding good simultaneous Diophantine approximations. Here we provide a deterministic, dimension-preserving reduction in the reverse direction. It has polynomial time and space complexity, and it is gap-preserving under the appropriate norms. We also give an alternative to the Lagarias algorithm by first reducing his version of simultaneous approximation to one with no explicit range in which a solution is sought.

math.NT↗