I will explain how to apply presentations of algebras (together with some classical results from non-commutative algebra) to obtain some 5 polynomial invariants telling us when two pairs of 2x2 […]
As $\lambda$ runs through all integer partitions, the set of Schur functions $\{s_{\lambda}\}_\lambda$ forms a basis in the ring of symmetric functions. Hence the rule $$s_{\lambda}s_{\mu}=\sum c_{\lambda,\mu}^{\gamma} s_{\gamma}$$ makes sense […]
Suppose you are given a data set that can be viewed as a nonnegative integer-valued function defined on a finite set. A natural question to ask is whether the data […]
Davidson Lecture Hall, CMC
340 E 9th St, Claremont, CA, United States
The existence of a set $A\subset \N_0$ of positive upper Banach density such that $A-A:=\{m-n:m, n\in A, m>n\}$ does not contain a set of the form $S-S$ with $S$ a piecewise syndetic is in essence the content of a popular result due to K\v r\'{i}\v z in 1987. Since then at least four different proofs […]
Davidson Lecture Hall, CMC
340 E 9th St, Claremont, CA, United States
An arithmetical structure on a finite, connected graph G without loops is given by an assignment of positive integers to the vertices such that, at each vertex, the integer there is a divisor of the sum of the integers at adjacent vertices, counted with multiplicity if the graph is not simple. Alternatively, an arithmetical structure […]
Davidson Lecture Hall, CMC
340 E 9th St, Claremont, CA, United States
This talk discusses a puzzle called “Spinning Switches,” based on a problem popularized by Martin Gardner in his February 1979 column of “Mathematical Games". This puzzle can be generalized to a two-player game on a finite wreath products. This talk will provide a classification of several families of these generalized puzzles, including a full classification […]
Davidson Lecture Hall, CMC
340 E 9th St, Claremont, CA, United States
The slice rank polynomial method, motivated by groundbreaking work of Croot, Lev and Pach and refined by Tao, has opened the door to the resolution of many problems in extremal combinatorics. We survey these results and discuss contributions in several of the speaker's recent papers.
Davidson Lecture Hall, CMC
340 E 9th St, Claremont, CA, United States
Markov chains have become widely-used to generate random political districting plans. These random districting plans can be used to form a baseline for comparison, and any proposed districting plans that […]
Davidson Lecture Hall, CMC
340 E 9th St, Claremont, CA, United States
"A Tale of Two Cities" is a novel told in three books/parts. Here we describe three projects related both to published work and ongoing pieces: PROJECT 1: In the world […]
Davidson Lecture Hall, CMC
340 E 9th St, Claremont, CA, United States
Given a degree d polynomial f(x) in Q, consider the subset S_f of Q consisting of rational numbers t for which the translated polynomial f(x) - t factors completely in […]
This website stores cookies on your computer. These cookies are used to collect information about how you interact with our website and allow us to remember you. We use this information in order to improve and customize your browsing experience and for analytics and metrics about our visitors both on this website and other media.