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:(Combinatorial geometry ). Showing records 1 – 30 of 55 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


Columbia University

1. Filip, Ioan. A local relative trace formula for spherical varieties.

Degree: 2016, Columbia University

 Let F be a local non-Archimedean field of characteristic zero. We prove a Plancherel formula for the symmetric space GL(2,F)\GL(2,E), where E/F is an unramified… (more)

Subjects/Keywords: Combinatorial geometry; Geometry, Algebraic; Mathematics; Trace formulas

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Filip, I. (2016). A local relative trace formula for spherical varieties. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8HX1CWK

Chicago Manual of Style (16th Edition):

Filip, Ioan. “A local relative trace formula for spherical varieties.” 2016. Doctoral Dissertation, Columbia University. Accessed August 05, 2020. https://doi.org/10.7916/D8HX1CWK.

MLA Handbook (7th Edition):

Filip, Ioan. “A local relative trace formula for spherical varieties.” 2016. Web. 05 Aug 2020.

Vancouver:

Filip I. A local relative trace formula for spherical varieties. [Internet] [Doctoral dissertation]. Columbia University; 2016. [cited 2020 Aug 05]. Available from: https://doi.org/10.7916/D8HX1CWK.

Council of Science Editors:

Filip I. A local relative trace formula for spherical varieties. [Doctoral Dissertation]. Columbia University; 2016. Available from: https://doi.org/10.7916/D8HX1CWK


The Ohio State University

2. Denig, William Allen. A class of combinatorial geometries arising from partially ordered sets.

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

Subjects/Keywords: Mathematics; Combinatorial geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Denig, W. A. (1976). A class of combinatorial geometries arising from partially ordered sets. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1487004443404201

Chicago Manual of Style (16th Edition):

Denig, William Allen. “A class of combinatorial geometries arising from partially ordered sets.” 1976. Doctoral Dissertation, The Ohio State University. Accessed August 05, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487004443404201.

MLA Handbook (7th Edition):

Denig, William Allen. “A class of combinatorial geometries arising from partially ordered sets.” 1976. Web. 05 Aug 2020.

Vancouver:

Denig WA. A class of combinatorial geometries arising from partially ordered sets. [Internet] [Doctoral dissertation]. The Ohio State University; 1976. [cited 2020 Aug 05]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487004443404201.

Council of Science Editors:

Denig WA. A class of combinatorial geometries arising from partially ordered sets. [Doctoral Dissertation]. The Ohio State University; 1976. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487004443404201


University of Ottawa

3. Schultz Xavier da Silveira, Luís Fernando. Turán Triangles, Cell Covers, Road Placement and Train Scheduling .

Degree: 2020, University of Ottawa

 In this doctoral thesis, four questions related to computational geometry are considered. The first is an extremal combinatorics question regarding triangles with vertices taken from… (more)

Subjects/Keywords: Computational Geometry; Combinatorial Optimization; Approximation Algorithms; Scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schultz Xavier da Silveira, L. F. (2020). Turán Triangles, Cell Covers, Road Placement and Train Scheduling . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/40569

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):

Schultz Xavier da Silveira, Luís Fernando. “Turán Triangles, Cell Covers, Road Placement and Train Scheduling .” 2020. Thesis, University of Ottawa. Accessed August 05, 2020. http://hdl.handle.net/10393/40569.

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

MLA Handbook (7th Edition):

Schultz Xavier da Silveira, Luís Fernando. “Turán Triangles, Cell Covers, Road Placement and Train Scheduling .” 2020. Web. 05 Aug 2020.

Vancouver:

Schultz Xavier da Silveira LF. Turán Triangles, Cell Covers, Road Placement and Train Scheduling . [Internet] [Thesis]. University of Ottawa; 2020. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/10393/40569.

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

Council of Science Editors:

Schultz Xavier da Silveira LF. Turán Triangles, Cell Covers, Road Placement and Train Scheduling . [Thesis]. University of Ottawa; 2020. Available from: http://hdl.handle.net/10393/40569

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

4. Basit, Abdul, 1987-. Some applications of algebraic methods in combinatorial geometry.

Degree: PhD, Computer Science, 2017, Rutgers University

This dissertation explores problems in combinatorial geometry relating to incidences and to applications of incidence problems in other areas of combinatorics. In recent years, various… (more)

Subjects/Keywords: Combinatorial geometry; Combinatorial analysis

…1 Chapter 1 Introduction Combinatorial Geometry is a field bringing together ideas from… …an important subfield of combinatorial geometry, referred to as incidence geometry… …arithmetic combinatorics (e.g., see [31, 20]), combinatorial geometry (e.g… …resolve) many outstanding problems in combinatorial geometry. This thesis presents some… …points and V be a set of objects. A large set of problems in combinatorial geometry deal with… 

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):

Basit, Abdul, 1. (2017). Some applications of algebraic methods in combinatorial geometry. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/54176/

Chicago Manual of Style (16th Edition):

Basit, Abdul, 1987-. “Some applications of algebraic methods in combinatorial geometry.” 2017. Doctoral Dissertation, Rutgers University. Accessed August 05, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/54176/.

MLA Handbook (7th Edition):

Basit, Abdul, 1987-. “Some applications of algebraic methods in combinatorial geometry.” 2017. Web. 05 Aug 2020.

Vancouver:

Basit, Abdul 1. Some applications of algebraic methods in combinatorial geometry. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Aug 05]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54176/.

Council of Science Editors:

Basit, Abdul 1. Some applications of algebraic methods in combinatorial geometry. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54176/


University of Cambridge

5. Milicevic, Luka. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics.

Degree: PhD, 2018, University of Cambridge

 In this thesis, we consider several combinatorial topics, belonging to the areas appearing in the thesis title. Given a non-empty complete metric space (X,d), a… (more)

Subjects/Keywords: combinatorics; graph theory; extremal combinatorics; metric geometry; combinatorial geometry; additive combinatorics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Milicevic, L. (2018). Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/273375

Chicago Manual of Style (16th Edition):

Milicevic, Luka. “Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics.” 2018. Doctoral Dissertation, University of Cambridge. Accessed August 05, 2020. https://www.repository.cam.ac.uk/handle/1810/273375.

MLA Handbook (7th Edition):

Milicevic, Luka. “Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics.” 2018. Web. 05 Aug 2020.

Vancouver:

Milicevic L. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2020 Aug 05]. Available from: https://www.repository.cam.ac.uk/handle/1810/273375.

Council of Science Editors:

Milicevic L. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://www.repository.cam.ac.uk/handle/1810/273375


Hong Kong University of Science and Technology

6. Wu, Fung Leung MATH. Some geometric aspects of polyhedral graphs from perspective of combinatorial curvature.

Degree: 2019, Hong Kong University of Science and Technology

Combinatorial curvature is defined for polyhedral graphs analogue to Gaussian curvature for Riemannian 2-manifolds. Some aspects of polyhedral graphs from the perspective of combinatorial curvature… (more)

Subjects/Keywords: Graph theory ; Mathematical models ; Curvature ; Polyhedral functions ; Combinatorial geometry ; Geometry, Riemannian

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, F. L. M. (2019). Some geometric aspects of polyhedral graphs from perspective of combinatorial curvature. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-100755 ; https://doi.org/10.14711/thesis-991012762868803412 ; http://repository.ust.hk/ir/bitstream/1783.1-100755/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):

Wu, Fung Leung MATH. “Some geometric aspects of polyhedral graphs from perspective of combinatorial curvature.” 2019. Thesis, Hong Kong University of Science and Technology. Accessed August 05, 2020. http://repository.ust.hk/ir/Record/1783.1-100755 ; https://doi.org/10.14711/thesis-991012762868803412 ; http://repository.ust.hk/ir/bitstream/1783.1-100755/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):

Wu, Fung Leung MATH. “Some geometric aspects of polyhedral graphs from perspective of combinatorial curvature.” 2019. Web. 05 Aug 2020.

Vancouver:

Wu FLM. Some geometric aspects of polyhedral graphs from perspective of combinatorial curvature. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2019. [cited 2020 Aug 05]. Available from: http://repository.ust.hk/ir/Record/1783.1-100755 ; https://doi.org/10.14711/thesis-991012762868803412 ; http://repository.ust.hk/ir/bitstream/1783.1-100755/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:

Wu FLM. Some geometric aspects of polyhedral graphs from perspective of combinatorial curvature. [Thesis]. Hong Kong University of Science and Technology; 2019. Available from: http://repository.ust.hk/ir/Record/1783.1-100755 ; https://doi.org/10.14711/thesis-991012762868803412 ; http://repository.ust.hk/ir/bitstream/1783.1-100755/1/th_redirect.html

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


University of Hong Kong

7. 姚兆明. Tight bound edge guard results on art gallery problems.

Degree: 1996, University of Hong Kong

Subjects/Keywords: Combinatorial geometry.; Geometry - Data processing.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

姚兆明. (1996). Tight bound edge guard results on art gallery problems. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/34917

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

Chicago Manual of Style (16th Edition):

姚兆明. “Tight bound edge guard results on art gallery problems.” 1996. Thesis, University of Hong Kong. Accessed August 05, 2020. http://hdl.handle.net/10722/34917.

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

MLA Handbook (7th Edition):

姚兆明. “Tight bound edge guard results on art gallery problems.” 1996. Web. 05 Aug 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

姚兆明. Tight bound edge guard results on art gallery problems. [Internet] [Thesis]. University of Hong Kong; 1996. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/10722/34917.

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

Council of Science Editors:

姚兆明. Tight bound edge guard results on art gallery problems. [Thesis]. University of Hong Kong; 1996. Available from: http://hdl.handle.net/10722/34917

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


University of North Texas

8. Hipp, James W. (James William), 1956-. The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors.

Degree: 1989, University of North Texas

 We show that the maximum size of a geometry of rank n excluding the (q + 2)-point line, the 3-wheel W3, and the 3-whirl W3(more)

Subjects/Keywords: combinatorial geometries; rings; mathematics; Combinatorial geometry.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hipp, James W. (James William), 1. (1989). The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc330849/

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):

Hipp, James W. (James William), 1956-. “The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors.” 1989. Thesis, University of North Texas. Accessed August 05, 2020. https://digital.library.unt.edu/ark:/67531/metadc330849/.

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

MLA Handbook (7th Edition):

Hipp, James W. (James William), 1956-. “The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors.” 1989. Web. 05 Aug 2020.

Vancouver:

Hipp, James W. (James William) 1. The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors. [Internet] [Thesis]. University of North Texas; 1989. [cited 2020 Aug 05]. Available from: https://digital.library.unt.edu/ark:/67531/metadc330849/.

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

Council of Science Editors:

Hipp, James W. (James William) 1. The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors. [Thesis]. University of North Texas; 1989. Available from: https://digital.library.unt.edu/ark:/67531/metadc330849/

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


University of North Texas

9. Yoon, Young-jin. Characterizations of Some Combinatorial Geometries.

Degree: 1992, University of North Texas

 We give several characterizations of partition lattices and projective geometries. Most of these characterizations use characteristic polynomials. A geometry is non—splitting if it cannot be… (more)

Subjects/Keywords: Combinatorial geometry.; combinatorial geometry; partition lattices; projective geometries

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yoon, Y. (1992). Characterizations of Some Combinatorial Geometries. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc277894/

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):

Yoon, Young-jin. “Characterizations of Some Combinatorial Geometries.” 1992. Thesis, University of North Texas. Accessed August 05, 2020. https://digital.library.unt.edu/ark:/67531/metadc277894/.

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

MLA Handbook (7th Edition):

Yoon, Young-jin. “Characterizations of Some Combinatorial Geometries.” 1992. Web. 05 Aug 2020.

Vancouver:

Yoon Y. Characterizations of Some Combinatorial Geometries. [Internet] [Thesis]. University of North Texas; 1992. [cited 2020 Aug 05]. Available from: https://digital.library.unt.edu/ark:/67531/metadc277894/.

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

Council of Science Editors:

Yoon Y. Characterizations of Some Combinatorial Geometries. [Thesis]. University of North Texas; 1992. Available from: https://digital.library.unt.edu/ark:/67531/metadc277894/

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


The Ohio State University

10. Roth, Robert Lyle. Hall Triple Systems and commutative Moufang exponent 3 loops .

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

Subjects/Keywords: Mathematics; Combinatorial geometry; Moufang loops; Geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roth, R. L. (1979). Hall Triple Systems and commutative Moufang exponent 3 loops . (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1487088320404598

Chicago Manual of Style (16th Edition):

Roth, Robert Lyle. “Hall Triple Systems and commutative Moufang exponent 3 loops .” 1979. Doctoral Dissertation, The Ohio State University. Accessed August 05, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487088320404598.

MLA Handbook (7th Edition):

Roth, Robert Lyle. “Hall Triple Systems and commutative Moufang exponent 3 loops .” 1979. Web. 05 Aug 2020.

Vancouver:

Roth RL. Hall Triple Systems and commutative Moufang exponent 3 loops . [Internet] [Doctoral dissertation]. The Ohio State University; 1979. [cited 2020 Aug 05]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487088320404598.

Council of Science Editors:

Roth RL. Hall Triple Systems and commutative Moufang exponent 3 loops . [Doctoral Dissertation]. The Ohio State University; 1979. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487088320404598


The Ohio State University

11. Barnes, Martha Lynn. Embedding geometric lattices and combinatorial designs into projective geometries or symmetric designs with the same number of hyperplanes or blocks.

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

Subjects/Keywords: Mathematics; Combinatorial geometry; Lattice theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Barnes, M. L. (1977). Embedding geometric lattices and combinatorial designs into projective geometries or symmetric designs with the same number of hyperplanes or blocks. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1487063539786913

Chicago Manual of Style (16th Edition):

Barnes, Martha Lynn. “Embedding geometric lattices and combinatorial designs into projective geometries or symmetric designs with the same number of hyperplanes or blocks.” 1977. Doctoral Dissertation, The Ohio State University. Accessed August 05, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487063539786913.

MLA Handbook (7th Edition):

Barnes, Martha Lynn. “Embedding geometric lattices and combinatorial designs into projective geometries or symmetric designs with the same number of hyperplanes or blocks.” 1977. Web. 05 Aug 2020.

Vancouver:

Barnes ML. Embedding geometric lattices and combinatorial designs into projective geometries or symmetric designs with the same number of hyperplanes or blocks. [Internet] [Doctoral dissertation]. The Ohio State University; 1977. [cited 2020 Aug 05]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487063539786913.

Council of Science Editors:

Barnes ML. Embedding geometric lattices and combinatorial designs into projective geometries or symmetric designs with the same number of hyperplanes or blocks. [Doctoral Dissertation]. The Ohio State University; 1977. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487063539786913


University of Kentucky

12. Wells, Daniel J. GENERAL FLIPS AND THE CD-INDEX.

Degree: 2010, University of Kentucky

 We generalize bistellar operations (often called flips) on simplicial manifolds to a notion of general flips on PL-spheres. We provide methods for computing the cd-index… (more)

Subjects/Keywords: combinatorial geometry; polytopes; bistellar flips; cd-index; PL-spheres; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wells, D. J. (2010). GENERAL FLIPS AND THE CD-INDEX. (Doctoral Dissertation). University of Kentucky. Retrieved from https://uknowledge.uky.edu/gradschool_diss/33

Chicago Manual of Style (16th Edition):

Wells, Daniel J. “GENERAL FLIPS AND THE CD-INDEX.” 2010. Doctoral Dissertation, University of Kentucky. Accessed August 05, 2020. https://uknowledge.uky.edu/gradschool_diss/33.

MLA Handbook (7th Edition):

Wells, Daniel J. “GENERAL FLIPS AND THE CD-INDEX.” 2010. Web. 05 Aug 2020.

Vancouver:

Wells DJ. GENERAL FLIPS AND THE CD-INDEX. [Internet] [Doctoral dissertation]. University of Kentucky; 2010. [cited 2020 Aug 05]. Available from: https://uknowledge.uky.edu/gradschool_diss/33.

Council of Science Editors:

Wells DJ. GENERAL FLIPS AND THE CD-INDEX. [Doctoral Dissertation]. University of Kentucky; 2010. Available from: https://uknowledge.uky.edu/gradschool_diss/33


University of Waterloo

13. Romero Barbosa, Julian. Applied Hilbert's Nullstellensatz for Combinatorial Problems.

Degree: 2016, University of Waterloo

 Various feasibility problems in Combinatorial Optimization can be stated using systems of polynomial equations. Determining the existence of a it{stable set} of a given size,… (more)

Subjects/Keywords: Algebraic Geometry; Combinatorial Optimization; Hilbert's Nullstellensatz; Graph Coloring; Graph Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Romero Barbosa, J. (2016). Applied Hilbert's Nullstellensatz for Combinatorial Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10897

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):

Romero Barbosa, Julian. “Applied Hilbert's Nullstellensatz for Combinatorial Problems.” 2016. Thesis, University of Waterloo. Accessed August 05, 2020. http://hdl.handle.net/10012/10897.

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

MLA Handbook (7th Edition):

Romero Barbosa, Julian. “Applied Hilbert's Nullstellensatz for Combinatorial Problems.” 2016. Web. 05 Aug 2020.

Vancouver:

Romero Barbosa J. Applied Hilbert's Nullstellensatz for Combinatorial Problems. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/10012/10897.

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

Council of Science Editors:

Romero Barbosa J. Applied Hilbert's Nullstellensatz for Combinatorial Problems. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10897

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


Northeastern University

14. Scheidwasser, Ilya. Contractions of polygons in abstract polytopes.

Degree: PhD, Department of Mathematics, 2015, Northeastern University

 There are several well-known constructions of new polytopes from old, such as the pyramid and prism constructions. This thesis defines two new local constructions on… (more)

Subjects/Keywords: abstract polytopes; combinatorics; Polytopes; Polygons; Combinatorial analysis; Discrete geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Scheidwasser, I. (2015). Contractions of polygons in abstract polytopes. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20194153

Chicago Manual of Style (16th Edition):

Scheidwasser, Ilya. “Contractions of polygons in abstract polytopes.” 2015. Doctoral Dissertation, Northeastern University. Accessed August 05, 2020. http://hdl.handle.net/2047/D20194153.

MLA Handbook (7th Edition):

Scheidwasser, Ilya. “Contractions of polygons in abstract polytopes.” 2015. Web. 05 Aug 2020.

Vancouver:

Scheidwasser I. Contractions of polygons in abstract polytopes. [Internet] [Doctoral dissertation]. Northeastern University; 2015. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/2047/D20194153.

Council of Science Editors:

Scheidwasser I. Contractions of polygons in abstract polytopes. [Doctoral Dissertation]. Northeastern University; 2015. Available from: http://hdl.handle.net/2047/D20194153


Michigan State University

15. Ionel, Eleny-Nocoleta. Genus one enumerative invariants in Pn.

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

Subjects/Keywords: Geometry, Algebraic; Combinatorial enumeration problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ionel, E. (1995). Genus one enumerative invariants in Pn. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:25986

Chicago Manual of Style (16th Edition):

Ionel, Eleny-Nocoleta. “Genus one enumerative invariants in Pn.” 1995. Doctoral Dissertation, Michigan State University. Accessed August 05, 2020. http://etd.lib.msu.edu/islandora/object/etd:25986.

MLA Handbook (7th Edition):

Ionel, Eleny-Nocoleta. “Genus one enumerative invariants in Pn.” 1995. Web. 05 Aug 2020.

Vancouver:

Ionel E. Genus one enumerative invariants in Pn. [Internet] [Doctoral dissertation]. Michigan State University; 1995. [cited 2020 Aug 05]. Available from: http://etd.lib.msu.edu/islandora/object/etd:25986.

Council of Science Editors:

Ionel E. Genus one enumerative invariants in Pn. [Doctoral Dissertation]. Michigan State University; 1995. Available from: http://etd.lib.msu.edu/islandora/object/etd:25986


Michigan State University

16. Giambrone, Adam Joseph. A combinatorial approach to knot theory : volume bounds for hyperbolic semi-adequate link complements.

Degree: 2014, Michigan State University

Thesis Ph. D. Michigan State University. Mathematics - Doctor of Philosophy 2014.

An interesting goal in knot theory is to discover how much geometric information… (more)

Subjects/Keywords: Knot theory; Combinatorial analysis; Geometry, Hyperbolic; Graph theory; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Giambrone, A. J. (2014). A combinatorial approach to knot theory : volume bounds for hyperbolic semi-adequate link complements. (Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:2621

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):

Giambrone, Adam Joseph. “A combinatorial approach to knot theory : volume bounds for hyperbolic semi-adequate link complements.” 2014. Thesis, Michigan State University. Accessed August 05, 2020. http://etd.lib.msu.edu/islandora/object/etd:2621.

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

MLA Handbook (7th Edition):

Giambrone, Adam Joseph. “A combinatorial approach to knot theory : volume bounds for hyperbolic semi-adequate link complements.” 2014. Web. 05 Aug 2020.

Vancouver:

Giambrone AJ. A combinatorial approach to knot theory : volume bounds for hyperbolic semi-adequate link complements. [Internet] [Thesis]. Michigan State University; 2014. [cited 2020 Aug 05]. Available from: http://etd.lib.msu.edu/islandora/object/etd:2621.

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

Council of Science Editors:

Giambrone AJ. A combinatorial approach to knot theory : volume bounds for hyperbolic semi-adequate link complements. [Thesis]. Michigan State University; 2014. Available from: http://etd.lib.msu.edu/islandora/object/etd:2621

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


Simon Fraser University

17. Adamec, Radek. General Davenport-Schinzel sequences.

Degree: 1992, Simon Fraser University

Subjects/Keywords: Combinatorial geometry.; Sequences (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Adamec, R. (1992). General Davenport-Schinzel sequences. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/3675

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):

Adamec, Radek. “General Davenport-Schinzel sequences.” 1992. Thesis, Simon Fraser University. Accessed August 05, 2020. http://summit.sfu.ca/item/3675.

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

MLA Handbook (7th Edition):

Adamec, Radek. “General Davenport-Schinzel sequences.” 1992. Web. 05 Aug 2020.

Vancouver:

Adamec R. General Davenport-Schinzel sequences. [Internet] [Thesis]. Simon Fraser University; 1992. [cited 2020 Aug 05]. Available from: http://summit.sfu.ca/item/3675.

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

Council of Science Editors:

Adamec R. General Davenport-Schinzel sequences. [Thesis]. Simon Fraser University; 1992. Available from: http://summit.sfu.ca/item/3675

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


Simon Fraser University

18. Bolstad, Peder A. The Oberwolfach problem : a history and some new results.

Degree: 1990, Simon Fraser University

Subjects/Keywords: Combinatorial geometry.; Graph theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bolstad, P. A. (1990). The Oberwolfach problem : a history and some new results. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/4945

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):

Bolstad, Peder A. “The Oberwolfach problem : a history and some new results.” 1990. Thesis, Simon Fraser University. Accessed August 05, 2020. http://summit.sfu.ca/item/4945.

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

MLA Handbook (7th Edition):

Bolstad, Peder A. “The Oberwolfach problem : a history and some new results.” 1990. Web. 05 Aug 2020.

Vancouver:

Bolstad PA. The Oberwolfach problem : a history and some new results. [Internet] [Thesis]. Simon Fraser University; 1990. [cited 2020 Aug 05]. Available from: http://summit.sfu.ca/item/4945.

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

Council of Science Editors:

Bolstad PA. The Oberwolfach problem : a history and some new results. [Thesis]. Simon Fraser University; 1990. Available from: http://summit.sfu.ca/item/4945

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


University of Melbourne

19. Dow, Ana J. CAT(0) structures on link exteriors: variations on a theme.

Degree: 2019, University of Melbourne

 This thesis adapts the cubical CAT(0) Aitchison complex, A(L), of alternating link exteriors to construct CAT(0) polyhedral metric structures, A′(L), on the exterior of various… (more)

Subjects/Keywords: knot theory; combinatorial geometry; non-positive curvature; low dimensional topology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dow, A. J. (2019). CAT(0) structures on link exteriors: variations on a theme. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/224389

Chicago Manual of Style (16th Edition):

Dow, Ana J. “CAT(0) structures on link exteriors: variations on a theme.” 2019. Doctoral Dissertation, University of Melbourne. Accessed August 05, 2020. http://hdl.handle.net/11343/224389.

MLA Handbook (7th Edition):

Dow, Ana J. “CAT(0) structures on link exteriors: variations on a theme.” 2019. Web. 05 Aug 2020.

Vancouver:

Dow AJ. CAT(0) structures on link exteriors: variations on a theme. [Internet] [Doctoral dissertation]. University of Melbourne; 2019. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/11343/224389.

Council of Science Editors:

Dow AJ. CAT(0) structures on link exteriors: variations on a theme. [Doctoral Dissertation]. University of Melbourne; 2019. Available from: http://hdl.handle.net/11343/224389


University of Cambridge

20. Gruslys, Vytautas. Tilings and other combinatorial results.

Degree: PhD, 2018, University of Cambridge

 In this dissertation we treat three tiling problems and three problems in combinatorial geometry, extremal graph theory and sparse Ramsey theory. We first consider tilings… (more)

Subjects/Keywords: Combinatorics; Tilings; Combinatorial Geometry; Extremal Graph Theory; Ramsey Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gruslys, V. (2018). Tilings and other combinatorial results. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/271311 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.745014

Chicago Manual of Style (16th Edition):

Gruslys, Vytautas. “Tilings and other combinatorial results.” 2018. Doctoral Dissertation, University of Cambridge. Accessed August 05, 2020. https://www.repository.cam.ac.uk/handle/1810/271311 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.745014.

MLA Handbook (7th Edition):

Gruslys, Vytautas. “Tilings and other combinatorial results.” 2018. Web. 05 Aug 2020.

Vancouver:

Gruslys V. Tilings and other combinatorial results. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2020 Aug 05]. Available from: https://www.repository.cam.ac.uk/handle/1810/271311 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.745014.

Council of Science Editors:

Gruslys V. Tilings and other combinatorial results. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://www.repository.cam.ac.uk/handle/1810/271311 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.745014


University of Hong Kong

21. Fung, Ping-yuen. Approximation for minimum triangulations of convex polyhedra.

Degree: 2001, University of Hong Kong

Subjects/Keywords: Decomposition method.; Geometry - Data processing.; Polyhedra.; Combinatorial geometry.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fung, P. (2001). Approximation for minimum triangulations of convex polyhedra. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/31849

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):

Fung, Ping-yuen. “Approximation for minimum triangulations of convex polyhedra.” 2001. Thesis, University of Hong Kong. Accessed August 05, 2020. http://hdl.handle.net/10722/31849.

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

MLA Handbook (7th Edition):

Fung, Ping-yuen. “Approximation for minimum triangulations of convex polyhedra.” 2001. Web. 05 Aug 2020.

Vancouver:

Fung P. Approximation for minimum triangulations of convex polyhedra. [Internet] [Thesis]. University of Hong Kong; 2001. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/10722/31849.

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

Council of Science Editors:

Fung P. Approximation for minimum triangulations of convex polyhedra. [Thesis]. University of Hong Kong; 2001. Available from: http://hdl.handle.net/10722/31849

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

22. Jartoux, Bruno. On combinatorial approximation algorithms in geometry : Sur les algorithmes d'approximation combinatoires en géométrie.

Degree: Docteur es, Informatique, 2018, Université Paris-Est

L'analyse des techniques d'approximation est centrale en géométrie algorithmique, pour des raisons pratiques comme théoriques. Dans cette thèse nous traitons de l'échantillonnage des structures géométriques… (more)

Subjects/Keywords: Algorithme d'approximation; Optimisation combinatoire; Géométrie algorithmique; Approximation algorithm; Combinatorial optimisation; Computational geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jartoux, B. (2018). On combinatorial approximation algorithms in geometry : Sur les algorithmes d'approximation combinatoires en géométrie. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2018PESC1078

Chicago Manual of Style (16th Edition):

Jartoux, Bruno. “On combinatorial approximation algorithms in geometry : Sur les algorithmes d'approximation combinatoires en géométrie.” 2018. Doctoral Dissertation, Université Paris-Est. Accessed August 05, 2020. http://www.theses.fr/2018PESC1078.

MLA Handbook (7th Edition):

Jartoux, Bruno. “On combinatorial approximation algorithms in geometry : Sur les algorithmes d'approximation combinatoires en géométrie.” 2018. Web. 05 Aug 2020.

Vancouver:

Jartoux B. On combinatorial approximation algorithms in geometry : Sur les algorithmes d'approximation combinatoires en géométrie. [Internet] [Doctoral dissertation]. Université Paris-Est; 2018. [cited 2020 Aug 05]. Available from: http://www.theses.fr/2018PESC1078.

Council of Science Editors:

Jartoux B. On combinatorial approximation algorithms in geometry : Sur les algorithmes d'approximation combinatoires en géométrie. [Doctoral Dissertation]. Université Paris-Est; 2018. Available from: http://www.theses.fr/2018PESC1078

23. Bus, Norbert. The use of geometric structures in graphics and optimization : L'utilisation des structures géométriques pour synthèse d'image et optimisation.

Degree: Docteur es, Informatique, 2015, Université Paris-Est

 Les données du monde réel ont manifestement une composante géométrique importante et suggère les patterns géométriques signifiants. Les méthodes qui utilisent la nature géométrique des… (more)

Subjects/Keywords: Géométrie algorithmique; Modélisation; Synthèse d'image; Combinatorial optimisation; Computational geometry; Modelling; Computer graphics; Optimisation combinatoire

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bus, N. (2015). The use of geometric structures in graphics and optimization : L'utilisation des structures géométriques pour synthèse d'image et optimisation. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2015PESC1117

Chicago Manual of Style (16th Edition):

Bus, Norbert. “The use of geometric structures in graphics and optimization : L'utilisation des structures géométriques pour synthèse d'image et optimisation.” 2015. Doctoral Dissertation, Université Paris-Est. Accessed August 05, 2020. http://www.theses.fr/2015PESC1117.

MLA Handbook (7th Edition):

Bus, Norbert. “The use of geometric structures in graphics and optimization : L'utilisation des structures géométriques pour synthèse d'image et optimisation.” 2015. Web. 05 Aug 2020.

Vancouver:

Bus N. The use of geometric structures in graphics and optimization : L'utilisation des structures géométriques pour synthèse d'image et optimisation. [Internet] [Doctoral dissertation]. Université Paris-Est; 2015. [cited 2020 Aug 05]. Available from: http://www.theses.fr/2015PESC1117.

Council of Science Editors:

Bus N. The use of geometric structures in graphics and optimization : L'utilisation des structures géométriques pour synthèse d'image et optimisation. [Doctoral Dissertation]. Université Paris-Est; 2015. Available from: http://www.theses.fr/2015PESC1117


University of Washington

24. Lombard, John. From Quantum Gravity to Combinatorial Hives: Addressing Longstanding Puzzles with Novel Approaches.

Degree: PhD, 2018, University of Washington

 A thesis in two parts, this manuscript concerns the applications of contemporary techniques in optimization, network theory, combinatorial topology, and other branches of discrete mathematics… (more)

Subjects/Keywords: Combinatorial hives; Emergent geometry; Littlewood-Richardson; Quantum gravity; Simplicial Complex; Physics; Mathematics; Statistics; Physics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lombard, J. (2018). From Quantum Gravity to Combinatorial Hives: Addressing Longstanding Puzzles with Novel Approaches. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/42513

Chicago Manual of Style (16th Edition):

Lombard, John. “From Quantum Gravity to Combinatorial Hives: Addressing Longstanding Puzzles with Novel Approaches.” 2018. Doctoral Dissertation, University of Washington. Accessed August 05, 2020. http://hdl.handle.net/1773/42513.

MLA Handbook (7th Edition):

Lombard, John. “From Quantum Gravity to Combinatorial Hives: Addressing Longstanding Puzzles with Novel Approaches.” 2018. Web. 05 Aug 2020.

Vancouver:

Lombard J. From Quantum Gravity to Combinatorial Hives: Addressing Longstanding Puzzles with Novel Approaches. [Internet] [Doctoral dissertation]. University of Washington; 2018. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/1773/42513.

Council of Science Editors:

Lombard J. From Quantum Gravity to Combinatorial Hives: Addressing Longstanding Puzzles with Novel Approaches. [Doctoral Dissertation]. University of Washington; 2018. Available from: http://hdl.handle.net/1773/42513


Michigan State University

25. Cheng, Szu-En. Generating function proofs of identities and congruences.

Degree: PhD, 2003, Michigan State University

Subjects/Keywords: Congruences (Geometry); Combinatorial identities; Proof theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheng, S. (2003). Generating function proofs of identities and congruences. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:32110

Chicago Manual of Style (16th Edition):

Cheng, Szu-En. “Generating function proofs of identities and congruences.” 2003. Doctoral Dissertation, Michigan State University. Accessed August 05, 2020. http://etd.lib.msu.edu/islandora/object/etd:32110.

MLA Handbook (7th Edition):

Cheng, Szu-En. “Generating function proofs of identities and congruences.” 2003. Web. 05 Aug 2020.

Vancouver:

Cheng S. Generating function proofs of identities and congruences. [Internet] [Doctoral dissertation]. Michigan State University; 2003. [cited 2020 Aug 05]. Available from: http://etd.lib.msu.edu/islandora/object/etd:32110.

Council of Science Editors:

Cheng S. Generating function proofs of identities and congruences. [Doctoral Dissertation]. Michigan State University; 2003. Available from: http://etd.lib.msu.edu/islandora/object/etd:32110

26. Sankararaman, Abishek. Spatial stochastic models for network analysis.

Degree: PhD, Electrical and Computer Engineering, 2019, University of Texas – Austin

 This thesis proposes new stochastic interacting particle models for networks, and studies some fundamental properties of these models. This thesis considers two application areas of… (more)

Subjects/Keywords: Stochastic geometry; Random graphs; Dynamics; Percolation; Stationary point process; Combinatorial statistics; 5G wireless networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sankararaman, A. (2019). Spatial stochastic models for network analysis. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/5795

Chicago Manual of Style (16th Edition):

Sankararaman, Abishek. “Spatial stochastic models for network analysis.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed August 05, 2020. http://dx.doi.org/10.26153/tsw/5795.

MLA Handbook (7th Edition):

Sankararaman, Abishek. “Spatial stochastic models for network analysis.” 2019. Web. 05 Aug 2020.

Vancouver:

Sankararaman A. Spatial stochastic models for network analysis. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2020 Aug 05]. Available from: http://dx.doi.org/10.26153/tsw/5795.

Council of Science Editors:

Sankararaman A. Spatial stochastic models for network analysis. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/5795


University of Melbourne

27. Andersen, Patrick. Degree bounded geometric spanning trees with a bottleneck objective function.

Degree: 2019, University of Melbourne

 We introduce the geometric δ-minimum bottleneck spanning tree problem (δ-MBST), which is the problem of finding a spanning tree for a set of points in… (more)

Subjects/Keywords: minimum spanning trees; bottleneck objective; approximation algorithms; discrete geometry; bounded degree; combinatorial optimisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Andersen, P. (2019). Degree bounded geometric spanning trees with a bottleneck objective function. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/221999

Chicago Manual of Style (16th Edition):

Andersen, Patrick. “Degree bounded geometric spanning trees with a bottleneck objective function.” 2019. Doctoral Dissertation, University of Melbourne. Accessed August 05, 2020. http://hdl.handle.net/11343/221999.

MLA Handbook (7th Edition):

Andersen, Patrick. “Degree bounded geometric spanning trees with a bottleneck objective function.” 2019. Web. 05 Aug 2020.

Vancouver:

Andersen P. Degree bounded geometric spanning trees with a bottleneck objective function. [Internet] [Doctoral dissertation]. University of Melbourne; 2019. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/11343/221999.

Council of Science Editors:

Andersen P. Degree bounded geometric spanning trees with a bottleneck objective function. [Doctoral Dissertation]. University of Melbourne; 2019. Available from: http://hdl.handle.net/11343/221999


University of Maine

28. Ryoo, Ji Hoon. Identities for the Multiple Polylogarithm Using the Shuffle Operation.

Degree: MA, Mathematics, 2001, University of Maine

  At the beginning of my research, I understood the shuffle operation and iterated integrals to make a new proof-method (called a combinatorial method). As… (more)

Subjects/Keywords: Combinatorial identities; logarithmic functions; Algebraic Geometry; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ryoo, J. H. (2001). Identities for the Multiple Polylogarithm Using the Shuffle Operation. (Masters Thesis). University of Maine. Retrieved from https://digitalcommons.library.umaine.edu/etd/407

Chicago Manual of Style (16th Edition):

Ryoo, Ji Hoon. “Identities for the Multiple Polylogarithm Using the Shuffle Operation.” 2001. Masters Thesis, University of Maine. Accessed August 05, 2020. https://digitalcommons.library.umaine.edu/etd/407.

MLA Handbook (7th Edition):

Ryoo, Ji Hoon. “Identities for the Multiple Polylogarithm Using the Shuffle Operation.” 2001. Web. 05 Aug 2020.

Vancouver:

Ryoo JH. Identities for the Multiple Polylogarithm Using the Shuffle Operation. [Internet] [Masters thesis]. University of Maine; 2001. [cited 2020 Aug 05]. Available from: https://digitalcommons.library.umaine.edu/etd/407.

Council of Science Editors:

Ryoo JH. Identities for the Multiple Polylogarithm Using the Shuffle Operation. [Masters Thesis]. University of Maine; 2001. Available from: https://digitalcommons.library.umaine.edu/etd/407

29. Uematsu, Naoya. Lights out game with cellular automation.

Degree: 2016, University of Northern Iowa

1 PDF file (x, 53 pages) Advisors/Committee Members: Douglas J. Shaw, Chair.

Subjects/Keywords: Directed graphs; Graph theory; Combinatorial geometry; Lights out (Game)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Uematsu, N. (2016). Lights out game with cellular automation. (Thesis). University of Northern Iowa. Retrieved from https://scholarworks.uni.edu/etd/234

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):

Uematsu, Naoya. “Lights out game with cellular automation.” 2016. Thesis, University of Northern Iowa. Accessed August 05, 2020. https://scholarworks.uni.edu/etd/234.

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

MLA Handbook (7th Edition):

Uematsu, Naoya. “Lights out game with cellular automation.” 2016. Web. 05 Aug 2020.

Vancouver:

Uematsu N. Lights out game with cellular automation. [Internet] [Thesis]. University of Northern Iowa; 2016. [cited 2020 Aug 05]. Available from: https://scholarworks.uni.edu/etd/234.

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

Council of Science Editors:

Uematsu N. Lights out game with cellular automation. [Thesis]. University of Northern Iowa; 2016. Available from: https://scholarworks.uni.edu/etd/234

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

30. Cuneo, Rémi. Généralisation d'une méthode de petites simplifications due à Mikhaïl Gromov et Yann Ollivier en géométrie des groupes : Drop impact of yield-stress fluids.

Degree: Docteur es, Mathématiques, 2011, Aix-Marseille 1

Dans un article publié en 2003, M.Gromov propose une reformulation de la théorie des petites simplifications en géométrie des groupes. Dans cette version, un graphe… (more)

Subjects/Keywords: Combinatoire; Diagramme; Entrelacs; Géométrie; Graphe; Groupe; Hyperbolique; Noeud; Topologie; Isopérimétrique; Combinatorial; Diagram; Geometry; Graph; Group; Hyperbolic; Isoperimetric; Knot; Link; Topology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cuneo, R. (2011). Généralisation d'une méthode de petites simplifications due à Mikhaïl Gromov et Yann Ollivier en géométrie des groupes : Drop impact of yield-stress fluids. (Doctoral Dissertation). Aix-Marseille 1. Retrieved from http://www.theses.fr/2011AIX10026

Chicago Manual of Style (16th Edition):

Cuneo, Rémi. “Généralisation d'une méthode de petites simplifications due à Mikhaïl Gromov et Yann Ollivier en géométrie des groupes : Drop impact of yield-stress fluids.” 2011. Doctoral Dissertation, Aix-Marseille 1. Accessed August 05, 2020. http://www.theses.fr/2011AIX10026.

MLA Handbook (7th Edition):

Cuneo, Rémi. “Généralisation d'une méthode de petites simplifications due à Mikhaïl Gromov et Yann Ollivier en géométrie des groupes : Drop impact of yield-stress fluids.” 2011. Web. 05 Aug 2020.

Vancouver:

Cuneo R. Généralisation d'une méthode de petites simplifications due à Mikhaïl Gromov et Yann Ollivier en géométrie des groupes : Drop impact of yield-stress fluids. [Internet] [Doctoral dissertation]. Aix-Marseille 1; 2011. [cited 2020 Aug 05]. Available from: http://www.theses.fr/2011AIX10026.

Council of Science Editors:

Cuneo R. Généralisation d'une méthode de petites simplifications due à Mikhaïl Gromov et Yann Ollivier en géométrie des groupes : Drop impact of yield-stress fluids. [Doctoral Dissertation]. Aix-Marseille 1; 2011. Available from: http://www.theses.fr/2011AIX10026

[1] [2]

.