DOCSLIB.ORG

Fractals in Dimension Theory and Complex Networks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS DOCTORAL THESIS BOOKLET Fractals in dimension theory and complex networks Author: Supervisor: István KOLOSSVÁRY Dr. Károly SIMON Doctoral School of Mathematics and Computer Science Faculty of Natural Sciences 2019 1 Introduction The word "fractal" comes from the Latin fractus¯ meaning "broken" or "fractured". Since the 1970s, 80s, fractal geometry has become an important area of mathematics with many connections to theory and practice alike. The main aim of the Thesis is to demonstrate the diverse applicability of fractals in different areas of mathematics. Namely, 1. widen the class of planar self-affine carpets for which we can calculate the dif- ferent dimensions especially in the presence of overlapping cylinders, 2. perform multifractal analysis for the pointwise Hölder exponent of a family of continuous parameterized fractal curves in Rd including deRham’s curve, 3. show how hierarchical structure can be used to determine the asymptotic growth of the distance between two vertices and the diameter of a random graph model, which can be derived from the Apollonian circle packing problem. Chapter 1 of the thesis gives an introduction to these topics and informally ex- plains the contributions made in an accessible way to a wider mathematical audience. Chapters 2, 3 and 4 contain the precise definitions and rigorous formulations of our re- sults, together with the proofs. They are based on the papers [KS18; BKK18; KKV16], respectively. 1 Self-affine planar carpets A self-affine Iterated Function System (IFS) F consists of a finite collection of maps d d fi : R ! R of the form fi(x) = Aix + ti, d×d for i 2 [N] := f1, 2, . , Ng, where Ai 2 R is a contracting, invertible matrix and d ti 2 R is a translation vector. The self-affine set corresponding to F is the unique non-empty compact set L, called the attractor, which satisfies [ L = fi(L). i2[N] Perhaps the most fundamental question in fractal geometry is to determine the different notions of dimension of a set. The thesis deals with Hausdorff, packing, (lower and upper) box, and affinity dimension denoted by dimH, dimP, dimB, dimB dimB, and dimAff, respectively. All self-affine sets satisfy dimH L ≤ dimP L ≤ dimBL ≤ minfdimAff L, dg. Equality of these dimensions is typical in some generic sense [Fal88; Sol98a; BHR17]. However, in specific cases strict inequality is possible. Planar carpets have drawn much attention, because they form a large class of examples in R2 for which this ex- ceptional behavior is typical. 2 Gatzouras–Lalley-type planar carpets Gatzouras–Lalley (GL) carpets [GL92] are the attractors of self-affine IFSs on the plane 2 whose first level cylinders (i.e. the images fi([0, 1] )) are aligned into columns (of possibly different widths) using orientation preserving maps with linear parts given by diagonal matrices. Moreover, they assumed the Rectangular Open Set Condition 2 (ROSC), i.e. the interiors of fi([0, 1] ) are disjoint, and that the width of a rectangle is larger than its height, we say that direction-x dominates. Later, Bara´nski[Bar08] kept these assumptions, but allowed lower triangular ma- 2 trices instead of diagonal. As a result, the images fi([0, 1] ) are parallelograms with two vertical sides. We call them Triangular Gatzouras–Lalley-type (TGL) planar car- pets, indicating that the linear part of the maps defining the IFS are triangular matrices and it is a natural generalization of the Gatzouras–Lalley construction. The shaded rectangles and parallelograms in Figure1 show the images of [0, 1]2 under the maps defining a GL carpet on the left and a TGL carpet on the right. There is a correspondence between the rectangles and parallelograms so that the height and width of corresponding ones coincide. We call the Gatzouras–Lalley carpet the GL- brother of the TGL carpet. Even though the ROSC holds, it is not immediate that the dimension of the two attractors should be the same. FIGURE 1: The IFS defining a Gatzouras–Lalley carpet on left and trian- gular Gatzouras–Lalley-type carpet on right, which are brothers. Other constructions for planar carpets include works of Bedford and McMullen[McM84; Bed84], Bara´nsky[Bar07], Feng–Wang [FW05] and Fraser [Fra12]. Only recently were carpets with overlaps considered, see Fraser–Shmerkin [FS16] and Pardo-Simón [PS]. The study of constructions with overlaps is always much more involved than the case when ROSC is assumed. Our goal was to study TGL carpets with overlaps. Our construction Our main contribution was to continue the works [Bar08; GL92] to allow different types of overlaps in the TGL construction. This is best illustrated with Figure2. All three examples are brothers of the GL carpet in Figure1. On the left, the columns are shifted in a way that the IFS on the x-axis generated by the columns, denoted by H, satisfies Hochman’s Exponential Separation Condition (HESC), see Definition 1.7. This type of shifted columns were considered in [FS16] and [PS] on different carpets. In the center, columns do not overlap, however, parallelograms within a column may do so if a certain transversality like condition holds, see Definition 1.7. The one on the right on Figure2 has both types of overlaps. 3 FIGURE 2: Triangular Gatzouras–Lalley-type carpets with different overlaps. Left: shifted columns satisfying Hochman’s exponential sep- aration condition. Center: non-overlapping columns, transversality condition. Right: mixture of both. To fix notation, here is the formal definition. Denote the closed unit square by R = [0, 1] × [0, 1]. Let A = fA1,..., ANg be a family of 2 × 2 invertible, strictly con- tractive, real-valued lower triangular matrices. The corresponding self-affine IFS is the collection of affine maps N bi 0 ti,1 F = f fi(x) := Aix + tigi=1, where Ai = and ti = , (1.1) di ai ti,2 for translation vectors ti, with ti,1, ti,2 ≥ 0. We assume that ai, bi 2 (0, 1). Orthogonal projection of F to the horizontal x-axis, denoted projx, generates an important self-similar IFS on the line N He = fehi(x) := bix + ti,1gi=1. F H = We denote the attractor of and e by L LF and LHe respectively. Definition 1.1. We say that an IFS of the form (1.1) is Triangular Gatzouras-Lalley type and we call its attractor L a TGL planar carpet if the following conditions hold: (a) direction-x dominates, i.e. 0 < ai < bi < 1 for all i 2 [N] := f1, 2, . , Ng, (b) column structure: there exists a partition of [N] into M > 1 sets I1,..., IM with cardi- nality jIıˆj = Nıˆ > 0 so that I1 = f1, . , N1g and Iıˆ = fN1 + ... + Nıˆ−1 + 1, . , N1 + ... + Nıˆg for ıˆ = 2, . , M. Assume that for two distinct indices k and ` 2 f1, . , Ng ( bk = b` =: rıˆ, if there exists ıˆ 2 f1, . , Mg such that k, `2 Iıˆ, then (1.2) tk,1 = t`,1 =: uıˆ. We also introduce M H = fhıˆ(x) := rıˆx + uıˆgıˆ=1, H and we observe that the attractor LH of is identical with LHe. 4 ≤ 2 f g (c) we assume that ∑j2Iıˆ aj 1 holds for every ıˆ 1, . , M and the non-overlapping column structure uıˆ + rıˆ ≤ uıˆ+1 for ıˆ = 1, . , M − 1 and uM + rM ≤ 1. (1.3) (d) Without loss of generality we always assume in this paper that (A1) fi(R) ⊂ R for all i 2 [N] and (A2) The smallest and the largest fixed points of the functions of H are 0 and 1 respec- tively. Observe that the definition allows overlaps within columns (like the second figure in Figure2), but columns do not overlap. We say that L is a shifted TGL carpet if we drop the assumption (1.3), that is non- M overlapping column structure is NOT assumed, we require only that ∑ıˆ=1 rıˆ ≤ 1 (like the first figure in Figure2). Definition 1.2. We say that a shifted TGL carpet L has uniform vertical fibres if s−sH ∑ aj = 1 for every ıˆ 2 [M], j2Iıˆ where s = dimB L and sH = dimB LH. Furthermore, we call L a diagonally homogeneous shifted TGL carpet if bi ≡ b and ai ≡ a for every i 2 [N]. In particular, a diagonally homogeneous carpet has uniform vertical fibres if N/M 2 N and Nıˆ = N/M for every ıˆ 2 f1, . , Mg. Definition 1.3. A self-affine IFS Fe is a Gatzouras-Lalley IFS and its attractor Le is a GL carpet if Fe is a TGL IFS as in Definition 1.1 with the additional assumptions that all off-diagonal elements di = 0 and the rectangular open set condition (ROSC) holds. Definition 1.4. Let L be a shifted TGL carpet generated from the IFS F of the form (1.1). We say that the Gatzouras–Lalley IFS ˜ ˜ ˜ ˜ ˜ N ˜ bi 0 ˜ ti,1 Fe = f fi(x) := Aix + tigi=1, where Ai = and ti = , 0 a˜i t˜i,2 and its attractor Le is the GL brother of F and L, respectively, if a˜i = ai and b˜i = bi for every i 2 [N], furthermore, Fe has the same column structure (1.2) as F. If the shifted TGL carpet L is actually a TGL (that is L has non-overlapping column structure) then we also require that eti,1 = ti,1 holds for all i 2 [N]. M There always exists such a brother since we assume Definition 1.1 (c) and ∑ıˆ=1 rıˆ ≤ 1. Throughout, the GL brother of L will always be denoted with the extra tilde Le.
Recommended publications
  • Using Fractal Dimension for Target Detection in Clutter

    Using Fractal Dimension for Target Detection in Clutter

    KIM T. CONSTANTIKES USING FRACTAL DIMENSION FOR TARGET DETECTION IN CLUTTER The detection of targets in natural backgrounds requires that we be able to compute some characteristic of target that is distinct from background clutter. We assume that natural objects are fractals and that the irregularity or roughness of the natural objects can be characterized with fractal dimension estimates. Since man-made objects such as aircraft or ships are comparatively regular and smooth in shape, fractal dimension estimates may be used to distinguish natural from man-made objects. INTRODUCTION Image processing associated with weapons systems is fractal. Falconer1 defines fractals as objects with some or often concerned with methods to distinguish natural ob­ all of the following properties: fine structure (i.e., detail jects from man-made objects. Infrared seekers in clut­ on arbitrarily small scales) too irregular to be described tered environments need to distinguish the clutter of with Euclidean geometry; self-similar structure, with clouds or solar sea glint from the signature of the intend­ fractal dimension greater than its topological dimension; ed target of the weapon. The discrimination of target and recursively defined. This definition extends fractal from clutter falls into a category of methods generally into a more physical and intuitive domain than the orig­ called segmentation, which derives localized parameters inal Mandelbrot definition whereby a fractal was a set (e.g.,texture) from the observed image intensity in order whose "Hausdorff-Besicovitch dimension strictly exceeds to discriminate objects from background. Essentially, one its topological dimension.,,2 The fine, irregular, and self­ wants these parameters to be insensitive, or invariant, to similar structure of fractals can be experienced firsthand the kinds of variation that the objects and background by looking at the Mandelbrot set at several locations and might naturally undergo because of changes in how they magnifications.
  • Measuring the Fractal Dimensions of Empirical Cartographic Curves

    Measuring the Fractal Dimensions of Empirical Cartographic Curves

    MEASURING THE FRACTAL DIMENSIONS OF EMPIRICAL CARTOGRAPHIC CURVES Mark C. Shelberg Cartographer, Techniques Office Aerospace Cartography Department Defense Mapping Agency Aerospace Center St. Louis, AFS, Missouri 63118 Harold Moellering Associate Professor Department of Geography Ohio State University Columbus, Ohio 43210 Nina Lam Assistant Professor Department of Geography Ohio State University Columbus, Ohio 43210 Abstract The fractal dimension of a curve is a measure of its geometric complexity and can be any non-integer value between 1 and 2 depending upon the curve's level of complexity. This paper discusses an algorithm, which simulates walking a pair of dividers along a curve, used to calculate the fractal dimensions of curves. It also discusses the choice of chord length and the number of solution steps used in computing fracticality. Results demonstrate the algorithm to be stable and that a curve's fractal dimension can be closely approximated. Potential applications for this technique include a new means for curvilinear data compression, description of planimetric feature boundary texture for improved realism in scene generation and possible two-dimensional extension for description of surface feature textures. INTRODUCTION The problem of describing the forms of curves has vexed researchers over the years. For example, a coastline is neither straight, nor circular, nor elliptic and therefore Euclidean lines cannot adquately describe most real world linear features. Imagine attempting to describe the boundaries of clouds or outlines of complicated coastlines in terms of classical geometry. An intriguing concept proposed by Mandelbrot (1967, 1977) is to use fractals to fill the void caused by the absence of suitable geometric representations.
  • A Gallery of De Rham Curves

    A Gallery of De Rham Curves

    A Gallery of de Rham Curves Linas Vepstas <[email protected]> 20 August 2006 Abstract The de Rham curves are a set of fairly generic fractal curves exhibiting dyadic symmetry. Described by Georges de Rham in 1957[3], this set includes a number of the famous classical fractals, including the Koch snowflake, the Peano space- filling curve, the Cesàro-Faber curves, the Takagi-Landsberg[4] or blancmange curve, and the Lévy C-curve. This paper gives a brief review of the construction of these curves, demonstrates that the complete collection of linear affine deRham curves is a five-dimensional space, and then presents a collection of four dozen images exploring this space. These curves are interesting because they exhibit dyadic symmetry, with the dyadic symmetry monoid being an interesting subset of the group GL(2,Z). This is a companion article to several others[5][6] exploring the nature of this monoid in greater detail. 1 Introduction In a classic 1957 paper[3], Georges de Rham constructs a class of curves, and proves that these curves are everywhere continuous but are nowhere differentiable (more pre- cisely, are not differentiable at the rationals). In addition, he shows how the curves may be parameterized by a real number in the unit interval. The construction is simple. This section illustrates some of these curves. 2 2 2 2 Consider a pair of contracting maps of the plane d0 : R → R and d1 : R → R . By the Banach fixed point theorem, such contracting maps should have fixed points p0 and p1. Assume that each fixed point lies in the basin of attraction of the other map, and furthermore, that the one map applied to the fixed point of the other yields the same point, that is, d1(p0) = d0(p1) (1) These maps can then be used to construct a certain continuous curve between p0and p1.
  • Fractals, Self-Similarity & Structures

    Fractals, Self-Similarity & Structures

    © Landesmuseum für Kärnten; download www.landesmuseum.ktn.gv.at/wulfenia; www.biologiezentrum.at Wulfenia 9 (2002): 1–7 Mitteilungen des Kärntner Botanikzentrums Klagenfurt Fractals, self-similarity & structures Dmitry D. Sokoloff Summary: We present a critical discussion of a quite new mathematical theory, namely fractal geometry, to isolate its possible applications to plant morphology and plant systematics. In particular, fractal geometry deals with sets with ill-defined numbers of elements. We believe that this concept could be useful to describe biodiversity in some groups that have a complicated taxonomical structure. Zusammenfassung: In dieser Arbeit präsentieren wir eine kritische Diskussion einer völlig neuen mathematischen Theorie, der fraktalen Geometrie, um mögliche Anwendungen in der Pflanzen- morphologie und Planzensystematik aufzuzeigen. Fraktale Geometrie behandelt insbesondere Reihen mit ungenügend definierten Anzahlen von Elementen. Wir meinen, dass dieses Konzept in einigen Gruppen mit komplizierter taxonomischer Struktur zur Beschreibung der Biodiversität verwendbar ist. Keywords: mathematical theory, fractal geometry, self-similarity, plant morphology, plant systematics Critical editions of Dean Swift’s Gulliver’s Travels (see e.g. SWIFT 1926) recognize a precise scale invariance with a factor 12 between the world of Lilliputians, our world and that one of Brobdingnag’s giants. Swift sarcastically followed the development of contemporary science and possibly knew that even in the previous century GALILEO (1953) noted that the physical laws are not scale invariant. In fact, the mass of a body is proportional to L3, where L is the size of the body, whilst its skeletal rigidity is proportional to L2. Correspondingly, giant’s skeleton would be 122=144 times less rigid than that of a Lilliputian and would be destroyed by its own weight if L were large enough (cf.
  • Fractal Initialization for High-Quality Mapping with Self-Organizing Maps

    Fractal Initialization for High-Quality Mapping with Self-Organizing Maps

    Neural Comput & Applic DOI 10.1007/s00521-010-0413-5 ORIGINAL ARTICLE Fractal initialization for high-quality mapping with self-organizing maps Iren Valova • Derek Beaton • Alexandre Buer • Daniel MacLean Received: 15 July 2008 / Accepted: 4 June 2010 Ó Springer-Verlag London Limited 2010 Abstract Initialization of self-organizing maps is typi- 1.1 Biological foundations cally based on random vectors within the given input space. The implicit problem with random initialization is Progress in neurophysiology and the understanding of brain the overlap (entanglement) of connections between neu- mechanisms prompted an argument by Changeux [5], that rons. In this paper, we present a new method of initiali- man and his thought process can be reduced to the physics zation based on a set of self-similar curves known as and chemistry of the brain. One logical consequence is that Hilbert curves. Hilbert curves can be scaled in network size a replication of the functions of neurons in silicon would for the number of neurons based on a simple recursive allow for a replication of man’s intelligence. Artificial (fractal) technique, implicit in the properties of Hilbert neural networks (ANN) form a class of computation sys- curves. We have shown that when using Hilbert curve tems that were inspired by early simplified model of vector (HCV) initialization in both classical SOM algo- neurons. rithm and in a parallel-growing algorithm (ParaSOM), Neurons are the basic biological cells that make up the the neural network reaches better coverage and faster brain. They form highly interconnected communication organization. networks that are the seat of thought, memory, con- sciousness, and learning [4, 6, 15].
  • FRACTAL CURVES 1. Introduction “Hike Into a Forest and You Are Surrounded by Fractals. the In- Exhaustible Detail of the Livin

    FRACTAL CURVES 1. Introduction “Hike Into a Forest and You Are Surrounded by Fractals. the In- Exhaustible Detail of the Livin

    FRACTAL CURVES CHELLE RITZENTHALER Abstract. Fractal curves are employed in many different disci- plines to describe anything from the growth of a tree to measuring the length of a coastline. We define a fractal curve, and as a con- sequence a rectifiable curve. We explore two well known fractals: the Koch Snowflake and the space-filling Peano Curve. Addition- ally we describe a modified version of the Snowflake that is not a fractal itself. 1. Introduction \Hike into a forest and you are surrounded by fractals. The in- exhaustible detail of the living world (with its worlds within worlds) provides inspiration for photographers, painters, and seekers of spiri- tual solace; the rugged whorls of bark, the recurring branching of trees, the erratic path of a rabbit bursting from the underfoot into the brush, and the fractal pattern in the cacophonous call of peepers on a spring night." Figure 1. The Koch Snowflake, a fractal curve, taken to the 3rd iteration. 1 2 CHELLE RITZENTHALER In his book \Fractals," John Briggs gives a wonderful introduction to fractals as they are found in nature. Figure 1 shows the first three iterations of the Koch Snowflake. When the number of iterations ap- proaches infinity this figure becomes a fractal curve. It is named for its creator Helge von Koch (1904) and the interior is also known as the Koch Island. This is just one of thousands of fractal curves studied by mathematicians today. This project explores curves in the context of the definition of a fractal. In Section 3 we define what is meant when a curve is fractal.
  • Turtlefractalsl2 Old

    Turtlefractalsl2 Old

    Lecture 2: Fractals from Recursive Turtle Programs use not vain repetitions... Matthew 6: 7 1. Fractals Pictured in Figure 1 are four fractal curves. What makes these shapes different from most of the curves we encountered in the previous lecture is their amazing amount of fine detail. In fact, if we were to magnify a small region of a fractal curve, what we would typically see is the entire fractal in the large. In Lecture 1, we showed how to generate complex shapes like the rosette by applying iteration to repeat over and over again a simple sequence of turtle commands. Fractals, however, by their very nature cannot be generated simply by repeating even an arbitrarily complicated sequence of turtle commands. This observation is a consequence of the Looping Lemmas for Turtle Graphics. Sierpinski Triangle Fractal Swiss Flag Koch Snowflake C-Curve Figure 1: Four fractal curves. 2. The Looping Lemmas Two of the simplest, most basic turtle programs are the iterative procedures in Table 1 for generating polygons and spirals. The looping lemmas assert that all iterative turtle programs, no matter how many turtle commands appear inside the loop, generate shapes with the same general symmetries as these basic programs. (There is one caveat here, that the iterating index is not used inside the loop; otherwise any turtle program can be simulated by iteration.) POLY (Length, Angle) SPIRAL (Length, Angle, Scalefactor) Repeat Forever Repeat Forever FORWARD Length FORWARD Length TURN Angle TURN Angle RESIZE Scalefactor Table 1: Basic procedures for generating polygons and spirals via iteration. Circle Looping Lemma Any procedure that is a repetition of the same collection of FORWARD and TURN commands has the structure of POLY(Length, Angle), where Angle = Total Turtle Turning within the Loop Length = Distance from Turtle’s Initial Position to Turtle’s Final Position within the Loop That is, the two programs have the same boundedness, closing, and symmetry.
  • Introduction to Fractal Geometry: Definition, Concept, and Applications

    Introduction to Fractal Geometry: Definition, Concept, and Applications

    University of Northern Iowa UNI ScholarWorks Presidential Scholars Theses (1990 – 2006) Honors Program 1992 Introduction to fractal geometry: Definition, concept, and applications Mary Bond University of Northern Iowa Let us know how access to this document benefits ouy Copyright ©1992 - Mary Bond Follow this and additional works at: https://scholarworks.uni.edu/pst Part of the Geometry and Topology Commons Recommended Citation Bond, Mary, "Introduction to fractal geometry: Definition, concept, and applications" (1992). Presidential Scholars Theses (1990 – 2006). 42. https://scholarworks.uni.edu/pst/42 This Open Access Presidential Scholars Thesis is brought to you for free and open access by the Honors Program at UNI ScholarWorks. It has been accepted for inclusion in Presidential Scholars Theses (1990 – 2006) by an authorized administrator of UNI ScholarWorks. For more information, please contact [email protected]. INTRODUCTION TO FRACTAL GEOMETRY: DEFINITI0N7 CONCEPT 7 AND APP LI CA TIO NS MAY 1992 BY MARY BOND UNIVERSITY OF NORTHERN IOWA CEDAR F ALLS7 IOWA • . clouds are not spheres, mountains are not cones~ coastlines are not circles, and bark is not smooth, nor does lightning travel in a straight line, . • Benoit B. Mandelbrot For centuries, geometers have utilized Euclidean geometry to describe, measure, and study the world around them. The quote from Mandelbrot poses an interesting problem when one tries to apply Euclidean geometry to the natural world. In 1975, Mandelbrot coined the term ·tractal. • He had been studying several individual ·mathematical monsters.· At a young age, Mandelbrot had read famous papers by G. Julia and P . Fatou concerning some examples of these monsters. When Mandelbrot was a student at Polytechnique, Julia happened to be one of his teachers.
  • Math Morphing Proximate and Evolutionary Mechanisms

    Math Morphing Proximate and Evolutionary Mechanisms

    Curriculum Units by Fellows of the Yale-New Haven Teachers Institute 2009 Volume V: Evolutionary Medicine Math Morphing Proximate and Evolutionary Mechanisms Curriculum Unit 09.05.09 by Kenneth William Spinka Introduction Background Essential Questions Lesson Plans Website Student Resources Glossary Of Terms Bibliography Appendix Introduction An important theoretical development was Nikolaas Tinbergen's distinction made originally in ethology between evolutionary and proximate mechanisms; Randolph M. Nesse and George C. Williams summarize its relevance to medicine: All biological traits need two kinds of explanation: proximate and evolutionary. The proximate explanation for a disease describes what is wrong in the bodily mechanism of individuals affected Curriculum Unit 09.05.09 1 of 27 by it. An evolutionary explanation is completely different. Instead of explaining why people are different, it explains why we are all the same in ways that leave us vulnerable to disease. Why do we all have wisdom teeth, an appendix, and cells that if triggered can rampantly multiply out of control? [1] A fractal is generally "a rough or fragmented geometric shape that can be split into parts, each of which is (at least approximately) a reduced-size copy of the whole," a property called self-similarity. The term was coined by Beno?t Mandelbrot in 1975 and was derived from the Latin fractus meaning "broken" or "fractured." A mathematical fractal is based on an equation that undergoes iteration, a form of feedback based on recursion. http://www.kwsi.com/ynhti2009/image01.html A fractal often has the following features: 1. It has a fine structure at arbitrarily small scales.
  • Fractal Modeling and Fractal Dimension Description of Urban Morphology

    Fractal Modeling and Fractal Dimension Description of Urban Morphology

    Fractal Modeling and Fractal Dimension Description of Urban Morphology Yanguang Chen (Department of Geography, College of Urban and Environmental Sciences, Peking University, Beijing 100871, P. R. China. E-mail: [email protected]) Abstract: The conventional mathematical methods are based on characteristic length, while urban form has no characteristic length in many aspects. Urban area is a measure of scale dependence, which indicates the scale-free distribution of urban patterns. Thus, the urban description based on characteristic lengths should be replaced by urban characterization based on scaling. Fractal geometry is one powerful tool for scaling analysis of cities. Fractal parameters can be defined by entropy and correlation functions. However, how to understand city fractals is still a pending question. By means of logic deduction and ideas from fractal theory, this paper is devoted to discussing fractals and fractal dimensions of urban landscape. The main points of this work are as follows. First, urban form can be treated as pre-fractals rather than real fractals, and fractal properties of cities are only valid within certain scaling ranges. Second, the topological dimension of city fractals based on urban area is 0, thus the minimum fractal dimension value of fractal cities is equal to or greater than 0. Third, fractal dimension of urban form is used to substitute urban area, and it is better to define city fractals in a 2-dimensional embedding space, thus the maximum fractal dimension value of urban form is 2. A conclusion can be reached that urban form can be explored as fractals within certain ranges of scales and fractal geometry can be applied to the spatial analysis of the scale-free aspects of urban morphology.
  • On the Beta Transformation

    On the Beta Transformation

    On the Beta Transformation Linas Vepstas December 2017 (Updated Feb 2018 and Dec 2018) [email protected] doi:10.13140/RG.2.2.17132.26248 Abstract The beta transformation is the iterated map bx mod 1. The special case of b = 2 is known as the Bernoulli map, and is exactly solvable. The Bernoulli map provides a model for pure, unrestrained chaotic (ergodic) behavior: it is the full invariant shift on the Cantor space f0;1gw . The Cantor space consists of infinite strings of binary digits; it is notable for many properties, including that it can represent the real number line. The beta transformation defines a subshift: iterated on the unit interval, it sin- gles out a subspace of the Cantor space that is invariant under the action of the left-shift operator. That is, lopping off one bit at a time gives back the same sub- space. The beta transform seems to capture something basic about the multiplication of two real numbers: b and x. It offers insight into the nature of multiplication. Iterating on multiplication, one would get b nx – that is, exponentiation; the mod 1 of the beta transform contorts this in strange ways. Analyzing the beta transform is difficult. The work presented here is more-or- less a research diary: a pastiche of observations and some shallow insights. One is that chaos seems to be rooted in how the carry bit behaves during multiplication. Another is that one can surgically insert “islands of stability” into chaotic (ergodic) systems, and have some fair amount of control over how those islands of stability behave.
  • Furniture Design Inspired from Fractals

    Furniture Design Inspired from Fractals

    169 Rania Mosaad Saad Furniture design inspired from fractals. Dr. Rania Mosaad Saad Assistant Professor, Interior Design and Furniture Department, Faculty of Applied Arts, Helwan University, Cairo, Egypt Abstract: Keywords: Fractals are a new branch of mathematics and art. But what are they really?, How Fractals can they affect on Furniture design?, How to benefit from the formation values and Mandelbrot Set properties of fractals in Furniture Design?, these were the research problem . Julia Sets This research consists of two axis .The first axe describes the most famous fractals IFS fractals were created, studies the Fractals structure, explains the most important fractal L-system fractals properties and their reflections on furniture design. The second axe applying Fractal flame functional and aesthetic values of deferent Fractals formations in furniture design Newton fractals inspired from them to achieve the research objectives. Furniture Design The research follows the descriptive methodology to describe the fractals kinds and properties, and applied methodology in furniture design inspired from fractals. Paper received 12th July 2016, Accepted 22th September 2016 , Published 15st of October 2016 nearly identical starting positions, and have real Introduction: world applications in nature and human creations. Nature is the artist's inspiring since the beginning Some architectures and interior designers turn to of creation. Despite the different artistic trends draw inspiration from the decorative formations, across different eras- ancient and modern- and the geometric and dynamic properties of fractals in artists perception of reality, but that all of these their designs which enriched the field of trends were united in the basic inspiration (the architecture and interior design, and benefited nature).