本篇論文主要在討論兩個人參選時的開票情況，研究「n+m人投票且無人投廢票的情況下，其中一人至少得n票且一路領先的開票方法數等於此人得n票的所有開票方法數」 ，第一章介紹研究動機及他人所使用的方式，使用路徑的方法證明一人得n票，另一人得m票，n≥m，得n票的人一路領先且勝出的方法數等於 C_n^(m+n)-C_(n+1)^(m+n)=C_m^(m+n)-C_(m-1)^(m+n)，再用計算相消的方式算出，此人至少得n票且一路領先的開票方法數等於此人得n票的所有開票方法數。 第二章介紹用一個折路徑的方法，將所有「一人得n票開票方法數」中非一路領先的路徑圖，經由一個壓扁、翻轉的摺紙方式，對應到「此人至少得n票且一路領先」的開票情況路徑圖，經由數學論證，這樣的路徑，是一對一且映成，並舉出兩個例子驗證其結果。 論文最後，提出一個猜想：若參選人數為三人時，其中一位參選人一路領先且勝出的開票方法數，應該可以用立體空間的方塊圖之路徑來證明。本篇論文，雖然沒有繼續討論這個有趣的問題，但也留下一個新的研究方向。 / The theme of this thesis is mainly to discuss of situation of counting and announcing the ballots in an election with two candidates. In explaining the contents of the "Total n+m votes, there’s no invalid vote. One candidate wins at least n votes and lead all the way. Under this circumstance this number of the way will be equal to all numbers of the way for these n votes of this candidate.” At first, we will introduce the methodology of the other adopt, the methodology of previous path of way proves one candidate known to have n votes, another candidate has m votes, the method of candidate with n votes who leads all the way and won will be equal to C_n^(m+n)-C_(n+1)^(m+n)=C_m^(m+n)-C_(m-1)^(m+n), and then result of calculating cancellation will prove this candidate will have at last n votes and leads the way to victory will be equal to all the methodologies of counting and announcing the ballots in this election. A method of flip the path will be introduced in the second chapter. Corresponding to the road map of ballot counting for the candidate who has n votes and lead the way to victory, the road map of same one with n votes without leading the way through a step-ping, flip the way of origami will be mathematically proves such reflect of the way will be reflect one to one and onto. By means of the discrete method is able to prove this result and the method to verify availability Finally, I would like to propose a surmise: If the number of candidates increased to 3, the methodology of the one who leads all the way should be able to use three-dimensional space of a block diagram of the path to prove. Although this thesis does not to continue pondering the interesting question, but also left a new research direction.

This master's thesis is an autoethnography. According to Denzin and Lincoln, an autoethnograpic piece "works to hold self and culture together, albeit not in equilibrium or stasis," (207). This thesis, presented in story form, tells how I was educated into and came to follow the "Good Path" in becoming a member of Santo Domingo Pueblo, and more specifically, a contemporary Santo Domingan woman. My story is framed within a Puebloan paradigm of remembrance as articulated through oral tradition, narrative and text, and the social and natural environments of my Santo Domingan world. Through introspection and reflection on the narratives, I elicit what I believe to be the foundational core values of Santo Domingo culture. I identify and reference these core values as Breath, Corn, Hair, and Family. It is through my stories that I have also come to understand the strength and power of oral traditional narratives and teachings.

Conjectured in 1943, Hadwiger’s conjecture is one of the most challenging open problems in graph theory. Hadwiger’s conjecture states that if the chromatic number of a graph G is k, then G has a clique minor of size at least k. In this thesis, we give motivation for attempting Hadwiger’s conjecture for circular arc graphs and also prove the conjecture for proper circular arc graphs. Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices are adjacent if and only if their corresponding arcs intersect. Proper circular arc graphs are a subclass of circular arc graphs that have a circular arc representation where no arc is completely contained in any other arc. It is interesting to study Hadwiger’s conjecture for circular arc graphs as their clique minor cannot exceed beyond a constant factor of its chromatic number as We show in this thesis. Our main contribution is the proof of Hadwiger’s conjecture for proper circular arc graphs. Also, in this thesis we give an analysis and some basic results on Hadwiger’s conjecture for circular arc graphs in general.