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:20210314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20211107T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20220313T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20221106T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220920T121500
DTEND;TZID=America/Los_Angeles:20220920T131000
DTSTAMP:20260420T022433
CREATED:20220811T002022Z
LAST-MODIFIED:20220906T231455Z
UID:2780-1663676100-1663679400@colleges.claremont.edu
SUMMARY:Arithmetical structures (Luis Garcia Puente\, Colorado College)
DESCRIPTION: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 on G is a pair  of positive integer vectors (d\,r) such that  Mr = 0\, where M = diag(d) – A  is a square matrix whose diagonal entries are given by the vector d\, and whose off-diagonal elements are given by the negative adjacency matrix of G. Arithmetical structures were first introduced by Lorenzini in 1989; matrices of the form (diag(d) – A) arise in algebraic geometry as intersection matrices of degenerating curves.  However\, they also naturally appear in the context of algebraic graph theory as matrices of the form  (diag(d) – A)  generalize the Laplacian matrix of a graph.\n\nIn this talk\, I will give an introduction to the topic. We will discuss some combinatorial\, structural and computational aspects of arithmetical structures. In particular\, we will count the number of distinct arithmetical structures on certain graph families such as path\, cycle\, complete and bident graphs. For paths\, we will show that arithmetical structures are enumerated by the Catalan numbers. For cycles\, we prove that arithmetical structures are enumerated by the binomial coefficients C(2n-1\,n-1).  We will also discuss results about the associated critical group of an arithmetical structure\, i.e.\,  the cokernel of the matrix M.   This talk will be accessible to undergraduate students with some knowledge of linear algebra and discrete mathematics.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-luis-garcia-puente-colorado-college/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR