Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"Matroid Polytope"”.

  1. Polytopal subdivisions in Grassmannians, tropical geometry and algebraic curves

    … of hypersimplices, we study the fiber polytope and show that in some cases it is normally equivalent to the Minkowski sum of some the faces of the corresponding secondary polytope. The second type of polytopal subdivision is regular matroid subdivisions. These objects are polytopal …

    fu-berlin Repository record for Polytopal subdivisions in Grassmannians, tropical geometry and algebraic curves (opens in a new tab)

  2. On The Circuit Diameters of Some Combinatorial Polytopes

    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 edges of P only. In contrast to the combinatorial diameter, the circuit diameter of P is defined as the maximum value of a shortest path between two vertices of P, …

    waterloo Repository record for On The Circuit Diameters of Some Combinatorial Polytopes (opens in a new tab)

  3. Beyond submodular maximization : one-sided smoothness and meta-submodularity

    … a submodular function f(S) subject to a matroid constraint S ∈ ℳ, there is much less work on the corresponding supermodular maximization problems. We develop new techniques for attacking these problems inspired by the continuous greedy method applied to the multi-linear extension of a …

    ubc Repository record for Beyond submodular maximization : one-sided smoothness and meta-submodularity (opens in a new tab) Download PDF for Beyond submodular maximization : one-sided smoothness and meta-submodularity (opens in a new tab)

  4. Counting Bases

    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 much harder problem, and includes the #P-complete problem of counting the number of perfect matchings in a bipartite graph. We focus on the problem of counting the …

    waterloo Repository record for Counting Bases (opens in a new tab)

  5. Matroid Independence Polytopes and Their Ehrhart Theory

    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 matroids is via geometry: one associates a polytope to a matroid, then uses both combinatorics and geometry to understand the polytope …

    ku Repository record for Matroid Independence Polytopes and Their Ehrhart Theory (opens in a new tab)