# Constructing Cospectral Graphs

Last week I had a cold and could not do much thinking. So I spent my time making TikZ pictures for an upcoming talk of mine. This talk is on my recent work with Akihiro Munemasa on constructing cospectral strongly regular graphs. I think that the pictures are nice for a blog post, so here we go.

1. The Spectrum of a Graph

Two graphs ${\Gamma}$ and ${\overline{\Gamma}}$ are called cospectral if their adjacency matrices ${A}$ and ${\overline{A}}$ have the same eigenvalues. This is the same as saying that there is an orthogonal matrix ${Q}$ with ${\overline{A} = Q^T A Q}$. Any permutation matrix is a valid choice for ${Q}$, but this is not very interesting as then ${\Gamma}$ and ${\overline{\Gamma}}$ are isomorphic. Chris Godsil and Brendan McKay described one of the easiest interesting choices for ${Q}$ in 1982. For a graph ${\Gamma}$ on ${v}$ vertices, a simplified version of their matrix is

$\displaystyle Q = \begin{pmatrix} \frac{1}{m} J_{2m} - I_{2m} & 0 \\ 0 & I_{v-2m} \end{pmatrix}.$

# Boolean Degree 1 Functions on Association Schemes

This is the announced post on my recent paper with Yuval Filmus on Boolean degree ${1}$ functions on association schemes. The post will focus on what motivates the problem from various points of view.

Before I start, a small remark. I am using latex2wp for the first time in this post. Thanks to Luca Trevisan for providing this nice script.

During this post I avoid using many definition, while I cite things that use all kind of terminology. For this I wrote this blog post as a reference. We will go through the main steps in the paper and focus more on the wider context of the research, so the parts for which there is less space in papers and not enough time in talks.

# Permutation Groups, Analysis of Boolean Functions, Finite Geometry, Coding Theory and Algebraic Graph Theory

Important mathematical concepts get reinvented many times. In my recent work with Yuval Filmus we explored objects that are called (in random ordering) Boolean degree 1 functions, Cameron-Liebler line classes, equitable partitions, completely regular strength 0 codes with covering radius 1, intriguing sets, perfect colorings, sets with dual width 1, tactical decompositions or tight sets — all depending on the context and who you ask. While the article with Yuval explains to some extent how these notions connect, a research article does not seem to be the right format to explain all concepts in sufficient detail. This post tries to amend this. It also prepares a future post which will elaborate my research with Yuval in more detail. (more…)

# Schrijver’s SDP Bound for Network Codes

This is a small report on a failed project — obtaining semidefinite programming bounds on constant dimension network codes. But let us start with some context …

A network code consists of a set of subspaces in $\mathbb{F}_q^n$. It is a code, so we want to maximize the distance between subspaces (or increase the code’s cardinality or rate). The most reasonable metric for this is the subspace metric in which two subspaces $U$ and $W$ have distance $\dim(U+W) - \dim(U \cap W)$, that is the shortest distance between $U$ and $W$ in the subspace lattice. These codes are used in random linear network coding, that is a method for the many-to-many transmission of data in a network which is faster than multiple one-to-one connections. As in classical coding theory, one area of research on those subspace codes is concerned with bounding the maximal size of a code with minimum distance $d$ in $\mathbb{F}_q^n$. Notice that one can interpret $q=1$ as a field with one element as is explained here by Peter Cameron. Then it corresponds to classical coding theory. (more…)

# The chromatic number of the Kneser graphs and the q-Kneser graphs

This year is László Lovász‘s 70th birthday and I went to his birthday conference, so a blog post about one of his famous results seems to be appropriate: the chromatic number of the Kneser graph.

Let $\Gamma$ be a graph with a vertex set $V$ and an adjacency relation $\sim$. A coloring of $\Gamma$ is a map from $V$ from $V$ to a set of colors $C$ such that no pair of adjacent vertices gets mapped to the same element of $C$. The chromatic number of $\Gamma$ is the smallest number of colors needed to color $\Gamma$. One of the nicest graphs to investigate is the Kneser graph: Here $V$ consists of all subsets of $\{ 1, 2, \ldots, n \}$ of size $k$ and two vertices are adjacent if the corresponding $k$-sets are disjoint. For $k=2$ and $n=5$, this is the famous Petersen graph:

# Erdős-Ko-Rado Theorems for Spherical Buildings

Today’s topic combines three of my favorite subjects: Erdős-Ko-Rado theorems (EKR theorems), finite buildings and spectral techniques. All of these topics deserve their own books (and have them, here some examples which I read: Erdos-Ko-Rado Theorems: Algebraic Approaches by Chris Godsil and Karen Meagher, Spectra of Graphs by Andries E. Brouwer and Willem H. Haemers, The Structure of Spherical Buildings by Richard M. Weiss), so I will only touch these topics slightly.

My main aim is to present a variation of the EKR theorem which is motivated by questions about spherical buildings. The variation was recently formulated by Klaus Metsch, Bernhard Mühlherr, and me. If you already know spherical buildings, then you might prefer to read the introduction of our paper instead. (more…)