An organizational meeting for this semester's "Number Theory Learning Seminar will take place on Thursday September 3 at 4:00 PM in CGU’s Burkle Hall, Room 24. The Seminar is geared […]
35 events found.
Events
Calendar of Events
|
Sunday
|
Monday
|
Tuesday
|
Wednesday
|
Thursday
|
Friday
|
Saturday
|
|---|---|---|---|---|---|---|
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
1 event, |
0 events,
|
1 event,
-
This GEMS session will be facilitated by Professor Qidi Peng and William Wu from Claremont Graduate University. Title: How to create a die if you only have a coin? Abstract: Imagine you […] |
|
0 events,
|
0 events,
|
1 event,
-
Given a polynomial defined over a field $K$, you can build an extension of $K_\infty / K$ by adjoining inverse images of some point $\alpha \in K$. The behavior of […] |
1 event,
-
This poster session is meant to showcase undergraduate and graduate work in the mathematical sciences, broadly interpreted, in a supportive environment. The poster session will take place at Claremont Graduate […] |
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
1 event,
-
In multi-armed trials, adaptive designs are a popular way to increase estimation efficiency or identify optimal treatments. Many recent papers have proposed adaptive methods for minimizing the error of unbiased […] |
1 event,
-
Kloosterman sums are explicit exponential sums which occur in several contexts in number theory and arithmetic geometry. Bessel functions encode a great deal of representation-theoretic information about finite groups of […] |
1 event,
-
Abstract: Edge ideals of graphs provide a fertile ground for uncovering combinatorial expressions for algebraic invariants of squarefree monomial ideals. Many algebraic invariants of these edge ideals directly reflect combinatorial properties of their underlying graphs. In this talk, I will discuss how the independence polynomial P_G(x), the generating function for independent sets of a graph G, […] |
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
1 event,
-
A Belyĭ pair \bigl( S,\, z(w) \bigr) is a compact, connected Riemann surface S together with a rational function z \colon S \to \mathbb{P}^1(\mathbb{C}) which has at most three critical values […] |
2 events,
-
The unique minimal generating set for a semigroup of lattice points in an n-dimensional polyhedral cone is called its Hilbert basis. In the case when the cone is spanned by […]
-
Speaker: Sam Nelson (CMC) Title: Permutation Jones Polynomials Abstract: The Jones Polynomial is an important invariant of knots with applications in physics, quantum computation and more. In this talk I will introduce a family of generalizations of the Jones polynomial associated to permutations of finite sets and discuss their properties. _______ We especially welcome all […] |
1 event,
-
Flyer for Kim's talk. Abstract: The logistic map is one of the most famous examples in dynamical systems. Originally introduced as a simple model of population growth, it exhibits a […] |
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
1 event,
-
A wide variety of medical imaging methods exist for research and diagnostic procedures on the Central Nervous System (CNS), among them Magnetic Resonance Imaging (MRI) and Optical Imaging. Mathematical modeling […] |
2 events,
-
Extremal graph theory asks how many edges a graph can have while avoiding a given substructure. We will begin with a brief, accessible introduction to this area, before turning to […]
-
Speaker: Helen Wong (CMC) Title: Introduction to the colored Jones polynomial Abstract: This is a learning seminar. We will present an accessible definition of the colored Jones polynomial for knots and links and discuss the Volume Conjecture, which relates the colored Jones polynomial of K with the volume of its complement S^3 \K. _______ We […] |
1 event,
-
Abstract: Stable Khovanov homology Kh(T(n, \infty)) is an algebraic limit of the Khovanov homology groups of torus links T(n, k) on a fixed number of strands n, when more and […] |
0 events,
|
0 events,
|
1 event,
-
This GEMS session will be facilitated by Professor Chiu-Yen Kao from Claremont McKenna College. Title: The Magic of 0s and 1s Abstract: Have you ever wondered how data in a computer is stored? In this talk, we'll crack open the binary numeral system, the simple code of 0s and 1s that represents everything on your […] |