2000 character limit reached
Graph colouring and Steenrod's problem for Stanley-Reisner rings (2501.09991v1)
Published 17 Jan 2025 in math.AT and math.CO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.