Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/28786
Title: Comparing invariants of toric ideals of bipartite graphs
Authors: Bhaskara, Kieran
Advisor: Van Tuyl, Adam
Department: Mathematics and Statistics
Keywords: Mathematics;Commutative algebra;Combinatorics;Graph theory
Publication Date: 2023
Abstract: Given a finite simple graph G, one can associate to G an ideal I_G, called the toric ideal of G. There are a number of algebraic invariants of ideals which are frequently studied in commutative algebra. In general, understanding these invariants is very difficult for arbitrary ideals. However, when the ideals are related to combinatorial objects, in this case, graphs, a deeper investigation can be conducted. If, in addition, the graph G is bipartite, even more can be said about these invariants. In this thesis, we explore a comparison of invariants of toric ideals of bipartite graphs. Our main result describes all possible values for the tuple (reg(K[E]/I_G), deg(h_{K[E]/I_G}), pdim(K[E]/I_G), depth(K[E]/I_G), dim(K[E]/I_G)) when G is a bipartite graph on n ≥ 1 vertices.
URI: http://hdl.handle.net/11375/28786
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File Description SizeFormat 
Bhaskara_Kieran_2023july_msc.pdf
Open Access
564.05 kBAdobe PDFView/Open
Show full item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue