Skip to Main Content
Sign In
Visit Apply Give

Archive : Hallenbeck Grad Student Seminar

Image Picker for Section 0

 

 

Emily Bergman, Hasan Eruslu, Navid MirzaeiEmily Bergman, Hasan Eruslu, Navid MirzaeiZoomTitle:How to get the Hell out of here? <br><br> Abstract: Are you wondering how to find a job after your PhD? Do you not know how to finish your thesis and get the Hell out of here? Join us on April 8th when we will talk about our experience of finishing the PhD and applying for academic, government and industrial jobs.4/8/2020 5:30:00 PM4/8/2020 6:30:00 PMFalse
Emily BergmanEmily BergmanZoomTitle:Hermite's Criterion, the Pandemic of Algebra: Seemingly Simple, but Actually Dangerous <br><br> Abstract: I will outline some of the recent development regarding classifying planar monomials in fields of specific orders. We try to extend this proof using Hermite's criterion. This method is used to help determine if a polynomial is a permutation polynomial. It seems simple, but is it? 4/1/2020 5:30:00 PM4/1/2020 6:30:00 PMFalse
Melissa FuentesMelissa FuentesEwing 336Title: The Maximum Number of q-Colorings of Graphs With Fixed Numbers of Vertices and Edges <br><br> Abstract: For a positive integer q, let P_G(q) denote the total number of proper q-colorings of a simple graph G. We will discuss an old problem by Linial and Wilf, to find the graphs with n vertices and m edges which maximize P_G(q). The problem has been completely solved for q = 2, but the answer is still unknown for q ≥ 3 and general n, m. In 2007, Lazebnik conjectured that among all graphs with n vertices and the same number of edges as the r-partite Turan graph, T_r(n), the graph T_r(n) has the most number of q-colorings for all q ≥ r. Several cases of the conjecture have been solved for specific ranges of q and r. We will focus our attention to the case when r = 2 and q ≥ 5 is odd. 3/18/2020 5:30:00 PM3/18/2020 6:30:00 PMFalse
Hansen PeiHansen PeiEwing 336Title: The Crossing Case Problem in Modeling Karlotoxin's Influence <br><br> Abstract: Karlotoxin, emitted by a predator species, is known to slow down its prey. Previously we have modeled the toxin's influence under the static assumption and a simple case under a moving reference frame when the prey speed s(x) is always higher than the predator speed s0. For this talk we will present how we build a ground-up analytical solution for the prey's population density for the steady state in the much more challenging crossing case when s(x) crosses with s0 in a periodic domain.3/11/2020 5:30:00 PM3/11/2020 6:30:00 PMFalse

Page Settings and MetaData:
(Not Shown on the Page)
Page Settings
Archive
No
MetaData for Search Engine Optimization
Archive
<a target='_blank' href='/Lists/CalendarHallenbeckGradStudentSeminar/calendar.aspx' class='ms-promotedActionButton'> <span style='font-size:16px;margin-right:5px;position:relative;top:2px;' class='fa fa-pencil-square-o'></span><span class='ms-promotedActionButton-text'>EDIT CALENDAR</span> </a> WebPartEditorsOnly
  • Department of Mathematical Sciences
  • University of Delaware
  • 501 Ewing Hall
  • Newark, DE 19716, USA
  • Phone: 302-831-2653
  • math-questions@udel.edu