448 research outputs found

    Geometric and Measure-Theoretic Shrinking Targets in Dynamical Systems

    Get PDF
    We consider both geometric and measure-theoretic shrinking targets for ergodic maps, investigating when they are visible or invisible. Some Baire category theorems are proved, and particular constructions are given when the underlying map is fixed. Open questions about shrinking targets are also described

    Geometric and Measure-Theoretic Shrinking Targets in Dynamical Systems

    Get PDF
    We consider both geometric and measure-theoretic shrinking targets for ergodic maps, investigating when they are visible or invisible. Some Baire category theorems are proved, and particular constructions are given when the underlying map is fixed. Open questions about shrinking targets are also described

    Uniform distributions on curves and quantization

    Get PDF
    The basic goal of quantization for probability distribution is to reduce the number of values, which is typically uncountable, describing a probability distribution to some finite set and thus to make an approximation of a continuous probability distribution by a discrete distribution. It has broad application in signal processing and data compression. In this paper, first we define the uniform distributions on different curves such as a line segment, a circle, and the boundary of an equilateral triangle. Then, we give the exact formulas to determine the optimal sets of n -means and the n th quantization errors for different values of n with respect to the uniform distributions defined on the curves. In each case, we further calculate the quantization dimension and show that it is equal to the dimension of the object; and the quantization coefficient exists as a finite positive number. This supports the well-known result of Bucklew and Wise \cite{BW}, which says that for a Borel probability measure P with non-vanishing absolutely continuous part the quantization coefficient exists as a finite positive number

    Optimal Quantization Via Dynamics

    Get PDF
    Quantization for probability distributions refers broadly to estimating a given probability measure by a discrete probability measure supported by a finite number of points. We consider general geometric approaches to quantization using stationary processes arising in dynamical systems, followed by a discussion of the special cases of stationary processes: random processes and Diophantine processes. We are interested in how close stationary process can be to giving optimal n-means and nth optimal mean distortion errors. We also consider different ways of measuring the degree of approximation by quantization, and their advantages and disadvantages in these different contexts

    Differentiating Orlicz spaces with rare bases of rectangles

    Full text link
    In the current paper, we study how the speed of convergence of a sequence of angles decreasing to zero influences the possibility of constructing a rare differentiation basis of rectangles in the plane, one side of which makes with the horizontal axis an angle belonging to the given sequence, that differentiates precisely a fixed Orlicz space
    • …
    corecore