Solvability of the Cauchy problem for a polynomial difference operator and monomial bases for the quotients of a polynomial ring (Q2352668): Difference between revisions

The authors consider difference operators on \(\mathbb{Z}_+^n\), that is, linear combinations of shifts, \(P(\delta)=\sum_{|\alpha| \leq m} c_\alpha \delta_1^{\alpha_1} \cdots \delta_n^{\alpha_n}\), where \(\delta_j\) is the shift in \(j\)-th variable, and \(\alpha = (\alpha_1,\dots,\alpha_n)\) is a multi-index with \(\ell^1\) norm denoted \(| \alpha|\). Fixing \(\beta\) such that \(|\beta |= m\) and \(c_\beta \neq 0\), the authors consider the Cauchy problem with prescribed values on the set \(\{x\in\mathbb{Z}_+^n \mid x_i < \beta_i \text{ for some }i\}\), and prove existence and uniqueness of solutions if \(| c_\beta|> \sum_{\alpha \neq \beta, |\alpha |= m} | c_\alpha |\). The proof proceeds by rewriting the system as a hierarchy of finite linear systems and by studying the determinants of those systems. The authors also prove that, in general, solvability of the Cauchy problem is determined only by the leading order terms (those with \(|\alpha|=m\)).