2000 character limit reached
Several combinatorial inequalities related to squarefree monomial ideals
Published 6 Jul 2023 in math.AC and math.CO | (2307.03018v3)
Abstract: Let $K$ be a field and $S=K[x_1,\ldots,x_n]$, the ring of polynomials in $n$ variables, over $K$. Using the fact that the Hilbert depth is an upper bound for the Stanley depth of a quotient of squarefree monomial ideals $0\subset I\subsetneq J\subset S$, we prove several combinatorial inequalities which involve the coefficients of the polynomial $f(t)=(1+t+\cdots+t{m-1})n$.
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.