Archive for the ‘Talks’ Category

Cofactor Genomics

April 17, 2012

This week, we have a guest speaker: Ian Schillebeeckx. He is a recent SLU Math/CS graduate and computational scientist who will be talking to us about Cofactor Genomics: a study in de novo assembly of Spider Dragline Silk Genes.

He will talk about a project he is actively working on that involves sequencing spider silk genes. He ran some in silico simulations and did research to formulate an application of next-generation sequencing techniques for discovery experiments. This is sure to be a fascinating talk!

You are welcome to join us in the Ritter Hall Lobby from 4-5 on Wednesday! Refreshments will be provided.


Art & Randomness

April 11, 2012

The SLU Math & CS Club will meet again tomorrow, Wednesday, April 11th. Dr. Clair will be running a workshop at the art museum next week so he’ll show us some of what he’s going to present. We will be making art using random processes!

Please join us in the Ritter Hall Lobby from 4-5. Light refreshments will be provided.

The Mathematical Music of Bell Towers

March 28, 2012

Later today Daniel Bossaller, a mathematics graduate student at SLU, will talk about change ringing.

Change ringing is the historic method of ringing different arrangements of some number of bells without repetition (subject to 4 rules). After developing the mathematics of these rules, we’ll do an example of one method of ringing six bells.

Join us in the Ritter Hall Lobby from 4:00pm to 5:00pm to enjoy refreshments and an interesting talk.

Aperiodic tilings

March 20, 2012

This week, we will be looking at APERIODIC TILINGS! Most tiles can cover the plane (or your floor) in simple ways that repeat themselves. Led by our very own Dr. Clair, we’ll investigate some tiles (and sets of tiles) that tile without repetitions, such as the Penrose kite and dart tiles.

Join us in the Ritter Hall lobby on Wednesday from 4-5! Refreshments will be provided!

Hundred Prisoners Problem

March 6, 2012

One hundred prisoners are offered a deal: Their names are placed into 100 jars, and if each prisoner can find their own name, they will go free.

The catch? They go one at a time, and cannot change the jars or communicate after each turn. Each prisoner is only allowed to look in 50 jars.

Come to Math/CS club for a surprising discussion, led by Dr. Bryan Clair, involving permutations and the harmonic series! We will meet in the lobby of Ritter Hall this Wednesday, from 4-5. Light refreshments will be provided

QR Codes: A Wealth of Information

February 6, 2012


This Wednesday, (Feb. 8.), Michael Schade, a SLU undergrad, will give a talk about QR codes like the one you see above. Bring your camera-enabled smart device if you have one–if you’d like to come prepared, you can find a reader for your device at

QR Card Us

As always, we’ll meet in the lobby of Ritter Hall from 4:00pm to 5:00pm to enjoy refreshments and math!

Polygonal Foldings and the Fold-and-Cut Theorem

February 1, 2012

I like turtles

This Wednesday, we will be joined by SLU’s own KYLE SYKES. Kyle is a grad student who will talk about Polygonal Foldings and the Fold-and-Cut Theorem!

Abstract. The field of Discrete and Computational Geometry has many awesome applications and many accessible problems that are just asking to be solved! We will look at several of the open problems related to polygonal folding (and polyhedral unfoldings!). What is polygonal folding you might ask? Come and find out! We’ll get our hands dirty with making polyhedra from scratch and demonstrate one of the most mindblowing theorems in the field, the Fold and Cut Theorem!

We will be meeting in the lobby of Ritter Hall from 4-5. You will be amazed at the refreshments we will provide especially for you!

Last Fall 2011 Meeting!

December 4, 2011

NGA Logo

The last meeting of the Fall 2011 semester of the SLU Mathematics and Computer Science Club will be this Wednesday, December 7th.

Rob Anderson from the National Geospatial-Intelligence Agency will speak about careers within the NGA. He will also talk about joint research projects the NGA has begun recently with SLU.

We will meet in Ritter Hall 142 from 4:00pm to 5:00pm. As always, light refreshments will be provided!

Orbifolds, Eigenvalues, and Google

November 28, 2011

Dr. Dan Edidin from the University of Missouri will visit SLU on Wednesday, November 30 from 4:00 pm to 5:00 pm in the lobby of Ritter Hall.

He will give an endearing personal account of how he was able to solve a research problem using a variety of tools: abstract thinking, computer calculations, and even a Google search. The goal of the talk is to illustrate the different ways mathematicians do research in the internet age.

Dr. Edidin will also discuss the graduate program in mathematics at the University of Missouri.

Quantum Computing

November 15, 2011

The theory of quantum computing was first introduced by Richard Feynman. A quantum computer exploits the particle-wave duality of matter and energy to perform operations on data. Quantum properties are used to represent data and to manipulate that data. Quantum computers can solve certain problems much faster than traditional computers. The foundation of a quantum computer is the qubit, which has the encoded quantum properties of an atom. This is fundamentally different from a traditional computer, which uses bits to store data.

Professor David Wisbey of SLU’s Department of Physics will talk on Wednesday 11/16 at 4:00pm in the Ritter Hall Lobby about quantum computers and the physical challenges in building them.