Beran’s tests of uniformity for discrete data (Michael Orrison, HMC)
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 […]
12 events found.
Algebra / Number Theory / Combinatorics Seminar
Events
-
-
On Zoom
-
-
Monodromy groups of Belyi Lattes maps (Edray Goins, Pomona College)
Estella 1021 (Emmy Noether Room), Pomona College Claremont, CA, United StatesAn elliptic curve $ E: y^2 + a_1 \, x \, y + a_3 \, y = x^3 + a_2 \, x^2 + a_1 \, x + a_6 $ is […]
-
Kriz’s theorem via dynamics of linear operators (Yunied Puig de Dios, CMC)
Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United StatesThe 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 […]
-
Arithmetical structures (Luis Garcia Puente, Colorado College)
Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United StatesAn 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 […]
-
Spinning switches on a wreath product (Peter Kagey, HMC)
Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United StatesThis 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 […]
-
-
Recent developments on the slice rank polynomial method with applications (Mohamed Omar, HMC)
Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United StatesThe 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 […]
-
On the geometry of lattice extensions (Max Forst, CGU)
Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United StatesGiven a lattice L, an extension of L is a lattice M of strictly greater rank so that L is equal to the intersection of the subspace spanned by L […]
-
Properties of redistricting Markov chains (Sarah Cannon, CMC)
Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United StatesMarkov 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 differ significantly from this baseline can be flagged as potentially gerrymandered. However, very little is rigorously known about these Markov chains - Are they irreducible? […]
-
-
A tale of two worlds: parking functions & reduction algebras (Dwight Anderson Williams II, Pomona)
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 of combinatorics, parking functions are combinatorial objects arising from the situation of parking cars under a parking strategy. In this part of the talk, we […]
-
Factoring translates of polynomials (Arvind Suresh, University of Arizona – Tucson)
Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United StatesGiven 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 […]
-
Minimal Mahler measure in number fields (Kate Petersen, University of Minnesota Duluth)
Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United StatesThe Mahler measure of a polynomial is the modulus of its leading term multiplied by the moduli of all roots outside the unit circle. The Mahler measure of an algebraic […]
-
Partial orders on standard Young tableaux( Gizem Karaali, Pomona)
On ZoomYoung diagrams are all possible arrangements of n boxes into rows and columns, with the number of boxes in each subsequent row weakly decreasing. For a partition λ of n, […]