BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv6.15.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://colleges.claremont.edu/ccms
X-WR-CALDESC:Events for Claremont Center for the Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20170312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20171105T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20180311T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20181104T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20190310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20191103T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20181106T121500
DTEND;TZID=America/Los_Angeles:20181106T131000
DTSTAMP:20260417T083906
CREATED:20180911T214141Z
LAST-MODIFIED:20181102T201125Z
UID:537-1541506500-1541509800@colleges.claremont.edu
SUMMARY:Turning probability into polynomials (Mark Huber\, CMC)
DESCRIPTION:Moment generating functions (Laplace transforms) are a means for transforming probability problems into problems involving polynomials.  Here I will concentrate on the binomial distribution\, and use the mgf to link this distributions probabilities directly to the binomial theorem.  The mgf is also a key ingredient in Chernoff bounds\, which give upper bounds on the tail probabilities of binomial distributions (aka partial sums of the binomial theorem).  By employing the method of smoothing and tilting\, it is possible to attain bounds on the tails that go down faster than the traditional approximation heuristic that uses the Central Limit Theorem.
URL:https://colleges.claremont.edu/ccms/event/talk-by-mark-huber-cmc/
LOCATION:Millikan 2099\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20181113T121500
DTEND;TZID=America/Los_Angeles:20181113T131000
DTSTAMP:20260417T083906
CREATED:20180912T174329Z
LAST-MODIFIED:20181105T225953Z
UID:551-1542111300-1542114600@colleges.claremont.edu
SUMMARY:Cayley digraphs of matrix rings over finite fields (Yesim Demiroglu\, HMC)
DESCRIPTION:In this talk we use the unit-graphs and the special unit-digraphs on matrix rings to show that every n x n nonzero matrix over F_q can be written as a sum of two SL_n-matrices when n>1. We compute the eigenvalues of these graphs in terms of Kloosterman sums and study their spectral properties; and prove that if X is a subset of Mat_2 (F_q) with size |X| > (2 q^3 \sqrt{q})/(q – 1)\, then X contains at least two distinct matrices whose difference has determinant $\alpha$ for any $\alpha \in F_q^*$. Using this result we also prove a sum-product type result: if $A\,B\,C\,D \subseteq F_q$ satisfy $\sqrt[4]{|A||B||C||D|}= \Omega (q^{0.75})$ as q tends to infinity\, then $(A – B)(C – D)$ equals all of $F_q$. In particular\, if A is a subset of F_q with cardinality $|A| > \frac{3}{2} q^{3/4}$\, then the subset $(A – A) (A – A)$ equals all of $F_q$. We also recover a classical result: every element in any finite ring of odd order can be written as the sum of two units. This talk should be accessible to undergraduates with some background in linear algebra.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-by-yesim-demiroglu-hmc/
LOCATION:Millikan 2099\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20181127T121500
DTEND;TZID=America/Los_Angeles:20181127T131000
DTSTAMP:20260417T083906
CREATED:20181002T061007Z
LAST-MODIFIED:20190115T082646Z
UID:892-1543320900-1543324200@colleges.claremont.edu
SUMMARY:Weil sums of binomials: properties and applications (Daniel Katz\, CSUN)
DESCRIPTION:We consider sums in which an additive character of a finite field F is applied to a binomial whose individual terms (monomials) become permutations of F when regarded as functions.  These Weil sums characterize the nonlinearity of power permutations of interest in cryptography.  They also tell us about the correlation of linear recursive sequences over finite fields that are used in digital communications and remote sensing.  In these applications\, one is interested in the spectrum of Weil sum values that are obtained as the coefficients in the binomial are varied.  We discuss topics of enduring interest: Archimedean and non-Archimedean bounds on the sums\, the number of values in the spectrum\, and the presence or absence of zero in the spectrum.  We indicate some important open problems and discuss progress that has been made on them.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-talk-by-daniel-katz-csun/
LOCATION:Millikan 2099\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR