Lines Matching full:generating

70 /// Compute the generating function for a unimodular cone.
105   // The powers in the denominator of the generating
230 /// We maintain a list of pairwise disjoint chambers and the generating
232 /// each time adding the current region's generating function to the chambers
235 /// Given the region each generating function is active in, for each subset of
236 /// generating functions the region that (the sum of) precisely this subset is
245   // We maintain a list of regions and their associated generating function
246   // initialized with the universe and the empty generating function.
253   // For each activity region R_j (corresponding to the generating function
258   // 1. the intersection R_i \cap R_j, where the generating function is
260   // 2. the difference R_i - R_j, where the generating function is gf_i.
293 /// For a polytope expressed as a set of n inequalities, compute the generating
301 /// 2. For each vertex, identify the tangent cone and compute the generating
302 ///    function corresponding to it. The generating function depends on the
322   // generating functions of the tangent cone, in order.
405     // Now, we compute the generating function at this vertex.
410     // as the generating function only depends on these.
432     // We store the vertex we computed with the generating function of its
444   // In each chamber, we sum up the generating functions of the active vertices
445   // to find the generating function of the polytope.
549 /// Substitute x_i = t^μ_i in one term of a generating function, returning
664 /// We have a generating function of the form
678 /// 1. Substitute x_i = (s+1)^μ_i for some vector μ. This makes the generating