On Sendov's Conjecture

dc.contributor.advisorAbi-Khuzam, Farouk
dc.contributor.authorFneish, Fatima
dc.contributor.commembersBertrand, Florian
dc.contributor.commembersDella Sala, Giuseppe
dc.contributor.degreeMS
dc.contributor.departmentDepartment of Mathematics
dc.contributor.facultyFaculty of Arts and Sciences
dc.contributor.institutionAmerican University of Beirut
dc.date2025
dc.date.accessioned2025-09-08T08:12:36Z
dc.date.available2025-09-08T08:12:36Z
dc.date.issued2025-09-07T21:00:00Z
dc.date.submitted2025-09-02T21:00:00Z
dc.description.abstractSendov's Conjecture states that if a complex polynomial of degree greater than or equal to two has all its zeros inside the closed unit disk, then each zero is at distance no more than one from at least one critical point. This conjecture is known for degree n<9, but only partial results are available for higher n. In 2020, Prof. Terence Tao proved this conjecture for sufficiently high degree polynomials in a singular contribution that departs from conventional approaches. This thesis studies his work after examining the existing ground of theorems that relate the zeros and critical points of complex polynomials.
dc.identifier.urihttp://hdl.handle.net/10938/35042
dc.language.isoen
dc.subject.lcshPolynomials
dc.subject.lcshFunctions of complex variables
dc.subject.lcshPotential theory (Mathematics)
dc.titleOn Sendov's Conjecture
dc.typeThesis
local.AUBID202371644

Files

Original bundle

Now showing 1 - 3 of 3
Loading...
Thumbnail Image
Name:
FneishFatima_2025.pdf
Size:
474.01 KB
Format:
Adobe Portable Document Format
Description:
Main Thesis
Loading...
Thumbnail Image
Name:
FneishFatima_ApprovalForm_2025.pdf
Size:
340.72 KB
Format:
Adobe Portable Document Format
Description:
Approval Form
Loading...
Thumbnail Image
Name:
FneishFatima_ReleaseForm_2025.pdf
Size:
602.06 KB
Format:
Adobe Portable Document Format
Description:
Release Form

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.65 KB
Format:
Item-specific license agreed upon to submission
Description: