BEGIN:VCALENDAR VERSION:2.0 PRODID:-// - ECPv6.16.3//NONSGML v1.0//EN CALSCALE:GREGORIAN METHOD:PUBLISH X-ORIGINAL-URL:https://aarms.math.ca X-WR-CALDESC:Events for REFRESH-INTERVAL;VALUE=DURATION:PT1H X-Robots-Tag:noindex X-PUBLISHED-TTL:PT1H BEGIN:VTIMEZONE TZID:UTC BEGIN:STANDARD TZOFFSETFROM:+0000 TZOFFSETTO:+0000 TZNAME:UTC DTSTART:20210101T000000 END:STANDARD END:VTIMEZONE BEGIN:VTIMEZONE TZID:America/Halifax BEGIN:DAYLIGHT TZOFFSETFROM:-0400 TZOFFSETTO:-0300 TZNAME:ADT DTSTART:20220313T060000 END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:-0300 TZOFFSETTO:-0400 TZNAME:AST DTSTART:20221106T050000 END:STANDARD BEGIN:DAYLIGHT TZOFFSETFROM:-0400 TZOFFSETTO:-0300 TZNAME:ADT DTSTART:20230312T060000 END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:-0300 TZOFFSETTO:-0400 TZNAME:AST DTSTART:20231105T050000 END:STANDARD BEGIN:DAYLIGHT TZOFFSETFROM:-0400 TZOFFSETTO:-0300 TZNAME:ADT DTSTART:20240310T060000 END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:-0300 TZOFFSETTO:-0400 TZNAME:AST DTSTART:20241103T050000 END:STANDARD END:VTIMEZONE BEGIN:VEVENT DTSTART;VALUE=DATE:20230727 DTEND;VALUE=DATE:20230801 DTSTAMP:20260611T181741 CREATED:20230712T231020Z LAST-MODIFIED:20230712T231020Z UID:7244-1690416000-1690847999@aarms.math.ca SUMMARY:Bridges Halifax 2023 DESCRIPTION:This conference is the premier international\, interdisciplinary conference connecting mathematics and art. The goal of the Bridges meetings is to foster research\, practice\, and new interest in mathematical connections to art\, music\, architecture\, education and culture. All too often\, mathematics can seem disconnected from or even antithetical to these other topics. We believe that mathematics and art can inform and enrich each other\, that there are great ideas waiting to be found in the mathematical analysis of art\, and that artistic thinking and activities can enliven what we understand about mathematics. \nThe Bridges conference brings together an interdisciplinary group of mathematicians\, scientists\, engineers\, artists\, educators\, musicians\, writers\, computer scientists\, sculptors\, dancers\, weavers\, model builders and many others in an atmosphere of mutual exchange and inspiration. \n  URL:https://aarms.math.ca/event/bridges-halifax-2023/ LOCATION:Dalhousie University\, Halifax\, Nova Scotia\, Canada CATEGORIES:AARMS workshops and conferences END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20230711 DTEND;VALUE=DATE:20230715 DTSTAMP:20260611T181741 CREATED:20230204T180025Z LAST-MODIFIED:20230204T180025Z UID:7064-1689033600-1689379199@aarms.math.ca SUMMARY:29th Workshop on Logic\, Language\, Information and Computation DESCRIPTION:WoLLIC is an annual international forum on inter-disciplinary research involving formal logic\, computing and programming theory\, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The 29th WoLLIC will be held at Dalhousie University in Halifax\, Nova Scotia\, Canada\, July 11–14\, 2023. The conference typically covers the following topics: foundations of computing\, programming and Artificial Intelligence (AI); novel computation models and paradigms; broad notions of proof and belief; proof mining\, type theory\, effective learnability and explainable AI; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs\, actions and resources; foundational aspects of information organization\, search\, flow\, sharing\, and protection; foundations of mathematics; philosophical logic; philosophy of language. URL:https://aarms.math.ca/event/29th-workshop-on-logic-language-information-and-computation/ LOCATION:Dalhousie University\, Halifax\, Nova Scotia\, Canada CATEGORIES:AARMS sponsored events ORGANIZER;CN="Peter Selinger":MAILTO:Peter.Selinger@Dal.Ca END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20230710 DTEND;VALUE=DATE:20230715 DTSTAMP:20260611T181741 CREATED:20230204T182700Z LAST-MODIFIED:20230204T182700Z UID:7084-1688947200-1689379199@aarms.math.ca SUMMARY:Junior Math and Computer Science Camp DESCRIPTION:This week-long day camp is an opportunity for students entering grades 5 or 6 in the Annapolis Valley to participate in fun and enriching science-based activities with Acadia faculty and students to develop their curiosity and enjoyment of math and computer science. It represents an important piece of a multi-year plan to develop the science skills of young students in the Annapolis Valley by bringing young students into the Acadia University outreach program. This will begin the process of positively engaging students with math and computer science at a critical time in their education. Bursaries are provided for those who qualify for financial assistance. URL:https://aarms.math.ca/event/junior-math-and-computer-science-camp-3/ LOCATION:Acadia University\, Wolfville\, Nova Scotia\, Canada CATEGORIES:AARMS outreach events ORGANIZER;CN="Caroline Cochran":MAILTO:caroline.cochran@acadiau.ca END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20230616 DTEND;VALUE=DATE:20230619 DTSTAMP:20260611T181741 CREATED:20230204T180250Z LAST-MODIFIED:20230204T180250Z UID:7066-1686873600-1687132799@aarms.math.ca SUMMARY:Theory Canada 15 DESCRIPTION:Theory Canada is an annual meeting which brings together Canadian theorists from across the country in order to foster collaborations and exchange of ideas across the disciplines of theoretical physics. It is organized by the Division of Theoretical Physics of the Canadian Association of Physicists (CAP). Theory Canada 15 will be held at Mount Allison University from June 16-18\, 2023\, just before the main CAP meeting which will be in Fredericton. URL:https://aarms.math.ca/event/theory-canada-15/ LOCATION:Mount Allison University\, Sackville\, New Brunswick\, Canada CATEGORIES:AARMS sponsored events END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20230605 DTEND;VALUE=DATE:20230609 DTSTAMP:20260611T181741 CREATED:20230204T181459Z LAST-MODIFIED:20230204T181459Z UID:7076-1685923200-1686268799@aarms.math.ca SUMMARY:Canadian Discrete and Algorithmic Mathematics conference DESCRIPTION:The Canadian Discrete and Algorithmic Mathematics (CanaDAM) is the pre-eminent conference in its area in Canada. It has been\nheld every two years since its founding in 2009. The general topic of the conference is the theory and application of\ndiscrete structures; the goal is to highlight the most salient trends in the field. CanaDAM will bring together researchers\nfrom the various disciplines with which discrete and algorithmic mathematics interact. Particular areas of interest include\ngraphs and digraphs\, hypergraphs\, matroids\, ordered sets\, designs\, coding theory\, enumeration\, combinatorics of words\,\ndiscrete optimization\, discrete and computational geometry\, lattice point enumeration\, combinatorial algorithms\,\ncomputational complexity\, and applications of discrete and algorithmic mathematics\, such as web graphs\, computational\nbiology\, telecommunication networks\, and information processing. CanaDAM strongly encourages participation from students and\npostdocs. We hope to see you there! URL:https://aarms.math.ca/event/canadian-discrete-and-algorithmic-mathematics-conference/ LOCATION:Winnipeg\, Manitoba\, Canada CATEGORIES:AARMS sponsored events ORGANIZER;CN="Mike Newman":MAILTO:mnewman@uottawa.ca END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20230510 DTEND;VALUE=DATE:20230512 DTSTAMP:20260611T181741 CREATED:20230204T181142Z LAST-MODIFIED:20230326T100317Z UID:7073-1683676800-1683849599@aarms.math.ca SUMMARY:East Coast Combinatorics Conference 2023 DESCRIPTION:The East Coast Combinatorics Conference is a 2-day annual event that brings together researchers in graph theory\, design theory\, and other areas of combinatorics. There will be two plenary speakers\, and a number of contributed talks\, in addition to opportunities for collaboration. The event brings together established researchers and those in the early stages of their academic careers and provides opportunities for subsequent collaborative research projects. We encourage participation by students since they greatly benefit from the opportunity to meet and interact with their peers across the region\, as well as to hear about the many and varied research interests of faculty. URL:https://aarms.math.ca/event/east-coast-combinatorics-conference-2023/ LOCATION:Acadia University\, Wolfville\, Nova Scotia\, Canada CATEGORIES:AARMS workshops and conferences ORGANIZER;CN="Nancy Clarke":MAILTO:nancy.clarke@acadiau.ca END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20230501 DTEND;VALUE=DATE:20230506 DTSTAMP:20260611T181741 CREATED:20230204T171542Z LAST-MODIFIED:20230206T104959Z UID:7060-1682899200-1683331199@aarms.math.ca SUMMARY:Topological Quantum Field Theory Spring School DESCRIPTION:Topological Quantum Field Theory lives at the intersection of category theory\, algebraic topology\, representation theory\, and theoretical physics. Physically\, TQFTs describe and control the symmetries of quantum systems\, including quantum symmetries\, anomalous symmetries\, and higher-form symmetries. Mathematically\, TQFTs provide a dictionary between manifold topology and structures in representation theory\, and as such allow computations and results to move between these separate fields. This school\, aimed at math PhD students from Atlantic Canada\, will consist of three 5-hour minicourses related to TQFTs\, plus problem sessions and discussion time; students are expected to be familiar with the basic language of category theory\, but are not expected to have any specialized knowledge in the field. The minicourses will be: Factorization Algebras (Araminta Amabel); Spectral Sequences (Arun Debray); Fusion Categories (Colleen Delaney). URL:https://aarms.math.ca/event/topological-quantum-field-theory-spring-school/ LOCATION:Old Orchard Inn and Conference Centre\, 153 Greenwich Road S.\, Wolfville\, Nova Scotia\, Canada CATEGORIES:AARMS sponsored events ORGANIZER;CN="Theo Johnson-Freyd":MAILTO:theojf@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=America/Halifax:20230331T160000 DTEND;TZID=America/Halifax:20230331T170000 DTSTAMP:20260611T181741 CREATED:20200904T115630Z LAST-MODIFIED:20230224T143704Z UID:7130-1680278400-1680282000@aarms.math.ca SUMMARY:Dalhousie-AARMS AAMP Seminar: Erick Schulz (ETH Zürich) DESCRIPTION:Title + Abstract: TBD\nThe Dalhousie-AARMS Analysis-Applied Math-Physics Seminar takes place on Fridays from 4 – 5 pm Atlantic Time over either Zoom and/or in Chase 227 depending on the speaker.  If you would like to attend\, please email the organizers for connection details. URL:https://aarms.math.ca/event/dalhousie-aarms-aamp-seminar-steven-lester-kings-college-london-2-2-3-2-2-2-4-2-2-2-2-2-2-2-2-3/ LOCATION:Dalhousie University\, Halifax\, Nova Scotia\, Canada CATEGORIES:AAMP Seminar ORGANIZER;CN="Suresh Eswarathasan":MAILTO:sr766936@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20230329T153000 DTEND;TZID=UTC:20230329T163000 DTSTAMP:20260611T181741 CREATED:20230325T113759Z LAST-MODIFIED:20230325T113833Z UID:7190-1680103800-1680107400@aarms.math.ca SUMMARY:Atlantic Graph Theory Seminar: Calum MacRury\, University of Toronto DESCRIPTION:Approximation Schemes for Resource Minimization for Fire Containment\nThe semi-random graph process is an example of an adaptive process for constructing a graph in which random edges are added step by step.  It is adaptive in that there is an online algorithm which has partial control over which random edges are added. Through intelligent decision-making\, the objective of the algorithm is to force the graph to satisfy a fixed graph property with high probability in as few rounds as possible. We first provide upper and lower bounds on the performance of an optimal algorithm when the property corresponds to being Hamiltonian or to containing a perfect matching. This part of the talk is based on joint works with Pawel Pralat and Jane Gao.Afterwards\, we introduce a formal definition of an adaptive random graph process which generalizes both the semi-random graph process\, as well as the Achlioptas process. In this model\, we define a condition called edge-replaceability  which we prove is sufficient for a property to have a sharp threshold. Intuitively\, a property has a sharp threshold if the optimal algorithm’s “success probability” transitions from almost $0$ to almost $1$ in a negligible number of steps.  We apply our result to the semi-random graph process to show that the properties of being Hamiltonian  and of containing a perfect matching each have a sharp threshold. This part of the talk is based on a joint work with Erlang Surya. URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-calum-macrury-university-of-toronto/ LOCATION:Online via Zoom CATEGORIES:AARMS Atlantic Graph Theory Seminar ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20230322T153000 DTEND;TZID=UTC:20230322T163000 DTSTAMP:20260611T181741 CREATED:20230319T132045Z LAST-MODIFIED:20230319T132045Z UID:7186-1679499000-1679502600@aarms.math.ca SUMMARY:Atlantic Graph Theory Seminar: Mohammad Salavatipour\, U. Alberta DESCRIPTION:Approximation Schemes for Resource Minimization for Fire Containment\nResource Minimization Fire Containment (RMFC) is a natural model for optimal inhibition of\nharmful spreading phenomena on a graph. In the RMFC problem on trees\, we are given an undirected\ntree G\, and a vertex r where the fire starts at\, called root. At each time step\, the firefighters\ncan protect up to B vertices of the graph while the fire spreads from burning vertices to all their\nneighbors that have not been protected so far. The task is to find the smallest B that allows for\nsaving all the leaves of the tree. The problem is hard to approximate up to any factor better than 2\neven on trees unless P = NP. \nIn this talk we present an asymptotic QPTAS for RMFC on trees. More specifically\, let \eps > 0\,\nand F be an instance of RMFC where the optimum number of firefighters to save all the leaves is\nOPT(F). We present an algorithm which uses at most \ceil(1 + \eps )OPT(F)\rceil many firefighters at each\ntime step and runs in time n^O(\log\log n). This suggests that the existence of an asymptotic PTAS is\nplausible especially since the exponent is O(log log n). \n————————————————————-\nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09 \nMeeting ID: 864 1523 0827\nPasscode: 835547 URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-mohammad-salavatipour-u-alberta/ LOCATION:Online via Zoom CATEGORIES:AARMS Atlantic Graph Theory Seminar ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=America/Halifax:20230317T160000 DTEND;TZID=America/Halifax:20230317T170000 DTSTAMP:20260611T181741 CREATED:20200904T115630Z LAST-MODIFIED:20230314T085635Z UID:7000-1679068800-1679072400@aarms.math.ca SUMMARY:Dalhousie-AARMS AAMP Seminar: Milivoje Lukic (Rice U.) DESCRIPTION:Title: Universality limits for orthogonal polynomialsAbstract: It is often expected that the local statistical behavior ofeigenvalues of some system depends only on its local properties; forinstance\, the local distribution of zeros of orthogonal polynomials shoulddepend only on the local properties of the measure of orthogonality. Thisphenomenon is studied using an object called the Christoffel-Darbouxkernel. The most commonly studied case is known as bulk universality\,where the rescaled limit of Christoffel-Darboux kernels converges to thesine kernel.In this talk\, we will survey this subject\, prior results\, and a recentresult which gives for the first time a completely local sufficientcondition for bulk universality. The new approach is based on a matrixversion of the Christoffel-Darboux kernel and the de Branges theory ofcanonical systems\, and it applies to other self-adjoint systems with 2×2transfer matrices such as continuum Schrodinger and Dirac operators.The talk is based on joint work with Benjamin Eichinger (TechnicalUniversity Wien) and Brian Simanek (Baylor University).\nThe Dalhousie-AARMS Analysis-Applied Math-Physics Seminar takes place on Fridays from 4 – 5 pm Atlantic Time over either Zoom and/or in Chase 227 depending on the speaker.  If you would like to attend\, please email the organizers for connection details. URL:https://aarms.math.ca/event/dalhousie-aarms-aamp-seminar-steven-lester-kings-college-london-2-2-3-2-2-2-4-2-2-2-2-2-2-2-2/ LOCATION:Dalhousie University\, Halifax\, Nova Scotia\, Canada CATEGORIES:AAMP Seminar ORGANIZER;CN="Suresh Eswarathasan":MAILTO:sr766936@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20230315T153000 DTEND;TZID=UTC:20230315T163000 DTSTAMP:20260611T181741 CREATED:20230315T123936Z LAST-MODIFIED:20230315T123936Z UID:7144-1678894200-1678897800@aarms.math.ca SUMMARY:Atlantic Graph Theory Seminar: Caleb Jones and Rylo Ashmore (Memorial University) DESCRIPTION:Speaker 1: Caleb Jones\, Memorial University\n \nTitle: Extending Graph Burning to Hypergraphs\n \nAbstract:\nWe introduce a round-based model much like graph burning which applies to hypergraphs. The rules for this new model are very natural\,and generalize the original model of graph burning. We also introduce a variant called lazy hypergraph burning\, along with a new parameter\, the lazy burning number. Interestingly\, lazily burning a graph is trivial\, while lazily burning a hypergraph can be quite complicated. Moreover\, the lazy burning model is a useful tool for analyzing the round-based model on hypergraphs. We obtain bounds on the burning number and lazy burning number of a hypergraph in terms of its parameters.\n \n \nSpeaker 2: Rylo Ashmore\, Memorial University\n \nTitle: Herding Cats Stuck in Trees.\n \nAbstract:\nIn the game of Cat Herding on a graph\, one player (the herder) will omnipresently delete edges\, while the other player (the cat) is on a vertex of the graph\, and will move along any path to a new vertex. Eventually\, the cat is isolated on a single vertex\, and the cat’s objective is to delay this event\, while the herder tries to hasten it. In an optimally played game\, the number of cuts the herder made to isolate the cat is the cat number of the graph. In this talk\, we will investigate this graph parameter for both dense and sparse graphs. We will see an argument that the asymptotic behaviour of the cat number of complete graphs is n^2/3. We also look at an unexpected connection between cat herding on trees and Fibonacci numbers. In particular\, we will see that trees with maximum cat number amongst graphs with n vertices have cat number asymptotically log_φ (n).\n\nZoom link: https://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09 \n\nMeeting ID: 864 1523 0827\nPasscode: 835547 URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-caleb-jones-and-rylo-ashmore-memorial-university/ LOCATION:Online via Zoom CATEGORIES:AARMS Atlantic Graph Theory Seminar ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20230313 DTEND;VALUE=DATE:20230318 DTSTAMP:20260611T181741 CREATED:20230228T164404Z LAST-MODIFIED:20230228T164444Z UID:7135-1678665600-1679097599@aarms.math.ca SUMMARY:Automorphisms And Derivations In Affine Algebraic Geometry DESCRIPTION:Mini-course by Professor Leonid Makar-Limanov\, Wayne University\,  USA \nBrief description of the mini course\nAfter this course you will know the proofs of several classical theorems of Affine Algebraic Geometry. The original proofs of these theorems were quite involved and a much longer course would be needed for their exposition. \nIn the first lecture we will discuss the theorems of Heinrich Jung and Rudolf Rentschler. The first one describes all invertible transformations of the plane by polynomials and the second all generalized shifts of the plane. Algebraically speaking\, Jung’s theorem describes all automorphisms of the ring of polynomials with two variables and Rentschler theorem describes all subgroups of this group which are isomorphic to the group of complex numbers under addition. If we have time\, we will  discuss the groups of polynomial automorphisms of several other surfaces. \nThe second lecture is devoted to the following topic: if a cylinder is given\, is it possible to recover the base of this cylinder. In general the answer is no\, but we discuss two cases when this is possible. We show that if the cylinder over a curve is given then we can recover this curve (this is the theorem of Shreeram Abhyankar\, Paul Eakin\, and William Heinzer). If the cylinder over a surface is isomorphic to a three-dimensional space then the surface is isomorphic to a plane (this is a theorem of Takao Fujita). \nHere is an algebraic translation: \nIf A is an integral domain of transcendence degree one and A[x1\, x2\,…\, xn] is given\, we can recover A up to an isomorphism. If A is an integral domain of transcendence degree two and A[x] is isomorphic to C[y1\,y2\,y3] then A is isomorphic to C[z1\,z2].  The main tool used in these two lectures is locally nilpotent derivations. \nIn the third lecture we prove one of the most famous theorems in affine algebraic geometry\, the AMS Theorem (after Abhyankar\, Tsuong-tsieng Moh\, Masakazu Suzuki): any smooth “good” embedding of a line to a plane is the image of a coordinate line under an automorphism of the plane. Algebraically\, this means the following: if two polynomials f(t)\, g(t)∈ C[t] generate C[t] then the smaller of the degrees of f(t)\, g(t) divides the larger of the degrees of f(t)\, g(t). The main tool here is a new algorithm for finding an irreducible dependence between two polynomials in one variable. \nThe lectures will be delivered during three time periods\, as shown below. They will take place at the St. John’s campus of Memorial University and will be broadcast via Webex. All the times are in Newfoundland Time (NST=UTC-3:30). \nMonday\, March 13th: TBA \nTuesday\, March 14th: TBA \nThursday\, March 16th: TBA \nThe lectures will be available online via Webex.  The details will be given later.  Contact the organizers for more information:   Mikhail Kotchetov ;  Yuri A Bakhturin URL:https://aarms.math.ca/event/automorphisms-and-derivations-in-affine-algebraic-geometry/ LOCATION:Memorial University (St. John’s Campus)\, St. John's\, Newfoundland and Labrador\, Canada CATEGORIES:AARMS schools and minicourses ORGANIZER;CN="Mikhail Kotchetov":MAILTO:Mikhail@mun.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=America/Halifax:20230310T160000 DTEND;TZID=America/Halifax:20230310T170000 DTSTAMP:20260611T181741 CREATED:20200904T115630Z LAST-MODIFIED:20221209T171625Z UID:6998-1678464000-1678467600@aarms.math.ca SUMMARY:Dalhousie-AARMS AAMP Seminar: Katrina Morgan (Northwestern University) DESCRIPTION:Title + Abstract: TBD\nThe Dalhousie-AARMS Analysis-Applied Math-Physics Seminar takes place on Fridays from 4 – 5 pm Atlantic Time over either Zoom and/or in Chase 227 depending on the speaker.  If you would like to attend\, please email the organizers for connection details. URL:https://aarms.math.ca/event/dalhousie-aarms-aamp-seminar-steven-lester-kings-college-london-2-2-3-2-2-2-4-2-2-2-2-2-2-2/ LOCATION:Dalhousie University\, Halifax\, Nova Scotia\, Canada CATEGORIES:AAMP Seminar ORGANIZER;CN="Suresh Eswarathasan":MAILTO:sr766936@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20230308T153000 DTEND;TZID=UTC:20230308T163000 DTSTAMP:20260611T181741 CREATED:20230304T105511Z LAST-MODIFIED:20230304T105511Z UID:7138-1678289400-1678293000@aarms.math.ca SUMMARY:Atlantic Graph Theory Seminar: Lucas Mol\, Thomson Rivers University DESCRIPTION:Avoiding additive powers in words\nA word is a sequence of symbols taken from some finite alphabet. A square is a word of the form xx\, where x is a nonempty word. It is well-known that there are infinite words over an alphabet of size 3 that contain no squares. Suppose now that the alphabet is some finite subset of the integers. An additive square is a word of the form xx’\, where x and x’ have the same nonzero length and the same sum. Additive cubes\, fourth powers\, etc.\, are defined similarly. We present a method for proving that certain types of infinite words contain no additive k-powers. This is joint work with James Currie\, Narad Rampersad\, and Jeffrey Shallit.\n\n\n—————————————————————————————————————-\n\n\n\nJoin Zoom Meeting \nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\nMeeting ID: 864 1523 0827\nPasscode: 835547 URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-lucas-mol-thomson-rivers-university/ LOCATION:Online via Zoom CATEGORIES:AARMS Atlantic Graph Theory Seminar ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20230301T153000 DTEND;TZID=UTC:20230301T163000 DTSTAMP:20260611T181741 CREATED:20230226T121131Z LAST-MODIFIED:20230226T121131Z UID:7132-1677684600-1677688200@aarms.math.ca SUMMARY:Atlantic Graph Theory Seminar: Isaac McMullin and Ian George\, Dalhousie University DESCRIPTION:Speaker 1: Isaac McMullin \nExistence of Optimal Split Reliability Polynomials\nOne of the most common models of robustness of a graph against random failures has all vertices operational\, but the edges independently operational with probability p. On one hand\, one can ask for the probability that all vertices can communicate (all-terminal reliability) while on the other hand\, we can ask that two specific vertices (or terminals) can communicate with each other (two-terminal reliability). While both of these questions have been well-studied\, they are both increasing functions of the edge probability. One new approach is split reliability\, where for two fixed vertices s and t\, we consider the probability that every vertex communicates with one of s or t\, but not both. The split reliability of G is a polynomial function of p that for connected graphs is 0 both at p=0 and at p=1. In this presentation\, we explore the existence for fixed numbers n>=2 and m>=n-1 of an optimal connected (n\,m)-graph G_(n\,m) for split reliability\, that is\, a connected graph with n vertices and m edges for which for any other such graph H\, the split reliability of G_(n\,m) is at least as large as that of H\, for all values of p in [0\,1]. Unlike the similar problems for all-terminal and two-terminal reliability\, where only partial results are known\, we completely solve the issue for split reliability\, where we show that there is an optimal (n\,m)-graph for split reliability if and only if n<=3\, m=n-1\, or n=m=4. \n  \n\n\nSpeaker 2: Ian George \nDegree Polynomials of Graphs \nIn this talk we introduce the Degree Polynomial of a graph.  This polynomial is defined to be the generating function of the sequence (a_0\, a_1\, a_2\, …) where a_k is the number of vertices of degree k in a graph.  Little has been published about this polynomial other than its behaviour under graph operations.  We will explore some basic properties of this polynomial\, and see what information it encodes about a graph.  Then we will discuss the roots of degree polynomials\, or degree roots\, giving some bounds and density results.  Along the way\, the degree polynomials and degree roots for certain families of graphs will be highlighted. \n\nThe talks will be held in room 227 in the Chase building at Dalhousie\, and streamed via zoom \nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\nMeeting ID: 864 1523 0827\nPasscode: 835547 URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-isaac-mcmullin-and-ian-george-dalhousie-university/ LOCATION:Online via Zoom CATEGORIES:AARMS Atlantic Graph Theory Seminar ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20230217T110000 DTEND;TZID=UTC:20230222T120000 DTSTAMP:20260611T181741 CREATED:20230131T103547Z LAST-MODIFIED:20230131T103547Z UID:7054-1676631600-1677067200@aarms.math.ca SUMMARY:Minicourse: Group Graded Azumaya Algebras and Generic Constructions DESCRIPTION:Taught by Professor Eli Aljadeff\, Technion University\, Israel \nThe main theme of this mini-course is gradings by finite groups on finite-dimensional algebras. Similar to the classical situation of ungraded algebras\, we will be interested in finite-dimensional graded simple algebras and finite-dimensional graded division algebras. An important role is played by a generalization of central simple algebras\, called Azumaya algebras. \nOur main tool will be polynomial identities and\, in particular\, graded polynomial identities. This tool will allow us to construct generic graded Azumaya algebras. \nIn the first lecture of the mini-course\, as a part of the motivation to discuss group graded algebras\, I will recall some classical topics such as division algebras\, Brauer groups\, crossed products and Galois cohomology. Then I will introduce G-graded polynomial identities\, where G is a finite group\, and discuss generic constructions. In particular\, for an arbitrary finite-dimensional G-graded simple algebra A over an algebraically closed field F of characteristic 0\, I will construct a generic G-graded Azumaya algebra from which one can obtain by specialization all forms of A in the sense of Galois descent. \nAs a key application\, I will discuss the following problem. It is not difficult to see that for any finite group G\, finite-dimensional G-graded division algebras are G-graded simple and they remain G-graded simple upon any extension of the field of scalars. \nWe will be interested in the opposite direction. Unlike the situation in the ungraded case\, where the algebras of n × n matrices always admit forms which are division algebras\, this is not generally true in the setting of G-graded algebras. \nSuppose that A is a finite-dimensional G-graded simple algebra over an algebraically closed field F. One of the goals of these lectures is to provide necessary and sufficient conditions on the graded structure of A under which A admits forms that are G-graded division algebras. In particular we show that A must be a G-graded simple algebra for which the corresponding generic G-graded simple algebra is a G-graded division algebra. \nThe lectures will be delivered during three time periods\, as shown below. They will take place at the St. John’s campus of Memorial University and will be broadcast via Webex. All the times are in Newfoundland Time (NST=UTC-3:30). \nFriday\, February 17\, 11-12 am\, room A-1045/1046 \nMonday\, February 20\, 11-12 am\, room A-1045/1046 \nWednesday\, February 22\, 11-12 am\, room A-1045/1046 \nThe lectures will be available online via Webex.  Contact the organizer for details URL:https://aarms.math.ca/event/minicourse-group-graded-azumaya-algebras-and-generic-constructions/ LOCATION:Memorial University (St. John’s Campus)\, St. John's\, Newfoundland and Labrador\, Canada CATEGORIES:AARMS schools and minicourses ORGANIZER;CN="Yuri Bahturin":MAILTO:bahturin@mun.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20230215T153000 DTEND;TZID=UTC:20230215T163000 DTSTAMP:20260611T181741 CREATED:20230213T124408Z LAST-MODIFIED:20230213T124408Z UID:7121-1676475000-1676478600@aarms.math.ca SUMMARY:Atlantic Graph Theory Seminar: Jérémie Turcotte\, Université de Montréal DESCRIPTION:Progress towards the Burning Number Conjecture\nThe burning number b(G) of a graph G is the smallest integer k such that G can be covered by k balls of radii respectively 0\,…\,k-1\, and was introduced independently by Brandenburg and Scott at Intel as a transmission problem on processors and Bonato\, Janssen and Roshanbin as a model for the spread of information in social networks. The Burning Number Conjecture claims that b(G)<=\lceil\sqrt{n}\rceil\, where n is the number of vertices of G. This bound is tight for paths. The previous best bound for this problem\, by Bastide et al.\, was b(G)<= \sqrt{\frac{4n}{3}}+1. We prove that the Burning Number Conjecture holds asymptotically\, that is b(G)<= (1+o(1))\sqrt{n}. Following a brief introduction to graph burning\, this talk will focus on the general ideas behind the proof. \nMeeting ID: 885 9352 1895\nPasscode: 522241 URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-jeremie-turcotte-universite-de-montreal/ LOCATION:Online via Zoom CATEGORIES:AARMS Atlantic Graph Theory Seminar ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=America/Halifax:20230210T160000 DTEND;TZID=America/Halifax:20230210T170000 DTSTAMP:20260611T181741 CREATED:20200904T115630Z LAST-MODIFIED:20221209T171515Z UID:6996-1676044800-1676048400@aarms.math.ca SUMMARY:Dalhousie-AARMS AAMP Seminar: Victor Ivrii (U. Toronto) DESCRIPTION:Title + Abstract: TBD\nThe Dalhousie-AARMS Analysis-Applied Math-Physics Seminar takes place on Fridays from 4 – 5 pm Atlantic Time over either Zoom and/or in Chase 227 depending on the speaker.  If you would like to attend\, please email the organizers for connection details. URL:https://aarms.math.ca/event/dalhousie-aarms-aamp-seminar-steven-lester-kings-college-london-2-2-3-2-2-2-4-2-2-2-2-2-2/ LOCATION:Dalhousie University\, Halifax\, Nova Scotia\, Canada CATEGORIES:AAMP Seminar ORGANIZER;CN="Suresh Eswarathasan":MAILTO:sr766936@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20230208T153000 DTEND;TZID=UTC:20230208T163000 DTSTAMP:20260611T181741 CREATED:20230213T124145Z LAST-MODIFIED:20230213T124512Z UID:7119-1675870200-1675873800@aarms.math.ca SUMMARY:Atlantic Graph Theory Seminar: Jason Brown\, Dalhousie University DESCRIPTION:Colourings\, Polynomials and Roots\nA lot has happened since graph colourings first arose as an applied problem in cartography – do four colours always suffice to distinguish countries when colouring a map? Along the way to the proof\, the related enumeration function to count the number of k-colourings was proposed. While the latter didn’t help much in the quest for the Four Colour Theorem\, it did lead to a fascinating branch of graph theory\, namely chromatic polynomials. While polynomials are the simplest of functions\, their properties can take you deep within mathematics. In this talk I will describe some recent result on chromatic polynomials and their offshoots\, connecting to commutative algebra as well as real and complex analysis. And on our trip\, we visit with some old friends\, including Charles Hermite\, Jacques Sturm\, and Carl Gauss. \nMeeting ID: 831 4765 9865\nPasscode: 505092 URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-jason-brown-dalhousie-university/ LOCATION:Online via Zoom CATEGORIES:AARMS Atlantic Graph Theory Seminar ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=America/Halifax:20230127T160000 DTEND;TZID=America/Halifax:20230127T170000 DTSTAMP:20260611T181741 CREATED:20200904T115630Z LAST-MODIFIED:20230110T173057Z UID:7006-1674835200-1674838800@aarms.math.ca SUMMARY:Dalhousie-AARMS AAMP Seminar: Alex Barnett (Flatiron Institute\, NYC) DESCRIPTION:Title: Equispaced Fourier representations for efficient Gaussian process regression from a billion data pointsAbstract: Gaussian process regression is widely used in geostatistics\, time-series analysis\, and machine learning. It infers an unknown continuous function in a principled fashion from noisy measurements at $N$ scattered data points.  The prior on the function is Gaussian\, with covariance given by some user-chosen translationally invariantkernel.  Yet $N$ has been limited to about $10^6$\, even with modern low-rank methods.  Focusing on low spatial dimension (1–3)\, we present a GP regression method using kernel approximation by an equispaced quadrature grid in the Fourier domain.  This enables the iterative solution of a smaller Toeplitz linear system\, exploiting both the FFT and the nonuniform FFT to give ${\mathcal O}(N)$ cost. The result is often one to two orders of magnitude faster than state of the art methods\, and enables cheap massive-scale regressions. For example\, for a 2D Mat\’ern-3/2 kernel and $N = 10^9$ points\, the posterior mean function is found to 3-digit accuracy in two minutes on a desktop.Joint work with Philip Greengard (Columbia) and Manas Rachh (Flatiron Institute)\nThe Dalhousie-AARMS Analysis-Applied Math-Physics Seminar takes place on Fridays from 4 – 5 pm Atlantic Time over either Zoom and/or in Chase 227 depending on the speaker.  If you would like to attend\, please email the organizers for connection details. URL:https://aarms.math.ca/event/dalhousie-aarms-aamp-seminar-steven-lester-kings-college-london-2-2-3-2-2-2-4-2-2-2-2-2-2-2-2-2/ LOCATION:Dalhousie University\, Halifax\, Nova Scotia\, Canada CATEGORIES:AAMP Seminar ORGANIZER;CN="Suresh Eswarathasan":MAILTO:sr766936@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=America/Halifax:20230120T160000 DTEND;TZID=America/Halifax:20230120T170000 DTSTAMP:20260611T181741 CREATED:20200904T115630Z LAST-MODIFIED:20230110T172249Z UID:6994-1674230400-1674234000@aarms.math.ca SUMMARY:Dalhousie-AARMS AAMP Seminar: Chamsol Park (Johns Hopkins University) DESCRIPTION:Title: Eigenfunction restriction estimates on curves with nonvanishing geodesic curvatures\n\nAbstract: Studying eigenfunctions of the Laplace-Beltrami operator on compact Riemannian manifolds (without boundary) is one of the interesting topics in Harmonic Analysis. One way to study them is to consider the L^p estimates of the eigenfunctions restricted to submanifolds. In this talk\, we briefly summarize previous results and would like to talk about the logarithmic improved analogue for the restriction to curves with nonvanishing geodesic curvatures\, in the presence of nonpositive sectional curvatures in the manifolds. If time permits\, we will discuss some applications and open problems for the Schrodinger counterparts.\n\n\nThe Dalhousie-AARMS Analysis-Applied Math-Physics Seminar takes place on Fridays from 4 – 5 pm Atlantic Time over Zoom and in Chase 227.  If you would like to attend\, please email the organizers for connection details. URL:https://aarms.math.ca/event/dalhousie-aarms-aamp-seminar-steven-lester-kings-college-london-2-2-3-2-2-2-4-2-2-2-2-2/ LOCATION:Dalhousie University\, Halifax\, Nova Scotia\, Canada CATEGORIES:AAMP Seminar ORGANIZER;CN="Suresh Eswarathasan":MAILTO:sr766936@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20230118T153000 DTEND;TZID=UTC:20230118T163000 DTSTAMP:20260611T181741 CREATED:20230113T131357Z LAST-MODIFIED:20230113T131357Z UID:7049-1674055800-1674059400@aarms.math.ca SUMMARY:Atlantic Graph Theory Seminar: Jane (Pu) Gao\, University of Waterloo DESCRIPTION:Conditions for perfect matchings in random sparse bipartite graphs \nGiven a uniformly random sparse matrix A\, with specified number of nonzero entries in columns and rows\, we determine when A has full row rank over a finite field. As a corollary\, by considering A as the adjacency matrix of a bipartite graph\, our result determines the conditions for the existence of a perfect matching in various models of random sparse bipartite graphs. We will explore some useful insight from statistical physics that guides our probabilistic combinatorial proof. This is joint work with Coja-Oghlan\, Hahn-Klimroth\, Lee\, Mueller and Rolvien. \n  \nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/82306017918?pwd=Q0hKTElTMzQxaythWmE3SnhtbGZDUT09\n\nMeeting ID: 823 0601 7918\nPasscode: 045489 URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-jane-pu-gao-university-of-waterloo/ LOCATION:Online via Zoom CATEGORIES:AARMS Atlantic Graph Theory Seminar ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=America/Halifax:20230113T160000 DTEND;TZID=America/Halifax:20230113T170000 DTSTAMP:20260611T181741 CREATED:20200904T115630Z LAST-MODIFIED:20230110T200300Z UID:6991-1673625600-1673629200@aarms.math.ca SUMMARY:Dalhousie-AARMS AAMP Seminar: Andrea Bertozzi (UCLA) DESCRIPTION:Title:  Energy Minimizing Surface Tension Configurations for Microparticles\nAbstract: An important area of microfluidics is the creation and manipulation of small droplets. This is commonly done using microchannels or electrowetting. Recently a new method is proposed to create templated droplets using amphiphilic microparticles. These particles are observed to hold nearly equal volumes of aqueous liquid when dispersed in an oil–water mixture. However a theory for this behavior is lacking. In this paper\, we present a mathematical model based on minimizing the surface tension energy of a system of particles. By analyzing this model\, we demonstrate that certain key properties of the particle guarantee the formation of small droplets within a volume range unique to the particle. We also look at statistical dynamics of pairwise exchange of fluids between particles for which the system can reach equilibrium.  We show examples of how such particles are useful for applications such asbiological assays and measurement of chemical secretions from single cells.\n\nThe Dalhousie-AARMS Analysis-Applied Math-Physics Seminar takes place on Fridays from 4 – 5 pm Atlantic Time over Zoom and in Chase 227.  If you would like to attend\, please email the organizers for connection details. URL:https://aarms.math.ca/event/dalhousie-aarms-aamp-seminar-steven-lester-kings-college-london-2-2-3-2-2-2-4-2-2-2-2/ LOCATION:Dalhousie University\, Halifax\, Nova Scotia\, Canada CATEGORIES:AAMP Seminar ORGANIZER;CN="Suresh Eswarathasan":MAILTO:sr766936@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20230111T153000 DTEND;TZID=UTC:20230111T163000 DTSTAMP:20260611T181741 CREATED:20230106T111103Z LAST-MODIFIED:20230106T113715Z UID:7016-1673451000-1673454600@aarms.math.ca SUMMARY:Atlantic Graph Theory Seminar: Pawel Pralat\, Metropolitan University of Toronto DESCRIPTION:An Unsupervised Framework for Comparing Graph Embeddings\nThe goal of many machine learning applications is to make predictions or discover new patterns using graph-structured data as feature information. In order to extract useful structural information from graphs\, one might want to try to embed it in a geometric space by assigning coordinates to each node such that nearby nodes are more likely to share an edge than those far from each other. There are many embedding algorithms (based on techniques from linear algebra\, random walks\, or deep learning) and the list constantly grows. As a result\, selecting the best embedding is a challenging task and very often requires domain experts. Our general framework assigns the divergence score to each embedding which\, in an unsupervised learning fashion\, distinguishes good from bad embeddings. In order to benchmark embeddings\, we generalize the Chung-Lu random graph model to incorporate geometry.\n\n\nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/82306017918?pwd=Q0hKTElTMzQxaythWmE3SnhtbGZDUT09\n\nMeeting ID: 823 0601 7918\nPasscode: 045489 URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-pawel-pralat-metropolitan-university-of-toronto/ LOCATION:Online via Zoom CATEGORIES:AARMS Atlantic Graph Theory Seminar ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20230107 DTEND;VALUE=DATE:20230113 DTSTAMP:20260611T181741 CREATED:20221008T115107Z LAST-MODIFIED:20221008T115107Z UID:6899-1673049600-1673567999@aarms.math.ca SUMMARY:The 19th Seminar on Commutative Algebra and related topics DESCRIPTION:Every year the school of mathematics of IPM-Tehran organizes a seminar and workshop to introduce the research topics in the main streams of “Algebraic Geometry\, Commutative algebra and Combinatorial commutative algebra” to young researchers and PhD students\, and encourage them to collaborate in teams led by well-known mathematicians in this area. This year we have paid special attention to inviting regional speakers\, as well as international leaders. Our list of speakers highlights female mathematicians\, and the areas represented are those in which there is regional expertise\, hopefully leading to new collaborations.\nThe conference is preceded by a workshop on Lefschetz properties and connections to algebra\, geometry and combinatorics. The workshop will feature the leading questions in the area\, and the lectures will be delivered by some of the main players in this field. URL:https://aarms.math.ca/event/the-19th-seminar-on-commutative-algebra-and-related-topics/ LOCATION:Institute for Research in Fundamental Sciences (IPM) Tehran\, Iran\, Tehran\, Iran\, Islamic Republic of CATEGORIES:AARMS sponsored events ORGANIZER;CN="Sara Faridi":MAILTO:sara.faridi@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20221130T153000 DTEND;TZID=UTC:20221130T163000 DTSTAMP:20260611T181741 CREATED:20221124T144803Z LAST-MODIFIED:20230106T112807Z UID:6970-1669822200-1669825800@aarms.math.ca SUMMARY:Atlantic Graph Theory Seminar: Sebastian Cioaba\, University of Delaware DESCRIPTION:Addressing graphs and hypergraphs \nIn 1970s\, Ron Graham and Henry Pollak introduced the notion of graph addressing which is a labeling of the vertices of an undirected graph by words of the same length over the alphabet {0\,1\,*} such that the distance between any two vertices equals the number of positions in their labels/addresses where one vertex has a 0 and the other one has a 1. The minimum of length of such words has been investigated by various people and is closely related to the partition of the edge set of the graph into bicliques (complete bipartite subgraphs). In this talk\, I will describe some recent results related to this parameter for various families of graphs and the corresponding problem for hypergraphs. \nZoom info:\n\nhttps://us02web.zoom.us/j/87564743456?pwd=cTdkMGxYQ0dGaG4zdkZpeFVlTmsrQT09 \nMeeting ID: 875 6474 3456\nPasscode: 259500 URL:https://aarms.math.ca/event/atlantic-graph-theory-semibar-sebastian-cioaba-university-of-delaware/ LOCATION:Online via Zoom CATEGORIES:AARMS Atlantic Graph Theory Seminar,Atlantic Graph Theory Seminar ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20221118 DTEND;VALUE=DATE:20221119 DTSTAMP:20260611T181741 CREATED:20221008T120408Z LAST-MODIFIED:20221008T120408Z UID:6902-1668729600-1668815999@aarms.math.ca SUMMARY:University of New Brunswick Data Challenge 2022 DESCRIPTION:The Data Challenge will bring together three competitive events\, Data Visualization (7th Annual)\, Data Analytics (3rd Annual)\, and Data Sprint (3rd Annual) on Nov. 18\, 2022\, in a hybrid format – virtually and in person! Take up the challenge and demonstrate the power of data\, with the flexibility to take part remotely.\nParticipants and teams will have the chance to showcase their ability to tell a story driven by data in three unique competitive formats. Teams can participate in all three competitive events. It is an ideal setting for citizens to get engaged\, meet leaders in academia\, government\, and private organizations\, and explore the world of data science. URL:https://aarms.math.ca/event/university-of-new-brunswick-data-challenge-2022/ LOCATION:University of New Brunswick (Fredericton Campus)\, Fredericton\, New Brunswick\, Canada CATEGORIES:AARMS sponsored events END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20221021 DTEND;VALUE=DATE:20221023 DTSTAMP:20260611T181741 CREATED:20220526T103354Z LAST-MODIFIED:20220914T151108Z UID:6711-1666310400-1666483199@aarms.math.ca SUMMARY:Science Atlantic Mathematics\, Statistics\, and Computer Science Conference DESCRIPTION:The Science Atlantic Mathematics\, Statistics\, and Computer Science Conference is held each October and provides an opportunity for students to present their research and to learn about other undergraduate research projects across the region in a supportive and inclusive environment. Undergraduate students are also able to participate in team-based mathematics and programming competitions. The conference additionally provides a valuable opportunity for undergraduate students to meet potential graduate supervisors\, and is the only venue for faculty members from across Atlantic Canada to network and share ideas and information related to research and mentorship. URL:https://aarms.math.ca/event/science-atlantic-mathematics-statistics-and-computer-science-conference/ LOCATION:Mount Allison University\, Sackville\, New Brunswick\, Canada CATEGORIES:AARMS sponsored events ORGANIZER;CN="Margaret-Ellen Messinger":MAILTO:mmessinger@mta.ca END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20220825 DTEND;VALUE=DATE:20220828 DTSTAMP:20260611T181741 CREATED:20220211T153546Z LAST-MODIFIED:20220223T152818Z UID:6592-1661385600-1661644799@aarms.math.ca SUMMARY:34th Canadian Conference on Computational Geometry DESCRIPTION:The Canadian Conference on Computational Geometry (CCCG) is a forum to disseminate and discuss theoretical and applied results in discrete and computational geometry.\nComputational geometry is concerned with the design of efficient algorithms\, the development of software\, and the study of the mathematical foundations of computational problems whose formulation involves geometric constraints. The field is motivated by problems from a broad range of application areas\, as diverse as computer graphics and animation\, computer vision\, computer-aided design and manufacturing\, geographic information systems\, pattern recognition\, wireless communications\, robotics\, protein folding\, urban planning\, graph drawing\, or statistical analysis. The 34th Canadian Conference on Computational Geometry will take place in August 2022 in Toronto\, ON. URL:https://aarms.math.ca/event/34th-canadian-conference-on-computational-geometry/ LOCATION:Ryerson University\, Toronto\, Ontario\, Canada CATEGORIES:AARMS sponsored events ORGANIZER;CN="Konstantinos Georgiou":MAILTO:konstantinos@ryerson.ca END:VEVENT END:VCALENDAR