๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

K2 of n lines in the plane

โœ Scribed by Barry H. Dayton; Leslie G. Roberts


Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
869 KB
Volume
15
Category
Article
ISSN
0022-4049

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Identification of high energy lines in t
โœ Thomas A. Carlson; W.E. Moddeman; B.P. Pullen; Manfred O. Krause ๐Ÿ“‚ Article ๐Ÿ“… 1970 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 265 KB

The K-LL spectrum in nitrogen has been measured with a high-resolution electron spectrometer using 1) 3 keV electrons and 2) AIKa X-rays to produce the initial K vacancy. In the high-energy portion of the Auger spectrum, lines at 383.8 eV and 386.7 eV and a band roughly between 368 eV and 380 eV wer

On โ€˜k-setsโ€™ in the plane
โœ G.W. Peck ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 95 KB

Given an arrangement of n points in the plane, a k-set in the plane is a k element subset of these that can be separated from the others by a straight line. The question of how many j-sets there are with ] less than k was considered by Pach and by Goodman and Pollack [1], who obtained upper bounds o

On Line Arrangements in the Hyperbolic P
โœ A. Dress; J.H. Koolen; V. Moulton ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 138 KB

Given a finite collection L of lines in the hyperbolic plane H, we denote by k = k(L) its Karzanov number, i.e., the maximal number of pairwise intersecting lines in L, and by C(L) and n = n(L) the set and the number, respectively, of those points at infinity that are incident with at least one line

On illuminating line segments in the pla
โœ Jurek Czyzowicz; Eduardo Rivera-Campo; Jorge Urrutia; Joseph Zaks ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 269 KB

Let F be a family of n convex sets in the plane. A set of light sources S illuminates F if every point on the boundary of each element of F is visible from at least one element in S. We prove that if F is a family of n line segments, n >/11, then [-2n/3 7 light sources are always sufficient to illum

Reconstructing sets of orthogonal line s
โœ Franz Rendl; Gerhard Woeginger ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 550 KB

Rend], F. and G. Woeginger, Reconstructing sets of orthogonal line segments in the plane, Discrete Mathematics 119 (1993) 1677174. We show that reconstructing a set of n orthogonal line segments in the plane from the set of their vertices can be done in O(n log n) time, if the segments are allowed

On Integers of the Forms kโˆ’2n and k2n+1
โœ Yong-Gao Chen ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 85 KB

In this paper we prove that the set of positive odd integers k such that k&2 n has at least three distinct prime factors for all positive integers n contains an infinite arithmetic progression. The same result corresponding to k2 n +1 is also true.