Conditional constrained and unconstrained quantization for uniform distributions on regular polygons
Abstract
In this paper, we have considered a uniform distribution on a regular polygon with k-sides for some k≥ 3 and the set of all its k vertices as a conditional set. For the uniform distribution under the conditional set first, for all positive integers n≥ k, we obtain the conditional optimal sets of n-points and the nth conditional quantization errors, and then we calculate the conditional quantization dimension and the conditional quantization coefficient in the unconstrained scenario. Then, for the uniform distribution on the polygon taking the same conditional set, we investigate the conditional constrained optimal sets of n-points and the conditional constrained quantization errors for all n ≥ 6, taking the constraint as the circumcircle, incircle, and then the different diagonals of the polygon.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.