English

FI-sets with relations

Combinatorics 2018-04-16 v2 Representation Theory

Abstract

Let FI denote the category whose objects are the sets [n]={1,,n}[n] = \{1,\ldots, n\}, and whose morphisms are injections. We study functors from the category FI into the category of sets. We write Sn\mathfrak{S}_n for the symmetric group on [n][n]. Our first main result is that, if the functor [n]Xn[n] \mapsto X_n is "finitely generated" there there is a finite sequence of integers mim_i and a finite sequence of subgroups HiH_i of Smi\mathfrak{S}_{m_i} such that, for nn sufficiently large, XniSn/(Hi×Snmi)X_n \cong \bigsqcup_i \mathfrak{S}_n/(H_i \times \mathfrak{S}_{n-m_i}) as a set with Sn\mathfrak{S}_n action. Our second main result is that, if [n]Xn[n] \mapsto X_n and [n]Yn[n] \mapsto Y_n are two such finitely generated functors and RnXn×YnR_n \subset X_n \times Y_n is an FI-invariant family of relations, then the (0,1)(0,1) matrices encoding the relation RnR_n, when written in an appropriate basis, vary polynomially with nn. In particular, if RnR_n is an FI-invariant family of relations from XnX_n to itself, then the eigenvalues of this matrix are algebraic functions of nn. 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 nn, while also expanding this result to a larger family of graphs.

Keywords

Cite

@article{arxiv.1804.04238,
  title  = {FI-sets with relations},
  author = {Eric Ramos and David Speyer and Graham White},
  journal= {arXiv preprint arXiv:1804.04238},
  year   = {2018}
}
R2 v1 2026-06-23T01:21:04.192Z