Let be an equigenerated squarefree monomial ideal in the polynomial ring , and let be a uniform clutter on the vertex set such that is its edge ideal. A central and challenging problem in combinatorial commutative algebra is to classify all clutters for which for a fixed positive integer , where denotes the symbolic power of . In this article, we give a complete solution to this problem for -uniform clutters. Moreover, we provide a simple combinatorial classification of all -uniform clutters having the packing property. As a consequence, we confirm the celebrated Conforti-Cornuéjols conjecture for -uniform clutters. We also compare our results with the known families of clutters for which the conjecture is known to be true. Finally, we present an application of our results to the theory of Linear Programming duality problems.

生成讲解博客的中文版本

生成AI智能校验的中文版本