Tuesday, 4:00–4:50pm, in Pearce 227.
|Date||Speaker||Title (click Title for Abstract or scroll down)|
|1/16/2017||C-Y. Jean Chan (CMU)||Organizational Meeting at PE 206D|
|1/23/2018||Tim Rey (Data Scientist, Paystr)||Paystr: A start up business with Analytics at it's Core|
|1/30/2018||No Seminar||No Seminar|
|2/6/2018||No Seminar||No Seminar|
|2/13/2018||No Seminar||No Seminar|
|2/20/2018||No Seminar||No Seminar|
|2/27/2018||Special Department Meeting (No Seminar)||No Seminar|
|3/6/2018||Spring Break||Spring Break|
|3/13/2018||Dr. Drew Swartz (Data Scientist, IRI)||A Chat about Data Science Careers|
|3/20/2018||Vladimir Vinogradov (Ohio University)||Department Colloquium|
|3/27/2018||Norma Saikali (CMU)||Application of Pick's Theorem to Ehrhart Theory|
|4/17/2018||Mohye Edden Salah Sweidan (CMU)||A Numerical Method for Two-point Value Problem with non-Fitting Mesh and Second Order Truncation Error|
Speaker: C-Y. Jean Chan (January 16)
Title: Organizational Meeting
Abstract: Students who registered MTH 693 for the current semester or are planning or interested in doing so should come to PE 206 D for the course policy and essential guidelines for the assignments. Notice that this meeting does not take place in the usual seminar room!!
Speaker: Tim Rey (January 23)
Title: Paystr: A start up business with Analytics at it's Core
Abstract: Paystr understands that entrepreneurs have valuable knowledge and experience operating in the global digital marketplace.
We're here to improve their efficiencies and help them capitalize in two areas: Content Management (helping them manage and present their product), and Network Management (helping them engage with potential customers).
Our proprietary technologies, MyMarket and FindEngine, are designed to help them accelerate their online business and fill in the gaps, maximizing their revenue potential. Leveraging external and internal data sources, along with Social Media, Paystr's FindEngine utilizes Cloud based Advanced Analytics methods to increase brand awareness and provide revenue growth.
Speaker: Drew Swartz (March 13)
Title: A Chat about Data Science Careers
Abstract: Data Science is one of the most popular careers in STEM today. But "data science" is also a relatively new term in society's lexicon, so you may be unfamiliar with what exactly a data scientist does. In this talk, I will shed some light on the much hyped field of data science, all from the perspective of a former academic mathematician. I will discuss my own career path from Ph.D. student to data scientist, technical trends in the field, and some parting career advice for those interested in making the leap to industry. I would like this to be a casual discussion, so please bring lots of questions!
Brief Bio: Dr. Drew Swartz is a data scientist with IRI, a market research firm based in Chicago. He holds a Ph.D. in mathematics from Purdue University, where his thesis work focused on partial differential equations.
Speaker: Vladimir Vinogradov (March 20)
Title: Department Colloquium
Abstract: Click here for Title and Abstract.
Speaker: Norma Saikali (March 27)
Title: Application of Pick's Theorem to Ehrhart Theory
Abstract: A French mathematician named Eugene Ehrhart in 1960s proved that the lattice point count of an integral convex $d$-polytope dilated by a factor $t$ is eventually a polynomial in $t$ of degree $d$. Naturally it is called the Ehrhart polynomial of the polytope. He also proved that the number of lattice points of a dilated convex polytope with rational vertices is a quasi- polynomial in $t$, and hence a periodic function. This is the origin of the Ehrhart Theory.
Pick's theorem determines a relation between the area of a 2-dimensional convex polygon P and the number of lattice points inside and on the boundary of P.
In fact, Pick's theorem can be a useful tool in computing the number of lattice points in a two or three-dimensional polygon with rational vertices.
In this talk, I will demonstrate an application of Pick's Theorem to the Ehrhart theory by utilizing GeoGebra to draw the shape of polygons, using Pick's theorem to compute the lattice points in the integral part of the shape, and then combining some combinatorics formulas to discover how this count changes beyond the integral part during dilation.
Speaker: Mohye Edden Salah Sweidan (April 17)
Title: A Numerical Method for Two-point Value Problem with non-Fitting Mesh and Second Order Truncation Error
Abstract: In this work, we analyze a second order accurate finite difference scheme for a two-point value problem, where the boundary points are not on the uniform mesh. The proposed scheme employs the standard central difference to approximate the second derivative for all mesh points away from the boundary. For the mesh points next to the boundary, the scheme utilizes four points: the boundary point and three nearest mesh points. The local truncation error is second order convergent. The main result of this work is that the proposed scheme is second order convergent. This is a joint work with Xiaoming Zheng.