Phd Researcher
DGA Structures on Minimal Free Resolutions of Binomial Edge Ideals of Complete Graphs.PhD Thesis authored by Peter Phelan. Supervised by Prof. Emil Sköldberg - (Currently awaiting Viva).• Employed a method algebraic Morse theory to prove the existence of a DGA structure on the minimal free resolution of the initial ideal of the binomial edge ideal of a complete graph.• Wrote Python code implemented in SageMath to compute products and differentials of elements in the DGAs… Show more DGA Structures on Minimal Free Resolutions of Binomial Edge Ideals of Complete Graphs.PhD Thesis authored by Peter Phelan. Supervised by Prof. Emil Sköldberg - (Currently awaiting Viva).• Employed a method algebraic Morse theory to prove the existence of a DGA structure on the minimal free resolution of the initial ideal of the binomial edge ideal of a complete graph.• Wrote Python code implemented in SageMath to compute products and differentials of elements in the DGAs explicitly.• Proved the non-existence of a DGA structure on the minimal free resolution of the binomial edge ideals of complete graphs with five or more vertices when the ground field has characteristic 2 or 3. Proof was aided by computations carried out using Python.Parity Binomial Edge Ideals with Pure Resolutions.Research Article authored by Peter Phelan. Supervised by Prof. Emil Sköldberg.• Employed a method of induced subgraphs, and a method of long exact Tor sequences to determine graded Betti numbers of parity binomial edge ideals.• Proved that if the parity binomial edge ideal of a simple connected graph has a pure resolution, then the graph must be bipartite or an odd cycle.• Proved that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a complete bipartite graph, or a disjoint union of paths and odd cycles. Show less