Combinatorial decompositions for monomial ideals (Q2229738)

The concept of involutive division has been introduced first in the works of \textit{Ch. Riquier} [Les systèmes d'équations aux dérivées partielles. Paris: Gauthier-Villars (1909; JFM 40.0411.01)] and \textit{M. Janet} [Leçons sur les systèmes d'équations aux dérivées partielles. Paris: Gauthier-Villars (1929; JFM 55.0276.01)]. Then, this notion has been formalized by \textit{V. P. Gerdt} and \textit{Y. A. Blinkov} [Math. Comput. Simul. 45, No. 5--6, 519--541 (1998; Zbl 1017.13500); Math. Comput. Simul. 45, No. 5--6, 543--560 (1998; Zbl 1017.13501)]. Indeed, the main purpose in this kind of division is the following. For a given set of terms \(U\) in the polynomial ring \(R:=K[x_1,\ldots ,x_n]\) and any term \(u\in U\), the set of variables is partioned into two sets, namely multiplicative and non-multiplicative variables. There are several examples for the involutive divisions. The most important ones consist of Janet, Pommaret and Thomas divisions. Based on these divisions and the definition of Gröbner bases, one is able to define Janet, Pommaret and Thomas bases for a given ideal. Using involutive divisions and by introducing the new notion of combinatorial decompositions, the author studies the escalier/ideal partition problem posed by \textit{M. Janet} [Ann. Sci. Éc. Norm. Supér. (3) 41, 27--65 (1924; JFM 50.0321.03)]: Let \(T_D\subset R\) be the set of all terms in \(R\) of a given degree \(D\). Furthermore, assume that we are given the Hilbert function \[ H(d)=\begin{cases} \binom{n+d-1}{d} & 0\le d< D \\ \sum_{i=1}^{n}{\sigma_i \binom{d-D+i-1}{i-1}} & d\ge D \end{cases} \] where \(\sigma_i\)'s are non-negative integers. Suppose that \(A,B\subset T_D\). The question is to find, if exists, a monomial ideal \(I\) such that the Hilbert function of \(I\) is \(H\), \(I\) is generated by some elements in \(T_D\), \(A\subset I\) and \(B \cap I=\emptyset\).