SearcharxivSearch

arXiv subjects

Christopher Parker

Publications and source records attributed to Christopher Parker.

5 recordsLinked to original sources

Saturated fusion systems on $p$-groups of maximal class

For a prime number $p$, a finite $p$-group of order $p^n$ has maximal class if it has nilpotency class $n-1$. Here we examine saturated fusion systems on maximal class $p$-groups and, in particular, we describe all the reduFor a prime number $p$, a finite $p$-group of order $p^n$ has maximal class if and only if it has nilpotency class $n-1$. Here we examine saturated fusion systems $\mathcal F$ on maximal class $p$-groups $S$ of order at least $p^4$. The Alperin-Goldschmidt Theorem for saturated fusion systems yields that $\mathcal F$ is entirely determined by the $\mathcal F$-automorphisms of its $\mathcal F$-essential subgroups and of $S$ itself. If an $\mathcal F$-essential subgroup either has order $p^2$ or is non-abelian of order $p^3$, then it is called an $\mathcal F$-pearl. The facilitating and technical theorem in this work shows that an $\mathcal F$-essential subgroup is either an $\mathcal F$-pearl, or one of two explicitly determined maximal subgroups of $S$. This result is easy to prove if $S$ is a $2$-group and can be read from the work of D'\iaz, Ruiz, and Viruel together with that of Parker and Semeraro when $p=3$. The main contribution is for $p \ge 5$ as in this case there is no classification of the maximal class $p$-groups. The main Theorem describes all the reduced saturated fusion systems on a maximal class $p$-group of order at least $p^4$ and follows from two more extensive theorems. These two theorems describe all saturated fusion systems, not restricting to the reduced ones for example, on exceptional and non-exceptional maximal class $p$-groups respectively. As a corollary, we have the easy to remember result that states that, if $O_p(\mathcal F)=1$, then either $\mathcal F$ has $\mathcal F$-pearls or $S$ is isomorphic to a Sylow $p$-subgroup of $\mathrm G_2(p)$ with $p\ge 5$ and the fusion systems are explicitly described.

math.GR

The spread of COVID-19 increases with individual mobility and depends on political leaning

The implementation of social distancing policies is key to reducing the impact of the current COVID-19 pandemic. However, their effectiveness ultimately depends on human behavior. In the United States, compliance with social distancing policies has widely varied thus far during the pandemic. But what drives such variability? Through six open datasets, including actual human mobility, we estimated the association between mobility and the growth rate of COVID-19 cases across 3,107 U.S. counties, generalizing previous reports. In addition, data from the 2016 U.S. presidential election was used to measure how the association between mobility and COVID-19 growth rate differed based on voting patterns. A significant association between political leaning and the COVID-19 growth rate was measured. Our results demonstrate that political orientation may inform models predicting the impact of policies in reducing the spread of COVID-19.

physics.soc-ph

The CUDA LATCH Binary Descriptor: Because Sometimes Faster Means Better

Accuracy, descriptor size, and the time required for extraction and matching are all important factors when selecting local image descriptors. To optimize over all these requirements, this paper presents a CUDA port for the recent Learned Arrangement of Three Patches (LATCH) binary descriptors to the GPU platform. The design of LATCH makes it well suited for GPU processing. Owing to its small size and binary nature, the GPU can further be used to efficiently match LATCH features. Taken together, this leads to breakneck descriptor extraction and matching speeds. We evaluate the trade off between these speeds and the quality of results in a feature matching intensive application. To this end, we use our proposed CUDA LATCH (CLATCH) to recover structure from motion (SfM), comparing 3D reconstructions and speed using different representations. Our results show that CLATCH provides high quality 3D reconstructions at fractions of the time required by other representations, with little, if any, loss of reconstruction quality.

cs.CV

Generation of finite simple groups with an application to groups acting on Beauville surfaces

We develop theorems which produce a multitude of hyperbolic triples for the finite classical groups. We apply these theorems to prove that every quasisimple group except Alt(5) and SL_2(5) is a Beauville group. In particular, we settle a conjecture of Bauer, Catanese and Grunewald which asserts that all non-abelian finite simple groups except for the alternating group $\Alt(5)$ are Beauville groups.

math.GR