نتایج جستجو برای: polytope
تعداد نتایج: 3669 فیلتر نتایج به سال:
Lorentzian polynomials, recently introduced by Brändén and Huh, generalize the notion of log-concavity sequences to homogeneous polynomials whose supports are integer points generalized permutahedra. Huh show that normalizations point transforms permutahedra Lorentzian. Moreover, certain projections with zero-one vertices also Taking this polytopal perspective further, we flow polytopes
We consider the longest common subsequence problem (lcs) and a variant of it where each symbol may occur at most once in the common subsequence. The lcs is a well-known problem that can be solved in polynomial time by a dynamic programming algorithm. We provide a complete description of a polytope we associate with the lcs. The integrality of this polytope can be derived by showing that it is i...
The n Birkhoff polytope is the set of all doubly stochastic n × n matrices, that is, those matrices with nonnegative real coefficients in which every row and column sums to one. A wide open problem concerns the volumes of these polytopes, which have been known for n ≤ 8. We present a new, complex-analytic way to compute the Ehrhart polynomial of the Birkhoff polytope, that is, the function coun...
Approximating a given three-dimensional object in order to simplify its handling is a classical topic in computational geometry and related fields. A typical approach is based on incremental approximation algorithms, which start with a small and topologically correct polytope representation (the seed polytope) of a given sample point cloud or input mesh. In addition, a correspondence between th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید