Warning: Unknown: Unable to allocate memory for pool. in Unknown on line 0

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/index.php on line 15

Warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 395

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/sites/default/settings.php on line 94

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 1111

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 1123

Warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/database.inc on line 146

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/database.mysql.inc on line 15

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 1127

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 1141

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 1155

Warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 1177

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 1183

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/common.inc on line 2665

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/common.inc on line 2666

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/common.inc on line 2667

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/common.inc on line 2668

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/common.inc on line 2669

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/common.inc on line 2670

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/common.inc on line 2671

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/common.inc on line 2672

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/common.inc on line 2673

Warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/common.inc on line 2674
Mathematics Colloquium Schedule | Department of Mathematics and Statistics

Mathematics Colloquium Schedule

  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/bootstrap.inc on line 690.
  • warning: include_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/theme.inc on line 155.
  • warning: include(): Unable to allocate memory for pool. in /webtree/depts/math/includes/theme.inc on line 1066.
  • warning: include(): Unable to allocate memory for pool. in /webtree/depts/math/includes/theme.inc on line 1066.
  • warning: include(): Unable to allocate memory for pool. in /webtree/depts/math/includes/theme.inc on line 1066.
  • warning: include(): Unable to allocate memory for pool. in /webtree/depts/math/includes/theme.inc on line 1066.
  • warning: include(): Unable to allocate memory for pool. in /webtree/depts/math/includes/theme.inc on line 1066.
  • warning: require_once(): Unable to allocate memory for pool. in /webtree/depts/math/includes/module.inc on line 274.

Fall 2014

 

Date 12-5-2014 (12pm-1pm, F03-200A), Dr. Konstantina Trivisa, University of Maryland

Title: TBD

Abstract: TBD

Date 11-14-2014 (12pm-1pm, F03-200A), Dr. Scott Crass, CSULB

Title: Dynamics of a soccer ball

Abstract: Exploiting the symmetry of the regular icosahedron, Peter Doyle and Curt McMullen constructed a solution to the quintic equation. Their algorithm relied on the dynamics of a certain icosahedrally-symmetric map for which one of the icosahedron's special orbits consists of superattracting periodic points. In this talk, we'll consider the question of whether there are maps with icosahedral symmetry with superattracting periodic points at a 60-point orbit. The investigation leads to the discovery of two maps whose superattracting sets are configurations of points that are respectively related to a soccer ball and a companion structure. It happens that a generic 60-point attractor provides for the extraction of all five of a quintic's roots.

Date 11-7-2014 (12pm-1pm, F03-200A), Dr. Mehrdad Aliasgari, CSULB

Title: Secure Computation and its Applications

Abstract: Cryptography is often described as the science of securing information in transit. However, with recent developments in computing, there is a need to provide data security in new settings. Cloud storage and cloud computing are examples of new security challenges. Secure Multiparty Computation (SMC) is when parties wish to jointly compute a function on their private input while maintaining privacy of their inputs. In this talk, we focus on cryptographic techniques that enable us to achieve security in SMC and we discuss some of their applications.

Date 10-17-2014 (12pm-1pm, F03-200A), Dr. Diane Hoffoss, University of San Diego

Title: How Wide is a 3-Manifold?

Abstract: In this talk, we will discuss some interesting ways to define the width of a 3-manifold, and we'll consider what relationships (if any!) these various definitions might have with one another.

Date 10-10-2014 (11:15am-12:15pm, F03-200A), Dr. Dominique Zosso, UCLA

Title: Variational image segmentation with dynamic artifact detection and bias correction

Abstract: Region-based image segmentation has essentially been solved by the famous Chan-Vese model. However, this model fails when images are affected by artifacts (scars, scratches, outliers) and illumination bias that outweigh the actual image contrast. Here, we introduce a new model for segmenting such damaged images: First, we introduce a dynamic artifact class X which prevents intensity outliers from skewing the segmentation. Second, in Retinex-fashion, we decompose the image into a flattened piecewise-constant structural, and a smooth bias part, I=B+S. The CV-segmentation terms are then only acting on the structure part, and only in regions not identified as artifact. We devise an efficient alternate direction minimization scheme involving averaging for S, thresholding for X, time-split MBO-like threshold dynamics for the perimeter TV-term, and spectral solutions for the bias B.

Date 10-3-2014 (12noon-1pm, F03-200A), Dr. Blake Hunter, Claremont McKenna College

Title: Topic Point Processes

Abstract: The widespread use of social media has created a need for automated extraction of useful information making detection of trends. This is essential to gain knowledge from the vastly diverse massive volume of data. This talk explores topic modeling and self-exciting time series models applied to social media microblog data. We use topic modeling and compressed sensing to discover prevalent topics and latent thematic word associations with in topics. Modeling tweet topics over time as temporal or spatial-temporal Hawkes process allows identification of self-exciting topics and reveals relationships between topics. This talk looks at applications to Twitter microblogs, text mining, image processing and content based search.

Date 9-26-2014 (3pm-4pm, F03-200A), Dr. Matt Rathbun, CSUF

Title: Knots, Fiber Surfaces, and the Building Blocks of Life

Abstract: DNA encodes the instructions used in the development and functioning of all living organisms. The DNA molecule, however, often becomes knotted, linked, and generally entangled during normal biological processes like replication and recombination. The subject of Knot Theory, correspondingly, can inform our understanding of these processes. I will introduce Knot Theory, and some of the myriad of tools that mathematicians use to understand knots and links. In particular, I will focus on a special class of link called fibered links. I will explain some recent results, joint with Dorothy Buck, Kai Ishihara, and Koya Shimokawa, about transformations from one fibered link to another, and explain how these results are relevant to microbiology.

Date 9-19-2014 (12pm-1pm, F03-200A), Dr. Ryan Compton , HRL

Title: Geotagging One Hundred Million Twitter Accounts with Total Variation Minimization

Abstract: Geographically annotated social media is extremely valuable for modern information retrieval. However, when researchers can only access publicly-visible data, one quickly finds that social media users rarely publish location information. In this work, we provide a method which can geolocate the overwhelming majority of active Twitter users, independent of their location sharing preferences, using only publicly-visible Twitter data.

Our method infers an unknown user's location by examining their friend's locations. We frame the geotagging problem as an optimization over a social network with a total variation-based objective and provide a scalable and distributed algorithm for its solution. Furthermore, we show how a robust estimate of the geographic dispersion of each user's ego network can be used as a per-user accuracy measure, allowing us to discard poor location inferences and control the overall error of our approach.

Leave-many-out evaluation shows that our method is able to infer location for 101,846,236 Twitter users at a median error of 6.33 km, allowing us to geotag over 80% of public tweets.

Date 9-12-2014 (12pm-1pm, F03-200A), Professor Ko Honda, UCLA

Title: An invitation to Floer homology

Abstract: This is a gentle introduction to Floer homology. ``Floer homology'' is a generic term for various homology theories of knots, 3- and 4-dimensional manifolds (aka spaces), symplectic manifolds, contact manifolds, etc., and has had an enormous impact in geometry/topology since its introduction by Floer more than twenty years ago. In this talk we start with a baby version of this theory called Morse homology, which gives a way to distinguish topological spaces (e.g., a sphere from the surface of a donut). We then build our way up to more recent theories such as contact homology and embedded contact homology.