No description available.

We study Hessenberg varieties in type A via their local defining equations, called patch ideals. We focus on two main classes of Hessenberg varieties: those associated to a regular nilpotent operator and to those associated to a semisimple operator. In the setting of regular semisimple Hessenberg varieties, which are known to be smooth and irreducible, we determine that their patch ideals are triangular complete intersections, as defined by Da Silva and Harada. For semisimple Hessenberg varieties, we give a partial positive answer to a conjecture of Insko and Precup that a given family of set-theoretic local defining ideals are radical. A regular nilpotent Hessenberg Schubert cell is the intersection of a Schubert cell with a regular nilpotent Hessenberg variety. Following the work of the author with Da Silva, Harada, and Rajchgot, we construct an embedding of the regular nilpotent Hessenberg Schubert cells into the coordinate chart of the regular nilpotent Hessenberg variety corresponding to the longest-word permutation in Bruhat order. This allows us to use work of Da Silva and Harada to conclude that regular nilpotent Hessenberg Schubert cells are also local triangular complete intersections. / Thesis / Master of Science (MSc) / Algebraic varieties provide a generalization of curves in the plane, such as parabolas and ellipses. One such family of these varieties are called Hessenberg varieties, and they are known to have connections to other areas of pure and applied mathematics, including to numerical linear algebra, combinatorics, and geometric representation theory. In this thesis, we view Hessenberg varieties as a collection of subvarieties, called coordinate charts, and study the computational geometry of each coordinate chart. Although this is a local approach, we recover global geometric data on Hessenberg varieties. We also provide a partial positive answer to an open question in the area.

Yes / Effective communication can aid in improving oral healthcare measures such as treatment outcomes and satisfaction of edentulous patients (EDPs) toward the treatment process. The triangle of communication (ToC) involves communication between the dentist, dental technician (DTech), and EDPs. This research aimed to explore the ToC between dental professionals (DPs) and patients undergoing complete denture prostheses (CDP) treatment in Fiji. Materials and Methods: A descriptive qualitative study was conducted among DPs under purposive sampling where focus group discussions were conducted at the four dental prosthetic clinics in Fiji. A semi-structured questionnaire with open-ended questions was applied to participants virtually via Zoom. The collected data were collated and analyzed manually using thematic analysis. Results: A total of 28 DPs participated in the study. Three themes were identified while exploring the ToC from DPs’ perspectives on CDP treatment and care in Fiji: staff communication—dentist and DTech, ToC and information sharing (dentist–DTech and EDPs), and stage-by-stage procedural checks for CDP between DPs. Effective collaboration between dentists and DTechs is an essence of a successful CDP treatment outcome. Most DPs agreed to undergo continuous communication throughout the treatment to keep EDPs engaged throughout the treatment process. In addition, stage-by-stage procedural checks in dental clinics as well as in dental laboratories improved the quality of CDPs. Conclusion: DPs highlighted predominantly the ToC between DPs and EDPs when receiving CDP treatment in Fiji as an essential tool for effective DP and patient engagement. Discussions should be complemented with the use of verbal, nonverbal, and written modes together with the utilization of interpreters to improve CDP treatment and care in Fiji.

We say a graph is locally P if the induced graph on the neighbourhood of every vertex has the property P. Specically, a graph is locally traceable (LT) or locally hamiltonian (LH) if the induced graph on the neighbourhood of every vertex is traceable or hamiltonian, respectively. A locally locally hamiltonian (L2H) graph is a graph in which the graph induced by the neighbourhood of each vertex is an LH graph. This concept is generalized to an arbitrary degree of nesting, to make it possible to work with LkH graphs. This thesis focuses on the global cycle properties of LT, LH and LkH graphs. Methods are developed to construct and combine such graphs to create others with desired properties. It is shown that with the exception of three graphs, LT graphs with maximum degree no greater than 5 are fully cycle extendable (and hence hamiltonian), but the Hamilton cycle problem for LT graphs with maximum degree 6 is NP-complete. Furthermore, the smallest nontraceable LT graph has order 10, and the smallest value of the maximum degree for which LT graphs can be nontraceable is 6. It is also shown that LH graphs with maximum degree 6 are fully cycle extendable, and that there exist nonhamiltonian LH graphs with maximum degree 9 or less for all orders greater than 10. The Hamilton cycle problem is shown to be NP-complete for LH graphs with maximum degree 9. The construction of r-regular nonhamiltonian graphs is demonstrated, and it is shown that the number of vertices in a longest path in an LH graph can contain a vanishing fraction of the vertices of the graph. NP-completeness of the Hamilton cycle problem for LkH graphs for higher values of k is also investigated. / Mathematical Sciences / D. Phil. (Mathematics)

Prompted by the success of heterotic line bundle model building on Complete Intersection Calabi Yau (CICY) manifolds and the new developments regarding a generalization thereof, I analyze the possibility of model building on generalized CICY (gCICY) manifolds.  Ultimately this is realized on two examples of gCICYs, one of which topologically equivalent to a CICY and one inequivalent to any previously studied examples.  The first chapter is dedicated to reporting background information on CICYs and gCICYs.  The mathematical machinery of CICYs and their generalizations are introduced alongside explicit constructions of two examples.  The second chapter introduces the reader to heterotic line bundle model building on CICYs and gCICYs.  In the setting of gCICYs, similar to regular CICYs, model building is accomplished in two steps: first the larger $E_{8}$ gauge group is broken to an $SU( 5 )$ grand unified theory  through a line bundle model.  Then the GUT is broken using Wilson line symmetry breaking, for which the presence of a freely acting discrete symmetry must be established.  To that end, I proceed to show that the two previous examples benefit from a $\mathbb{Z}_{2}$ freely acting discrete symmetry.  Utilizing this symmetry I construct 20 and 11 explicit models for the two gCICY examples respectively, by scanning over a finite range of line bundle charges. / Ett av de största problemen i modern teoretisk fysik är att hitta en teori för kvantgravitation.För en konsekvent kvantteori gravitation skulle vara en väsentlig del i fysikens pussel, och koppla samman gravitationsfysiken för planeter och galaxer, som beskrivs av allmänna relativitetsteorin, till fysiken för partiklar, beskrivet av kvantfältteori.Bland de mest lovande teorierna finns strängteorin som föreslår att ersätta partiklar med strängar som materiens grundläggande beståndsdel.Förutom att lösa kvantgravitationproblemet hoppas teoretiska fysiker genom strängteorin att förenkla beskrivningen av partikelfysik.Detta skulle ske genom att ersätta hela partikelzoo med ett enda objekt: strängen.Olika vibrationer i strängen skulle motsvara olika partiklar och interaktioner mellan strängar skulle motsvara interaktioner mellan partiklar.För att vara motsägelsefri kräver dock strängteori att det finns minst sex fler dimensioner än de vi kan uppleva.En av strategierna som för närvarande studeras för att förlika extra dimensioner med och moderna experiment kallas ``kompaktifiering'' eller ``compactification'' på engelska.Strategin föreslår att dessa extra dimensioner ska vara kompakta och så små att de är osynliga för observationer.Interesant nog påverkar geometrin i det sexdimensionella kompakta rummet i stor utsträckning fysiken som strängteorin producerar: olika rum skulle producera olika partiklar och olika grundläggande naturkrafter.I den här uppsatsen studerar jag två exempel på sådana sexdimensionella rum som kommer från en uppsättning av rum som kallas `` generaliserade CICYs'' som nyligen har upptäckts.Med hjälp av de tekniker som liknar de som har utvecklats för andra liknade rum, visar jag att vissa aspekter av en strängteori kompaktifierad på generaliserade CICY återspeglar de som mäts genom moderna partikelfysikexperiment.

An ordering on bases in Banach spaces is defined as a natural generalization of the notion of equivalence. Its theory is developed with emphasis on its behavior with respect to shrinking and boundedly-complete bases. We prove that a bounded operator mapping a shrinking basis to a boundedly-complete one is weakly compact. A well-known result concerning the factorization of a weakly compact operator through a reflexive space is then reinterpreted in terms of the ordering. Next, we introduce a class of Banach spaces whose norm is constructed from a given two-dimensional norm N. We prove that any such space XN is isomorphic to an Orlicz sequence space. A key step in obtaining this correspondence is to describe the unit circle in the norm N with a convex function ϕ. The canonical unit vectors form a basis of a subspace YN of XN . We characterize the equivalence of these bases and the situation when the basis is boundedly-complete. The criteria are formulated in terms of the norm N and the function ϕ. 1

Doctor of Education / Department of Educational Leadership / Mary Devin / David C. Thompson / School districts throughout the United States have continuous concerns about how to meet the needs of high school students who are at-risk of dropping out of school. Despite multiple resources available for addressing this concern through alternative education schools and programs, there continues to be an unacceptably high number of students who do not graduate from high school. While knowledge about what is working in alternative schools and the students they serve is progressing, additional research is still needed. In Maize USD 266, Complete High School Maize is an award-winning and nationally recognized dropout prevention program that has, over a fifteen year span (1999-2014), helped reduce the dropout rate in Maize. The intent of this qualitative historical analysis was to serve two purposes. First, it delineated the historical evolution of Complete High School Maize as a model for school districts to emulate in an effort to reduce the number of high school dropouts. Secondly, this study provided historical documentation to help preserve and share in the history of the program for future generations of students. This study examined the factors and circumstances present in Maize USD 266 that resulted in the creation of an alternative school for its students. This study also narrated the structural evolution of Complete High School Maize from 1999 to 2014 and examined the conditions and factors that resulted in the progressions. The findings of the study showed that Complete High School Maize had successfully helped reduce the number of dropouts in Maize USD 266.

This work addresses the problem of stabilizing attitude dynamics with an unknown delay in feedback. Two cases are considered: 1) constant time-delay 2) time-varying time-delay. This is to our best knowledge the first result that provides asymptotically stable closed-loop control design for the attitude dynamics problem with an unknown delay in feedback. Strict upper bounds on the unknown delay are assumed to be known. The time-varying delay is assumed to be made of the constant unknown delay with a time-varying perturbation. Upper bounds on the magnitude and rate of the time-varying part of the delay are assumed to be known. A novel modification to the concept of the complete type Lyapunov-Krasovskii (L-K) functional plays a crucial role in this analysis towards ensuring stability robustness to time-delay in the control design. The governing attitude dynamic equations are partitioned to form a nominal system with a perturbation term. Frequency domain analysis is employed in order to construct necessary and sufficient stability conditions for the nominal system. Consequently, a complete type L-K functional is constructed for stability analysis that includes the perturbation term. As an intermediate step, an analytical solution for the underlying Lyapunov matrix is obtained. Departing from previous approaches, where controller parameter values are arbitrarily chosen to satisfy the sufficient conditions obtained from robustness analysis, a systematic numerical optimization process is employed here to choose control parameters so that the region of attraction is maximized. The estimate of the region of attraction is directly related to the initial angular velocity norm and the closed-loop system is shown to be stable for a large set of initial attitude orientations. / text

Artificial neural networks (ANNs) were originally inspired by networks of biological neurons and the interactions present in networks of these neurons. The recent revival of interest in ANNs has again focused attention on the apparent ability of ANNs to solve difficult problems, such as machine vision, in novel ways. There are many types of ANNs which differ in architecture and learning algorithms, and the list grows annually. This study was restricted to feed-forward architectures and Backpropagation- like (BP-like) learning algorithms. However, it is well known that the learning problem for such networks is NP-complete. Thus generative and incremental learning algorithms, which have various advantages and to which the NP-completeness analysis used for BP-like networks may not apply, were also studied. Various algorithms were investigated and the performance compared. Finally, the better algorithms were applied to a number of problems including music composition, image binarization and navigation and goal satisfaction in an artificial environment. These tasks were chosen to investigate different aspects of ANN behaviour. The results, where appropriate, were compared to those resulting from non-ANN methods, and varied from poor to very encouraging. / Thesis (M.Sc.)-University of Natal, Durban, 1992.

Let G be a graph and k be an integer greater than or equal to the chromatic number of G. The k-colouring graph of G is the graph whose vertices are k-colourings of G, with two colourings adjacent if they colour exactly one vertex differently. We explore the Hamiltonicity and connectivity of such graphs, with particular focus on the k-colouring graphs of complete multipartite graphs. We determine the connectivity of the k-colouring graph of the complete graph on n vertices for all n, and show that the k-colouring graph of a complete multipartite graph K is 2-connected whenever k is at least the chromatic number of K plus one. Additionally, we examine a conjecture that every connected k-colouring graph is 2-connected, and give counterexamples for k greater than or equal to 4. As our main result, we show that for all k greater than or equal to 2t, the k-colouring graph of a complete t-partite graph is Hamiltonian. Finally, we characterize the complete multipartite graphs K whose k-colouring graphs are Hamiltonian when k is the chromatic number of K plus one. / Graduate