Fixed block configuration GDDs with block size 6 and (3, r)-regular graphs

Chapter 1 is used to introduce the basic tools and mechanics used within this thesis. Most of the definitions used in the thesis will be defined, and we provide a basic survey of topics in graph theory and design theory pertinent to the topics studied in this thesis. In Chapter 2, we are concerned with the study of fixed block configuration group divisible designs, GDD(n; m; k; λ1; λ2). We study those GDDs in which each block has configuration (s; t), that is, GDDs in which each block has exactly s points from one of the two groups and t points from the other. Chapter 2 begins with an overview of previous results and constructions for small group size and block sizes 3, 4 and 5. Chapter 2 is largely devoted to presenting constructions and results about GDDs with two groups and block size 6. We show the necessary conditions are sufficient for the existence of GDD(n, 2, 6; λ1, λ2) with fixed block configuration (3; 3). For configuration (1; 5), we give minimal or nearminimal index constructions for all group sizes n ≥ 5 except n = 10, 15, 160, or 190. For configuration (2, 4), we provide constructions for several families ofGDD(n, 2, 6; λ1, λ2)s. Chapter 3 addresses characterizing (3, r)-regular graphs. We begin with providing previous results on the well studied class of (2, r)-regular graphs and some results on the structure of large (t; r)-regular graphs. In Chapter 3, we completely characterize all (3, 1)-regular and (3, 2)-regular graphs, as well has sharpen existing bounds on the order of large (3, r)- regular graphs of a certain form for r ≥ 3. Finally, the appendix gives computational data resulting from Sage and C programs used to generate (3, 3)-regular graphs on less than 10 vertices.

Translation Studies on an Annular Field Reversed Configuration Device for Space Propulsion

This research investigated annular field reversed configuration (AFRC)devices for high power electric propulsion by demonstrating the acceleration of these plasmoids using an experimental prototype and measuring the plasmoid's velocity, impulse, and energy efficiency. The AFRC plasmoid translation experiment was design and constructed with the aid of a dynamic circuit model. Two versions of the experiment were built, using underdamped RLC circuits at 10 kHz and 20 kHz. Input energies were varied from 100 J/pulse to 1000 J/pulse for the 10 kHz bank and 100 J/pulse for the 20 kHz bank. The plasmoids were formed in static gas fill of argon, from 1 mTorr to 50 mTorr. The translation of the plasmoid was accomplished by incorporating a small taper into the outer coil, with a half angle of 2°. Magnetic field diagnostics, plasma probes, and single-frame imaging were used to measure the plasmoid's velocity and to diagnose plasmoid behavior. Full details of the device design, construction, and diagnostics are provided in this dissertation. The results from the experiment demonstrated that a repeatable AFRC plasmoid was produced between the coils, yet failed to translate for all tested conditions. The data revealed the plasmoid was limited in lifetime to only a few (4-10) μs, too short for translation at low energy. A global stability study showed that the plasma suffered a radial collapse onto the inner wall early in its lifecycle. The radial collapse was traced to a magnetic pressure imbalance. A correction made to the circuit was successful in restoring an equilibrium pressure balance and prolonging radial stability by an additional 2.5 μs. The equilibrium state was sufficient to confirm that the plasmoid current in an AFRC reaches a steady-state prior to the peak of the coil currents. This implies that the plasmoid will always be driven to the inner wall, unless it translates from the coils prior to peak coil currents. However, ejection of the plasmoid before the peak coil currents results in severe efficiency losses. These results demonstrate the difficulty in designing an AFRC experiment for translation as balancing the different requirements for stability, balance, and efficient translation can have competing consequences.