As far as we know, usual computer algebra packages can not compute denumerants for almost medium (about a hundred digits) or almost medium-large (about a thousand digits) input data in a reasonably time cost on an ordinary ...

We consider the binomial random set model where each element in is chosen independently with probability . We show that for essentially all regimes of p and very general conditions for a matrix A and a column vector b, the ...

For the well known Frobenius problem, we present a new geometric approach, based on the use of the $n$-dimensional lattice $\mathbb{Z}^n$, where $n$ is the number of generators. Within this approach we are able to study ...