Preprint Version: May 30, 2009 THE PROBLEM OF TWO STICKS

نویسندگان

  • LUIS A. CAFFARELLI
  • MICHAEL G. CRANDALL
چکیده

Let l = [l0, l1] be the directed line segment from l0 ∈ IR to l1 ∈ IR. Suppose l̄ = [l̄0, l̄1] is a second segment of equal length such that l, l̄ satisfy the “two sticks condition”: ∥∥l1 − l̄0∥∥ ≥ ‖l1 − l0‖ ,∥∥l̄1 − l0∥∥ ≥ ∥∥l̄1 − l̄0∥∥ . Here ‖·‖ is a norm on IR. We explore the manner in which l1− l̄1 is then constrained when assumptions are made about “intermediate points” l∗ ∈ l, l̄∗ ∈ l̄. Roughly speaking, our most subtle result constructs parallel planes separated by a distance comparable to ∥∥l∗ − l̄∗∥∥ such that l1 − l̄1 must lie between these planes, provided that ‖·‖ is “geometrically convex” and “balanced”, as defined herein. The standard p-norms are shown to be geometrically convex and balanced. Other results estimate ∥∥l1 − l̄1∥∥ in a Lipschitz or Hölder manner by ∥∥l∗ − l̄∗∥∥. All these results have implications in the theory of eikonal equations, from which this “problem of two sticks” arose. Introduction The origin of the “problem of two sticks,” which we are about to describe, lies in the theory of eikonal equations. Roughly speaking, the results of Caffarelli and Crandall [3] rely on knowledge of how the endpoints of “rays” of the distance function to some set, as measured in a norm ‖·‖ , that emanate from points in the set and pass through a common tiny ball in the interior of the region of differentiability of the distance function are constrained. We provide a variety of results that speak to this issue. In particular, the crown jewel of our results, Corollary 5.3 below, implies that the endpoints must lie between parallel planes which are separated by a distance comparable to the radius of the ball. The ingredients of the problem of two sticks are a norm ‖·‖ on IR and two “sticks” l = [l0, l1], l̄ = [l̄0, l̄1], where [l0, l1] denotes the directed line segment from l0 to l1 ∈ IR. Sometimes we regard l as a set, as when we write x ∈ l, or x ∈ [l0, l1], but [x, y] has an “initial” point x and a “terminal” point y. We assume throughout this paper that the sticks satisfy the “two sticks

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cultural Adaptation of Sniffin’ Sticks Smell Identification Test: The Malaysian Version

Introduction: Sniffin’ Sticks smell identification test is a tool used for evaluation of olfactory function but the results are culture-dependent. It relies on the subject’s familiarity to the odorant and descriptors. This study aims to develop the Malaysian version of Sniffin’ Sticks smell identification test suitable for local population usage. Materials and Methods:   The o...

متن کامل

Buckling Analyses of Rectangular Plates Composed of Functionally Graded Materials by the New Version of DQ Method Subjected to Non-Uniform Distributed In-Plane Loading

In this paper, the new version of differential quadrature method (DQM), for calculation of the buckling coefficient of rectangular plates is considered. At first the differential equations governing plates have been calculated. Later based on the new version of differential quadrature method, the existing derivatives in equation are converted to the amounts of function in the grid points inside...

متن کامل

An approximation algorithm for the cutting-sticks problem

The cuttings-sticks problem is the following. We are given a bundle of sticks all having integer lengths. The total sum of their lengths is n(n+1)/2. Can we break the sticks so that the resulting sticks have lengths 1, 2, . . . , n? The problem is known to be NP-hard. We consider an optimization version of the problem which involves cutting the sticks and placing them into boxes. The problem ha...

متن کامل

On the complexity of crossings in permutations

We investigate crossing minimization problems for a set of permutations, where a crossing expresses a disarrangement between elements. The goal is a common permutation π∗ which minimizes the number of crossings. In voting and social science theory this is known as the Kemeny optimal aggregation problem minimizing the Kendall-τ distance. This rank aggregation problem can be phrased as a one-side...

متن کامل

Computing Maximal Tiles and Application to Impostor-Based Simplification

The computation of the largest planar region approximating a 3D object is an important problem with wide applications in modeling and rendering. Given a voxelization of the 3D object, we propose an efficient algorithm to solve a discrete version of this problem. The input of the algorithm is the set of grid edges connecting the interior and the exterior of the object (called sticks). Using a vo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009