The path of ants Dragos Crisan, Andrei Petridean, 11 th grade. Colegiul National "Emil Racovita", Cluj-Napoca

Similar documents
Affine transformations and convexity

Spectral Graph Theory and its Applications September 16, Lecture 5

More metrics on cartesian products

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

Difference Equations

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

Learning Theory: Lecture Notes

a b a In case b 0, a being divisible by b is the same as to say that

Section 8.3 Polar Form of Complex Numbers

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,

Lecture Notes on Linear Regression

8.6 The Complex Number System

Errors for Linear Systems

The Second Eigenvalue of Planar Graphs

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

DIFFERENTIAL FORMS BRIAN OSSERMAN

MMA and GCMMA two methods for nonlinear optimization

= 1.23 m/s 2 [W] Required: t. Solution:!t = = 17 m/s [W]! m/s [W] (two extra digits carried) = 2.1 m/s [W]

Line Drawing and Clipping Week 1, Lecture 2

Volume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].

Foundations of Arithmetic

Supplement to Clustering with Statistical Error Control

Math 261 Exercise sheet 2

Perron Vectors of an Irreducible Nonnegative Interval Matrix

APPENDIX 2 FITTING A STRAIGHT LINE TO OBSERVATIONS

EPR Paradox and the Physical Meaning of an Experiment in Quantum Mechanics. Vesselin C. Noninski

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

A combinatorial problem associated with nonograms

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

On the Multicriteria Integer Network Flow Problem

Spatial Statistics and Analysis Methods (for GEOG 104 class).

Chapter - 2. Distribution System Power Flow Analysis

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

MA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials

Math1110 (Spring 2009) Prelim 3 - Solutions

DONALD M. DAVIS. 1. Main result

Problem Set 9 Solutions

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

REAL ANALYSIS I HOMEWORK 1

On the correction of the h-index for career length

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

A new Approach for Solving Linear Ordinary Differential Equations

Correlation and Regression. Correlation 9.1. Correlation. Chapter 9

Complex Numbers Alpha, Round 1 Test #123

Common loop optimizations. Example to improve locality. Why Dependence Analysis. Data Dependence in Loops. Goal is to find best schedule:

Nice plotting of proteins II

Causal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim

AGC Introduction

Determinants Containing Powers of Generalized Fibonacci Numbers

Module 14: THE INTEGRAL Exploring Calculus

One Dimension Again. Chapter Fourteen

First day August 1, Problems and Solutions

Physics 114 Exam 2 Fall 2014 Solutions. Name:

APPENDIX A Some Linear Algebra

Lecture Torsion Properties for Line Segments and Computational Scheme for Piecewise Straight Section Calculations

Report on Image warping

Economics 101. Lecture 4 - Equilibrium and Efficiency

Exercise Solutions to Real Analysis

NUMERICAL DIFFERENTIATION

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Note 10. Modeling and Simulation of Dynamic Systems

Formulas for the Determinant

Geometric drawings of K n with few crossings

Exercises of Chapter 2

arxiv: v1 [math.co] 1 Mar 2014

The Geometry of Logit and Probit

Fundamental loop-current method using virtual voltage sources technique for special cases

of Nebraska - Lincoln

The internal structure of natural numbers and one method for the definition of large prime numbers

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

Remarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

Complete subgraphs in multipartite graphs

Chapter Twelve. Integration. We now turn our attention to the idea of an integral in dimensions higher than one. Consider a real-valued function f : D

The Number of Ways to Write n as a Sum of ` Regular Figurate Numbers

Approximate Smallest Enclosing Balls

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

Lecture Note 3. Eshelby s Inclusion II

The Minimum Universal Cost Flow in an Infeasible Flow Network

Maximizing the number of nonnegative subsets

Lecture 3: Probability Distributions

MAGNETISM MAGNETIC DIPOLES

Module 2. Random Processes. Version 2 ECE IIT, Kharagpur

HMMT February 2016 February 20, 2016

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

1. Estimation, Approximation and Errors Percentages Polynomials and Formulas Identities and Factorization 52

Convexity preserving interpolation by splines of arbitrary degree

9 Characteristic classes

Problem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?

Gravitational Acceleration: A case of constant acceleration (approx. 2 hr.) (6/7/11)

The Expectation-Maximization Algorithm

The optimal delay of the second test is therefore approximately 210 hours earlier than =2.

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Chapter 3 Describing Data Using Numerical Measures

Affine and Riemannian Connections

1 GSW Iterative Techniques for y = Ax

Transcription:

Ths artcle s wrtten by students. It may nclude omssons and mperfectons, whch were dentfed and reported as mnutely as possble by our revewers n the edtoral notes. The path of ants 07-08 Students names and grades : Dragos Crsan, Andre Petrdean, th grade Insttuton: Colegul Natonal "Eml Racovta", Cluj-Napoca Teacher: Arana Vacaretu Researcher : Lorand Parajd, "Babes-Bolya" Unversty Research topc The problem we were presented wth s: The frst ant makes 0 random moves, each havng a length of one unt and, at each move, she leaves a mark. After the tenth move, she reaches food and sends a rado sgnal back to the anthll. A second ant goes along the frst half of the frst segment, then, from the mddle of t to the mddle of the second and so on, untl she reaches the mddle of the last segment, from where she goes to the food along the second half of the last segment. A thrd ant follows the same strategy, followng the second ant s path. a Is the second path shorter than the frst? b Wll the ants tend to fnd the shortest tnerary between the two ponts? What the second queston actually asks for s to descrbe how a gven polygonal chan behaves, asymptotcally, when the above descrbed algorthm s nfntely repeated. Our research. Results The path wll tend towards a straght lne between the two endponts, n terms of both shape and length.[] Throughout the proof, we have used remarkable results, such as the trangle s nequalty, Pascal s trangle and Walls approxmaton. MATh.en.JEANS 07-08 [Colegul Natonal "Eml Racovta", Cluj-Napoca] Page

. Proof of a We prove the slghtly more general statement: "An ant starts movng at a pont A 0 and makes n moves along the segments A 0 A, A A,, A n A n. If a second ant moves along the segments A 0 M, M M, M M 3,, M n M n, M n A n, where M, M, M n are the mdponts of A 0 A, A A,, A n A n respectvely, then, the second path wll be shorter than the frst one.": A 0 M = A 0A M n A n = A na n M k M k+ = A ka k+ A ka k + A k A k+ for every k from to n. Addng these up, we get to the concluson.3 Proof of b We prove a weaker result: The path tends towards a lne n terms of shape. That s, we consder the xoy Carthesan system, wth the orgn n A 0 and wth Ox = A 0 A n and we consder the coordnates of our ponts. We show that the ordnates tend to 0, and the abscssae tend to be n ascendng order, nsde the ntal segment. We frstly show that the asserton holds for ordnates. For ths, consder the followng table, where every lne represents an antnote that, from now on, unless stated otherwse, the MATh.en.JEANS 07-08 [Colegul Natonal "Eml Racovta", Cluj-Napoca] Page

numberng of lnes and columns starts from 0: lne 0 y y y 3 y n lne y y + y y + y 3 y n + y n lne y y + y y + y + y 3 y n + y n 4 4 4 4 y n y n 4 To be able to determne a closed-form of the general term, we consder the contrbuton of every y separately. Take the followng trangle, constructed by dvdng every lne of Pascal s trangle by, where every term s the arthmetc mean of the two above, just as n the frst table: lne 0 lne lne Now, addng up the coeffcents, we obtan the formula: y j = nα= y α j α+ Consderng M = max{ y, y, y n } and applyng a basc nequalty, we get: y j Mn But, by Walls approxmaton: lm n n n nπ = 4 n lm = 0 Now, we move on to the abscssae. We consder the same type of table as before, the only excepton beng that every lne s nfnte, the last term repeatng ndefntely []. The trangles of coeffcents are the same as above for x, x,, x n, so, by Walls approxmaton, they tend towards 0. The coeffcents of x n are gven by: MATh.en.JEANS 07-08 [Colegul Natonal "Eml Racovta", Cluj-Napoca] Page 3

lne 0 lne lne 3 4 4 Ths "trapezod" T j s just an nfnte sum of the above trangles, so ts terms are of j α=0 the form α, whch are clearly n ascendng order on each lne. That s, the statement s completely proven..4 Proof of b Now, we prove the strong result, that s, the length of the path tends towards the dstance between the ntal endponts. We use both the notatons and the results from the prevous subsecton. If S n denotes the length of the n-th path where the numberng starts from 0, we get: S = +n +n +n = x j + x j + y j + y j x j + x j + y j + y j +n x j + x j + j =0 y j + y j where everythng undefned wth negatve ndces or too large ndces s 0. We show that the frst sum P n converges to x n and the second Q n to 0. As before, we start wth the ordnates: +n Q = y j + y j = = j =0 +n +n M +n n α= y α n α= y α α= j α+ j α+ nα= y α j α+ j α+ n j α + j α + MATh.en.JEANS 07-08 [Colegul Natonal "Eml Racovta", Cluj-Napoca] Page 4

Now, we evaluate the nteror sums, as many terms cancel out: [3] n j + j n+, j α= j α + j α + = j + j n+ j + n j n+ j + + n j We proceed to evaluate the last sum, where other terms cancel out: Q M + j + j n + +n j = +n j = +n j + j n + Q n nm j n + By Walls approxmaton, the last term tends to 0, therefore, so does Q n Q n s nonnegatve. We move on to the abscssae and we let x = x n. Recall the constructon of the abscssae s table and let x j = x j + x j, where x j s a lnear expresson n x, x,, x n and x s of the j form x j = T j n+x, T j beng the "trapezod" mentoned n the prevous secton. So: +n P = x j + x j +n x +n j + x j + j + + x j + x j As above, the frst sum converges to 0, so we compute the second sum: P +n = x j + x j = x j = x j =0 That s, P s smaller than somethng that tends to x and, together wth the result about Q, we obtan S smaller than somethng that tends to x. But, as S xthe shortest path between two ponts s the straght lne, we get that S tends to x and the concluson follows. MATh.en.JEANS 07-08 [Colegul Natonal "Eml Racovta", Cluj-Napoca] Page 5

3 Conclusons and generalsatons The problem, as stated, s completely solved. Although the frst varant of b s weaker, that was the frst we came up wth and only after beng shown why t does not mply the stronger one, dd we manage to prove the latter. In the proof of b, the ndex s tactly assumed even. Although that s not always the case, the computatons for the other case are smlar but, even more, gven the result from a, the proof that the even subsequence converges s enough. An mmedate generalsaton s to extend the eucldean plane to R n, where the proof s dentcal. The generalsaton to a sphere, a torus or any other such surface s not always true, as counter-examples are easly constructed for the frst two. A far more nterestng generalsaton s to consder a metrc on R or R n dfferent from the usual eucldean dstance, and ask under what condtons we can reach the same conclusons, or f there exsts a metrc n whch they fal. These are very general questons that we were not able to tackle yet. Edton Notes [] Here, somethng should be sad about the two notons and about the relatonshp between them. [] Ths sentence s not so clear. Some more explanaton would be useful. [3] These calculatons are rather complex. They should be explaned and developed n more detal. MATh.en.JEANS 07-08 [Colegul Natonal "Eml Racovta", Cluj-Napoca] Page 6