Tuesday, 6 pm (or 7 pm)

Novosibirsk, Time zone UTC+7

**Zoom****-Conference:** https://us02web.zoom.us/j/7612939528

Novosibirsk, Time zone UTC+7

Lectorium on Algebraic

Graph Theory

Graph Theory

Mathematical Center in Akademgorodok,

Novosibirsk, Russia

Novosibirsk, Russia

Lectorium on Algebraic Graph Theory is an International Educational Program of the Mathematical Center in Akademgorodok. The main goal of the program is to educate students and young researchers in the main aspects, directions and problems of algebraic graph theory. In the frame of the program famous young researchers and professors over the world give lectures on a wide range of topics in algebraic graph theory and its application.

Current events

Minicourse: Right-angled Artin groups and the R-infinity property

by Pieter Senden

by Pieter Senden

Pieter Senden is a talented young researcher, who obtained his Master's degree at KU Leuven, Belgium, under the supervision of Professor Karel Dekimpe, in the year 2019. After graduation from the master's program he got a position of the PhD student, funded by The Research Foundation – Flanders (FWO). At the moment he is finishing his PhD thesis at KU Leuven, Kulak Kortrijk Campus.

Description of the course

In this mini-course we explore the relation between the properties of a right-angled Artin group (RAAG) and the properties of its defining graph, which we then use to discuss the R-infinity property for RAAGs. In the first part we introduce RAAGs and provide a (non-exhaustive) dictionary to see how graph theoretical properties translate into algebraic properties of the groups and vice versa. In the second part we give an introduction to twisted conjugacy and the R-infinity property after which we use the aforementioned dictionary to prove that certain families of RAAGs have the R-infinity property. We illustrate both parts with concrete examples.

Tuesday, 7 pm

Novosibirsk, Time zone UTC+7

Zoom-Conference https://us02web.zoom.us/j/7612939528

Novosibirsk, Time zone UTC+7

Zoom-Conference https://us02web.zoom.us/j/7612939528

Minicourse: Coverings of graphs and maps

by Roman Nedela

by Roman Nedela

Roman Nedela obtained his PhD in 1991 at Comenius University, Bratislava, under the supervision of Professor Stefan Znam. Most of his career he spent at the Department of Mathematics, Matej Bel University first at the position of associated professor, since 1996 at the position of professor. In the period 2001-2006 he was employed by the Math. institute of the Slovak Academy of Siences, where he has a part time job till

nowadays. Since 2018 he is a full professor at the Department of Mathematics, University of West Bohemia, Pilsen. His research interests include graph theory, combinatorics, algebraic graph theory, theory of finite groups and geometry. He is a (co)author of 110 research papers.

nowadays. Since 2018 he is a full professor at the Department of Mathematics, University of West Bohemia, Pilsen. His research interests include graph theory, combinatorics, algebraic graph theory, theory of finite groups and geometry. He is a (co)author of 110 research papers.

Description of the course

A covering between two graphs is a graph epimorphism which is locally bijective. Although the concept of coverings of topological spaces was well known in algebraic topology for a long time, a systematic combinatorial approach to graph coverings is related to the solution of the Heawood map colouring problem by Ringel and Youngs. Nowadays the concept of graph coverings forms an integral part of graph theory well established in the monograph by Gross and Tucker (1987) and has found dozen of applications, in particular, as a strong construction technique.

The aim of the course is to explain foundations of the combinatorial theory of graph coverings and its extension to branched coverings between 1-dimensional and 2-dimensional orbifolds.

The aim of the course is to explain foundations of the combinatorial theory of graph coverings and its extension to branched coverings between 1-dimensional and 2-dimensional orbifolds.

Tuesday, 6 pm

Novosibirsk, Time zone UTC+7

Zoom-Conference https://us02web.zoom.us/j/7612939528

Novosibirsk, Time zone UTC+7

Zoom-Conference https://us02web.zoom.us/j/7612939528

February 8, 2022

1. Graphs and Groups

Basic concepts. Graphs with semiedges and their fundamental groups. Graph coverings. Groups acting on graphs. Group of covering transformations. Subgroup enumeration in some finitely generated groups. Enumeration of conjugacy classes of subgroups. Universal covers.

Basic concepts. Graphs with semiedges and their fundamental groups. Graph coverings. Groups acting on graphs. Group of covering transformations. Subgroup enumeration in some finitely generated groups. Enumeration of conjugacy classes of subgroups. Universal covers.

February 22, 2022

2. Combinatorial description

Graph coverings and two group actions on a fibre. Voltage spaces: permutation voltage space, Cayley voltage space, Coset voltage space. When a covering is connected, T-reduced voltage spaces. Equivalence of coverings. Enumeration of Coverings.

Graph coverings and two group actions on a fibre. Voltage spaces: permutation voltage space, Cayley voltage space, Coset voltage space. When a covering is connected, T-reduced voltage spaces. Equivalence of coverings. Enumeration of Coverings.

March 8, 2022

3. Applications of graph coverings

Regular graphs with large girth. Large graphs of given degree and diameter. Nowhere-zero flows and coverings. 3-edge colourings of cubic graphs.

Regular graphs with large girth. Large graphs of given degree and diameter. Nowhere-zero flows and coverings. 3-edge colourings of cubic graphs.

March 22, 2022

4. Coverings between embedded graphs

Lift of a graph and lift of a map. Heawood map coloring problem. Construction of (near) triangular embeddings of Kn. Riemann-Hurwitz theorem. Maps on orbifolds. Voltages at vertices. Discrete actions of groups on surfaces. Equivalence of actions and equivalence of coverings. Cyclic actions and map enumeration.

Lift of a graph and lift of a map. Heawood map coloring problem. Construction of (near) triangular embeddings of Kn. Riemann-Hurwitz theorem. Maps on orbifolds. Voltages at vertices. Discrete actions of groups on surfaces. Equivalence of actions and equivalence of coverings. Cyclic actions and map enumeration.

April 5, 2022

5. Lifting automorphism problem

Classical approach Lifting of graph automorphisms in terms of voltages. Lifting problem, case of abelian CT(p). Elementary abelian CT(p).

Classical approach Lifting of graph automorphisms in terms of voltages. Lifting problem, case of abelian CT(p). Elementary abelian CT(p).

April 19, 2022

6. Branched coverings of graphs

Harmonic morphisms of graphs. Riemann-Hurwitz theorem for Graphs. Laplacian of a graph and the Matrix-Tree Theorem. Jacobian of a graph.

Harmonic morphisms of graphs. Riemann-Hurwitz theorem for Graphs. Laplacian of a graph and the Matrix-Tree Theorem. Jacobian of a graph.

- A. Gross, Jonathan L.; Tucker, Thomas W. Topological graph theory. Wiley-Interscience Series in

Discrete Mathematics and Optimization. A Wiley-Interscience Publication. John Wiley & Sons, Inc., New

York, 1987. xvi+351 pp. ISBN: 0-471-04926-3. - A. Mednykh, R. Nedela, Harmonic morphisms of graphs, Part I: Graph Coverings, Matej Bel Uni-

versity, 2015.

Minicourse: **Generalized quadrangles and applications**

by Leo Storme

by Leo Storme

Leo Storme obtained his PhD in 1991 at Ghent University, Belgium, under the supervision of Professor Joseph A. Thas. He started in 1988 his research career with the Fund for Scientific Research — Flandres, Belgium. On October 1, 2000, he became assistant professor at Ghent University. Since 2006, he is full professor at Ghent University and he has been a Fellow of the Alexander von Humboldt Foundation in 2006. He works on problems on substructures in finite geometry, and also on links with coding theory. He is a (co)author of 170 research papers.

Description of the course

In this minicourse we will give an introduction to finite generalized quadrangles, embedded in finite geometries, and applications to graph theory and coding theory. We start with an introduction to finite geometry, discuss the polarities and the corresponding finite classical polar spaces. We then introduce finite generalized quadrangles and present the finite classical generalized quadrangles as being the finite classical polar spaces of rank two.

The finite generalized quadrangles are first of all investigated because of their geometrical interest. But they are also of interest for other research domains. We present applications in graph theory, and we also discuss linear codes defined by finite generalized quadrangles.

The finite generalized quadrangles are first of all investigated because of their geometrical interest. But they are also of interest for other research domains. We present applications in graph theory, and we also discuss linear codes defined by finite generalized quadrangles.

- A. Cossidente and F. Pavese, Strongly regular graphs from classical generalized quadrangles.
*Des. Codes Cryptogr*. 85 (2017), no. 3, 457–470. - S. Gravier, A. Parreau, S. Rottey, L. Storme, and É. Vandomme, Identifying codes in vertex-transitive graphs and strongly regular graphs.
*Electron. J. Combin*. 22 (2015), no. 4, Paper 4.6, 26 pp. - T. Héger and L. Hernandez Lucas, Dominating sets in finite generalized quadrangles.
*Ars. Math. Contemporanea*19 (2020), 61–76. - J.W.P. Hirschfeld and J.A. Thas, General Galois geometries. Springer Monographs in Mathematics.
*Springer, London,*2016. - J.-L. Kim, K.E. Mellinger, and L. Storme, Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles.
*Des. Codes Cryptogr*. 42 (2007), no. 1, 73–92. - M. Lavrauw and G. Van de Voorde, Locally repairable codes with high availability based on generalised quadrangles. (arXiv:1912.06372)
- Z. Liu and D.A. Pados, LDPC codes from generalized polygons
*.**IEEE Trans. Inform. Theory*51 (2005), no. 11, 3890–3898. - S.E. Payne and J.A. Thas, Finite generalized quadrangles. Second edition. EMS Series of Lectures in Mathematics.
*European Mathematical Society (EMS), Zürich,*2009. - V. Pepe, L. Storme, and G. Van de Voorde, On codewords in the dual code of classical generalised quadrangles and classical polar spaces.
*Discrete Math***.**310 (2010), no. 22, 3132–3148.

Minicourse: Construction of combinatorial structures from finite groups

by Andrea Švob

by Andrea Švob

Andrea Švob obtained her PhD thesis at the University of Zagreb, Croatia, under the supervision of Professor Dean Crnković, in the year 2013. Since November 2007, she had been employed at the Department of Mathematics of the University of Rijeka and currenty works there as an assistant professor. She is a (co)author of 24 research papers.

Description of the course

In this minicourse we give an introduction to one of the methods for construction of combinatorial structures from finite groups. The focus is on distance-regular graphs and combinatorial designs. In the first part of the course we give a construction of transitive combinatorial structures i.e. the structures on which finite groups act transitively. In the second part we extend and generalize the method to obtain non-transitive structures. The methods are followed up with various examples. Finally, we show some of the applications of the constructed structures.

Minicourse: A not so short introduction into Algebraic Graph Theory

by Štefan Gyürki

by Štefan Gyürki

Štefan Gyürki received his PhD from Comenius University (Bratislava, Slovakia) in 2009. He spent a year as a postdoc student at Ben-Gurion University of the Negev (Beer-Sheva, Israel) under the guidance of Prof. Mikhail Klin. He is a (co)author of 10 research publications. He currently works at the Slovak University of Technology as a researcher.

Description of the course

This minicourse provides a gentle introduction into the theory of coherent configurations and association schemes. We start the considerations with the theory of permutation groups and their actions. After that we introduce the terms of a coherent configuration and association scheme. A significant family of coherent configurations and associations schemes arose with the aid of permutation groups, these are called Schurian. We spend some time on the investigations of a few objects which are non-Schurian, while at the end of the minicourse we will approach the most symmetric (in the sense of the number of automorphisms) strongly regular graph with parameters (26,10,3,4).

Basic knowledge of algebra is required, but all other concepts are explained in the course.

Basic knowledge of algebra is required, but all other concepts are explained in the course.

Materials

March 23, 2021

Permutation groups (basics)

Video

Slides

Assignment

Video

Slides

Assignment

April 6, 2021

Invariant relations of permutation groups

Video

Slides

**Assignment**

Video

Slides

April 20, 2021

Coherent configurations and association schemes

Video

Slides

Assignment

Video

Slides

Assignment

May 4, 2021

Coherent closure

Video

Slides

Assignment

Video

Slides

Assignment

Useful links

Workshops, seminars and conferences on algebraic graph theory organized by our team

http://mca.nsu.ru/atg4_2021/

http://mca.nsu.ru/atg3_2020/

http://mca.nsu.ru/atg2020/

http://mca.nsu.ru/atg2019en/

We would be glad to see you as a participant of our future events.

Videos of talks given on workshops, seminars and conferences on algebraic graph theory organized by our team:

https://www.youtube.com/playlist?list=PLaX3n04-uUZr9jVGOCYzPsB9L0Qzo9KeN

Videos of talks given on Lectorium on Algebraic Graph Theory are submitted to the playlist.

http://mca.nsu.ru/atg4_2021/

http://mca.nsu.ru/atg3_2020/

http://mca.nsu.ru/atg2020/

http://mca.nsu.ru/atg2019en/

We would be glad to see you as a participant of our future events.

Videos of talks given on workshops, seminars and conferences on algebraic graph theory organized by our team:

https://www.youtube.com/playlist?list=PLaX3n04-uUZr9jVGOCYzPsB9L0Qzo9KeN

Videos of talks given on Lectorium on Algebraic Graph Theory are submitted to the playlist.

Lectorium is organized by

Organizer

e_konsta@math.nsc.ru

e_konsta@math.nsc.ru

Organizer

ntr@math.nsc.ru

ntr@math.nsc.ru

Dmitry Churikov

Organizer

chdv@math.nsc.ru

chdv@math.nsc.ru

Supported by Mathematical Center in Akademgorodok under agreement No. 075-15-2019-1675 with the Ministry of Science and Higher Education of the Russian Federation