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:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20270314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20271107T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260417T110000
DTEND;TZID=America/Los_Angeles:20260417T121500
DTSTAMP:20260419T144050
CREATED:20260110T235143Z
LAST-MODIFIED:20260416T002939Z
UID:3956-1776423600-1776428100@colleges.claremont.edu
SUMMARY:CCMS Colloquium: Ryan Moruzzi (CSU Northridge)
DESCRIPTION:CCMS Colloquium invites you to a talk by Ryan Moruzzi (CSU Northridge)\n\n \nTitle:  Exploring Leaky Forcing Through Hopi Rectangle graphs\n \nAbstract:  Leaky forcing\, introduced in 2019\, is a graph-coloring process motivated by questions of network monitoring\, in which the loss of information can hinder propagation through a graph. As a variant of standard zero forcing\, leaky forcing has opened new directions in the study of zero forcing and related graph parameters. In this talk\, based on joint work with students\, we will collaboratively investigate the leaky forcing number for several graphs before focusing on a family of graphs called Hopi Rectangles. By viewing these graphs as induced subgraphs of d-dimensional grid graphs\, we classify their leaky forcing numbers. Time permitting\, we will conclude by discussing the maximum nullity of this graph family and its connection to standard zero forcing.\n \nBio: I am a husband\, father\, sports enthusiast\, and mathematician who enjoys spending time with my family and the energy of sports. I earned my B.S. in Mathematics from Cal Poly Pomona and my Ph.D. in Mathematics from the University of California\, Riverside\, where I specialized in representation theory. My research interests lie in combinatorics\, discrete mathematics\, and linear algebra\, with particular emphasis on the inverse eigenvalue problem of a graph\, zero forcing and its variations\, throttling\, and propagation time on graphs. I also care deeply about teaching and mentorship\, and as an educator I am committed to fostering equity and inclusion by working intentionally to remove barriers that limit student success.
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-6/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
END:VCALENDAR