BEGIN:VCALENDAR

VERSION:2.0

PRODID:-//wp-events-plugin.com//7.4.2//EN

TZID:Asia/Jerusalem

X-WR-TIMEZONE:Asia/Jerusalem
BEGIN:VEVENT

UID:649@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20260702T113000

DTEND;TZID=Asia/Jerusalem:20260702T123000

DTSTAMP:20260626T091802Z

URL:https://math.technion.ac.il/events/tba-41/

SUMMARY:Alternating Stackings and Word Measures
DESCRIPTION:Lecturer:Noam Ta-Shma (TAU)\n Location:Amado 919\n Let Γ be a 
 labeled and directed graph. The w-cycle theorem bounds the number of cycle
 s which are labeled by a word w in Γ. Louder and Wilton (2017) proved the
  w-cycle theorem using a combinatorial object they called a stacking. We g
 eneralize stackings to k-alternating stackings\, sketch Louder and Wilton'
 s proof\, and show that k-alternating stackings give stronger bounds.\n\nG
 iven a word w\, its word measure is a distribution on S_n given by w(σ _1
 \, ... \, σ_r) where σ_1\, ... \, σ_r are uniformly random permutations
 \, e.g.\, for w=[x\, y] its measure is a random commutator w(σ\, τ) = [
 σ\, τ]. Given a character χ of S_n\, we ask what is its expectation ove
 r the word measure\, i.e.\, the expectation of χ(w(σ_1\, ... \, σ_r)).
   Cassidy (2024) bounded the expectation using stackings. We extend Cassi
 dy's method with k-alternating stackings\, proving that a conjecture of Ha
 nany and Puder (2020) holds with high probability.\n 
CATEGORIES:Geometry and Topology Seminar,Seminars
LOCATION:Amado 919

END:VEVENT

BEGIN:VTIMEZONE

TZID:Asia/Jerusalem

X-LIC-LOCATION:Asia/Jerusalem

BEGIN:DAYLIGHT

DTSTART:20260327T030000

TZOFFSETFROM:+0200

TZOFFSETTO:+0300

TZNAME:IDT

END:DAYLIGHT

END:VTIMEZONE
END:VCALENDAR