Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `+publisher:"University of Michigan" +contributor:("Blass, Andreas R.")`

.
Showing records 1 – 21 of
21 total matches.

▼ Search Limiters

University of Michigan

1. Hathaway, Daniel J. Generalized Domination.

Degree: PhD, Mathematics, 2015, University of Michigan

URL: http://hdl.handle.net/2027.42/113539

► This thesis develops the theory of the everywhere domination relation between functions from one infinite cardinal to another. When the domain of the functions is…
(more)

Subjects/Keywords: Set Theory; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hathaway, D. J. (2015). Generalized Domination. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/113539

Chicago Manual of Style (16^{th} Edition):

Hathaway, Daniel J. “Generalized Domination.” 2015. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/113539.

MLA Handbook (7^{th} Edition):

Hathaway, Daniel J. “Generalized Domination.” 2015. Web. 27 Oct 2020.

Vancouver:

Hathaway DJ. Generalized Domination. [Internet] [Doctoral dissertation]. University of Michigan; 2015. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/113539.

Council of Science Editors:

Hathaway DJ. Generalized Domination. [Doctoral Dissertation]. University of Michigan; 2015. Available from: http://hdl.handle.net/2027.42/113539

University of Michigan

2. Aubrey, Jason Aaron. Pseudo -dominating families of functions.

Degree: PhD, Pure Sciences, 2003, University of Michigan

URL: http://hdl.handle.net/2027.42/123535

► The topics presented in this dissertation are a contribution to the study of cardinal characteristics of the continuum. We introduce a property of families of…
(more)

Subjects/Keywords: Families Of Functions; Pseudo-dominating; Set Theory; Unsplitting Numbers

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Aubrey, J. A. (2003). Pseudo -dominating families of functions. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/123535

Chicago Manual of Style (16^{th} Edition):

Aubrey, Jason Aaron. “Pseudo -dominating families of functions.” 2003. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/123535.

MLA Handbook (7^{th} Edition):

Aubrey, Jason Aaron. “Pseudo -dominating families of functions.” 2003. Web. 27 Oct 2020.

Vancouver:

Aubrey JA. Pseudo -dominating families of functions. [Internet] [Doctoral dissertation]. University of Michigan; 2003. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/123535.

Council of Science Editors:

Aubrey JA. Pseudo -dominating families of functions. [Doctoral Dissertation]. University of Michigan; 2003. Available from: http://hdl.handle.net/2027.42/123535

University of Michigan

3. Mitavskiy, Boris. A mathematical model of evolutionary computation and some consequences.

Degree: PhD, Pure Sciences, 2004, University of Michigan

URL: http://hdl.handle.net/2027.42/124270

► In this thesis a general mathematical framework to describe evolutionary algorithms is developed. The following two applications of the framework are presented in detail: (1)…
(more)

Subjects/Keywords: Consequences; Evolutionary Computation; Geiringer Theorem; Geiringer's Theorem; Genetic Algorithms; Mathematical; Model; Random Walk; Some

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Mitavskiy, B. (2004). A mathematical model of evolutionary computation and some consequences. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/124270

Chicago Manual of Style (16^{th} Edition):

Mitavskiy, Boris. “A mathematical model of evolutionary computation and some consequences.” 2004. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/124270.

MLA Handbook (7^{th} Edition):

Mitavskiy, Boris. “A mathematical model of evolutionary computation and some consequences.” 2004. Web. 27 Oct 2020.

Vancouver:

Mitavskiy B. A mathematical model of evolutionary computation and some consequences. [Internet] [Doctoral dissertation]. University of Michigan; 2004. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/124270.

Council of Science Editors:

Mitavskiy B. A mathematical model of evolutionary computation and some consequences. [Doctoral Dissertation]. University of Michigan; 2004. Available from: http://hdl.handle.net/2027.42/124270

University of Michigan

4. Montenegro Escovar, Carlos Hernando. Combinatorics on large cardinals.

Degree: PhD, Pure Sciences, 1989, University of Michigan

URL: http://hdl.handle.net/2027.42/128335

► We study maps between ideals on a cardinal κ (cardinals are identified with initial ordinals, an ideal on κ is a collection of subsets of…
(more)

Subjects/Keywords: Cardinals; Combinatorics; Large

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Montenegro Escovar, C. H. (1989). Combinatorics on large cardinals. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/128335

Chicago Manual of Style (16^{th} Edition):

Montenegro Escovar, Carlos Hernando. “Combinatorics on large cardinals.” 1989. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/128335.

MLA Handbook (7^{th} Edition):

Montenegro Escovar, Carlos Hernando. “Combinatorics on large cardinals.” 1989. Web. 27 Oct 2020.

Vancouver:

Montenegro Escovar CH. Combinatorics on large cardinals. [Internet] [Doctoral dissertation]. University of Michigan; 1989. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/128335.

Council of Science Editors:

Montenegro Escovar CH. Combinatorics on large cardinals. [Doctoral Dissertation]. University of Michigan; 1989. Available from: http://hdl.handle.net/2027.42/128335

University of Michigan

5. Pambuccian, Victor Vasken. The axiomatics of Euclidean geometry.

Degree: PhD, Mathematics, 1993, University of Michigan

URL: http://hdl.handle.net/2027.42/103655

► The main object of this thesis is to provide axiomatizations for Euclidean geometry, that are, in some precisely defined sense, simpler than any other imaginable…
(more)

Subjects/Keywords: Mathematics

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Pambuccian, V. V. (1993). The axiomatics of Euclidean geometry. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/103655

Chicago Manual of Style (16^{th} Edition):

Pambuccian, Victor Vasken. “The axiomatics of Euclidean geometry.” 1993. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/103655.

MLA Handbook (7^{th} Edition):

Pambuccian, Victor Vasken. “The axiomatics of Euclidean geometry.” 1993. Web. 27 Oct 2020.

Vancouver:

Pambuccian VV. The axiomatics of Euclidean geometry. [Internet] [Doctoral dissertation]. University of Michigan; 1993. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/103655.

Council of Science Editors:

Pambuccian VV. The axiomatics of Euclidean geometry. [Doctoral Dissertation]. University of Michigan; 1993. Available from: http://hdl.handle.net/2027.42/103655

University of Michigan

6. Jiarasuksakun, Thiradet. On expander graphs and hypergraphs.

Degree: PhD, Pure Sciences, 2006, University of Michigan

URL: http://hdl.handle.net/2027.42/126062

► Expander graphs have been studied in various definitions and approaches. We show some relationships among these definitions. A clear criterion for optimality of expanders is…
(more)

Subjects/Keywords: Eigenvalues; Expander Graphs; Graph Theory; Hypergraphs; Lift Construction; Ramanujan Graphs

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Jiarasuksakun, T. (2006). On expander graphs and hypergraphs. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/126062

Chicago Manual of Style (16^{th} Edition):

Jiarasuksakun, Thiradet. “On expander graphs and hypergraphs.” 2006. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/126062.

MLA Handbook (7^{th} Edition):

Jiarasuksakun, Thiradet. “On expander graphs and hypergraphs.” 2006. Web. 27 Oct 2020.

Vancouver:

Jiarasuksakun T. On expander graphs and hypergraphs. [Internet] [Doctoral dissertation]. University of Michigan; 2006. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/126062.

Council of Science Editors:

Jiarasuksakun T. On expander graphs and hypergraphs. [Doctoral Dissertation]. University of Michigan; 2006. Available from: http://hdl.handle.net/2027.42/126062

7. Tucker, Dustin. Propositions and Paradoxes.

Degree: PhD, Philosophy, 2011, University of Michigan

URL: http://hdl.handle.net/2027.42/89611

► Propositions are more than the bearers of truth and the meanings of sentences: they are also the objects of an array of attitudes including belief,…
(more)

Subjects/Keywords: Paradoxes; Intensionality; Propositions; Higher-order Intensional Type Theory; Theories of Content; Philosophy; Humanities

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Tucker, D. (2011). Propositions and Paradoxes. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/89611

Chicago Manual of Style (16^{th} Edition):

Tucker, Dustin. “Propositions and Paradoxes.” 2011. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/89611.

MLA Handbook (7^{th} Edition):

Tucker, Dustin. “Propositions and Paradoxes.” 2011. Web. 27 Oct 2020.

Vancouver:

Tucker D. Propositions and Paradoxes. [Internet] [Doctoral dissertation]. University of Michigan; 2011. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/89611.

Council of Science Editors:

Tucker D. Propositions and Paradoxes. [Doctoral Dissertation]. University of Michigan; 2011. Available from: http://hdl.handle.net/2027.42/89611

8. Rupprecht, Nicholas Andrew. Effective Correspondents to Cardinal Characteristics in Cichon's Diagram.

Degree: PhD, Mathematics, 2010, University of Michigan

URL: http://hdl.handle.net/2027.42/77915

► In this thesis, we define and study Turing characteristics. These are sets of oracles of computation which compute members of Cantor space or Baire space…
(more)

Subjects/Keywords: Cardinal Characteristics; Schnorr; Cichon's Diagram; Forcing; Mass Problem; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Rupprecht, N. A. (2010). Effective Correspondents to Cardinal Characteristics in Cichon's Diagram. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/77915

Chicago Manual of Style (16^{th} Edition):

Rupprecht, Nicholas Andrew. “Effective Correspondents to Cardinal Characteristics in Cichon's Diagram.” 2010. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/77915.

MLA Handbook (7^{th} Edition):

Rupprecht, Nicholas Andrew. “Effective Correspondents to Cardinal Characteristics in Cichon's Diagram.” 2010. Web. 27 Oct 2020.

Vancouver:

Rupprecht NA. Effective Correspondents to Cardinal Characteristics in Cichon's Diagram. [Internet] [Doctoral dissertation]. University of Michigan; 2010. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/77915.

Council of Science Editors:

Rupprecht NA. Effective Correspondents to Cardinal Characteristics in Cichon's Diagram. [Doctoral Dissertation]. University of Michigan; 2010. Available from: http://hdl.handle.net/2027.42/77915

University of Michigan

9. Kastermans, Bart. Cofinitary groups and other almost disjoint families of reals.

Degree: PhD, Pure Sciences, 2006, University of Michigan

URL: http://hdl.handle.net/2027.42/126070

► We study two different types of (maximal) almost disjoint families: very mad families and (maximal) cofinitary groups. For the very mad families we prove the…
(more)

Subjects/Keywords: Almost; Cofinitary Groups; Disjoint Families Of Reals; Infinite Permutation Groups; Natural Numbers; Other; Set Theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Kastermans, B. (2006). Cofinitary groups and other almost disjoint families of reals. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/126070

Chicago Manual of Style (16^{th} Edition):

Kastermans, Bart. “Cofinitary groups and other almost disjoint families of reals.” 2006. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/126070.

MLA Handbook (7^{th} Edition):

Kastermans, Bart. “Cofinitary groups and other almost disjoint families of reals.” 2006. Web. 27 Oct 2020.

Vancouver:

Kastermans B. Cofinitary groups and other almost disjoint families of reals. [Internet] [Doctoral dissertation]. University of Michigan; 2006. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/126070.

Council of Science Editors:

Kastermans B. Cofinitary groups and other almost disjoint families of reals. [Doctoral Dissertation]. University of Michigan; 2006. Available from: http://hdl.handle.net/2027.42/126070

10. Henry, Shawn J. Classifying Topoi and Preservation of Higher Order Logic by Geometric Morphisms.

Degree: PhD, Mathematics, 2013, University of Michigan

URL: http://hdl.handle.net/2027.42/99993

► Topoi are categories which have enough structure to interpret higher order logic. They admit two notions of morphism: logical morphisms which preserve all of the…
(more)

Subjects/Keywords: Topos Theory; Geometric Morphisms; Higher Order Logic; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Henry, S. J. (2013). Classifying Topoi and Preservation of Higher Order Logic by Geometric Morphisms. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/99993

Chicago Manual of Style (16^{th} Edition):

Henry, Shawn J. “Classifying Topoi and Preservation of Higher Order Logic by Geometric Morphisms.” 2013. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/99993.

MLA Handbook (7^{th} Edition):

Henry, Shawn J. “Classifying Topoi and Preservation of Higher Order Logic by Geometric Morphisms.” 2013. Web. 27 Oct 2020.

Vancouver:

Henry SJ. Classifying Topoi and Preservation of Higher Order Logic by Geometric Morphisms. [Internet] [Doctoral dissertation]. University of Michigan; 2013. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/99993.

Council of Science Editors:

Henry SJ. Classifying Topoi and Preservation of Higher Order Logic by Geometric Morphisms. [Doctoral Dissertation]. University of Michigan; 2013. Available from: http://hdl.handle.net/2027.42/99993

11. Lieberman, Michael Joseph. Topological and Category-Theoretic Aspects of Abstract Elementary Classes.

Degree: PhD, Mathematics, 2009, University of Michigan

URL: http://hdl.handle.net/2027.42/63854

► We consider the behavior of Galois types in abstract elementary classes (AECs), and introduce several new techniques for use in the analysis of the associated…
(more)

Subjects/Keywords: Model Theory; Nonelementary Classes; Abstract Elementary Classes; Mathematical Logic; Accessible Categories; Category Theory; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lieberman, M. J. (2009). Topological and Category-Theoretic Aspects of Abstract Elementary Classes. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/63854

Chicago Manual of Style (16^{th} Edition):

Lieberman, Michael Joseph. “Topological and Category-Theoretic Aspects of Abstract Elementary Classes.” 2009. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/63854.

MLA Handbook (7^{th} Edition):

Lieberman, Michael Joseph. “Topological and Category-Theoretic Aspects of Abstract Elementary Classes.” 2009. Web. 27 Oct 2020.

Vancouver:

Lieberman MJ. Topological and Category-Theoretic Aspects of Abstract Elementary Classes. [Internet] [Doctoral dissertation]. University of Michigan; 2009. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/63854.

Council of Science Editors:

Lieberman MJ. Topological and Category-Theoretic Aspects of Abstract Elementary Classes. [Doctoral Dissertation]. University of Michigan; 2009. Available from: http://hdl.handle.net/2027.42/63854

12. Seward, Brandon M. Krieger's Finite Generator Theorem for Ergodic Actions of Countable Groups.

Degree: PhD, Mathematics, 2015, University of Michigan

URL: http://hdl.handle.net/2027.42/111377

► For an ergodic probability-measure-preserving action of a countable group G, we define the Rokhlin entropy to be the infimum of the Shannon entropies of countable…
(more)

Subjects/Keywords: Krieger's finite generator theorem; generating partitions; entropy; nonamenable groups; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Seward, B. M. (2015). Krieger's Finite Generator Theorem for Ergodic Actions of Countable Groups. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/111377

Chicago Manual of Style (16^{th} Edition):

Seward, Brandon M. “Krieger's Finite Generator Theorem for Ergodic Actions of Countable Groups.” 2015. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/111377.

MLA Handbook (7^{th} Edition):

Seward, Brandon M. “Krieger's Finite Generator Theorem for Ergodic Actions of Countable Groups.” 2015. Web. 27 Oct 2020.

Vancouver:

Seward BM. Krieger's Finite Generator Theorem for Ergodic Actions of Countable Groups. [Internet] [Doctoral dissertation]. University of Michigan; 2015. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/111377.

Council of Science Editors:

Seward BM. Krieger's Finite Generator Theorem for Ergodic Actions of Countable Groups. [Doctoral Dissertation]. University of Michigan; 2015. Available from: http://hdl.handle.net/2027.42/111377

13. Reyes, Matthew G. Cutset Based Processing and Compression of Markov Random Fields.

Degree: PhD, Electrical Engineering: Systems, 2011, University of Michigan

URL: http://hdl.handle.net/2027.42/84510

► This thesis presents results related to the compression a Markov random field (MRF) bfX defined on a graph G=(V,E) by first losslessly compressing a cutset…
(more)

Subjects/Keywords: Markov Random Fields; Source Coding; Belief Propagation; Cutset; Ising Model; Monotonicity; Electrical Engineering; Engineering

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Reyes, M. G. (2011). Cutset Based Processing and Compression of Markov Random Fields. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/84510

Chicago Manual of Style (16^{th} Edition):

Reyes, Matthew G. “Cutset Based Processing and Compression of Markov Random Fields.” 2011. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/84510.

MLA Handbook (7^{th} Edition):

Reyes, Matthew G. “Cutset Based Processing and Compression of Markov Random Fields.” 2011. Web. 27 Oct 2020.

Vancouver:

Reyes MG. Cutset Based Processing and Compression of Markov Random Fields. [Internet] [Doctoral dissertation]. University of Michigan; 2011. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/84510.

Council of Science Editors:

Reyes MG. Cutset Based Processing and Compression of Markov Random Fields. [Doctoral Dissertation]. University of Michigan; 2011. Available from: http://hdl.handle.net/2027.42/84510

14. Ferguson, Timothy James. Extremal Problems in Bergman Spaces.

Degree: PhD, Mathematics, 2011, University of Michigan

URL: http://hdl.handle.net/2027.42/84458

► We deal with extremal problems in Bergman spaces. If A^p denotes the Bergman space, then for any given functional phi not equal to zero in…
(more)

Subjects/Keywords: Bergman; Extremal Problem; Hardy Space; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Ferguson, T. J. (2011). Extremal Problems in Bergman Spaces. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/84458

Chicago Manual of Style (16^{th} Edition):

Ferguson, Timothy James. “Extremal Problems in Bergman Spaces.” 2011. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/84458.

MLA Handbook (7^{th} Edition):

Ferguson, Timothy James. “Extremal Problems in Bergman Spaces.” 2011. Web. 27 Oct 2020.

Vancouver:

Ferguson TJ. Extremal Problems in Bergman Spaces. [Internet] [Doctoral dissertation]. University of Michigan; 2011. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/84458.

Council of Science Editors:

Ferguson TJ. Extremal Problems in Bergman Spaces. [Doctoral Dissertation]. University of Michigan; 2011. Available from: http://hdl.handle.net/2027.42/84458

15. da Cunha, Aubrey. Turing Machines, Cayley Graphs, and Inescapable Groups.

Degree: PhD, Mathematics, 2012, University of Michigan

URL: http://hdl.handle.net/2027.42/94057

► We present a generalization of standard Turing machines based on allowing unusual tapes. We present a set of reasonable constraints on tape geometry and conclude…
(more)

Subjects/Keywords: Turing Machine; Cayley Graph; Turing Degree; Computability; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

da Cunha, A. (2012). Turing Machines, Cayley Graphs, and Inescapable Groups. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/94057

Chicago Manual of Style (16^{th} Edition):

da Cunha, Aubrey. “Turing Machines, Cayley Graphs, and Inescapable Groups.” 2012. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/94057.

MLA Handbook (7^{th} Edition):

da Cunha, Aubrey. “Turing Machines, Cayley Graphs, and Inescapable Groups.” 2012. Web. 27 Oct 2020.

Vancouver:

da Cunha A. Turing Machines, Cayley Graphs, and Inescapable Groups. [Internet] [Doctoral dissertation]. University of Michigan; 2012. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/94057.

Council of Science Editors:

da Cunha A. Turing Machines, Cayley Graphs, and Inescapable Groups. [Doctoral Dissertation]. University of Michigan; 2012. Available from: http://hdl.handle.net/2027.42/94057

16. DeWitt, Elizabeth Angela. Identities Relating Schur s-Functions and Q-Functions.

Degree: PhD, Mathematics, 2012, University of Michigan

URL: http://hdl.handle.net/2027.42/93841

► Schur s- and Q-functions are two important families of symmetric functions, with applications for other fields, such as the representation theory of the symmetric group.…
(more)

Subjects/Keywords: Symmetric Functions; Schur Functions; Q-functions; S-functions; Tableaux; Shifted Tableaux; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

DeWitt, E. A. (2012). Identities Relating Schur s-Functions and Q-Functions. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/93841

Chicago Manual of Style (16^{th} Edition):

DeWitt, Elizabeth Angela. “Identities Relating Schur s-Functions and Q-Functions.” 2012. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/93841.

MLA Handbook (7^{th} Edition):

DeWitt, Elizabeth Angela. “Identities Relating Schur s-Functions and Q-Functions.” 2012. Web. 27 Oct 2020.

Vancouver:

DeWitt EA. Identities Relating Schur s-Functions and Q-Functions. [Internet] [Doctoral dissertation]. University of Michigan; 2012. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/93841.

Council of Science Editors:

DeWitt EA. Identities Relating Schur s-Functions and Q-Functions. [Doctoral Dissertation]. University of Michigan; 2012. Available from: http://hdl.handle.net/2027.42/93841

17. Kinser, Ryan David. Rank Functors and Representation Rings of Quivers.

Degree: PhD, Mathematics, 2009, University of Michigan

URL: http://hdl.handle.net/2027.42/63764

► The free abelian group *R*(Q) on the set of indecomposable representations of a quiver Q, over a field K, has a ring structure where the…
(more)

Subjects/Keywords: Quiver Representations; Combinatorics; Representation Theory; Associative Algebras; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Kinser, R. D. (2009). Rank Functors and Representation Rings of Quivers. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/63764

Chicago Manual of Style (16^{th} Edition):

Kinser, Ryan David. “Rank Functors and Representation Rings of Quivers.” 2009. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/63764.

MLA Handbook (7^{th} Edition):

Kinser, Ryan David. “Rank Functors and Representation Rings of Quivers.” 2009. Web. 27 Oct 2020.

Vancouver:

Kinser RD. Rank Functors and Representation Rings of Quivers. [Internet] [Doctoral dissertation]. University of Michigan; 2009. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/63764.

Council of Science Editors:

Kinser RD. Rank Functors and Representation Rings of Quivers. [Doctoral Dissertation]. University of Michigan; 2009. Available from: http://hdl.handle.net/2027.42/63764

18. McCarty, Lindsey Ann. Preemptive Rerouting of Airline Passengers under Uncertain Delays.

Degree: PhD, Applied and Interdisciplinary Mathematics, 2012, University of Michigan

URL: http://hdl.handle.net/2027.42/93864

► An airline's operational disruptions can lead to flight delays that in turn impact passengers, not only through the delay itself but also through possible missed…
(more)

Subjects/Keywords: Airline Scheduling; Airline Recovery; Passenger Reaccommodation; Two-stage Stochastic Programming; Benders Decomposition; Branch and Price; Industrial and Operations Engineering; Mathematics; Engineering; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

McCarty, L. A. (2012). Preemptive Rerouting of Airline Passengers under Uncertain Delays. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/93864

Chicago Manual of Style (16^{th} Edition):

McCarty, Lindsey Ann. “Preemptive Rerouting of Airline Passengers under Uncertain Delays.” 2012. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/93864.

MLA Handbook (7^{th} Edition):

McCarty, Lindsey Ann. “Preemptive Rerouting of Airline Passengers under Uncertain Delays.” 2012. Web. 27 Oct 2020.

Vancouver:

McCarty LA. Preemptive Rerouting of Airline Passengers under Uncertain Delays. [Internet] [Doctoral dissertation]. University of Michigan; 2012. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/93864.

Council of Science Editors:

McCarty LA. Preemptive Rerouting of Airline Passengers under Uncertain Delays. [Doctoral Dissertation]. University of Michigan; 2012. Available from: http://hdl.handle.net/2027.42/93864

19. Metcalf-Burton, Jessica Ruth. Information Rates for Secret Sharing over Various Access Structures.

Degree: PhD, Mathematics, 2009, University of Michigan

URL: http://hdl.handle.net/2027.42/63729

► Many open questions in secret sharing ask about the information rate of a particular access structure or class of access structures. Here we improve the…
(more)

Subjects/Keywords: Secret Sharing; Vamos Matroid; Information Inequalities; Access Structure; Information Rate; Shannon Entropy; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Metcalf-Burton, J. R. (2009). Information Rates for Secret Sharing over Various Access Structures. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/63729

Chicago Manual of Style (16^{th} Edition):

Metcalf-Burton, Jessica Ruth. “Information Rates for Secret Sharing over Various Access Structures.” 2009. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/63729.

MLA Handbook (7^{th} Edition):

Metcalf-Burton, Jessica Ruth. “Information Rates for Secret Sharing over Various Access Structures.” 2009. Web. 27 Oct 2020.

Vancouver:

Metcalf-Burton JR. Information Rates for Secret Sharing over Various Access Structures. [Internet] [Doctoral dissertation]. University of Michigan; 2009. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/63729.

Council of Science Editors:

Metcalf-Burton JR. Information Rates for Secret Sharing over Various Access Structures. [Doctoral Dissertation]. University of Michigan; 2009. Available from: http://hdl.handle.net/2027.42/63729

20. Altman, Harry J. Integer Complexity, Addition Chains, and Well-Ordering.

Degree: PhD, Mathematics, 2014, University of Michigan

URL: http://hdl.handle.net/2027.42/108986

► In this dissertation we consider two notions of the "complexity" of a natural number, one being addition chain length, the other known as "integer complexity".…
(more)

Subjects/Keywords: Integer Complexity; Addition Chains; Well-ordering; Number Theory; Computational Complexity; Algorithms; Mathematics; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Altman, H. J. (2014). Integer Complexity, Addition Chains, and Well-Ordering. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/108986

Chicago Manual of Style (16^{th} Edition):

Altman, Harry J. “Integer Complexity, Addition Chains, and Well-Ordering.” 2014. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/108986.

MLA Handbook (7^{th} Edition):

Altman, Harry J. “Integer Complexity, Addition Chains, and Well-Ordering.” 2014. Web. 27 Oct 2020.

Vancouver:

Altman HJ. Integer Complexity, Addition Chains, and Well-Ordering. [Internet] [Doctoral dissertation]. University of Michigan; 2014. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/108986.

Council of Science Editors:

Altman HJ. Integer Complexity, Addition Chains, and Well-Ordering. [Doctoral Dissertation]. University of Michigan; 2014. Available from: http://hdl.handle.net/2027.42/108986

University of Michigan

21. Golman, Russell. Essays on Population Learning Dynamics and Boundedly Rational Behavior.

Degree: PhD, Applied and Interdisciplinary Mathematics, 2009, University of Michigan

URL: http://hdl.handle.net/2027.42/63738

► This dissertation contains four essays about evolutionary learning dynamics and the quantal response model of bounded rationality in game theory. The first essay examines the…
(more)

Subjects/Keywords: Basins of Attraction; Best Response Dynamics; Evolutionary Game; Heterogeneity; Quantal Response; Replicator Dynamics; Economics; Mathematics; Business; Science

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Golman, R. (2009). Essays on Population Learning Dynamics and Boundedly Rational Behavior. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/63738

Chicago Manual of Style (16^{th} Edition):

Golman, Russell. “Essays on Population Learning Dynamics and Boundedly Rational Behavior.” 2009. Doctoral Dissertation, University of Michigan. Accessed October 27, 2020. http://hdl.handle.net/2027.42/63738.

MLA Handbook (7^{th} Edition):

Golman, Russell. “Essays on Population Learning Dynamics and Boundedly Rational Behavior.” 2009. Web. 27 Oct 2020.

Vancouver:

Golman R. Essays on Population Learning Dynamics and Boundedly Rational Behavior. [Internet] [Doctoral dissertation]. University of Michigan; 2009. [cited 2020 Oct 27]. Available from: http://hdl.handle.net/2027.42/63738.

Council of Science Editors:

Golman R. Essays on Population Learning Dynamics and Boundedly Rational Behavior. [Doctoral Dissertation]. University of Michigan; 2009. Available from: http://hdl.handle.net/2027.42/63738