{"id":4109,"date":"2021-07-07T15:44:38","date_gmt":"2021-07-07T19:44:38","guid":{"rendered":"http:\/\/matroidunion.org\/?p=4109"},"modified":"2021-07-14T15:52:35","modified_gmt":"2021-07-14T19:52:35","slug":"online-talk-eimear-byrne","status":"publish","type":"post","link":"https:\/\/matroidunion.org\/?p=4109","title":{"rendered":"Online Talk: Eimear Byrne"},"content":{"rendered":"\n<p><strong>Monday, July 12,<\/strong> <strong>3pm ET<\/strong> (8pm BST, 7am Tue NZST)<br \/><strong><a href=\"https:\/\/people.ucd.ie\/ebyrne\">Eimear Byrne<\/a><\/strong>, University College Dublin<br \/><strong>Some recent results on q-matroids<\/strong><\/p>\n<p><b><\/b><strong>Abstract:<br \/><\/strong>The q-analogue of a (poly)matroid has been a topic of recent interest among the coding theory community, due to their connections with rank-metric codes (see e.g. [GJLR20], [JP18], [Shi19]). When defining a q-(poly)matroid, we associate a rank function with the lattice of subspaces of a finite dimensional space E. As one might expect, there are several cryptomorphic descriptions of a q-matroid, in terms of independent spaces, circuits, flats, etc. We will go through some of these, highlighting the difference to the classical case. We will also outline some applications of q-(poly)matroids to the construction of the q-analogue of a t-design.<\/p>\n<h5>\u00a0<\/h5>\n<h5>Some of the results of this talk are based on joint work with Michela Ceria, Sorina Ionica, Relinde Jurrius and Elif Sacikara.<\/h5>\n<h5>\u00a0<\/h5>\n<h5>[JP18] Relinde Jurrius and Ruud Pellikaan. Defining the q-analogue of a matroid. Electronic Journal of Combinatorics, 25(3):P3.2, 2018.<\/h5>\n<h5>[GJLR20] Elisa Gorla, Relinde Jurrius, Hiram H L\u00b4opez, and Alberto Ravagnani. Rank-metric codes and q-polymatroids. Journal of Algebraic Combinatorics, 52:1\u201319, 2020.<\/h5>\n<h5>[Shi19] Keisuke Shiromoto. Codes with the rank metric and matroids. Designs, Codes and Cryptography, 87(8):1765\u20131776, 2019.<\/h5>\n","protected":false},"excerpt":{"rendered":"<p>Monday, July 12, 3pm ET (8pm BST, 7am Tue NZST)Eimear Byrne, University College DublinSome recent results on q-matroids Abstract:The q-analogue of a (poly)matroid has been a topic of recent interest among the coding theory community, due to their connections with &hellip; <a href=\"https:\/\/matroidunion.org\/?p=4109\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":20,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[11],"class_list":["post-4109","post","type-post","status-publish","format-standard","hentry","category-matroids","tag-online-talks"],"_links":{"self":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4109","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/users\/20"}],"replies":[{"embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=4109"}],"version-history":[{"count":3,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4109\/revisions"}],"predecessor-version":[{"id":4138,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4109\/revisions\/4138"}],"wp:attachment":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=4109"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=4109"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=4109"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}