Families of nested graphs with compatible symmetric-group actions

From MaRDI portal
Publication:2335508

DOI10.1007/S00029-019-0520-9zbMATH Open1428.05321arXiv1711.07456OpenAlexW2988974455WikidataQ126836660 ScholiaQ126836660MaRDI QIDQ2335508FDOQ2335508


Authors: Eric Ramos, Graham White Edit this on Wikidata


Publication date: 14 November 2019

Published in: Selecta Mathematica. New Series (Search for Journal in Brave)

Abstract: For fixed positive integers n and k, the Kneser graph KGn,k has vertices labeled by k-element subsets of 1,2,dots,n and edges between disjoint sets. Keeping k fixed and allowing n to grow, one obtains a family of nested graphs, each of which is acted on by a symmetric group in a way which is compatible with all of the other actions. In this paper, we provide a framework for studying families of this kind using the FI-module theory of Church, Ellenberg, and Farb, and show that this theory has a variety of asymptotic consequences for such families of graphs. These consequences span a range of topics including enumeration, concerning counting occurrences of subgraphs, topology, concerning Hom-complexes and configuration spaces of the graphs, and algebra, concerning the changing behaviors in the graph spectra.


Full work available at URL: https://arxiv.org/abs/1711.07456




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Families of nested graphs with compatible symmetric-group actions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2335508)