Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
Avoiding, Pretending, And Querying : Three Combinatorial Problems., Adam S. Jobson
Avoiding, Pretending, And Querying : Three Combinatorial Problems., Adam S. Jobson
Electronic Theses and Dissertations
A k-term quasi-progression of diameter d is a sequence {Xl,... ,xk} for which there exists a positive integer l such that l < Xi-Xi-1 < l+d, for all i = 2, ... ,k. Quasi-progressions may be thought of as arithmetic progressions with a certain amount of 'wiggle-room' allowed. Let Q(d, k) be the least positive integer such that every 2-coloring of {1, ... , Q(d, k)} contains a monochromatic k-term quasi-progression of diameter d. We prove a conjecture of Landman for certain values of k and d, provide counterexamples for some other cases, and determine that the conjecture always has the correct order of growth. Let A be the adjacency matrix of a non empty graph. Is there always a nonzero {0, 1}-vector in the row space of A that is not a row of A? Akbari, Cameron, and Khosrovshahi have shown that an affirmative answer to this question would imply bounds on many graph parameters as a function of the rank of the adjacency matrix. We demonstrate the existence of such vectors for certain families of graphs, examine techniques to find and verify the existence of such vectors, and show that if you generalize the problem to allow asymmetry in the matrices then some {0, 1 }-matrices do not have such vectors. In 1981, Andrew Yao asked "Should tables be sorted?". When the table has n cells that are filled with entries taken from a key space of m possibilities, he showed that it is possible to decide whether any member of the key space is present in the table by inspecting (querying) only one cell of the table if and only if m < 2n - 2. We make steps toward extending his result to the case where you are permitted two queries by considering several variations of the problem.
On Greenberg's Question: An Algebraic And Computational Approach, David H. Chapman
On Greenberg's Question: An Algebraic And Computational Approach, David H. Chapman
LSU Doctoral Dissertations
Greenberg asked whether arithmetically equivalent number fields share the same Iwasawa invariants. In this dissertation it is shown that the problem naturally breaks up into four cases, depending on properties of Galois groups. This analysis is then used to give a positive answer to Greenberg’s question in some nontrivial examples.