USF Math Colloquium Archive 2010–Fall 2013

Fall 2013

  • Wednesday, December 4
    Pi Mu Epsilon Colloquium, featuring USF student research

    Title: Ranking NBA Players Using Linear Algebra
    Speaker: Milica Hadzi-Tanovic (Advisor: Professor Steve Devlin)
     
    Abstract: We introduce a network structure on NBA players where individuals are connected when they play against each other during a period of time in an NBA game. Using readily available play-by-play data, we  give weights to the network edges to allow for head-to-head comparisons between players based on in-game performance. Using this network structure, we formulate and solve a graph diffusion process to produce a ranking of players.  We then compare and contrast the diffusion ranking with existing player rankings such as Player Efficiency Rating and Adjusted Plus-Minus, as well as with similar network based ranking systems used in other contexts including the methods of Keener and Colley, and Google PageRank.
     
    Title: New Insights into Stock Returns through Clustering
    Speakers: Jared Rohe, Paul Hundal (Advisor: Professor David Uminsky)
    Abstract: Spectral clustering techniques use properties of the spectrum of the similarity matrix of a collection of data in order to reduce the dimensionality reduction. We apply spectral clustering techniques promulgated by Shi and Malik (2000), as well as other clustering techniques, to analyze the log-returns of the constituents of the Standard and Poor's 500 Index for the 2007-2013 period. We use two different measures to diagnose the number of clusters that are latent in the collection of stock returns. The resulting clusters are closely aligned with the sectors associated with the two-digit Standard Industrial Classification (SIC) codes maintained by the Occupational Safety and Health Administration.


  • Freedom for the Clones
    Zvezdelina Stankova (Mills College)
    Wednesday, November 13
    Abstract: The talk is based on a famous simple game with pebbles, rumored to have been proposed by a Russian teenager Maxim Kontsievitch for the Moscow Olympiads back in the 1980's. The game can be understood and played by anybody without any technical background. Yet, as we will see during the talk, solving the game will plunge us into the imaginative and creative realm of invariants, geometric series, and questioning whether it is possible to prove that something is impossible, as well as extensions of the game that involve the golden ratio and other problem-solving wonders. Meanwhile, the teenager Maxim grew into a world-famous mathematician, who won the most prestigious math award, the Fields Medal, partly for his research as faculty at UC Berkeley. No technical background is necessary for the talk: just bring your curiosity for the unknown and enthusiasm for discovering beautiful and powerful mathematics.
 

 

  • An Introduction to the Binomial Options Pricing Model
    Jeff Hamrick (USF)

    Wednesday, October 30, 2013
    Abstract: We aim to give an elementary introduction to the binomial options pricing model, which was first developed by Cox, Ross, and Rubinstein in 1979. In the process of pricing a simple contingent claim, we will connect the following ideas: the no-arbitrage condition, discounted risk-neutral expectations, and the replicating portfolio associated with a contingent claim. We will conclude the talk with a set of ideas: the extension of the binomial model to popular continuous-time models in finance, the valuation of exotic options, and the situation of this particular topic in the broader agenda of a typical upper-division elective in mathematical finance. We will also talk about graduate opportunities in mathematical finance (which is, distractingly, also called "financial engineering" or "financial mathematics").

  

  • Chromatic Numbers and Other Geometric Combinatorics Delights
    Tatiana Shubin
    (San Jose State University)

    Wednesday, October 16, 2013
    Abstract: Geometric combinatorics is a relatively new and rapidly growing branch of mathematics. It deals with geometric objects described by a finite set of building blocks, for example, the convex hulls of finite sets of points. Typically, problems in this area are concerned with finding bounds on a number of points or geometric figures that satisfy some conditions, or make a given configuration “optimal” in some sense.   Problems encountered within geometric combinatorics come in various forms; some are easy to state. Nevertheless, there are lots of problems that are extremely hard to solve, including a great many that remain open despite the efforts of some leading mathematicians.  In this talk, we’ll discuss some such problems, in particular, chromatic numbers of Euclidean spaces.  

 

  • An Introduction to Learning to Rank, with Applications to Predictive Policing
    George Mohler
    (Santa Clara University)
    Wednesday, October 2, 2013
    Abstract: In this talk we will give an introduction to "learning to rank" problems that often arise in information retrieval. A learning to rank problem might involve ranking the relevance of urls returned by a search engine or ranking potential movies for a person based upon their user history and demographics. We will discuss some of the basic building blocks of algorithm design such as data munging, constructing base learners, ensemble learning, and then show how these ideas can be applied to ranking crime hotspots in a city.
     
     
  • A Mathematician Displays Self Knowledge
    Jim Sauerberg
    (Saint Mary’s College)
    Wednesday, September 18, 2013

    Abstract: Completing the sentence  "This sentence contains exactly ___ e's, ___ i's, and ___ s's"  appears easy, until one realizes that putting "5" into the first blank is correct but not satisfactory, while putting in "five" is satisfactory but incorrect. We will look at the mathematics that arises from trying to find correct and satisfactory completions.

 

  • Generalized Barycentric Coordinates: An Introduction and an Application to Algebraic Geometry
    Corey Irving
    (Santa Clara University)
    Wednesday, September 04, 2013

    Abstract:  Barycentric coordinates allow one to express points of a polygon as convex combinations of the vertices.  For triangles these coordinates are uniquely defined and well-known.  However, for n-gons with n>3, they are not unique and less well-known.  These generalized barycentric coordinates are used in a variety of applications ranging from the finite element method in differential equations to computer animation.

    For the first part of the talk we discuss various ways to define barycentric coordinates for general n-gons.  The second part will focus on one type of barycentric coordinates, Wachspress coordinates, which are rational functions on the polygon, and we examine an algebraic variety they define.

 

 

 

Spring 2013

  • Math Career panel
    Wednesday, May 08, 2013

    Speakers:
    Keith Bailey has 18 years combined of actuarial consulting experience at Milliman, Fidelity Investments, and Buck Consultants, all in San Francisco. He became a fellow of the Society of Actuaries in 2005.

    Erik Lewis graduated with a Ph.D. in applied mathematics from UCLA in 2012 where he worked closely with the mathematical crime research group. Erik has returned to the Bay Area where he works at Kontagent as a Customer Success Manager/Data Scientist.

    Lindsay MacGarva is a 2011 USF graduate with a degree in mathematics. She is now completing her MA in education at USF while teaching mathematics at Stuart Hall High School in San Francisco.

    Dimitri Skjorshammer graduated from Harvey Mudd College in 2011 as a math major. He worked for a bit in finance, got bored, and cofounded ClassPager to help teachers understand students better. He is currently the CTO at ClassPager in San Francisco.

    Holly Toboni double majored in math and mechanical engineering at Santa Clara University. She then received an MS in statistics from the University of Maryland. Now Holly is senior manager of customer analytics at Williams-Sonoma here in San Francisco.
     

  • Patterns, Swarms, and the Unreasonable Effectiveness of Mathematics
    Speaker: Chad Topaz (Macalester College)
    Wednesday, April 24, 2013

    Abstract: From fish schools to zebra stripes to fluid waves, the world is full of patterns that form spontaneously. I will discuss natural pattern formation from the point of view of mathematical modeling, highlighting how minimal models can effectively -- and perhaps surprisingly -- describe real pattern-forming phenomena. As an extended example, I will discuss biological aggregations, which are arguably some of the most common and least understood patterns in nature. More specifically, I will present work performed with undergraduate students on modeling locust swarms with high-dimensional systems of nonlinear differential equations.

  • Natural Optimization: The Story of Farmer Ted
    Speaker: Matt DeLong (Taylor University)
    Wednesday, April 10, 2013
    Abstract
    :The problem of minimizing the perimeter of a rectangle of a given area is familiar to all introductory calculus students. Its solution was not at all natural, however, to Farmer Ted, a fictitious character introduced in a 1999 Mathematics Magazine article. Farmer Ted required integer solutions to his farming needs. Three articles in the Magazine (two by first-year undergraduate authors) used elementary number theory to help Farmer Ted do his business naturally and efficiently. In this talk I will share the mathematics of, as well as the story behind, these cute problems. I will also discuss some lessons learned from directing undergraduate research, and tell you why my Erdös number is not exactly four.

    Short bio: Matt is a visiting professor in the Department of Mathematics at Harvey Mudd College for 2012-2013, while on sabbatical from his roles as Professor of Mathematics and Fellow of the Center for Teaching and Learning Excellence at Taylor University, in Upland, IN. He is also one of the Associate Directors of the MAA’s Project NExT. Matt has a B.A. from Northwestern University and a Ph.D. from the University of Michigan. He was awarded the 2005 Alder Award and the 2012 Haimo Award for distinguished teaching from the MAA.

  • An Introduction to Surface Tension (Or Why Raindrops are Spherical)
    Speaker: Andrew Bernoff (Harvey Mudd College)
    Wednesday, March 20, 2013

    Abstract:  A common misconception is that raindrops take the form of teardrops.  In  fact, they tend to be nearly spherical due to surface tension forces.   This is an example of how at small scales the tendency of molecules to  adhere to each other is the dominant effect driving a fluid’s motion.   In this talk we will explain how surface tension arises from  intermolecular forces.  We will also examine some examples of the  behavior that can occur at small scales due to the balance between  fluid-fluid and fluid-solid forces, with applications as varied as  understanding how detergents help clean clothes to designing fuel tanks in zero gravity environments.

     

  • Are Umpires Racist?
    Speaker: Jeff Hamrick (USF)
    Wednesday, March 6, 2013
    Abstract
    : We investigate the racial preferences of Major League Baseball umpires as they evaluate both pitchers and hitters from 1989-2010, including the 2002-2006 period in which "QuesTec" electronic monitoring systems were installed in some ball parks. We find limited, and sometimes contradictory, evidence that umpires unduly favor or unjustly discriminate against players based on their race.

    Variables including attendance, terminal pitch, the absolute score differential, and the presence of monitoring systems do not consistently interact with umpire/pitcher and umpire/hitter racial combinations. Most evidence that would first appear to support racially-connected behaviors by umpires vanishes in three-way interaction models. Overall, in contrast with some other literature on this subject, our findings fall well short of convincing evidence for racial bias.

  • Why Nature Rarely Assembles into Spheres
    Speaker: David Uminsky (USF)

    Wednesday, February 20, 2013
    Abstract
    : Soap bubbles on their own naturally select a sphere as their preferred shape as it is the solution which best balances the desire to minimize surface area while capturing a fixed amount of volume. Despite their natural beauty Nature rarely selects empty shells, or spheres, as the preferred shape to assemble into, especially when particles to talk to one another do so over different length scales.

    Two notable exceptions are virus self assembly and the spontaneous assembly of macro-ions into super molecular spherical structures call "Blackberries." In this talk we will show how mathematics is just the right tool to explain this phenomena and help us predict when spheres will be the favored structure. The same tools will allow us to design nano particles to assemble into a variety of spherical patterns.
       
  •  
  • Tic-Tac-Toe and the Topology of Surfaces
    Speaker: Linda Green (Dominican University)
    Wednesday, February 06, 2013
    Abstract
    : Informally, two objects have the same topology if the first object can be deformed to look like the second by bending and stretching it, without making any violent changes like tearing or fusing. In this talk, we'll represent 2-dimensional surfaces as "gluing diagrams" of polygons whose edges are identified in pairs. We'll develop techniques to decide if two gluing diagrams represent surfaces with the same topology. By generalizing these ideas to 3-dimensional spaces, we can gain an understanding of possible shapes for the universe. Along the way, we'll build our intuition for unusual surfaces by playing familiar games like tic-tac-toe ... with a twist.

Fall 2012

  • Where does the railroad track go?
    Speaker:
    Shirley Yap
    (CSU - East Bay)
    Wednesday, November 14, 2012
    Abstract: Throughout history, artists have derived inspiration from mathematics. But mathematicians have also derived inspiration from art. In this talk, I will discuss a specific intersection of math and art that will help you see art in all its three-dimensional splendor.
     
  • Twin Peaks, Crater Lake, and Earthquakes : Interactive Multivariable Calculus and Linear Algebra on the Internet
    Speaker:
    Thomas Banchoff (Brown University)
    Friday, November 2, 2012
    Abstract: What happens to geographical landmarks when the ground under them shifts? Interactive computer graphics demonstrations and animations provide striking illustrations of examples from multivariable calculus and linear algebra, the two courses that naturally lead in to differential geometry of curves and surfaces. This talk will feature computer renditions of graphs of families of functions of two variables as well as parametric curves in the plane and in three-space, concentrating on changes in critical points and contour lines. Interactive demonstrations on the Internet will illustrate the presentation.
     
  • Japanese Ladders and the Braid Group
    Speaker:
    Michael Alloca (Saint Mary's College)
    Wednesday, October 17, 2012
    Abstract: Japanese Ladders are a visual technique used to construct a bijective map from a set to itself for purposes such as assigning grab bag gift rules. They also entail a very enjoyable puzzle game. We will briefly explore the rules of this game and slightly modified versions. We will also investigate the underlying mathematics, which leads to fascinating generalizations of permutations and of a well-known short exact sequence used with the braid group.
     
  • Gauss' Theorema Egregium and modern geometry
    Speaker: Lashi Bandara (visiting at Stanford University)
    Wednesday, September 26, 2012
    Abstract: In this talk, I will give a brief account the ideas of Gauss that led him to the Theorema Egregium, "Remarkable Theorem." I will then illustrate how Riemann looked upon these ideas as a seed which has now grown into the fruitful area known today as Riemannian geometry.
     
  • Two Parameter Families of Kernel Functions
    Speaker: Casey Bylund (USF)
    Wednesday, September 12, 2012
    Casey presented work she did as part of a Research Experience for Undergraduates (REU) over the summer of 2012.
     
  • Sampling of Operators
    Speaker:
    Goetz Pfander (Jacobs University)
    Wednesday, May 2, 2012
    Abstract: Sampling and reconstruction of functions is a central tool in science. A key result is given by the classical sampling theorem for bandlimited functions. We describe a recently developed sampling theory for operators. Our findings use geometric properties of so-called Gabor systems in finite dimensions. We shall briefly discuss these systems and include remarks on their potential use in the area of compressed sensing. Students with basic knowledge of calculus and linear algebra should be able to follow large portions of the talk.
     
  • The Art Gallery Theorem
    Speaker:
    Emille Lawrence (University of San Francisco)
    Wednesday, April 18, 2012
    Abstract: Suppose you own a one-room art gallery whose floor plan is a simple polygon. Given that your collection of art is quite valuable, suppose further that you would like to place cameras in your gallery so that every point in the space is visible to at least one of the cameras. Additionally, to cut down on the cost of your security system and to be as unintrusive as possible to the gallery guests, you'd like to install as few cameras as possible. How many cameras would you need, and where would you decide to place them? This question, known as the Art Gallery Problem, was first posed in 1973 by Victor Klee, and has been extended by mathematicians in many directions over the years. We will answer this question, and discuss a proof via a 3-coloring argument. We will also discuss some interesting related problems in computational geometry.
     
  • Applying Markov Chains to NFL Overtime
    Speaker:
    Chris Jones (St. Mary's College)
    Wednesday, March 21, 2012
    Abstract: The NFL recently changed its rules for games that go into overtime in the postseason. We will verify that the previous system provides a statistically significant bias to the team winning the toss and using Markov Chains we will show how the new rules appear to balance out that advantage. We will also look at other possible methods for deciding the winner in an overtime game that have been considered, and rejected.
     
  • The Graph Menagerie: Abstract Algebra meets the Mad Veterinarian
    Speaker:
    Gene Abrams (University of Colorado at Colorado Springs)
    Wednesday, March 7, 2012
    Abstract: Click here.
     
  • Groups with Cayley graph isomorphic to a cube
    Speaker:
    Rick Scott (Santa Clara University)
    Wednesday, December 7, 2011
    Abstract: Groups are algebraic objects that capture the notion of symmetry in mathematics. One way to study a group is from the geometric perspective of its Cayley Graph -- a collection of vertices and labeled edges that exhibits the symmetries of the group. In this talk we will consider groups whose Cayley graph is a cube. We will give a combinatorial characterization of these groups in terms of generators and relations and use it to describe a product decomposition. The talk with begin with a gentle introduction to groups and Cayley graphs, including definitions and lots of examples.
     
  • The Triumph of the One
    Speaker: Benjamin Wells (USF Emeritus)
    Friday, 11.11.11, at 1:11P.M.
    Abstract:
    This talk discusses some interesting coincidences involving the number 1. It is not numerology, for there is no interpretation or inferred meaning. It is not mathematics, for no deductions are feasible. It is not computer science, for nothing is computed or scientific. It is not philosophy or psychology, for nothing depends on reflection, introspection, association, or the lower mind. No special claim is made of divine intervention. But it is math and art.
     
  • Continued Fractions and Geometry
    Speaker:
    Paul Zeitz (University of San Francisco) (Also, he's on Wikipedia!)
    Wednesday, November 2, 2011
    Abstract: In this talk, we will look at a surprising connection between number theory and geometry that was discovered a few decades ago. There is a link between continued fractions, a topic in number theory, and hyperbolic geometry. The "glue" that links these two seemingly-unrelated subjects: complex numbers.
     
  • Shapes of spaces: 2- and 3-manifolds
    Speaker:
    Marion Campisi (The University of Texas at Austin)
    Wednesday, October 19, 2011
    Abstract: If you took off in a faster than light rocket-ship and flew in a straight line forever, what would happen? Would you hit the edge of the universe? Would you keep going forever, always getting further away from home? Is there another possibility? Could the answer to these questions give us any clues about the shape of the Universe?  While we do not know what the actual shape of the universe is, mathematicians have been able to determine possible shapes a 3-dimensional universe could have. Before we try to understand these shapes, called 3-manifolds, we will build our intuition by considering the perspective of beings living in 2-dimensional universes, or 2-manifolds. We will consider possible 2-manifolds and develop tools that a being living in such a space could use to distinguish them. Finally, we will develop a picture of several different 3-manifolds and consider if there is any way to know whether any of them might be the shape of our own universe.

     
  • Isoperimetric Inequalities
    Speaker:
    Ellen Veomett (Saint Mary's College)
    Wednesday, September 7, 2011
    Abstract: Suppose you had a closed loop, like a piece of string with both ends tied together. If someone asked you to place that loop on a sheet of paper so that it enclosed the largest possible area, what shape would you make? This kind of question gives rise to an isoperimetric inequality: an upper bound on the area of a set in the plane with fixed perimeter.  In this talk, we will discuss some very different types of isoperimetric inequalities. We will explore the Euclidean isoperimetric inequality, along with a geometric proof of that inequality using the Brunn-Minkowski Theorem. We will then consider a couple of discrete isoperimetric questions on two different but closely related graphs. We will see the interesting complications that arise when our graph has finitely many vertices, as opposed to infinitely many vertices.

  • Bennequin surfaces & links
    Speaker:
      Yi (Owen) Xie and Xuanchang (Carl) Liu
    When:  May 11, 2011, 3:45pm
    Where:  Harney Science Center, Room 232
    Abstract:  It's here.

 

  • The mathematics of Rubik's cube
    Speaker:
      Dr. Philip Matchett Wood (Stanford)
    When:  April 6, 2011, 4:00pm
    Where:  Harney Science Center, Room 127
    Abstract:  In the past 30 years, the Rubik's Cube has been one of the world's best selling toys and most engaging puzzles. This talk will aim to cover some of the mathematics that has been inspired by the Rubik's Cube. There are many mathematical questions one might ask, for example:
  • How many different configurations are there for a Rubik's Cube?
  • What is the hardest configuration to solve
  • What about generalizations of the Rubik's Cube?

    The talk will introduce the idea of a mathematical group along with ideas from algorithms and optimized computing.  The main goal will be a hands-on demonstration of how the mathematics of the Rubik's Cube can be applied to something that everone is interested in: having fun!

 
 

  • Noncomputable functions and undecidable sets
    Speaker:
      Dr. Russell Miller (Queens College – City University of New York)
    When:  March 30, 2011, 4:00pm
    Where:  Harney Science Center, Room 127
    Abstract:  Intuitively, a function f is computable if there is a computer program which, when given input n, runs and eventually stops and outputs f(n). This notion was made precise by Alan Turing, in his definition of the machines which came to be known as Turing machines. Without going too far into the formalism, we will investigate how one might arrive at such a definition, and how that definition can be used to show that a particular function cannot be computed by any such machine. Such a function is said to be noncomputable, and if the characteristic function of a set is noncomputable, then the set is undecidable.

  • The dynamics of group actions on the circle
    Speaker:
      Anne McCarthy (Fort Lewis College)
    When:  March 9, 2011, 4:00pm
    Where:  Harney Science Center, Room 127
    Abstract:  We will investigate how functions can be viewed as transformations of the circle. The basic notions of dynamical systems and group actions will be introduced. We will then give a classification of how one particular group acts on the circle by discussing the dynamics of the actions. Lots of pictures and examples will be provided.

  • The curious mascot of the fusion project — Meditations on Flexing, Dualizing Polyhedra
    Speaker:
      Dr. Benjamin Wells (USF)
    When:  February 15, 2011, 4:30pm
    Where:  Harney Science Center, Room 127
    Abstract:  The Fusion Project (FP) is a research program at the University of San Francisco that seeks to bring 7th grade math classes to the art of the de Young Museum (and vice versa). We also have our eye on the opportunities of new media for teaching middle school math. The Hoberman Switch-Pitch™ is the project’s mascot (I looked it up—it can be an object!). After an introduction to FP, we’ll explore the static and dynamic symmetry of this curious, ancient shape. We’ll also visit with other wild shapes in and out of cages.

  • Eigencircles of 2x2 matrices
    Speaker:  Graham Farr (Monash University)
    When:  January 27, 2011, 4:30pm
    Where:  Harney Science Center, Room 127
    Abstract:  An Eigenvalue of a square matrix A is a number k such that Ax = kx for some nonzero vector x, and the corresponding x is called its Eigenvector. Eigenvalues and Eigenvectors have applications throughout mathematics and science. We show how to associate, to any 2-by-2 matrix A, a circle (the
    Eigencircle) that can be used to illustrate and prove many properties of Eigenvalues and Eigenvectors using well-known results from classical geometry.


     

Past talks (2010)

  • The History of “Gaussian” Elimination
    Speaker:
      Joseph Grcar
    When:  November 17, 2010, 4pm
    Where: Harney Science Center, Room 232 
    Abstract:  Gaussian elimination is universally known as “the” method for solving simultaneous linear equations. As Leonhard Euler remarked in 1771, it is “the most natural way” of proceeding. The method was invented in China about 2000 years ago, and then it was reinvented in Europe in the 17th century, so it is surprising that the primary European sources have not been identified until now. It is an interesting story in the history of computing and technology that Carl Friedrich Gauss came to be mistakenly identified as the inventor of Gaussian elimination even though he was not born until 1777.
     
    The European development has three phases. First came the “schoolbook” method that began with algebra lessons written by Isaac Newton; what we learn in high school or precalculus algebra is still basically Newton's creation. Second were methods that professional hand computers used to solve the normal equations of least squares problems; until comparatively recently the chief societal use for Guassian elimination was to solve normal equations for statistical estimation. Third was the adoption of matrix notation in the middle of the last century; henceforth the schoolbook lesson and the professional algorithms were understood to be related in that all can be interpreted as computing triangular decompositions.

  • Making sports as fun doing your taxes: How statistical analysis is used to build teams, plan for opponents and give fans more to argue about
    Speaker:
     Benjamin Alamar (Menlo College, Director of Basketball Analytics and Research at Oklahoma City Thunder)
    When: October 20, 2010, 4pm
    Where: Harney Science Center, Room 232
    Abstract:  As soon as sports are invented, statistics are created to help us understand who won and how well each team/individual played. Coaches, managers and fans have gotten used to discussing their sports within the context of certain numbers, but the numbers that are most frequently discussed are often misleading or incomplete. Good statistical analysis can help process the data that is available in more informative ways and suggest which types of information would be most useful to begin to collect.
     
    With each new advance in the field of sports statistics, however, comes further push-back from groups of fans and executives that do not see the utility of the new analysis. This sets up the additional challenge for the sports statistician of not only pioneering new techniques, but effectively communicating their analysis to the relevant audience, so that the work is not wasted. When communicated effectively though, advanced statistical analysis is used regularly in the front offices and coaching rooms of MLB, the NBA and the NFL.
     
     
  • Matroids as a theory of independence
    Speaker:
     Federico Ardila (San Francisco State University)
    When: October 6, 2010, 4pm
    Where: Harney Science Center, Room 232
    Abstract:
      Consider the following three questions:
    • If each person in a town makes a list of people that they are willing to marry, what is the largest possible number of marriages that could take place?
    • Let a=x2+y2, b=x3+y3, and c=x5+y5. Is there a polynomial equation with constant coefficients satisfied by a, b, and c?
    • How do we build the cheapest road system connecting all the cities in a country, if we know the cost of building a road between any two cities?

    To answer these questions, mathematicians in very different areas were led to the discovery of "matroids". My talk will give a brief introduction to these objects.
     

  • Quaternion numbers: history and applications
    Speaker:
     Alon Amit (Facebook, Inc.)
    When: September 23, 2010, 4pm
    Where: Harney Science Center, Room 232
    Abstract: Quaternions are a strange and wonderful system of numbers which includes, but vastly extends, the complex numbers. Complex numbers correspond to pairs of real numbers, and so to points in the plane; the quaternions correspond to quadruples of real numbers and to points in 4-dimensional space. We will talk about why and how they were discovered (this has to do with physics), why we have a number system in 2 and 4 but not 3 dimensions (this has to do with topology) and what they are good for (this has to do with number theory and computer animation).
     
  • A knotty problem
    Speaker:
     Radmila Sazdanovic (MSRI)
    When: April 14, 2010, 4pm
    Where: Harney 232
    Abstract: We will define knots and talk about tools (invariants) mathematicians use to better understand and distinguish knots, which is a very knotty and still open problem. Therefore, mathematicians keep inventing better and better invariants: starting with numerical ones, such as the unknotting number or 3-colorings, through polynomials all the way to most recent, homology theories. This heavy mathematical machinery can be used outside mathematics: in physics, quantum computing, DNA studies and protein folding.
     
  • Unsolvability in mathematics
    Speaker: Jennifer Chubb (USF)
    When: March 31, 2010, 4pm
    Where: Cowell Hall, Room 413
    Abstract: David Hilbert said that in mathematics, "there is no ignorabimus," and, in a way, he was right (though not in the way he'd hoped). If a problem is solvable, we should be able work out a solution, and if it's not, well, then we should be able to prove that. If we want to show a problem is solvable, we know what to do... find the solution! Showing that a problem is unsolvable is trickier. One way is to show that being able to solve that problem would make it possible for us to solve another problem that's already known to be unsolvable. We will discuss the Alan Turing's Halting Problem and see why it is unsolvable. With this example in hand, we will discuss other famous problems, including Hilbert's 10th Problem, and see their connections to the Halting Problem.
     
  • Finding a Classical Needle in a Quantum Haystack: An introduction to quantum algorithms
    Speaker: Michael Nathanson (Dept. of Mathematics and Computer Science, St. Mary's College of California)
    When: February 24, 2010, 4:30pm
    Where: Harney, Room 510
    Abstract: Quantum computing attempts to redesign hardware at the atomic scale to take advantage of the strange effects of quantum mechanics, and there are growing numbers of physicists, computer scientists, and mathematicians who work on these problems. It has been shown that, in theory, a quantum computer could accomplish certain tasks (such as factoring) much faster than the best-known algorithms for classical computers. This talk will introduce quantum computing by exploring the quantum search algorithm. The algorithm is beautifully geometric and can be visualized in a plane. Since the search problem is well understood, it is easy to compare the efficiency of the quantum algorithm against the best possible classical one.