My research
Logic of Random Graphs
This was my master's project at Phystech. The main objective of the project was to prove if the $\mathcal{L}^k$ zero-one law for random graphs holds for first-order formulae with at most $k$-veriables and to find the minum $k$ such that $\mathcal{L}^k$ has an infinite spectrum. The first part of the project is done and only the spectrum remains. See
Logic of random graph project. The outcome of this project is a paper with
Maksim Zhukovskii which is still in preparation.
Algebraic Graph Theory
You can find a draft of my thesis on this here.
Hadamard Diagonalizable Graphs
This is the project which the Discrete Mathematics Research Group at the University of Regina is working on this Fall 2018. The objective of the project is to find more graphs whose adjacency matrices are Hadamard Diagonalizable.
Publications
Soon...
Thesis