2 citations · 5 across the 12 of their papers we have counts for
4 papers · 1 filter
Optimal Aggregation of Blocks into Subproblems in Linear-Programs with Block-Diagonal-Structure
Deepak Ponvel Chermakani
Wall-clock-time is minimized for a solution to a linear-program with block-diagonal-structure, by decomposing the linear-program into as many small-sized subproblems as possible, e…
Efficiently determining Convergence in Polynomial Recurrence Sequences
Deepak Ponvel Chermakani
We derive the necessary and sufficient condition, for a given Polynomial Recurrence Sequence to converge to a given target rational K. By converge, we mean that the Nth term of the…
Expressing Reachability in Linear Recurrences, as Infinite Determinants and Rational Polynomial Equations
Deepak Ponvel Chermakani
We present two tools, which could be useful in determining whether or not a non-Homogenous Linear Recurrence can reach a desired rational. First, we derive the determinant that is…
A new Rational Generating Function for the Frobenius Coin Problem
Deepak Ponvel Chermakani
An important question arising from the Frobenius Coin Problem is to decide whether or not a given monetary sum S can be obtained from N coin denominations. We develop a new Generat…