BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20251102T010000
RDATE:20260308T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20261101T010000
RDATE:20270314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20271107T010000
RDATE:20280312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20281105T010000
RDATE:20290311T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20250415T170000
RDATE:20251102T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RDATE:20261101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20270314T030000
RDATE:20271107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20280312T030000
RDATE:20281105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:b5f6b63eb9056d1dc9f9333717d1883e
CATEGORIES:Experimental Mathematics Seminar
CREATED:20260409T185754
SUMMARY:Computational and Experimental Methods in Permutation Patterns
LOCATION:https://rutgers.zoom.us/j/94346444480 [password: The 20th Catalan number\, 
 alias (40)!/(20!*21!)
DESCRIPTION:For most of its existence, a hallmark of permutation patterns research has 
 been the use of computers. Our research is regularly made possible by the a
 bility to write a simple script to generate permutations with some certain 
 property, helping us to discover an interesting theorem; or to open up Sage
 , or Maple, or Mathematica and perform some large generating function calcu
 lation; or to use one of the several existing large permutation patterns so
 ftware libraries to test some intriguing conjectures.\nThe quest to underst
 and permutation classes has led to the import of computational methods from
  other areas into the field of permutation patterns, as well as the develop
 ment of a number of new techniques. Some of these methods produce rigorous 
 results, assuming the correctness of the software implementation. Others ar
 e experimental in the sense that their output should be considered conjectu
 ral. The popularity of permutation patterns has even led to some of these c
 omputational techniques making the jump to other areas of combinatorics. Th
 is talk will survey a collection of these methods, including some developed
  by myself and my collaborators.\n
X-ALT-DESC;FMTTYPE=text/html:<p style="color: #000000; font-family: 'Times New Roman'; font-size: medium
 ; font-weight: 400; letter-spacing: normal; orphans: 2; text-align: start; 
 text-indent: 0px; text-transform: none; white-space: normal; widows: 2; wor
 d-spacing: 0px;">For most of its existence, a hallmark of permutation patte
 rns research has been the use of computers. Our research is regularly made 
 possible by the ability to write a simple script to generate permutations w
 ith some certain property, helping us to discover an interesting theorem; o
 r to open up Sage, or Maple, or Mathematica and perform some large generati
 ng function calculation; or to use one of the several existing large permut
 ation patterns software libraries to test some intriguing conjectures.</p><
 p style="color: #000000; font-family: 'Times New Roman'; font-size: medium;
  font-weight: 400; letter-spacing: normal; orphans: 2; text-align: start; t
 ext-indent: 0px; text-transform: none; white-space: normal; widows: 2; word
 -spacing: 0px;">The quest to understand permutation classes has led to the 
 import of computational methods from other areas into the field of permutat
 ion patterns, as well as the development of a number of new techniques. Som
 e of these methods produce rigorous results, assuming the correctness of th
 e software implementation. Others are experimental in the sense that their 
 output should be considered conjectural. The popularity of permutation patt
 erns has even led to some of these computational techniques making the jump
  to other areas of combinatorics. This talk will survey a collection of the
 se methods, including some developed by myself and my collaborators.</p>
CONTACT:  Jay Pantone, Marquette University
DTSTAMP:20260826T215136
DTSTART;TZID=America/New_York:20260416T170000
DTEND;TZID=America/New_York:20260416T180000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR