Thursday, June 9, 2022

Thursday, June 9, 2022 — 11:30 to 11:30 AM EDT

Title: Generalized Subspace Subcode with Application in Cryptology

Speaker: Jean Belo Klamti Affiliation: University of Waterloo Attend: Contact Jesse Elliott

Abstract:

Most codes with an algebraic decoding algorithm are derived from Reed-Solomon codes. They are obtained by taking equivalent codes, for example Generalized Reed-Solomon codes, or by using the so-called subfield subcode method, which leads to Alternant codes over the underlying prime field, or over some intermediate subfield. The main advantage of these constructions is to preserve both the minimum distance and the decoding algorithm of the underlying Reed-Solomon code.

Thursday, June 9, 2022 — 1:00 PM EDT

Title: Virtual characters of permutation statistics

Speaker: Zachary Hamacker Affiliation: University of Florida Room: MC 5483

Abstract:

Functions of permutations are studied in a wide variety of fields including probability, statistics and theoretical computer science. I will introduce a method for studying such functions using representation theory and symmetric functions. As a consequence, one can extract detailed information about asymptotic behavior of many permutation statistics with respect to non-uniform measures that are invariant under conjugation. The key new tool is a combinatorial formula called the path Murnaghan-Nakayama rule that gives the Schur expansion of a novel basis of the ring of symmetric functions. This is joint work with Brendon Rhoades.

Thursday, June 9, 2022 — 2:30 PM EDT

Title: Algebraic Graph Theory

Speaker: Sabrina Lato Affiliation: University of Waterloo Location: MC 6029

Abstract:

A graph is distance-regular if we can write the distance adjacency matrices as polynomials in the adjacency matrix. Distance-regular graphs are a class of graphs of significant interest to algebraic graph theorists for their structural and algebraic properties. The notion of distance-regularity can be weakened to a local property on vertices, but when every vertex in the graph is locally distance-regular, the graph will either be distance-regular or in the closely related class of distance-biregular graphs.

S M T W T F S
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
  1. 2022 (112)
    1. October (3)
    2. September (11)
    3. August (2)
    4. July (17)
    5. June (17)
    6. May (10)
    7. April (12)
    8. March (18)
    9. February (10)
    10. January (13)
  2. 2021 (103)
    1. December (3)
    2. November (7)
    3. October (6)
    4. September (12)
    5. August (6)
    6. July (10)
    7. June (12)
    8. May (7)
    9. April (9)
    10. March (13)
    11. February (8)
    12. January (10)
  3. 2020 (119)
  4. 2019 (167)
  5. 2018 (136)
  6. 2017 (103)
  7. 2016 (137)
  8. 2015 (136)
  9. 2014 (88)
  10. 2013 (48)
  11. 2012 (39)
  12. 2011 (36)
  13. 2010 (40)
  14. 2009 (40)
  15. 2008 (39)
  16. 2007 (15)