Pure O-sequences: known results, applications, and open problems
Juan Migliore, Uwe Nagel, and Fabrizio Zanello

TL;DR
This paper discusses the algebraic and combinatorial properties of pure O-sequences, highlighting their appearances in various contexts and outlining open problems for future research.
Contribution
It provides a comprehensive overview of pure O-sequences, including known results, applications, and open questions in the field.
Findings
Pure O-sequences are connected to multiple algebraic and combinatorial structures.
Several open problems related to pure O-sequences are identified for future exploration.
The paper summarizes known results and potential applications of pure O-sequences.
Abstract
This note presents a discussion of the algebraic and combinatorial aspects of the theory of pure O-sequences. Various instances where pure O-sequences appear are described. Several open problems that deserve further investigation are also presented.
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
TopicsAdvanced Algebra and Logic · semigroups and automata theory · graph theory and CDMA systems
