Have you ever considered being a seismologist?

Date: October 18, 2018
Speaker: Josh Russell
Title: Have you ever considered being a seismologist?

Abstract: Seismology is the perfect mix of complex wave mechanics, high performance computing, and fieldwork. Geophysicists travel the world to exotic places deploying instruments to monitor Earth’s physical processes such as volcanoes, active faults, and even glaciers. For my current research, I study seismic waves that travel through Earth’s mantle and are recorded by seismometers on the seafloor. We use these signals to create images of Earth’s mantle miles below the surface, similar to a CAT scan, to better understand the elastic properties and dynamic processes of Earth’s tectonic plates and the underlying asthenosphere. My experiences as an IRIS and RESESS intern were crucial in my decision to pursue a PhD in the Earth Sciences. If you enjoy physics and computer programming and are excited by the idea of working outdoors, then geophysics might be for you!

Cooperation in the Iterated Prisoner’s Dilemma

Date: October 11, 2018
Speaker: Dr. Johann Thiel
Title: Cooperation in the Iterated Prisoner’s Dilemma

Abstract: Suppose that two bank robbers are caught by the police after a heist. They are placed into separate rooms with no means of communication and given two options: confess to the crime, or blame the other person. If both robbers confess, the judge will be merciful and each will be given a 2-year sentence. If both blame the each other, they will be each be given a harsher 5-year sentence. If one confesses and the other does not, the one that confesses will get a 10-year sentence and the other one will go free. If you were in this situation, what would you do? This is known as the Prisoner’s Dilemma.

The Prisoner’s Dilemma is an interesting game that suggests that a rational individual’s best option is to avoid cooperating with others, even though it may cause more harm. While this game may be completely analyzed when played once, what happens if the game is played repeatedly by two individuals? Is there a strategy to improve one’s overall performance? Can this give rise to cooperation? We will examine this Iterated Prisoner’s Dilemma with some computer simulations.

Decision Trees

Date: September 20, 2018
Speaker: Dr. Johann Thiel
Title: Decision Trees

Abstract: Suppose you have 5 pieces of fruit whose size, color, and label (the type of fruit it is) are known. Given the size and color of an unlabeled piece of fruit, is it possible to classify it given our previous observations? How sure can we be that we are right? This is a kind of classification problem.

Decision trees (used in machine learning) can be used to help with these types of problems. In this talk we will discuss how to construct a decision tree by hand and how to use the scikit-learn python module to create decision trees for larger data sets.

Faculty Presentations for SIAM meeting

Date: September 13, 2018
Speakers: Carlly Simeon, Dr. Nadia Benakli, Dr. Johann Thiel, Dr. Jonathan Natov
Title: N/A
Abstract:

This meeting will feature faculty presentations on the following topics:
• Welcome to Applied Mathematics and STEM Majors
• Services provided by the Professional Development Center
• Internship Information and opportunities
• Differential-Equations competition opportunity
• When 7=4?

“A 2-Dimensional Model for Ice and Alternating Sign Matrices” by Ezra Halleck

 

Date: April 26, 2018
Speaker: Dr. Ezra Halleck (NYCCT)
Title: A 2-Dimensional Model for Ice and Alternating Sign Matrices
Abstract: In the later part of the 20th century, physicists developed the Ising and Potts models for ice and interacting spins on a crystalline lattice. Mathematicians noticed connections to several constructs, including the alternating sign matrices illustrated above. There was much interest on the growth of these objects as the size increased. A conjecture on an exact count for a given size quickly arose. Finding a proof was a hot problem for years, with many discrete mathematicians adding pieces towards its proof. Doron Zielberger put in the final piece in 1995.
This picture-rich and proof-light treatment will begin with the bijection between the model and the matrix illustrated above but then focus on enumerative aspects of the matrix class. There will be several hands-on activities.

“Statistical Mechanics and Combinatorics” by Ezra Halleck

Date: April 19, 2018
Speaker: Dr. Ezra Halleck (NYCCT)
Title: Statistical Mechanics and Combinatorics
Abstract: In this picture-rich and proof-light treatment, I will begin with the connections between the 2 subjects but focus on enumerative and bijective aspects. One example is tiling using dimers. Another is a model of ice, again in a plane. There will be several hands-on activities as well as recursive programming examples in MATLAB, Python and R.

“The science of machine learning” by Viviana Acquaviva

Date: March 29, 2018
Speaker: Dr. Viviana Acquaviva (NYCCT)
Title: The science of machine learning
Abstract: Machine learning is the discipline of teaching computers to recognize, classify and predict relationships within data. It has countless applications in the most diverse fields: it can be used to generate to recommend movies and articles, to generate poems in the style of Shakespeare, to accelerate diagnoses of dangerous diseases, to prevent insurance fraud, to improve system security, and many other endeavors. At their core though, machine learning algorithms are just a set of clever mathematical tools that allow us to re-map complicated questions onto simpler optimization problems. We discuss our ID course, Machine Learning for Physics and Astronomy, in which we use data sets from Physics and Astronomy and Python programming to learn machine learning from the ground up. We present a selection of algorithms to solve challenges such as discovering new elementary particles, finding dark energy, identifying variable stars, and understanding the origin of galaxy shapes.

“Roulette Wheel Betting” by Johann Thiel

Date: March 22, 2018

Speaker: Johann Thiel

Title: Roulette Wheel Betting

Abstract: A typical American roulette wheel has 38 different pockets. Two are colored green while the other 36 are split evenly between black and red. One way to bet on the roulette wheel is to bet on the color (black or red) of the next spin. The payout for this kind of bet is 1-to-1.

If we start out with $30 and want to try to double our money (or lose it all trying), what betting strategies can help improve our odds? What does this have to do with matrices? We will try to answer these questions and more in this introductory talk.

“Numbers: Real vs Imaginary” by Arthur Kramer

Date: March 15, 2018

Speaker: Arthur Kramer

Title: Numbers: Real vs Imaginary

Abstract: Imaginary numbers are as “real” as real numbers. Many of the greatest minds did not fully accept imaginary numbers as “real” mathematical quantities. It took a brilliant engineer to see in them as an elegant application to solving the problems of ac electricity. Such is the story with many scientific discoveries. Prof. Kramer will explore numbers and the evolution of imaginary numbers, the intriguing history surrounding them and their eventual acceptance as a “real” number system by the scientific community.

“Is the product of any k many consecutive integers always divisible by k factorial?” by Thomas Johnstone

Date: March  8, 2018
Speaker: Dr. Thomas Johnstone (NYCCT)
Title: Is the product of any k many consecutive integers always divisible by k factorial?
Abstract: Recall that “k factorial” is defined as the product of all integers between 1 and k, inclusive. There are many examples when the product of k many consecutive integers is divisible by k factorial. For instance, if k=5, then the product of the five consecutive integers 12, 13, 14, 15, 16 is divisible by five factorial: indeed, 12*13*14*15*16=524160, which is divisible by 1*2*3*4*5=120.
In this talk, we will answer the question whether the product of k many consecutive integers is always divisible by k factorial. While this question can be answered using combinatorial arguments, we shall rely on elementary number-theoretic arguments such as basic divisibility rules only.

Professor Johnstone explains the divisibility of factorials.