No label defined (Q4790463)

Let \({\mathcal C}\subseteq{\mathbb R}^n\) be a polyhedral cone with rational generators and let \(\Lambda\subseteq{\mathbb Z}^n\) be a lattice. We call a finite set \( H=\{h_1,\dots,h_t\}\subseteq\Lambda\cap{\mathcal C}\) a generating set of the monoid \((\Lambda\cap{\mathcal C},+)\) if for every \(z\in\Lambda\cap{\mathcal C}\) there exist integers \(\lambda_1\geq 0,\dots,\lambda_t\geq 0\) such that \(z=\sum_{i=1}^t\lambda_ih_i\). For every pointed rational polyhedral cone \({\mathcal C}\subseteq{\mathbb R}^n\) and every lattice \(\Lambda\subseteq{\mathbb Z}^n\) there exists a unique generating set of the monoid \((\Lambda\cap{\mathcal C},+)\) that is minimal with respect to inclusion. For \(\Lambda={\mathbb Z}^n\) this generating set is also called a Hilbert basis. The author gives a novel project-and-lift algorithm to compute minimal generating sets for \({\mathcal C}={\mathbb R}_+^n\) and arbitrary lattices \(\Lambda\subseteq{\mathbb Z}^n\). For the entire collection see [Zbl 0995.00019].