Scrambled sets of continuous maps of 1-dimensional polyhedra

Scrambled Sets of Continuous Maps of 1-dimensional Polyhedra

Let K be a 1-dimensional simplicial complex in R3 without isolated vertexes, X = |K| be the polyhedron of K with the metric dK induced by K, and f : X → X be a continuous map. In this paper we prove that if K is finite, then the interior of every scrambled set of f in X is empty. We also show that if K is an infinite complex, then there exist continuous maps from X to itself having scrambled se...

study of hash functions based on chaotic maps

توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...

Semi-θ-Open Sets and New Classes of Maps

L2 discrepancy of generalized two-dimensional Hammersley point sets scrambled with arbitrary permutations

The L2 discrepancy is a quantitative measure for the irregularity of distribution of a finite point set. In this paper we consider the L2 discrepancy of so-called generalized Hammersley point sets which can be obtained from the classical Hammersley point sets by introducing some permutations on the base b digits. While for the classical Hammersley point set it is not possible to achieve the opt...

Continuous Blooming of Convex Polyhedra

We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can be refined (further cut, by a linear number of cuts) to have a continuous blooming.