Simplicial complexes and Macaulay's inverse systems
Adam Van Tuyl, Fabrizio Zanello

TL;DR
This paper explores the structure of certain artinian algebras derived from simplicial complexes using Macaulay's inverse systems, identifying conditions under which these algebras are level, thus linking combinatorial topology with algebraic properties.
Contribution
It provides an explicit description of the socle of these algebras and characterizes simplicial complexes that admit a tuple making the algebra level.
Findings
Explicit socle description in terms of simplicial complexes
Identification of 'levelable' complexes for level algebra existence
Connection between combinatorial and algebraic properties
Abstract
Let be a simplicial complex on , with Stanley-Reisner ideal . The goal of this paper is to investigate the class of artinian algebras , where each . By utilizing the technique of Macaulay's inverse systems, we can explicitly describe the socle of in terms of . As a consequence, we determine the simplicial complexes, that we will call {\em levelable}, for which there exists a tuple such that is a level algebra.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Algebraic structures and combinatorial models
