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:(Matroid Polytope). Showing records 1 – 4 of 4 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Kansas

1. Duna, Chad Kenneth. Matroid Independence Polytopes and Their Ehrhart Theory.

Degree: PhD, Mathematics, 2019, University of Kansas

 A \emph{matroid} is a combinatorial structure that provides an abstract and flexible model for dependence relations between elements of a set. One way of studying… (more)

Subjects/Keywords: Mathematics; Combinatorics; Ehrhart; Matroid; Polytope

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duna, C. K. (2019). Matroid Independence Polytopes and Their Ehrhart Theory. (Doctoral Dissertation). University of Kansas. Retrieved from http://hdl.handle.net/1808/29877

Chicago Manual of Style (16th Edition):

Duna, Chad Kenneth. “Matroid Independence Polytopes and Their Ehrhart Theory.” 2019. Doctoral Dissertation, University of Kansas. Accessed January 25, 2020. http://hdl.handle.net/1808/29877.

MLA Handbook (7th Edition):

Duna, Chad Kenneth. “Matroid Independence Polytopes and Their Ehrhart Theory.” 2019. Web. 25 Jan 2020.

Vancouver:

Duna CK. Matroid Independence Polytopes and Their Ehrhart Theory. [Internet] [Doctoral dissertation]. University of Kansas; 2019. [cited 2020 Jan 25]. Available from: http://hdl.handle.net/1808/29877.

Council of Science Editors:

Duna CK. Matroid Independence Polytopes and Their Ehrhart Theory. [Doctoral Dissertation]. University of Kansas; 2019. Available from: http://hdl.handle.net/1808/29877


University of California – Berkeley

2. Doker, Jeffrey Samuel. Geometry of Generalized Permutohedra.

Degree: Mathematics, 2011, University of California – Berkeley

 We study generalized permutohedra and some of the geometric properties they exhibit. We decompose matroid polytopes (and several related polytopes) into signed Minkowski sums of… (more)

Subjects/Keywords: Mathematics; associahedron; generalized permutohedron; matroid; multiplihedron; polytope

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Doker, J. S. (2011). Geometry of Generalized Permutohedra. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/34p6s66v

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

Doker, Jeffrey Samuel. “Geometry of Generalized Permutohedra.” 2011. Thesis, University of California – Berkeley. Accessed January 25, 2020. http://www.escholarship.org/uc/item/34p6s66v.

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

MLA Handbook (7th Edition):

Doker, Jeffrey Samuel. “Geometry of Generalized Permutohedra.” 2011. Web. 25 Jan 2020.

Vancouver:

Doker JS. Geometry of Generalized Permutohedra. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2020 Jan 25]. Available from: http://www.escholarship.org/uc/item/34p6s66v.

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

Council of Science Editors:

Doker JS. Geometry of Generalized Permutohedra. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/34p6s66v

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


University of Waterloo

3. Webb, Kerri. Counting Bases.

Degree: 2004, University of Waterloo

 A theorem of Edmonds characterizes when a pair of matroids has a common basis. Enumerating the common bases of a pair of matroid is a… (more)

Subjects/Keywords: Mathematics; matroid; Pfaffian; lattice; binary space; series-parallel; bipartite graph; matroid polytope

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Webb, K. (2004). Counting Bases. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/1120

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

Webb, Kerri. “Counting Bases.” 2004. Thesis, University of Waterloo. Accessed January 25, 2020. http://hdl.handle.net/10012/1120.

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

MLA Handbook (7th Edition):

Webb, Kerri. “Counting Bases.” 2004. Web. 25 Jan 2020.

Vancouver:

Webb K. Counting Bases. [Internet] [Thesis]. University of Waterloo; 2004. [cited 2020 Jan 25]. Available from: http://hdl.handle.net/10012/1120.

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

Council of Science Editors:

Webb K. Counting Bases. [Thesis]. University of Waterloo; 2004. Available from: http://hdl.handle.net/10012/1120

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

4. Kafer, Sean. On The Circuit Diameters of Some Combinatorial Polytopes.

Degree: 2017, University of Waterloo

 The combinatorial diameter of a polytope P is the maximum value of a shortest path between two vertices of P, where the path uses the… (more)

Subjects/Keywords: Circuit Diameter; Hirsch Conjecture; Circuit Hirsch Conjecture; Traveling Salesman Polytope; Matching Polytope; Perfect Matching Polytope; Polytope Formulations; Fractional Stable Set Polytope; Combinatorial Diameter; Spanning Tree Polytope; Matroid Polytope

Matroid polytope, defined as the convex hull of all characteristic vectors of independent sets… …Chapter 1 Introduction For a polytope P ⊆ Rd , the 1-skeleton of P is the graph given by… …combinatorial diameter of a polytope. The most famous conjecture in this context is the Hirsch… …polytope with f facets is at most f − d. While this conjecture has been disproved [20]… …with one such notion of diameter: the circuit diameter of a polytope, formalized by Borgwardt… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kafer, S. (2017). On The Circuit Diameters of Some Combinatorial Polytopes. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12413

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

Kafer, Sean. “On The Circuit Diameters of Some Combinatorial Polytopes.” 2017. Thesis, University of Waterloo. Accessed January 25, 2020. http://hdl.handle.net/10012/12413.

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

MLA Handbook (7th Edition):

Kafer, Sean. “On The Circuit Diameters of Some Combinatorial Polytopes.” 2017. Web. 25 Jan 2020.

Vancouver:

Kafer S. On The Circuit Diameters of Some Combinatorial Polytopes. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2020 Jan 25]. Available from: http://hdl.handle.net/10012/12413.

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

Council of Science Editors:

Kafer S. On The Circuit Diameters of Some Combinatorial Polytopes. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12413

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

.