Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Zn Orbifolds Of Vertex Operator Algebras, Daniel Graybill
Zn Orbifolds Of Vertex Operator Algebras, Daniel Graybill
Electronic Theses and Dissertations
Given a vertex algebra V and a group of automorphisms of V, the invariant subalgebra VG is called an orbifold of V. This construction appeared first in physics and was also fundamental to the construction of the Moonshine module in the work of Borcherds. It is expected that nice properties of V such as C2-cofiniteness and rationality will be inherited by VG if G is a finite group. It is also expected that under reasonable hypotheses, if V is strongly finitely generated and G is reductive, VG will also be strongly finitely generated. This is an analogue …
Understanding The Latinx Student Experience In A First-Year, Non-Remedial, Terminal College Math Course: A Convergent Mixed Methods Study, Ross Morgan
Electronic Theses and Dissertations
Working with Latinx students, a semester long study was conducted in the Spring of 2021 to better understand student’s perception of Culturally Responsive Teaching Practices (CRTP) at Mountain State University (MSU). The course sections selected are a part of a larger first year, non-remedial, terminal mathematics courses designed to provide students with smaller teacher to student ratios as well as opportunities to earn credit towards graduation. Instructors in two of the sections received special training around CRTP, while instructors in the other two sections did not receive this training. Findings demonstrate that simple adjustments to instructional practices had a statistically …
Exponential Random Graphs And A Generalization Of Parking Functions, Ryan Demuse
Exponential Random Graphs And A Generalization Of Parking Functions, Ryan Demuse
Electronic Theses and Dissertations
Random graphs are a powerful tool in the analysis of modern networks. Exponential random graph models provide a framework that allows one to encode desirable subgraph features directly into the probability measure. Using the theory of graph limits pioneered by Borgs et. al. as a foundation, we build upon the work of Chatterjee & Diaconis and Radin & Yin. We add complexity to the previously studied models by considering exponential random graph models with edge-weights coming from a generic distribution satisfying mild assumptions. In particular, we show that a large family of two-parameter, edge-weighted exponential random graphs display a phase …