Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Entire DC Network
Orientations Of Graphs Which Have Small Directed Graph Minors., Glenn Randolph Berman
Orientations Of Graphs Which Have Small Directed Graph Minors., Glenn Randolph Berman
LSU Historical Dissertations and Theses
Graphs are characterized by whether or not they have orientations to avoid one or more of the digraphs K&ar;3 , S&ar;3 , and P&ar;3 . K&ar;3 , S&ar;3 and P&ar;3 are created by starting with a triangle, a three point star, or a path of length three respectively, and replacing each edge with a pair of arcs in opposite directions. Conditions are described when all orientations of 3-connected and 4-connected graphs must have one or more of the above digraphs as a minor. It is shown that double wheels, and double wheels without an axle, are the only 4-connected graphs …
Densities Of 4-Ranks Of K(2) Of Rings Of Integers., Robert Burke Osburn
Densities Of 4-Ranks Of K(2) Of Rings Of Integers., Robert Burke Osburn
LSU Historical Dissertations and Theses
Conner and Hurrelbrink established a method of determining the structure of the 2-Sylow subgroup of the tame kernel K2( O ) for certain quadratic number fields. Specifically, the 4-rank for these fields was characterized in terms of positive definite binary quadratic forms. Numerical calculations led to questions concerning possible density results of the 4-rank of tame kernels. In this thesis, we succeed in giving affirmative answers to these questions.
On K-Conjugacy Classes Of Maximal Tori In Semi-Simple Algebraic Groups., Uroyoan Ramon-Emeterio Walker
On K-Conjugacy Classes Of Maximal Tori In Semi-Simple Algebraic Groups., Uroyoan Ramon-Emeterio Walker
LSU Historical Dissertations and Theses
An attempt was made to make this a self-contained reading. The first three chapters are intended to provide the necessary background. Chapter one develops the tools needed from Galois Cohomology. Chapter two is a brief description of involutions, and in chapter three we define the notion of (linear) algebraic group, we give some examples and discuss some of their properties. In chapter four, we discuss some variants of the classical Skolem-Noether theorem, requiring only that the subalgebra have a unique faithful representation of full degree over a separable closure. We verify that we can extend every isomorphism to the whole …
Artin-Schreier Families And 2-D Cycle Codes, Cem Guneri
Artin-Schreier Families And 2-D Cycle Codes, Cem Guneri
LSU Doctoral Dissertations
We start with the study of certain Artin-Schreier families. Using coding theory techniques, we determine a necessary and sufficient condition for such families to have a nontrivial curve with the maximum possible number of rational points over the finite field in consideration. This result produces several nice corollaries, including the existence of certain maximal curves; i.e., curves meeting the Hasse-Weil bound.We then present a way to represent two-dimensional (2-D) cyclic codes as trace codes starting from a basic zero set of its dual code. This representation enables us to relate the weight of a codeword to the number of rational …