Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Combinatorics (2)
- 1-flowing matroid (1)
- Categorification (1)
- Circuits (1)
- Cluster algebras (1)
-
- Even-cycle and even-cut matroids (1)
- Extremal function (1)
- Fan (1)
- Finite fields (1)
- Golden-mean matroid (1)
- Graph (1)
- Graph theory (1)
- Graphs (1)
- Immersion (1)
- Infinite graph (1)
- Intertwine (1)
- Koszul duality (1)
- Ladder (1)
- Matroid structure (1)
- Matroids (1)
- Minor (1)
- Mixed categories (1)
- Noncommutative discriminants (1)
- Perturbation (1)
- Perverse sheaves (1)
- Poisson prime elements (1)
- Quantum groups at roots of unity (1)
- Quivers (1)
- Sheaves (1)
- Symplectic foliations (1)
Articles 1 - 8 of 8
Full-Text Articles in Entire DC Network
Invariant Of Noncommutative Algebras And Poisson Geometry, Bach Van Nguyen
Invariant Of Noncommutative Algebras And Poisson Geometry, Bach Van Nguyen
LSU Doctoral Dissertations
In this dissertation, we describe the structure of discriminant of noncommutative algebras using the theory of Poisson quantization and ring theoretic properties of Poisson algebra. In particular, under appropriate conditions, we express the discriminant of specialization of K[q^{+-1}]-algebras as product of Poisson prime elements in some Poisson central subalgebra. In addition, we provide methods for computing noncommutative discriminant in various settings using results obtained for specialization of K[q^{+-1}]-algebras. Further, to demonstrate, we explicitly compute the discriminant of algebra of quantum matrices and quantum Schubert cell algebras specializing at roots of unity. This dissertation is part of the collaboration with Trampel …
Dimers On Cylinders Over Dynkin Diagrams And Cluster Algebras, Maitreyee Chandramohan Kulkarni
Dimers On Cylinders Over Dynkin Diagrams And Cluster Algebras, Maitreyee Chandramohan Kulkarni
LSU Doctoral Dissertations
This dissertation describes a general setting for dimer models on cylinders over Dynkin diagrams which in type A reduces to the well-studied case of dimer models on a disc. We prove that all Berenstein--Fomin--Zelevinsky quivers for Schubert cells in a symmetric Kac--Moody algebra give rise to dimer models on the cylinder over the corresponding Dynkin diagram. We also give an independent proof of a result of Buan, Iyama, Reiten and Smith that the corresponding superpotentials are rigid using the dimer model structure of the quivers.
Unavoidable Immersions And Intertwines Of Graphs, Matthew Christopher Barnes
Unavoidable Immersions And Intertwines Of Graphs, Matthew Christopher Barnes
LSU Doctoral Dissertations
The topological minor and the minor relations are well-studied binary relations on the class of graphs. A natural weakening of the topological minor relation is an immersion. An immersion of a graph H into a graph G is a map that injects the vertex set of H into the vertex set of G such that edges between vertices of H are represented by pairwise-edge-disjoint paths of G. In this dissertation, we present two results: the first giving a set of unavoidable immersions of large 3-edge-connected graphs and the second on immersion intertwines of infinite graphs. These results, along with …
Templates For Representable Matroids, Kevin Manuel Grace
Templates For Representable Matroids, Kevin Manuel Grace
LSU Doctoral Dissertations
The matroid structure theory of Geelen, Gerards, and Whittle has led to a hypothesis that a highly connected member of a minor-closed class of matroids representable over a finite field is a mild modification (known as a perturbation) of a frame matroid, the dual of a frame matroid, or a matroid representable over a proper subfield. They introduced the notion of a template to describe these perturbations in more detail. In this dissertation, we determine these templates for various classes and use them to prove results about representability, extremal functions, and excluded minors.
Chapter 1 gives a brief introduction …
Two Results In Drawing Graphs On Surfaces, Joshua E. Fallon
Two Results In Drawing Graphs On Surfaces, Joshua E. Fallon
LSU Doctoral Dissertations
In this work we present results on crossing-critical graphs drawn on non-planar surfaces and results on edge-hamiltonicity of graphs on the Klein bottle. We first give an infinite family of graphs that are 2-crossing-critical on the projective plane. Using this result, we construct 2-crossing-critical graphs for each non-orientable surface. Next, we use 2-amalgamations to construct 2-crossing-critical graphs for each orientable surface other than the sphere. Finally, we contribute to the pursuit of characterizing 4-connected graphs that embed on the Klein bottle and fail to be edge-hamiltonian. We show that known 4-connected counterexamples to edge-hamiltonicity on the Klein bottle are hamiltonian …
Mixed Categories Of Sheaves On Toric Varieties, Sean Michael Taylor
Mixed Categories Of Sheaves On Toric Varieties, Sean Michael Taylor
LSU Doctoral Dissertations
In [BGS96], Beilinson, Ginzburg, and Soergel introduced the notion of mixed categories. This idea often underlies many interesting "Koszul dualities." In this paper, we produce a mixed derived category of constructible complexes (in the sense of [BGS96]) for any toric variety associated to a fan. Furthermore, we show that it comes equipped with a t-structure whose heart is a mixed version of the category of perverse sheaves. In chapters 2 and 3, we provide the necessary background. Chapter 2 concerns the categorical preliminaries, while chapter 3 gives the background geometry. This concerns both some basics of toric varieties as well …
On Structures Of Large Rooted Graphs, Shilin Wang
On Structures Of Large Rooted Graphs, Shilin Wang
LSU Doctoral Dissertations
A rooted graph is a pair (G,R), where G is a graph and R⊆V(G). There are two research topics in this thesis. One is about unavoidable substructures in sufficiently large rooted graphs. The other is about characterizations of rooted graphs excluding specific large graphs.
The first topic of this thesis is motivated by Ramsey Theorem, which states that K_n and ¯(K_n ) are unavoidable induced subgraphs in every sufficiently large graph. It is also motivated by a classical result of Oporowski, Oxley, and Thomas, which determines unavoidable large 3-connected minors. We first determine unavoidable induced subgraphs, and unavoidable subgraphs in …
The Graphs And Matroids Whose Only Odd Circuits Are Small, Kristen Nicole Wetzler
The Graphs And Matroids Whose Only Odd Circuits Are Small, Kristen Nicole Wetzler
LSU Doctoral Dissertations
This thesis is motivated by a graph-theoretical result of Maffray, which states that a 2-connected graph with no odd cycles exceeding length 3 is bipartite, is isomorphic to K_4, or is a collection of triangles glued together along a common edge. We first prove that a connected simple binary matroid M has no odd circuits other than triangles if and only if M is affine, M is M(K_4) or F_7, or M is the cycle matroid of a graph consisting of a collection of triangles glued together along a common edge. This result implies that a 2-connected loopless graph G …