Systems of ideals parametrized by combinatorial structures

Authors Robert P. Laudone, Andrew Snowden

Publication date 7 April 2023

Abstract: A symmetric chain of ideals is a rule that assigns to each finite set

S

an ideal

I_{S}

in the polynomial ring

m a t h b b C [x_{i}]_{i i n S}

such that if

p h i c o l o n S o T

is an embedding of finite sets then the induced homomorphism

p h i_{*}

maps

I_{S}

into

I_{T}

. Cohen proved a fundamental noetherian result for such chains, which has seen intense interest in recent years due to a wide array of new applications. In this paper, we consider similar chains of ideals, but where finite sets are replaced by more complicated combinatorial objects, such as trees. We give a general criterion for a Cohen-like theorem, and give several specific examples where our criterion holds. We also prove similar results for certain limiting situations, where a permutation group acts on an infinite variable polynomial ring. This connects to topics in model theory, such as Fra"iss'e limits and oligomorphic groups.

This page was built for publication: Systems of ideals parametrized by combinatorial structures

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