Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Ordered sets). Showing records 1 – 30 of 45 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. McDevitt, Matthew. Orderings on words and permutations.

Degree: PhD, 2019, University of St Andrews

 Substructure orderings are ubiquitous throughout combinatorics and all of mathematics. In this thesis we consider various orderings on words, as well as the consecutive involvement… (more)

Subjects/Keywords: QA171.48M3; Ordered sets; Combinatorial analysis; Permutations

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McDevitt, M. (2019). Orderings on words and permutations. (Doctoral Dissertation). University of St Andrews. Retrieved from http://hdl.handle.net/10023/18465

Chicago Manual of Style (16th Edition):

McDevitt, Matthew. “Orderings on words and permutations.” 2019. Doctoral Dissertation, University of St Andrews. Accessed December 05, 2020. http://hdl.handle.net/10023/18465.

MLA Handbook (7th Edition):

McDevitt, Matthew. “Orderings on words and permutations.” 2019. Web. 05 Dec 2020.

Vancouver:

McDevitt M. Orderings on words and permutations. [Internet] [Doctoral dissertation]. University of St Andrews; 2019. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/10023/18465.

Council of Science Editors:

McDevitt M. Orderings on words and permutations. [Doctoral Dissertation]. University of St Andrews; 2019. Available from: http://hdl.handle.net/10023/18465


Florida Atlantic University

2. Joseph, Jean S. A Constructive Theory of Ordered Sets and their Completions.

Degree: 2018, Florida Atlantic University

The context for the development of this work is constructive mathematics without the axiom of countable choice. By constructive mathematics, we mean mathematics done without… (more)

Subjects/Keywords: Constructive mathematics; Ordered sets; Abelian groups

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Joseph, J. S. (2018). A Constructive Theory of Ordered Sets and their Completions. (Thesis). Florida Atlantic University. Retrieved from http://fau.digital.flvc.org/islandora/object/fau:40818

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Joseph, Jean S. “A Constructive Theory of Ordered Sets and their Completions.” 2018. Thesis, Florida Atlantic University. Accessed December 05, 2020. http://fau.digital.flvc.org/islandora/object/fau:40818.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Joseph, Jean S. “A Constructive Theory of Ordered Sets and their Completions.” 2018. Web. 05 Dec 2020.

Vancouver:

Joseph JS. A Constructive Theory of Ordered Sets and their Completions. [Internet] [Thesis]. Florida Atlantic University; 2018. [cited 2020 Dec 05]. Available from: http://fau.digital.flvc.org/islandora/object/fau:40818.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Joseph JS. A Constructive Theory of Ordered Sets and their Completions. [Thesis]. Florida Atlantic University; 2018. Available from: http://fau.digital.flvc.org/islandora/object/fau:40818

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade Estadual de Campinas

3. Spreafico, Marcos Vinicius Pereira, 1986-. Extensão de isomorfismos de ideais em conjuntos parcialmente ordenados: Extension of isomorphisms of ideals in partially ordered sets.

Degree: 2016, Universidade Estadual de Campinas

 Abstract: When we take into account MacWilliams type identities for poset codes, natural questions arise about invariants that play the rule of weight enumerators of… (more)

Subjects/Keywords: Conjuntos parcialmente ordenados; Códigos posets; Partially ordered sets; Poset codes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Spreafico, Marcos Vinicius Pereira, 1. (2016). Extensão de isomorfismos de ideais em conjuntos parcialmente ordenados: Extension of isomorphisms of ideals in partially ordered sets. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/321567

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Spreafico, Marcos Vinicius Pereira, 1986-. “Extensão de isomorfismos de ideais em conjuntos parcialmente ordenados: Extension of isomorphisms of ideals in partially ordered sets.” 2016. Thesis, Universidade Estadual de Campinas. Accessed December 05, 2020. http://repositorio.unicamp.br/jspui/handle/REPOSIP/321567.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Spreafico, Marcos Vinicius Pereira, 1986-. “Extensão de isomorfismos de ideais em conjuntos parcialmente ordenados: Extension of isomorphisms of ideals in partially ordered sets.” 2016. Web. 05 Dec 2020.

Vancouver:

Spreafico, Marcos Vinicius Pereira 1. Extensão de isomorfismos de ideais em conjuntos parcialmente ordenados: Extension of isomorphisms of ideals in partially ordered sets. [Internet] [Thesis]. Universidade Estadual de Campinas; 2016. [cited 2020 Dec 05]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/321567.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Spreafico, Marcos Vinicius Pereira 1. Extensão de isomorfismos de ideais em conjuntos parcialmente ordenados: Extension of isomorphisms of ideals in partially ordered sets. [Thesis]. Universidade Estadual de Campinas; 2016. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/321567

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Western Kentucky University

4. Barnette, Brandy Amanda. Counting Convex Sets on Products of Totally Ordered Sets.

Degree: MS, Department of Mathematics, 2015, Western Kentucky University

  The main purpose of this thesis is to find the number of convex sets on a product of two totally ordered spaces. We will… (more)

Subjects/Keywords: COUNTING CONVEX SETS; ORDERED SPACES; Mathematics; Set Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Barnette, B. A. (2015). Counting Convex Sets on Products of Totally Ordered Sets. (Masters Thesis). Western Kentucky University. Retrieved from https://digitalcommons.wku.edu/theses/1484

Chicago Manual of Style (16th Edition):

Barnette, Brandy Amanda. “Counting Convex Sets on Products of Totally Ordered Sets.” 2015. Masters Thesis, Western Kentucky University. Accessed December 05, 2020. https://digitalcommons.wku.edu/theses/1484.

MLA Handbook (7th Edition):

Barnette, Brandy Amanda. “Counting Convex Sets on Products of Totally Ordered Sets.” 2015. Web. 05 Dec 2020.

Vancouver:

Barnette BA. Counting Convex Sets on Products of Totally Ordered Sets. [Internet] [Masters thesis]. Western Kentucky University; 2015. [cited 2020 Dec 05]. Available from: https://digitalcommons.wku.edu/theses/1484.

Council of Science Editors:

Barnette BA. Counting Convex Sets on Products of Totally Ordered Sets. [Masters Thesis]. Western Kentucky University; 2015. Available from: https://digitalcommons.wku.edu/theses/1484


University of Cambridge

5. Garrod, Bryn James. Problems of optimal choice on posets and generalizations of acyclic colourings.

Degree: PhD, 2011, University of Cambridge

 NOTE : The mathematical symbols in the abstract do not always display correctly in this text field. Please see the abstract in the thesis for… (more)

Subjects/Keywords: Partially ordered sets; Graph theory; Graph coloring; Secretary problem (Probability theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Garrod, B. J. (2011). Problems of optimal choice on posets and generalizations of acyclic colourings. (Doctoral Dissertation). University of Cambridge. Retrieved from http://www.dspace.cam.ac.uk/handle/1810/243496https://www.repository.cam.ac.uk/bitstream/1810/243496/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/5/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/3/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/6/GarrodThesis.pdf.jpg

Chicago Manual of Style (16th Edition):

Garrod, Bryn James. “Problems of optimal choice on posets and generalizations of acyclic colourings.” 2011. Doctoral Dissertation, University of Cambridge. Accessed December 05, 2020. http://www.dspace.cam.ac.uk/handle/1810/243496https://www.repository.cam.ac.uk/bitstream/1810/243496/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/5/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/3/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/6/GarrodThesis.pdf.jpg.

MLA Handbook (7th Edition):

Garrod, Bryn James. “Problems of optimal choice on posets and generalizations of acyclic colourings.” 2011. Web. 05 Dec 2020.

Vancouver:

Garrod BJ. Problems of optimal choice on posets and generalizations of acyclic colourings. [Internet] [Doctoral dissertation]. University of Cambridge; 2011. [cited 2020 Dec 05]. Available from: http://www.dspace.cam.ac.uk/handle/1810/243496https://www.repository.cam.ac.uk/bitstream/1810/243496/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/5/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/3/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/6/GarrodThesis.pdf.jpg.

Council of Science Editors:

Garrod BJ. Problems of optimal choice on posets and generalizations of acyclic colourings. [Doctoral Dissertation]. University of Cambridge; 2011. Available from: http://www.dspace.cam.ac.uk/handle/1810/243496https://www.repository.cam.ac.uk/bitstream/1810/243496/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/5/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/3/GarrodThesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/243496/6/GarrodThesis.pdf.jpg


Columbia University

6. Yuan, Xinhao. Effective Randomized Concurrency Testing with Partial Order Methods.

Degree: 2020, Columbia University

 Modern software systems have been pervasively concurrent to utilize parallel hardware and perform asynchronous tasks. The correctness of concurrent programming, however, has been challenging for… (more)

Subjects/Keywords: Computer science; Computer multitasking; Computer software – Testing; Partially ordered sets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yuan, X. (2020). Effective Randomized Concurrency Testing with Partial Order Methods. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/d8-0fvn-dn65

Chicago Manual of Style (16th Edition):

Yuan, Xinhao. “Effective Randomized Concurrency Testing with Partial Order Methods.” 2020. Doctoral Dissertation, Columbia University. Accessed December 05, 2020. https://doi.org/10.7916/d8-0fvn-dn65.

MLA Handbook (7th Edition):

Yuan, Xinhao. “Effective Randomized Concurrency Testing with Partial Order Methods.” 2020. Web. 05 Dec 2020.

Vancouver:

Yuan X. Effective Randomized Concurrency Testing with Partial Order Methods. [Internet] [Doctoral dissertation]. Columbia University; 2020. [cited 2020 Dec 05]. Available from: https://doi.org/10.7916/d8-0fvn-dn65.

Council of Science Editors:

Yuan X. Effective Randomized Concurrency Testing with Partial Order Methods. [Doctoral Dissertation]. Columbia University; 2020. Available from: https://doi.org/10.7916/d8-0fvn-dn65


Michigan State University

7. Liu, Larry Shu-Chung. Left-modular elements and edge labelings.

Degree: PhD, Department of Mathematics, 1999, Michigan State University

Subjects/Keywords: Lattice theory; Partially ordered sets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, L. S. (1999). Left-modular elements and edge labelings. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:27870

Chicago Manual of Style (16th Edition):

Liu, Larry Shu-Chung. “Left-modular elements and edge labelings.” 1999. Doctoral Dissertation, Michigan State University. Accessed December 05, 2020. http://etd.lib.msu.edu/islandora/object/etd:27870.

MLA Handbook (7th Edition):

Liu, Larry Shu-Chung. “Left-modular elements and edge labelings.” 1999. Web. 05 Dec 2020.

Vancouver:

Liu LS. Left-modular elements and edge labelings. [Internet] [Doctoral dissertation]. Michigan State University; 1999. [cited 2020 Dec 05]. Available from: http://etd.lib.msu.edu/islandora/object/etd:27870.

Council of Science Editors:

Liu LS. Left-modular elements and edge labelings. [Doctoral Dissertation]. Michigan State University; 1999. Available from: http://etd.lib.msu.edu/islandora/object/etd:27870

8. Waaijers, L.J.M. On the structure of lattice ordered groups.

Degree: 1968, Waltman

Subjects/Keywords: Ordered sets; lattices; Boolean algebras

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Waaijers, L. J. M. (1968). On the structure of lattice ordered groups. (Doctoral Dissertation). Waltman. Retrieved from http://resolver.tudelft.nl/uuid:6beb8dc8-d766-4b37-a919-02b5a371e414 ; urn:NBN:nl:ui:24-uuid:6beb8dc8-d766-4b37-a919-02b5a371e414 ; urn:NBN:nl:ui:24-uuid:6beb8dc8-d766-4b37-a919-02b5a371e414 ; http://resolver.tudelft.nl/uuid:6beb8dc8-d766-4b37-a919-02b5a371e414

Chicago Manual of Style (16th Edition):

Waaijers, L J M. “On the structure of lattice ordered groups.” 1968. Doctoral Dissertation, Waltman. Accessed December 05, 2020. http://resolver.tudelft.nl/uuid:6beb8dc8-d766-4b37-a919-02b5a371e414 ; urn:NBN:nl:ui:24-uuid:6beb8dc8-d766-4b37-a919-02b5a371e414 ; urn:NBN:nl:ui:24-uuid:6beb8dc8-d766-4b37-a919-02b5a371e414 ; http://resolver.tudelft.nl/uuid:6beb8dc8-d766-4b37-a919-02b5a371e414.

MLA Handbook (7th Edition):

Waaijers, L J M. “On the structure of lattice ordered groups.” 1968. Web. 05 Dec 2020.

Vancouver:

Waaijers LJM. On the structure of lattice ordered groups. [Internet] [Doctoral dissertation]. Waltman; 1968. [cited 2020 Dec 05]. Available from: http://resolver.tudelft.nl/uuid:6beb8dc8-d766-4b37-a919-02b5a371e414 ; urn:NBN:nl:ui:24-uuid:6beb8dc8-d766-4b37-a919-02b5a371e414 ; urn:NBN:nl:ui:24-uuid:6beb8dc8-d766-4b37-a919-02b5a371e414 ; http://resolver.tudelft.nl/uuid:6beb8dc8-d766-4b37-a919-02b5a371e414.

Council of Science Editors:

Waaijers LJM. On the structure of lattice ordered groups. [Doctoral Dissertation]. Waltman; 1968. Available from: http://resolver.tudelft.nl/uuid:6beb8dc8-d766-4b37-a919-02b5a371e414 ; urn:NBN:nl:ui:24-uuid:6beb8dc8-d766-4b37-a919-02b5a371e414 ; urn:NBN:nl:ui:24-uuid:6beb8dc8-d766-4b37-a919-02b5a371e414 ; http://resolver.tudelft.nl/uuid:6beb8dc8-d766-4b37-a919-02b5a371e414

9. Hudson, Philip Wayne. Some Properties of Partially Ordered Sets.

Degree: 1966, North Texas State University

 It may be said of certain pairs of elements of a set that one element precedes the other. If the collection of all such pairs… (more)

Subjects/Keywords: partially ordered sets; mathematics; automorphism

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hudson, P. W. (1966). Some Properties of Partially Ordered Sets. (Thesis). North Texas State University. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc130722/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hudson, Philip Wayne. “Some Properties of Partially Ordered Sets.” 1966. Thesis, North Texas State University. Accessed December 05, 2020. https://digital.library.unt.edu/ark:/67531/metadc130722/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hudson, Philip Wayne. “Some Properties of Partially Ordered Sets.” 1966. Web. 05 Dec 2020.

Vancouver:

Hudson PW. Some Properties of Partially Ordered Sets. [Internet] [Thesis]. North Texas State University; 1966. [cited 2020 Dec 05]. Available from: https://digital.library.unt.edu/ark:/67531/metadc130722/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hudson PW. Some Properties of Partially Ordered Sets. [Thesis]. North Texas State University; 1966. Available from: https://digital.library.unt.edu/ark:/67531/metadc130722/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

10. Compton, Lewis W. Fundamentals of Partially Ordered Sets.

Degree: 1968, North Texas State University

Gives the basic definitions and theorems of similar partially ordered sets; studies finite partially ordered sets, including the problem of combinatorial analysis; and includes the ideas of complete, dense, and continuous partially ordered sets, including proofs. Advisors/Committee Members: Parrish, Herbert C., Mohat, John T., 1924-.

Subjects/Keywords: partially ordered sets; combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Compton, L. W. (1968). Fundamentals of Partially Ordered Sets. (Thesis). North Texas State University. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc130984/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Compton, Lewis W. “Fundamentals of Partially Ordered Sets.” 1968. Thesis, North Texas State University. Accessed December 05, 2020. https://digital.library.unt.edu/ark:/67531/metadc130984/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Compton, Lewis W. “Fundamentals of Partially Ordered Sets.” 1968. Web. 05 Dec 2020.

Vancouver:

Compton LW. Fundamentals of Partially Ordered Sets. [Internet] [Thesis]. North Texas State University; 1968. [cited 2020 Dec 05]. Available from: https://digital.library.unt.edu/ark:/67531/metadc130984/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Compton LW. Fundamentals of Partially Ordered Sets. [Thesis]. North Texas State University; 1968. Available from: https://digital.library.unt.edu/ark:/67531/metadc130984/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


The Ohio State University

11. Sali, Attila. Extremal problems for finite partially ordered sets .

Degree: PhD, Graduate School, 1986, The Ohio State University

Subjects/Keywords: Mathematics; Extremal problems; Ordered sets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sali, A. (1986). Extremal problems for finite partially ordered sets . (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu148732358362162

Chicago Manual of Style (16th Edition):

Sali, Attila. “Extremal problems for finite partially ordered sets .” 1986. Doctoral Dissertation, The Ohio State University. Accessed December 05, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu148732358362162.

MLA Handbook (7th Edition):

Sali, Attila. “Extremal problems for finite partially ordered sets .” 1986. Web. 05 Dec 2020.

Vancouver:

Sali A. Extremal problems for finite partially ordered sets . [Internet] [Doctoral dissertation]. The Ohio State University; 1986. [cited 2020 Dec 05]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu148732358362162.

Council of Science Editors:

Sali A. Extremal problems for finite partially ordered sets . [Doctoral Dissertation]. The Ohio State University; 1986. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu148732358362162


Simon Fraser University

12. Poon, David Hung Yiu. Sperner's theorem and external properties of finite sets.

Degree: 1983, Simon Fraser University

Subjects/Keywords: Set theory.; Partially ordered sets.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Poon, D. H. Y. (1983). Sperner's theorem and external properties of finite sets. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/6282

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Poon, David Hung Yiu. “Sperner's theorem and external properties of finite sets.” 1983. Thesis, Simon Fraser University. Accessed December 05, 2020. http://summit.sfu.ca/item/6282.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Poon, David Hung Yiu. “Sperner's theorem and external properties of finite sets.” 1983. Web. 05 Dec 2020.

Vancouver:

Poon DHY. Sperner's theorem and external properties of finite sets. [Internet] [Thesis]. Simon Fraser University; 1983. [cited 2020 Dec 05]. Available from: http://summit.sfu.ca/item/6282.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Poon DHY. Sperner's theorem and external properties of finite sets. [Thesis]. Simon Fraser University; 1983. Available from: http://summit.sfu.ca/item/6282

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

13. Barros, David Nicholas. Properties of Order Relations and Certain Partly Ordered Systems.

Degree: 1961, North Texas State College

 The purpose of this paper is to present a study of partly ordered sets. It includes a rigorous development of relations based on the notion… (more)

Subjects/Keywords: sets; mathematics; lattices; Ordered sets.; Lattice theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Barros, D. N. (1961). Properties of Order Relations and Certain Partly Ordered Systems. (Thesis). North Texas State College. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc108130/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Barros, David Nicholas. “Properties of Order Relations and Certain Partly Ordered Systems.” 1961. Thesis, North Texas State College. Accessed December 05, 2020. https://digital.library.unt.edu/ark:/67531/metadc108130/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Barros, David Nicholas. “Properties of Order Relations and Certain Partly Ordered Systems.” 1961. Web. 05 Dec 2020.

Vancouver:

Barros DN. Properties of Order Relations and Certain Partly Ordered Systems. [Internet] [Thesis]. North Texas State College; 1961. [cited 2020 Dec 05]. Available from: https://digital.library.unt.edu/ark:/67531/metadc108130/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Barros DN. Properties of Order Relations and Certain Partly Ordered Systems. [Thesis]. North Texas State College; 1961. Available from: https://digital.library.unt.edu/ark:/67531/metadc108130/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Cambridge

14. Garrod, Bryn James. Problems of optimal choice on posets and generalizations of acyclic colourings.

Degree: PhD, 2011, University of Cambridge

 This dissertation is in two parts, each of three chapters. In Part 1, I shall prove some results concerning variants of the 'secretary problem'. In… (more)

Subjects/Keywords: 510; Partially ordered sets; Graph theory; Graph coloring; Secretary problem (Probability theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Garrod, B. J. (2011). Problems of optimal choice on posets and generalizations of acyclic colourings. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.16222 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.555207

Chicago Manual of Style (16th Edition):

Garrod, Bryn James. “Problems of optimal choice on posets and generalizations of acyclic colourings.” 2011. Doctoral Dissertation, University of Cambridge. Accessed December 05, 2020. https://doi.org/10.17863/CAM.16222 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.555207.

MLA Handbook (7th Edition):

Garrod, Bryn James. “Problems of optimal choice on posets and generalizations of acyclic colourings.” 2011. Web. 05 Dec 2020.

Vancouver:

Garrod BJ. Problems of optimal choice on posets and generalizations of acyclic colourings. [Internet] [Doctoral dissertation]. University of Cambridge; 2011. [cited 2020 Dec 05]. Available from: https://doi.org/10.17863/CAM.16222 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.555207.

Council of Science Editors:

Garrod BJ. Problems of optimal choice on posets and generalizations of acyclic colourings. [Doctoral Dissertation]. University of Cambridge; 2011. Available from: https://doi.org/10.17863/CAM.16222 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.555207


University of Cambridge

15. David, Stefan. Extremal combinatorics and universal algorithms.

Degree: PhD, 2018, University of Cambridge

 In this dissertation we solve several combinatorial problems in different areas of mathematics: automata theory, combinatorics of partially ordered sets and extremal combinatorics. Firstly, we… (more)

Subjects/Keywords: 511; Combinatorics; Extremal Combinatorics; Algorithms; Automata theory; Bootstrap percolation; Combinatorics of partially ordered sets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

David, S. (2018). Extremal combinatorics and universal algorithms. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.25601 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383

Chicago Manual of Style (16th Edition):

David, Stefan. “Extremal combinatorics and universal algorithms.” 2018. Doctoral Dissertation, University of Cambridge. Accessed December 05, 2020. https://doi.org/10.17863/CAM.25601 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383.

MLA Handbook (7th Edition):

David, Stefan. “Extremal combinatorics and universal algorithms.” 2018. Web. 05 Dec 2020.

Vancouver:

David S. Extremal combinatorics and universal algorithms. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2020 Dec 05]. Available from: https://doi.org/10.17863/CAM.25601 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383.

Council of Science Editors:

David S. Extremal combinatorics and universal algorithms. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://doi.org/10.17863/CAM.25601 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383


University of Colorado

16. Sidrow, Evan. Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.

Degree: MS, Applied Mathematics, 2018, University of Colorado

  Bayesian networks are widely considered as powerful tools for modeling risk assessment, uncertainty, and decision making. They have been extensively employed to develop decision… (more)

Subjects/Keywords: Bayesian Networks; Partially Ordered Sets; Perfect Simulation; Directed Acyclic Graphs; Applied Statistics; Probability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sidrow, E. (2018). Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/98

Chicago Manual of Style (16th Edition):

Sidrow, Evan. “Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.” 2018. Masters Thesis, University of Colorado. Accessed December 05, 2020. https://scholar.colorado.edu/appm_gradetds/98.

MLA Handbook (7th Edition):

Sidrow, Evan. “Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.” 2018. Web. 05 Dec 2020.

Vancouver:

Sidrow E. Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions. [Internet] [Masters thesis]. University of Colorado; 2018. [cited 2020 Dec 05]. Available from: https://scholar.colorado.edu/appm_gradetds/98.

Council of Science Editors:

Sidrow E. Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions. [Masters Thesis]. University of Colorado; 2018. Available from: https://scholar.colorado.edu/appm_gradetds/98


Hong Kong University of Science and Technology

17. Lau, Man Kwong. On semi-Eulerian 2-strata partially ordered sets.

Degree: 1997, Hong Kong University of Science and Technology

 In this thesis we study a special kind of partially ordered sets which are called semi-Eulerian 2-strata posets (P, B). The posets possess many interesting… (more)

Subjects/Keywords: Partially ordered sets ; Eulerian graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lau, M. K. (1997). On semi-Eulerian 2-strata partially ordered sets. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-5066 ; https://doi.org/10.14711/thesis-b571500 ; http://repository.ust.hk/ir/bitstream/1783.1-5066/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lau, Man Kwong. “On semi-Eulerian 2-strata partially ordered sets.” 1997. Thesis, Hong Kong University of Science and Technology. Accessed December 05, 2020. http://repository.ust.hk/ir/Record/1783.1-5066 ; https://doi.org/10.14711/thesis-b571500 ; http://repository.ust.hk/ir/bitstream/1783.1-5066/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lau, Man Kwong. “On semi-Eulerian 2-strata partially ordered sets.” 1997. Web. 05 Dec 2020.

Vancouver:

Lau MK. On semi-Eulerian 2-strata partially ordered sets. [Internet] [Thesis]. Hong Kong University of Science and Technology; 1997. [cited 2020 Dec 05]. Available from: http://repository.ust.hk/ir/Record/1783.1-5066 ; https://doi.org/10.14711/thesis-b571500 ; http://repository.ust.hk/ir/bitstream/1783.1-5066/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lau MK. On semi-Eulerian 2-strata partially ordered sets. [Thesis]. Hong Kong University of Science and Technology; 1997. Available from: http://repository.ust.hk/ir/Record/1783.1-5066 ; https://doi.org/10.14711/thesis-b571500 ; http://repository.ust.hk/ir/bitstream/1783.1-5066/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Tartu University

18. Tart, Lauri. Morita equivalence of partially ordered semigroups .

Degree: 2011, Tartu University

 Väitekirjas uuritakse, kas ja kuivõrd on võimalik üldistada Morita ekvivalentsuse mõistet ja teooriat poolrühmadelt osaliselt järjestatud poolrühmadele. Morita teooria põhiidee on taandada ühe struktuuri uurimine… (more)

Subjects/Keywords: dissertatsioonid; osaliselt järjestatud hulgad; poolrühmad; homoloogiline algebra; partially ordered sets; homological algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tart, L. (2011). Morita equivalence of partially ordered semigroups . (Thesis). Tartu University. Retrieved from http://hdl.handle.net/10062/17479

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Tart, Lauri. “Morita equivalence of partially ordered semigroups .” 2011. Thesis, Tartu University. Accessed December 05, 2020. http://hdl.handle.net/10062/17479.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Tart, Lauri. “Morita equivalence of partially ordered semigroups .” 2011. Web. 05 Dec 2020.

Vancouver:

Tart L. Morita equivalence of partially ordered semigroups . [Internet] [Thesis]. Tartu University; 2011. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/10062/17479.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tart L. Morita equivalence of partially ordered semigroups . [Thesis]. Tartu University; 2011. Available from: http://hdl.handle.net/10062/17479

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Simon Fraser University

19. Lapsley, Roderick Mcleod. Trees, orders and forcing.

Degree: 1989, Simon Fraser University

Subjects/Keywords: Ordered sets.; Set theory.; Linear orderings.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lapsley, R. M. (1989). Trees, orders and forcing. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/4946

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lapsley, Roderick Mcleod. “Trees, orders and forcing.” 1989. Thesis, Simon Fraser University. Accessed December 05, 2020. http://summit.sfu.ca/item/4946.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lapsley, Roderick Mcleod. “Trees, orders and forcing.” 1989. Web. 05 Dec 2020.

Vancouver:

Lapsley RM. Trees, orders and forcing. [Internet] [Thesis]. Simon Fraser University; 1989. [cited 2020 Dec 05]. Available from: http://summit.sfu.ca/item/4946.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lapsley RM. Trees, orders and forcing. [Thesis]. Simon Fraser University; 1989. Available from: http://summit.sfu.ca/item/4946

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Cornell University

20. Schweig, Jay. Poset Convex-Ear Decompositions and Applications to the Flag h-Vector.

Degree: 2008, Cornell University

 Possibly the most fundamental combinatorial invariant associated to a finite simplicial complex is its f-vector, the integral sequence expressing the number of faces of the… (more)

Subjects/Keywords: Mathematics; Combinatorics; Partially ordered sets; h-vector

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schweig, J. (2008). Poset Convex-Ear Decompositions and Applications to the Flag h-Vector. (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/10735

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Schweig, Jay. “Poset Convex-Ear Decompositions and Applications to the Flag h-Vector.” 2008. Thesis, Cornell University. Accessed December 05, 2020. http://hdl.handle.net/1813/10735.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Schweig, Jay. “Poset Convex-Ear Decompositions and Applications to the Flag h-Vector.” 2008. Web. 05 Dec 2020.

Vancouver:

Schweig J. Poset Convex-Ear Decompositions and Applications to the Flag h-Vector. [Internet] [Thesis]. Cornell University; 2008. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/1813/10735.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schweig J. Poset Convex-Ear Decompositions and Applications to the Flag h-Vector. [Thesis]. Cornell University; 2008. Available from: http://hdl.handle.net/1813/10735

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Indian Institute of Science

21. Adiga, Abhijin. On Dimensional Parameters Of Graphs And Posets.

Degree: PhD, Faculty of Engineering, 2013, Indian Institute of Science

 In this thesis we study the following dimensional parameters : boxicity, cubicity, threshold dimension and poset dimension. While the first three parameters are defined on… (more)

Subjects/Keywords: Graph Theory; Partially Ordered Sets; Boxicity; Cubicity; Poset Dimension; Threshold Dimension; Posets; Interval Graphs; Threshold Graphs; Interval Orders; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Adiga, A. (2013). On Dimensional Parameters Of Graphs And Posets. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2071

Chicago Manual of Style (16th Edition):

Adiga, Abhijin. “On Dimensional Parameters Of Graphs And Posets.” 2013. Doctoral Dissertation, Indian Institute of Science. Accessed December 05, 2020. http://etd.iisc.ac.in/handle/2005/2071.

MLA Handbook (7th Edition):

Adiga, Abhijin. “On Dimensional Parameters Of Graphs And Posets.” 2013. Web. 05 Dec 2020.

Vancouver:

Adiga A. On Dimensional Parameters Of Graphs And Posets. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2013. [cited 2020 Dec 05]. Available from: http://etd.iisc.ac.in/handle/2005/2071.

Council of Science Editors:

Adiga A. On Dimensional Parameters Of Graphs And Posets. [Doctoral Dissertation]. Indian Institute of Science; 2013. Available from: http://etd.iisc.ac.in/handle/2005/2071

22. Koda, Yasunori. Combinatorial algorithms on partially ordered sets.

Degree: Department of Computer Science, 2018, University of Victoria

 The main results of this dissertation are various algorithms related to partially ordered sets. The dissertation basically consists of two parts. The first part treats… (more)

Subjects/Keywords: Combinatorial enumeration problems; Partially ordered sets

…formulas of acyclic transitive digraphs (p artially ordered sets), finite topologies… …15 2.2 An exam ple of acyclic digraph whose vertices are ordered by d istance from s o u… …5.o T h e conceptual scheme of a set o flists L{tj ordered by the num ber of… …x5D;) and poset (partially ordered sat) th eo ry (see S tanley [52… …problem s are the enum er­ ation of acyclic tran sitiv e digraphs (o r partially ordered… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koda, Y. (2018). Combinatorial algorithms on partially ordered sets. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9558

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Koda, Yasunori. “Combinatorial algorithms on partially ordered sets.” 2018. Thesis, University of Victoria. Accessed December 05, 2020. https://dspace.library.uvic.ca//handle/1828/9558.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Koda, Yasunori. “Combinatorial algorithms on partially ordered sets.” 2018. Web. 05 Dec 2020.

Vancouver:

Koda Y. Combinatorial algorithms on partially ordered sets. [Internet] [Thesis]. University of Victoria; 2018. [cited 2020 Dec 05]. Available from: https://dspace.library.uvic.ca//handle/1828/9558.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Koda Y. Combinatorial algorithms on partially ordered sets. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9558

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

23. Huang, Junbo. A Characterization of LYM and Rank Logarithmically Concave Partially Ordered Sets and Its Applications.

Degree: 2010, University of Waterloo

 The LYM property of a finite standard graded poset is one of the central notions in Sperner theory. It is known that the product of… (more)

Subjects/Keywords: Sperner Theory; Extremal Set Theory; Partially Ordered Sets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, J. (2010). A Characterization of LYM and Rank Logarithmically Concave Partially Ordered Sets and Its Applications. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4958

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Huang, Junbo. “A Characterization of LYM and Rank Logarithmically Concave Partially Ordered Sets and Its Applications.” 2010. Thesis, University of Waterloo. Accessed December 05, 2020. http://hdl.handle.net/10012/4958.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Huang, Junbo. “A Characterization of LYM and Rank Logarithmically Concave Partially Ordered Sets and Its Applications.” 2010. Web. 05 Dec 2020.

Vancouver:

Huang J. A Characterization of LYM and Rank Logarithmically Concave Partially Ordered Sets and Its Applications. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/10012/4958.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang J. A Characterization of LYM and Rank Logarithmically Concave Partially Ordered Sets and Its Applications. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/4958

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

24. Keisler, D. Michael. Generalized C-sets.

Degree: 1974, North Texas State University

 The problem undertaken in this paper is to determine what the algebraic structure of the class of C-sets is, when the notion of sum is… (more)

Subjects/Keywords: C-sets; Lattice theory.; lattice ordered groups; Λ-ideals

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Keisler, D. M. (1974). Generalized C-sets. (Thesis). North Texas State University. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc501024/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Keisler, D Michael. “Generalized C-sets.” 1974. Thesis, North Texas State University. Accessed December 05, 2020. https://digital.library.unt.edu/ark:/67531/metadc501024/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Keisler, D Michael. “Generalized C-sets.” 1974. Web. 05 Dec 2020.

Vancouver:

Keisler DM. Generalized C-sets. [Internet] [Thesis]. North Texas State University; 1974. [cited 2020 Dec 05]. Available from: https://digital.library.unt.edu/ark:/67531/metadc501024/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Keisler DM. Generalized C-sets. [Thesis]. North Texas State University; 1974. Available from: https://digital.library.unt.edu/ark:/67531/metadc501024/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Virginia Tech

25. Parrish, Edna L. Generalized total and partial set covering problems.

Degree: MS, Industrial Engineering and Operations Research, 1986, Virginia Tech

 This thesis is concerned with the development of two generalized set covering models. The first model is formulated for the total set covering problem where… (more)

Subjects/Keywords: LD5655.V855 1986.P3775; Partially ordered sets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Parrish, E. L. (1986). Generalized total and partial set covering problems. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/91140

Chicago Manual of Style (16th Edition):

Parrish, Edna L. “Generalized total and partial set covering problems.” 1986. Masters Thesis, Virginia Tech. Accessed December 05, 2020. http://hdl.handle.net/10919/91140.

MLA Handbook (7th Edition):

Parrish, Edna L. “Generalized total and partial set covering problems.” 1986. Web. 05 Dec 2020.

Vancouver:

Parrish EL. Generalized total and partial set covering problems. [Internet] [Masters thesis]. Virginia Tech; 1986. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/10919/91140.

Council of Science Editors:

Parrish EL. Generalized total and partial set covering problems. [Masters Thesis]. Virginia Tech; 1986. Available from: http://hdl.handle.net/10919/91140


Georgia Tech

26. Keller, Mitchel Todd. Some results on linear discrepancy for partially ordered sets.

Degree: PhD, Mathematics, 2009, Georgia Tech

 Tanenbaum, Trenk, and Fishburn introduced the concept of linear discrepancy in 2001, proposing it as a way to measure a partially ordered set's distance from… (more)

Subjects/Keywords: Semiorders; Partially ordered sets; Linear discrepancy; Online algorithms; Interval orders; Partially ordered sets; Irregularities of distribution (Number theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Keller, M. T. (2009). Some results on linear discrepancy for partially ordered sets. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/33810

Chicago Manual of Style (16th Edition):

Keller, Mitchel Todd. “Some results on linear discrepancy for partially ordered sets.” 2009. Doctoral Dissertation, Georgia Tech. Accessed December 05, 2020. http://hdl.handle.net/1853/33810.

MLA Handbook (7th Edition):

Keller, Mitchel Todd. “Some results on linear discrepancy for partially ordered sets.” 2009. Web. 05 Dec 2020.

Vancouver:

Keller MT. Some results on linear discrepancy for partially ordered sets. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/1853/33810.

Council of Science Editors:

Keller MT. Some results on linear discrepancy for partially ordered sets. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/33810


Indian Institute of Science

27. Khopkar, Abhijeet. Computational And Combinatorial Problems On Some Geometric Proximity Graphs.

Degree: PhD, Faculty of Engineering, 2017, Indian Institute of Science

 In this thesis, we focus on the study of computational and combinatorial problems on various geometric proximity graphs. Delaunay and Gabriel graphs are widely studied… (more)

Subjects/Keywords: Geometric Proximity Graphs; Computational Geometry; Geometric Graphs; Gabriel Graphs; Locally Gabriel Graphs; Unit Distance Graphs; Ordered Bipartite Graphs; Convex Point Sets; Combinatorial Geometry; Locally Gabriel Geometric Graphs; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khopkar, A. (2017). Computational And Combinatorial Problems On Some Geometric Proximity Graphs. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2622

Chicago Manual of Style (16th Edition):

Khopkar, Abhijeet. “Computational And Combinatorial Problems On Some Geometric Proximity Graphs.” 2017. Doctoral Dissertation, Indian Institute of Science. Accessed December 05, 2020. http://etd.iisc.ac.in/handle/2005/2622.

MLA Handbook (7th Edition):

Khopkar, Abhijeet. “Computational And Combinatorial Problems On Some Geometric Proximity Graphs.” 2017. Web. 05 Dec 2020.

Vancouver:

Khopkar A. Computational And Combinatorial Problems On Some Geometric Proximity Graphs. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2017. [cited 2020 Dec 05]. Available from: http://etd.iisc.ac.in/handle/2005/2622.

Council of Science Editors:

Khopkar A. Computational And Combinatorial Problems On Some Geometric Proximity Graphs. [Doctoral Dissertation]. Indian Institute of Science; 2017. Available from: http://etd.iisc.ac.in/handle/2005/2622


Georgia Tech

28. Howard, David M. A study of discrepancy results in partially ordered sets.

Degree: PhD, Mathematics, 2010, Georgia Tech

 In 2001, Fishburn, Tanenbaum, and Trenk published a pair of papers that introduced the notions of linear and weak discrepancy of a partially ordered set… (more)

Subjects/Keywords: Poset; Linear discrepancy; Weak discrepancy; Partially ordered sets; Irregularities of distribution (Number theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Howard, D. M. (2010). A study of discrepancy results in partially ordered sets. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/34794

Chicago Manual of Style (16th Edition):

Howard, David M. “A study of discrepancy results in partially ordered sets.” 2010. Doctoral Dissertation, Georgia Tech. Accessed December 05, 2020. http://hdl.handle.net/1853/34794.

MLA Handbook (7th Edition):

Howard, David M. “A study of discrepancy results in partially ordered sets.” 2010. Web. 05 Dec 2020.

Vancouver:

Howard DM. A study of discrepancy results in partially ordered sets. [Internet] [Doctoral dissertation]. Georgia Tech; 2010. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/1853/34794.

Council of Science Editors:

Howard DM. A study of discrepancy results in partially ordered sets. [Doctoral Dissertation]. Georgia Tech; 2010. Available from: http://hdl.handle.net/1853/34794


The Ohio State University

29. Hammett, Adam Joseph. On comparability of random permutations.

Degree: PhD, Mathematics, 2007, The Ohio State University

 Two permutations of [n]:={1,2,…,<i>n</i>} are comparable in <i>Bruhat order</i> if one can be obtained from the other by a sequence of transpositions decreasing the number… (more)

Subjects/Keywords: Mathematics; Combinatorics; Probability; Bruhat Order; Weak Order; Partially Ordered Sets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hammett, A. J. (2007). On comparability of random permutations. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1172592365

Chicago Manual of Style (16th Edition):

Hammett, Adam Joseph. “On comparability of random permutations.” 2007. Doctoral Dissertation, The Ohio State University. Accessed December 05, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1172592365.

MLA Handbook (7th Edition):

Hammett, Adam Joseph. “On comparability of random permutations.” 2007. Web. 05 Dec 2020.

Vancouver:

Hammett AJ. On comparability of random permutations. [Internet] [Doctoral dissertation]. The Ohio State University; 2007. [cited 2020 Dec 05]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1172592365.

Council of Science Editors:

Hammett AJ. On comparability of random permutations. [Doctoral Dissertation]. The Ohio State University; 2007. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1172592365


Université de Grenoble

30. Aksenov, Alexandre. Raréfaction dans les suites b-multiplicatives : The rarefaction phenomenon in b-multiplicative sequences.

Degree: Docteur es, Mathématiques, 2014, Université de Grenoble

 On étudie une sous-classe des suites b-multiplicatives rarefiées avec un pas de raréfaction p premier, et on trouve une structure asymptotique avec un exposant α∈]0,1[… (more)

Subjects/Keywords: Suites b-multiplicatives; Phénomène de Newman; Partitions d'un ensemble; Triangle de Pascal; Ensembles partiellement ordonnés; B-multiplicative sequences; Newman phenomenon; Set patitions; Pascal's triangle; Partially ordered sets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Aksenov, A. (2014). Raréfaction dans les suites b-multiplicatives : The rarefaction phenomenon in b-multiplicative sequences. (Doctoral Dissertation). Université de Grenoble. Retrieved from http://www.theses.fr/2014GRENM001

Chicago Manual of Style (16th Edition):

Aksenov, Alexandre. “Raréfaction dans les suites b-multiplicatives : The rarefaction phenomenon in b-multiplicative sequences.” 2014. Doctoral Dissertation, Université de Grenoble. Accessed December 05, 2020. http://www.theses.fr/2014GRENM001.

MLA Handbook (7th Edition):

Aksenov, Alexandre. “Raréfaction dans les suites b-multiplicatives : The rarefaction phenomenon in b-multiplicative sequences.” 2014. Web. 05 Dec 2020.

Vancouver:

Aksenov A. Raréfaction dans les suites b-multiplicatives : The rarefaction phenomenon in b-multiplicative sequences. [Internet] [Doctoral dissertation]. Université de Grenoble; 2014. [cited 2020 Dec 05]. Available from: http://www.theses.fr/2014GRENM001.

Council of Science Editors:

Aksenov A. Raréfaction dans les suites b-multiplicatives : The rarefaction phenomenon in b-multiplicative sequences. [Doctoral Dissertation]. Université de Grenoble; 2014. Available from: http://www.theses.fr/2014GRENM001

[1] [2]

.