2000 character limit reached
Noetherianity and rooted trees
Published 14 Sep 2015 in math.RT and math.CO | (1509.04228v1)
Abstract: Let T be the category whose objects are rooted trees and morphisms are order embeddings preserving the root. We prove that finitely generated representations of T are Noetherian using techniques developed by Sam and Snowden which generalize classical Grobner theory. The proof uses a relative version of Kruskals tree Theorem.
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.