Indexed metadata

FI–sets with relations

Eric Ramos, David Speyer, Graham White

Source record

Source: Crossref

Published: Oct 12, 2020

DOI: 10.5802/alco.128

Open original source ↗

Source abstract

Let FI denote the category whose objects are the sets [ n ] = { 1 , ... , n } , and whose morphisms are injections. We study functors from the category FI into the category of finite sets. We write 𝔖 n for the symmetric group on [ n ] . Our first main result is that, if the functor [ n ] ↦ X n is “finitely generated” there is a finite sequence of integers m i and a finite sequence of subgroups H i of 𝔖 m i such that, for n sufficiently large, X n ≅ ⨆ i 𝔖 n / ( H i × 𝔖 n - m i ) as a set with 𝔖 n action. Our second main result is that, if [ n ] ↦ X n and [ n ] ↦ Y n are two such finitely generated functors and R n ⊂ X n × 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.