Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/449451
Full metadata record
DC FieldValueLanguage
dc.coverage.spatial
dc.date.accessioned2023-01-19T04:41:47Z-
dc.date.available2023-01-19T04:41:47Z-
dc.identifier.urihttp://hdl.handle.net/10603/449451-
dc.description.abstractParking functions are multifaceted objects with applications in many areas of math- newlineematics. For a graph G on n + 1 vertices with a designated vertex as root, Postnikov and newlineShapiro associated a G-parking function ideal in the standard polynomial ring over a field newlinewith variables corresponding to the non-root vertices of G. The standard monomials of this newlineideal, given by the G-parking functions, are in bijective correspondence with the spanning newlinetree of G. Recently, Dochtermann introduced and investigated the k-skeleton ideals, which newlineare certain parameter-dependent subideals of the G-parking function ideal. We have studied newlinethe homological and combinatorial properties of these k-skeleton ideals. We have calculated newlineall the multigraded Betti numbers of k-skeleton ideals of complete graphs. We give alternative newlineproof for calculating the number of standard monomials of the k-skeleton ideal of complete newlinemultigraphs via Steck determinant evaluation. Dochtermann conjectured the existence of a newlinebijective correspondence between the set of the spherical parking functions of the complete newlinegraph and the set of uprooted trees on the vertex set {1, 2, . . . , n}, preserving degree and newlinesurface inversions. We have proved this conjecture. Our proof involves the use of a modified newlineversion of the depth-first-search algorithm. We also give an extension of this map for the case newlineof general simple graphs and show that this map is always an injection but not necessarily a newlinesurjection. For many classes of graphs, we explicitly describe the image of this extension map newlineand compute the cardinality of the associated set of spherical parking functions. Dochtermann newlinealso conjectured that for a simple graph, the number of standard monomials of the 1-skeleton newlineideal is bounded below by the determinant of the reduced signless Laplacian of the graph. newlineWe extended this conjecture in a general framework of positive semidefinite matrices over newlinenonnegative integers and obtained necessary and sufficient conditions for which the equality newlineholds newline
dc.format.extent
dc.languageEnglish
dc.relation
dc.rightsuniversity
dc.titleSkeleton ideals of graphs and their associated invariants
dc.title.alternative
dc.creator.researcherLather, Gargi
dc.subject.keyword
dc.subject.keywordMathematics
dc.subject.keywordPhysical Sciences
dc.subject.keywordStatistics and Probability
dc.description.note
dc.contributor.guidekumar, Chanchal
dc.publisher.placeMohali
dc.publisher.universityIndian Institute of Science Education and Research (IISER) Mohali
dc.publisher.institutionDepartment of Mathematical Sciences
dc.date.registered2015
dc.date.completed2022
dc.date.awarded2022
dc.format.dimensions
dc.format.accompanyingmaterialDVD
dc.source.universityUniversity
dc.type.degreePh.D.
Appears in Departments:Department of Mathematical Sciences

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File2.05 MBAdobe PDFView/Open
02_prelim pages.pdf2.14 MBAdobe PDFView/Open
03_content.pdf88.8 kBAdobe PDFView/Open
04_abstract.pdf51.1 kBAdobe PDFView/Open
05_chapter 1.pdf178.86 kBAdobe PDFView/Open
06_chapter 2.pdf236.07 kBAdobe PDFView/Open
07_chapter 3.pdf235.95 kBAdobe PDFView/Open
08_chapter 4.pdf302.93 kBAdobe PDFView/Open
09_chapter 5.pdf818.01 kBAdobe PDFView/Open
10_chapter 6.pdf156.81 kBAdobe PDFView/Open
11_chapter 7.pdf184.73 kBAdobe PDFView/Open
12_annexuers.pdf57.64 kBAdobe PDFView/Open
80_recommendation.pdf2.22 MBAdobe PDFView/Open


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: