The 11th annual Princeton University Mathematics Competition is barely a month away! As one of the largest math competitions for high school students in the world, we attract hundreds of students to Princeton to engage in a day-long adventure in mathematics. The main website for the event is here.
As a student-run event, we are always looking for volunteers to help out!
Date: November 19th (Saturday)
Time: 9 am – noon, but we would also appreciate extra volunteers for the afternoon
Perks: FREE (yummy) breakfast, FREE (catered) lunch, FREE (sexy) t-shirt
If you are interested in helping out, you can contact email@example.com. Additionally, if you are interested in helping test-solve, you can contact firstname.lastname@example.org.
You may have heard of Hamlet by William Shakespeare. BUT have you heard of Ham-set by Jerry Shakespeare? Jerry Shakespeare, who looks resounding similar to his brother and also apparently had very similar dialogue in his stories, is a newly discovered gem. Come discover the newly uncovered, six-hundred year old manuscript in its truest form this Tuesday!
Who: Prof. Jerry Wang
What: To Square or Not to Square
When: 5:00 PM — 6:00 PM, Tuesday, 10/18
Where: Fine 110
Abstract: I will be speaking about my two research areas on rational points on hyperelliptic curves and squarefree sieve of discriminants.
Welcome back to campus! Hope everyone had a great summer.
Our first Board Game Night of the year will be this Friday!
Time: 9-12 PM, Friday, September 18, 2015
Place: Fine Common Room
Come hang out and enjoy a leisurely night playing board games and eating delicious snacks. There will be pizza!
Principia is officially accepting submissions! Visit our brand new website at www.pumj.org to view submission guidelines.
We are also looking for advertisers! More information can be found here:
Principia announcement on webpage of Princeton’s Office of Undergraduate Research:
What: info session on applying to graduate schools.
Where: Fine common room
When: Friday 5/9, 3:30pm (a.k.a. tea time!)
Seniors: If you can make it, please let me know! We will are mainly be sharing our experiences with the application process.
Non-seniors: If you’re interested at all in applying to graduate school, you should come and learn from our experiences. Bring questions!
Princeton University Press gave us a bunch of new books! They’re on the shelf in Fine Hall Common Room. Feel free to check them out! Please keep them in the Common Room though!
We will be having a colloquium this coming Wednesday at 5 pm in Fine 214. The speaker will be Prof. Gang Tian who specializes in geometric analysis. Check out his profile/wikipedia page here: http://en.wikipedia.org/wiki/Gang_Tian
The title of the talk will be “Conic spherical metrics”. Here is the abstract:
I will discuss the problem of constructing spherical structures on 2-sphere with prescribed conic angles and its connection to geometric stability. In the end, I will briefly discuss higher dimensional analogue of this problem.
Hope to see you there!
The next colloquium will be this coming Monday, 4/28, given by Prof. Yakov Sinai. It will be at 5pm in Fine 322. He will be talking about deterministic chaos and here is the abstract:
Deterministic chaos is a property of deterministic dynamics. I shall explain main properties of chaotic dynamics and give some example of chaotic dynamical systems.
Prof. Sinai is known for his work in dynamic systems. As many of you may have heard, he received the Abel Prize, which is often described as the mathematician’s Nobel Prize, not long ago. Check out his wikipedia page if you are interested!http://en.wikipedia.org/wiki/Yakov_Sinai
When: 4:30 pm – 5:30 pm, April 23
Who: Prof. Schapire, who is a professor in the department of Computer Science and specializes in theoretical and applied machine learning.
Title: How to Play Repeated Games
This talk will describe a simple, general algorithm for learning to play any matrix game against an unknown adversary. The algorithm can be shown never to perform much worse than the best fixed strategy, even if selected in hindsight. Moreover, because of the algorithm's moderate resource requirements, it can be used even when working with extremely large game matrices. Taken together, these properties make the algorithm a good fit for a range of machine-learning applications, some of which will be discussed, for instance, to the problem of learning to imitate the behavior of an "expert" while attempting simultaneously to improve on the expert's performance.