Graph colouring and Steenrod's problem for Stanley-Reisner rings
Algebraic Topology
2025-01-20 v1 Combinatorics
Abstract
It is a classical problem in algebraic topology asked by Steenrod which graded rings occur as the cohomology ring of a space. In this paper, we define an algebraic version of the graph colouring, span colouring, and observe the relation between span colourings and Steenrod's problem for graded Stanley-Reisner rings, in other words polynomial rings divided by an ideal generated by square-free monic monomials.
Cite
@article{arxiv.2501.09991,
title = {Graph colouring and Steenrod's problem for Stanley-Reisner rings},
author = {Donald Stanley and Masahiro Takeda},
journal= {arXiv preprint arXiv:2501.09991},
year = {2025}
}
Comments
33 pages