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-WR-CALNAME:Claremont Center for the Mathematical Sciences
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: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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20200308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20201101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190402T121500
DTEND;TZID=America/Los_Angeles:20190402T131000
DTSTAMP:20260417T045927
CREATED:20190206T180617Z
LAST-MODIFIED:20190326T042503Z
UID:1196-1554207300-1554210600@colleges.claremont.edu
SUMMARY:Fibonacci and Lucas analogues of binomial coefficients and what they count (Curtis Bennett\, CSULB)
DESCRIPTION:A Fibonomial is what is obtained when you replace each term of the binomial coefficients $ {n \choose k}$ by the corresponding Fibonacci number.  For example\, the Fibonomial \n$${ 6\brace 3 } = \frac{F_6 \cdot F_5 \cdot \dots \cdot F_1}{(F_3\cdot F_2 \cdot F_1)(F_3\cdot F_2 \cdot F_1)} = \frac{8\cdot5\cdot3\cdot2\cdot1\cdot1}{(2\cdot1\cdot1)(2\cdot1\cdot1)} = 60$$ \nsince the first six Fibonacci numbers are 1\, 1\, 2\, 2\, 5\, and 8.  Curiously the Fibonomials are always integers\, raising the combinatorial question:  what do they count?  In this talk we introduce and provide a little history of the Fibonomials.  We then provide a simple object the Fibonomials enumerate.  We will use this new object to prove various Fibonomial analogues of standard identities on binomial coefficients and discuss further generalizations including the Lucanomials.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-curtis-bennett-csulb/
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:20190409T121500
DTEND;TZID=America/Los_Angeles:20190409T131000
DTSTAMP:20260417T045927
CREATED:20190123T071619Z
LAST-MODIFIED:20190402T034536Z
UID:1145-1554812100-1554815400@colleges.claremont.edu
SUMMARY:Matrix multiplication: the hunt for $\omega$ (Mark Huber\, CMC)
DESCRIPTION:For centuries finding the determinant of a matrix was considered to be something that took $\Theta(n^3)$ steps.  Only in 1969 did Strassen discover that there was a faster method.  In this talk I’ll discuss his finding\, how the Master Theorem for divide-and-conquer plays into it\, and how it was shown that finding determinants\, inverting matrices\, and Gaussian elimination are the same time complexity as to matrix multiplication.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-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:20190416T121500
DTEND;TZID=America/Los_Angeles:20190416T131000
DTSTAMP:20260417T045927
CREATED:20190123T071749Z
LAST-MODIFIED:20190408T231144Z
UID:1147-1555416900-1555420200@colleges.claremont.edu
SUMMARY:Chow rings of heavy/light Hassett spaces via tropical geometry (Dagan Karp\, HMC)
DESCRIPTION:In this talk\, I will try to give a fun introduction to tropical geometry and Hassett spaces\, and show how tropical geometry can be used to compute the Chow rings of Hassett spaces combinatorially. This is joint work with Siddarth Kannan and Shiyue Li.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-dagan-karp-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:20190423T121500
DTEND;TZID=America/Los_Angeles:20190423T131000
DTSTAMP:20260417T045927
CREATED:20190312T201357Z
LAST-MODIFIED:20190312T201357Z
UID:1273-1556021700-1556025000@colleges.claremont.edu
SUMMARY:Theory of vertex Ho-Lee-Schur graphs (Sin-Min Lee\, SJSU)
DESCRIPTION:A triple of natural numbers (a\,b\,c) is an S-set if a+b=c. I. Schur used the S-sets to show that for n >3\, there exists s(n) such that for prime p > s(n)\, x^p + y^p = z^p (mod p) has a nontrivial solution. A (p\,q)-graph G is said to be vertex Ho-Lee-Schur graph if there exists a bijection f: V(G) –> {1\,2\,…\,p} such that for each C3 subgraph of G with vertices {x\,y\,z} the triple (f(x)\,f(y)\,f(z)) is an S-set. The VHLS deficiency of G is the smallest k such that GU Nk\, where Nk is null graph\,  is a vertex Ho-Lee-Schur graph. We determine VHLS deficiency of some graphs and show that no Kuratowski type characterization of non-vertex Ho-Lee-Schur graphs. Some relation of integer partitions and this theory  is explored. We will also introduce some unsolved problems and invite the audience to  solve them.
URL:https://colleges.claremont.edu/ccms/event/theory-of-vertex-ho-lee-schur-graphs-sin-min-lee-sjsu/
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:20190430T121500
DTEND;TZID=America/Los_Angeles:20190430T131000
DTSTAMP:20260417T045927
CREATED:20190123T071945Z
LAST-MODIFIED:20190419T172528Z
UID:1149-1556626500-1556629800@colleges.claremont.edu
SUMMARY:What Did Ada Do? Digging into the Mathematical Work of Ada Lovelace (Gizem Karaali\, Pomona)
DESCRIPTION:Augusta Ada Byron King Lovelace (1815-1852) is today celebrated as the first computer programmer in history. This might be confusing to some because in 1852 there were no machines that looked like what we call computers today. In this talk I attempt to explain what Ada really did\, and delineate the mathematics involved. Bernoulli numbers will definitely come into play\, but there may also be other fun distractions along the way\, possibly including some juicy gossip about Ada’s life.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-gizem-karaali-pomona/
LOCATION:Millikan 2099\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR