Series: *
https://sites.google.com/view/northeastcombinatoricsnetwork/virtual-combinatorics-colloquium
The next two Colloquia speakers and dates are as follows, with further
details below:
*Date: *Tuesday, 19 November, 2019 at 2:00 p.m. (14:00) Eastern Standard
Time
*Speaker: *Heide Gluesing-Luerssen, University of Kentucky
*Title:* Rank-Metric Codes for Random Network Coding
*Zoom Link: * https://smcvt.zoom.us/j/858049685 Join Meeting ID: 858 049
685
and
*Date: *Tuesday, 3 December, 2019 at 2:00 p.m. (14:00) Eastern Standard Time
*Speaker: *Sergi Elizalde, Dartmouth College
*Title:* Consecutive Patterns in Permutations and Inversion Sequences
*Zoom Link: *https://wpi.zoom.us/j/791224665 Join Meeting ID: 791-224-665
Individuals and viewing party groups from around the world can "attend"
these online talks and interact with the speaker and other attendees
remotely via Zoom. It is very easy--Just click on the link below to join.
If you have not used Zoom before, there may be a very brief download, but
then you will be in the event. Here are quick instructions for joining a
Zoom meeting if you would like more details:
https://support.zoom.us/hc/en-us/articles/201362193-How-Do-I-Join-A-Meeting-
The talk will start at the stated time, but the Zoom invitation will open
30 minutes earlier so that participants may call in early if they wish to
get a sense of how the platform works (how to mute/unmute, share screens,
shared whiteboard, raise hand, chat, etc.).
*We are very pleased to announce the next talks in the series:*
*Date: *Tuesday, 19 November, 2019 at 2:00 p.m. (14:00) Eastern Standard
Time
*Speaker: *Heide Gluesing-Luerssen, University of Kentucky
*Title:* Rank-Metric Codes for Random Network Coding
*Zoom Link: * https://smcvt.zoom.us/j/858049685 Join Meeting ID: 858 049
685
*Abstract: *In multicast networks, information is passed through a network
of nodes to several receivers. The goal is to transmit the information to
all receivers with the least amount of uses of the network. We will see
that suitable encoding of the information at the nodes (inner coding) can
decrease the number of applications of the network. In addition, encoding
the information before transmission (outer coding) can safeguard the
information against errors during transmission. It turns out that
rank-metric codes are the appropriate tool for outer coding. After a gentle
introduction into the theory of rank-metric codes I will present some
recent results, such as constructions of optimal Ferrers-diagram codes and
their proportion among all Ferrers-diagram codes of the same dimension
*Date: *Tuesday, 3 December, 2019 at 2:00 p.m. (14:00) Eastern Standard Time
*Speaker: *Sergi Elizalde, Dartmouth College
*Title:* Consecutive Patterns in Permutations and Inversion Sequences
*Zoom Link: *https://wpi.zoom.us/j/791224665 Join Meeting ID: 791-224-665
* Abstract: * An occurrence of a consecutive pattern σ in a permutation π
is a subsequence of adjacent entries of π in the same relative order as the
entries of σ. For example, occurrences of the consecutive pattern 21 are
descents, and alternating permutations are those that avoid the consecutive
patterns 123 and 321. Consecutive patterns also arise in the study of one
dimensional dynamical systems, and they are useful in distinguishing random
from deterministic time series. The talk will survey some work from the
last two decades on the enumeration of permutations avoiding consecutive
patterns, and on the classification of these patterns according to how many
permutations of a given length avoid them. It will also discuss some recent
work with Juan Auli regarding consecutive patterns in inversion sequences.
Further information and upcoming talks may be found here:
We especially invited groups to host viewing parties
<https://sites.google.com/view/northeastcombinatoricsnetwork/virtual-combinatorics-colloquium>
for these events. However, To avoid the possibility of distraction and
feedback noise, please keep your mic muted unless you or someone in your
group has something particular to say.
The *Northeast Combinatorics Network* (NCN) is funded by the US National
Science Foundation.
Activities, including *Discrete Math Days in the Northeast* (DMD), *Summer
Combo in Vermont*, and the *Virtual Combinatorics Colloquium* (VCC), are
detailed on the NCN website:
Google Sites: Northeast Combinatorics Network
<https://sites.google.com/view/northeastcombinatoricsnetwork/home>
Email: northeastcombinatoricsnetwork@gmail.com
YouTube Channel: Northeast
Combinatorics Network
<https://www.youtube.com/channel/UCQYSxI_EL0nhE9E6aZZra5Q>
On behalf of the organizers: Jo Ellis-Monaghan and Bill Martin
*Jo*
Jo Ellis-Monaghan
Chair, Department of Mathematics and Statistics (on sabbatical 2019-2020)
Editor-in-Chief, PRIMUS
Saint Michael's College
One Winooski Park
Colchester, VT 05439
office: Jeanmarie 279
website: http://academics.smcvt.edu/jellis-monaghan/
phone: 802 654 2660
fax: 802 654 2960
e-mail: je <jellis-monaghan@smcvt.edu>llismonaghan@gmail.com
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
