Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Latin Squares And Their Applications To Cryptography, Nathan O. Schmidt
Latin Squares And Their Applications To Cryptography, Nathan O. Schmidt
Boise State University Theses and Dissertations
A latin square of order-n is an n x n array over a set of n symbols such that every symbol appears exactly once in each row and exactly once in each column. Latin squares encode features of algebraic structures. When an algebraic structure passes certain "latin square tests", it is a candidate for use in the construction of cryptographic systems. A transversal of a latin square is a list of n distinct symbols, one from each row and each column. The question regarding the existence of transversals in latin squares that encode the Cayley tables of finite groups …
The Density Topology On The Reals With Analogues On Other Spaces, Stuart Nygard
The Density Topology On The Reals With Analogues On Other Spaces, Stuart Nygard
Boise State University Theses and Dissertations
A point x is a density point of a set A if all of the points except a measure zero set near to x are contained in A. In the usual topology on ℝ, a set is open if shrinking intervals around each point are eventually contained in the set. The density topology relaxes this requirement. A set is open in the density topology if for each point, the limit of the measure of A contained in shirking intervals to the measure of the shrinking intervals themselves is one. That is, for any point x and a small enough …
On The Conjugacy Problem For Automorphisms Of Trees, Kyle Douglas Beserra
On The Conjugacy Problem For Automorphisms Of Trees, Kyle Douglas Beserra
Boise State University Theses and Dissertations
In this thesis we identify the complexity of the conjugacy problem of automorphisms of regular trees. We expand on the results of Kechris, Louveau, and Friedman on the complexities of the isomorphism problem of classes of countable trees. We see in nearly all cases that the complexity of isomorphism of subtrees of a given regular countable tree is the same as the complexity of conjugacy of automorphisms of the same tree, though we present an example for which this does not hold.