Primitive Monodromy Groups of Genus at most Two

We show that if the action of a classical group $G$ on a set $\Omega$ of $1$-spaces of its natural module is of genus at most two, then $|\Omega| \leq 10,000$

Ground Water Quality Protection in Colorado

8 pages

Implementing the Guided Pathways Model: A Case for Change Management and Transformation

Wouldn’t we all love to roll out changes according to best practices and reliable data? This session includes a case study on change management at a large community college, as well as a discussion on the strategies and best practices used to help academic leaders implement the Guided Pathways Model

Ground Water Quality Protection in Colorado

8 pages

Seeing Algebraic Structure: The Rubik’s Cube Online Appendix 2

Online appendix the following article: Milewski, A., & Frohardt, D. (2020). Seeing Algebraic Structure: The Rubik's Cube, Mathematics Teacher: Learning and Teaching PK-12 MTLT, 113(5), 397-403. https://pubs.nctm.org/view/journals/mtlt/113/5/article-p397.xmlPeer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/143508/5/Seeing Algebraic Structure-The Rubik's Cube Online Appendix 2.pdfhttps://deepblue.lib.umich.edu/bitstream/2027.42/143508/4/Seeing Algebraic Structure-The Rubik's Cube Online Appendix 2.pdfhttps://deepblue.lib.umich.edu/bitstream/2027.42/143508/1/Online Appendix 2.pdfDescription of Seeing Algebraic Structure-The Rubik's Cube Online Appendix 2.pdf : SUPERSEDEDDescription of Online Appendix 2.pdf : SUPERSEDE

Model Checking Branching Properties on Petri Nets with Transits (Full Version)

To model check concurrent systems, it is convenient to distinguish between the data flow and the control. Correctness is specified on the level of data flow whereas the system is configured on the level of control. Petri nets with transits and Flow-LTL are a corresponding formalism. In Flow-LTL, both the correctness of the data flow and assumptions on fairness and maximality for the control are expressed in linear time. So far, branching behavior cannot be specified for Petri nets with transits. In this paper, we introduce Flow-CTL* to express the intended branching behavior of the data flow while maintaining LTL for fairness and maximality assumptions on the control. We encode physical access control with policy updates as Petri nets with transits and give standard requirements in Flow-CTL*. For model checking, we reduce the model checking problem of Petri nets with transits against Flow-CTL* via automata constructions to the model checking problem of Petri nets against LTL. Thereby, physical access control with policy updates under fairness assumptions for an unbounded number of people can be verified.Comment: 23 pages, 5 figure

Geometric Hyperplanes of the Near Hexagon L_3 times GQ(2, 2)

Having in mind their potential quantum physical applications, we classify all geometric hyperplanes of the near hexagon that is a direct product of a line of size three and the generalized quadrangle of order two. There are eight different kinds of them, totalling to 1023 = 2^{10} - 1 = |PG(9, 2)|, and they form two distinct families intricately related with the points and lines of the Veldkamp space of the quadrangle in question.Comment: 10 pages, 5 figures and 2 tables; Version 2 - more detailed discussion of the properties of hyperplane