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 9 of 9 for “"uniform matroids"”.
-
A Combinatorial Formula for Kazhdan-Lusztig Polynomials of Sparse Paving Matroids
… of Kazhdan-Lusztig polynomials for sparse paving matroids. These matroids are known to be logarithmically almost all matroids, but are conjectured to be almost all matroids. We also show the positivity of these coefficients using our formula. In special cases, such as for uniform matroids, our …
-
Comparing 3-Connectedness and Roundness in Matroid Theory
… in graph theory. There are many broad classes of matroids. Important examples include binary matroids, graphic matroids, regular matroids, uniform matroids, and various levels of connected matroids. Some of the most important problems in matroid theory involve characterizing classes of matroids so …
-
Excluded minors for nearly-paving matroids
Matroids capture an abstract notion of independence that generalizes linear independence in linear algebra, edge independence in graph theory, as well as algebraic independence. Given a particular property of matroids, all the matroids possessing that property form a matroid class. A common …
-
Kazhdan-Lusztig Polynomials of Matroids and Their Roots
… Kazhdan-Lusztig polynomials of several graphical matroids, including thagomizer graphs, the complete bipartite graph K_{2,n}, and (conjecturally) fan graphs. Additionally, we investigate a conjecture by the author, Proudfoot, and Young on the real-rootedness for Kazhdan-Lusztig polynomials of …
-
Lattice Path Matroids: Base Polytopes & Ehrhart Theory
We study matroid base polytopes of lattice path matroids, $\mathscr{P}(M(\nu))\subset \Rr^n$ with skew shape $\nu$. Our goal is to compute their corresponding Ehrhart polynomials. This story comes in three parts.\textit{Part 1:} We produce a minimal linear inequality description for the base …
-
Infinite Matroids and Transfinite Sequences
… introduced µ- admissibility for pairs of matroids on the same ground set and showed that it is a necessary condition for the existence of a matching. A pair of matroids (M,W) with common ground set E is µ-admissible if a subset of sequences in E × {0,1} have a certain property. In order to …
-
On k-level matroids: geometry and combinatorics
… associated to the collection of bases of matroids and show that the class of matroids with bounded Theta rank or levelness is closed under taking minors. This allows us to find a characterization of matroids with bounded Theta rank or levelness in terms of forbidden minors. We give the …
-
Exploring Matroid Minors
Matroids are discrete mathematical objects that generalize important concepts of independence arising in other areas of mathematics. There are many different important classes of matroids and a frequent problem in matroid theory is to determine whether or not a given matroid belongs to a certain …
-
Matroid Independence Polytopes and Their Ehrhart Theory
… 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 and thereby the original matroid. By a \emph{polytope}, we mean a bounded convex set in Euclidean space …