Abstract

Let FI denote the category whose objects are the sets $[n] = \{1,\ldots, n\}$, and whose morphisms are injections. We study functors from the category FI into the category of sets. We write $\mathfrak{S}_n$ for the symmetric group on $[n]$. Our first main result is that, if the functor $[n] \mapsto X_n$ is there there is a finite sequence of integers $m_i$ and a finite sequence of subgroups $H_i$ of $\mathfrak{S}_{m_i}$ such that, for $n$ sufficiently large, $X_n \cong \bigsqcup_i \mathfrak{S}_n/(H_i \times \mathfrak{S}_{n-m_i})$ as a set with $\mathfrak{S}_n$ action. Our second main result is that, if $[n] \mapsto X_n$ and $[n] \mapsto Y_n$ are two such finitely generated functors and $R_n \subset X_n \times Y_n$ is an FI-invariant family of relations, then the $(0,1)$ matrices encoding the relation $R_n$, when written in an appropriate basis, vary polynomially with $n$. In particular, if $R_n$ is an FI-invariant family of relations from $X_n$ to itself, then the eigenvalues of this matrix are algebraic functions of $n$. As an application of this theorem we provide a proof of a result about eigenvalues of adjacency matrices claimed by the first and last author. This result recovers, for instance, that the adjacency matrices of the Kneser graphs have eigenvalues which are algebraic functions of $n$, while also expanding this result to a larger family of graphs.

Highlights

  • We begin with a specific example of the sort of phenomenon we seek to explain

  • The eigenvalues each agree with a function which is algebraic over the field

  • The main goal of this paper is to provide a uniform framework under which one can deduce the existence of these behaviors

Read more

Summary

Introduction

We begin with a specific example of the sort of phenomenon we seek to explain. The Kneser graph KG(n, r) has as vertices the r–element subsets of n and has an edge between two vertices if and only if the corresponding subsets are disjoint. Its adjacency matrix is computed in [8, Section 9.4] to have eigenvalues λi := (−1)i n−r−i r−i for 0 i r. The total number of distinct eigenvalues is eventually independent of n. There are eventually exactly r + 1 such eigenvalues. Manuscript received 23rd May 2018, revised 10th February 2020 and 10th February 2020, accepted 6th May 2020.

FI–modules and representation stability
FI–sets
Relations of FI–sets
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call