Partitioning arrangements of lines II: Applications

In this paper we present efficient deterministic algorithms for various problems involving lines or segments in the plane, using the partitioning algorithm described in a companion paper [A3]. These applications include: (i) anO(m ^2/3 n ^2/3 · log^2/3 n · log^/3 (m/n)+(m+n) logn) algorithm to compute all incidences betweenm points andn lines, where is a constant <3.33; (ii) anO(m ^2/3 n ^2/3 · log^5/3 n · log^/3 (m/n)+(m+n) logn) algorithm to computem faces in an arrangement ofn lines; (iii) anO(n ^4/3 log^(+2)/3 n) algorithm to count the number of intersections in a set ofn segments; (iv) anO(n ^4/3 log^{( + 2)/3} n) algorithm to count red-blue intersections between two sets of segments, and (v) anO(n ^3/2 log^/3 n) algorithm to compute spanning trees with low stabbing number for a set ofn points. We also present an algorithm that, given set ofn points in the plane, preprocesses it, in timeO(nm log^+1/2 n), into a data structure of sizeO(m) forn lognmn ², so that the number of points ofS lying inside a query triangle can be computed inO((n/m) log^3/2 n) time.Work on this paper has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant DCR-83-20085, and by grants from the Digital Equipment Corporation and the IBM Corporation. A preliminary version of this paper appears in theProceedings of the 5th ACM Symposium on Computational Geometry, 1989, pp. 11–22.     

On a problem about covering lines by squares

LetS be the square [0,n]² of side lengthn and letS = {S ₁, ...,S _t} be a set of unit squares lying insideS, whose sides are parallel to those ofS.S is called a line cover, if every line intersectingS also intersects someS _i S. Let(n) denote the minimum cardinality of a line cover, and let(n) be defined in the same way, except that we restrict our attention to lines which are parallel to either one of the axes or one of the diagonals ofS. It has been conjectured by Fejes Tóth that(n)=2n+O(1) and by Bárány and Füredi that(n)=3/2n+O(1). We will prove that, instead,(n)=4/3n+O(1) and, as to Fejes Tóth's conjecture, we will exhibit a noninteger solution to a related LP-relaxation, which has size equal to 3/2n+O(1).     

Magnetohydrodynamic flow past a circular cylinder

This paper deals with the slow-flow problem of an incompressible, viscous, electrically conducting fluid past a circular cylinder in an aligned magnetic field. The solutions for the velocity and magnetic fields are sought by the method of matched asymptotic expansions under the assumptions:R, R _mM1, such thatR=O(R _m). The influence ofR andR _m on this solution is studied toO(R/(logM)²) andO(R/logM), respectively.

---

Zusammenfassung Die Arbeit behandelt das Problem des langsamen Fliessens einer nicht zusammendrückbaren zähen elektrisch leitenden Flüssigkeit, die um einen Kreiszylinder mit parallel zur Strömung gerichtetem Magnetfeld strömt. Die Lösungen für die Geschwindigkeit und das Magnetfeld werden gefunden durch die Methode der angepassten asymptotischen Entwicklungen unter den VoraussetzungenR, R _mM1, so dassR=O(R _m). Der Einfluss vonR undR _m auf diese Lösungen wird fürO(R/(logM)²) bzw.O(R _m /logM) untersucht.

     

New applications of random sampling in computational geometry

This paper gives several new demonstrations of the usefulness of random sampling techniques in computational geometry. One new algorithm creates a search structure for arrangements of hyperplanes by sampling the hyperplanes and using information from the resulting arrangement to divide and conquer. This algorithm requiresO(s ^d+ ) expected preprocessing time to build a search structure for an arrangement ofs hyperplanes ind dimensions. The expectation, as with all expected times reported here, is with respect to the random behavior of the algorithm, and holds for any input. Given the data structure, and a query pointp, the cell of the arrangement containingp can be found inO(logs) worst-case time. (The bound holds for any fixed >0, with the constant factors dependent ond and .) Using point-plane duality, the algorithm may be used for answering halfspace range queries. Another algorithm finds random samples of simplices to determine the separation distance of two polytopes. The algorithm uses expectedO(n ^[d/2]) time, wheren is the total number of vertices of the two polytopes. This matches previous results [10] for the cased = 3 and extends them. Another algorithm samples points in the plane to determine their orderk Voronoi diagram, and requires expectedO(s ¹⁺ k) time fors points. (It is assumed that no four of the points are cocircular.) This sharpens the boundO(sk ² logs) for Lee's algorithm [21], andO(s ² logs+k(s–k) log² s) for Chazelle and Edelsbrunner's algorithm [4]. Finally, random sampling is used to show that any set ofs points inE ³ hasO(sk ² log⁸ s/(log logs)⁶) distinctj-sets withjk. (ForS E ^d , a setS S with |S| =j is aj-set ofS if there is a half-spaceh ⁺ withS =S h ⁺.) This sharpens with respect tok the previous boundO(sk ⁵) [5]. The proof of the bound given here is an instance of a probabilistic method [15].A preliminary version of this paper appeared in theProceedings of the 18th Annual ACM Symposium on Theory of Computing, Berkeley, CA, 1986.     

Tate–Vogel Completions of Half-Exact Functors

We provide a general method to construct the Tate–Vogel homology theory for a general half-exact functor with one variable, aiming at a good generalization of Cohen–Macaulay approximations of modules over commutative Gorenstein rings. For a half exact functor F, using the left and right satellites (S _n and S ⁿ ), we define F (X)=lim S _n S ⁿ F(X) and F (X)=lim S _n S ⁿ F(X), and call F and F the Tate–Vogel completions of F. We provide several properties of F and F , and their relations with the G-dimension and the projective dimension of the functor F. A comparison theorem of Tate–Vogel completions with ordinary Tate–Vogel homologies is proved. If F is a half exact functor over the category of R-modules, where R is a commutative Noetherian local ring inspired by Martsinkovsky's works, we can define the invariants (F) and (F) of F. If F=Ext _R ⁱ (M, ), then they coincide with Martsinkovsky's -invariants and Auslander's delta invariants. Our advantage is that we can consider these invariants for any half exact functors. We also compute these invariants for the local cohomology functors.     

On the unique finite (SI) decomposition of the Jordan operator ⊕ i=1 n S(θ) for certain inner function θ

In this paper, we have proven that for the Jordan blockS() withS() (SI), _i=1 ⁿ S() =S() ⁽ⁿ⁾ (n 1) has unique finite (SI) decomposition up to a similarity. As result, we obtain that ifV is a Volterra operator onH=L ²([0, 1]), thenV ⁽ⁿ⁾ has unique finite (SI) decomposition.This project was supported by National Natural Science Foundation of China.     

Recurrence and transience for random walks with stationary increments

Summary Let S _n = ₁+...+ _n , n1, be the partial sums of stationary, dependent random variables in ^m . The probability space can be partitioned into I _t I _r , where I _t = {S _n} and I _r ={each S _n is limit point of (S _n)_n1}. This result follows from the inclusion{S _n > for n>0}I _t a.s., which is obtained by using Kac's inequality.     

A self normalized law of the iterated logarithm for random walk in random scenery

LetX,X _i ,i1, be a sequence of i.i.d. random vectors in ^d . LetS _o=0 and, forn1, letS _n =X ₁+...+X _n . LetY,Y(), ^d , be i.i.d. -valued random variables which are independent of theX _i . LetZ _n =Y(S _o )+...+Y(S _n ). We will callZ _n arandom walk in random scenery.In this work, we consider the law of the iterated logarithm for random walk in random sceneries. Under fairly general conditions, we obtain arandomly normalized law of the iterated logarithm.Supported in part by NSF Grants DMS-85-21586 and DMS-90-24961.     

Graphs S(n, k) and a Variant of the Tower of Hanoi Problem

For any n 1 and any k 1, a graph S(n, k) is introduced. Vertices of S(n, k) are n-tuples over {1, 2,. . . k} and two n-tuples are adjacent if they are in a certain relation. These graphs are graphs of a particular variant of the Tower of Hanoi problem. Namely, the graphs S(n, 3) are isomorphic to the graphs of the Tower of Hanoi problem. It is proved that there are at most two shortest paths between any two vertices of S(n, k). Together with a formula for the distance, this result is used to compute the distance between two vertices in O(n) time. It is also shown that for k 3, the graphs S(n, k) are Hamiltonian.     

Number of no nisomorphic subgraphs in an n-point graph

LetG(n) be the set of all nonoriented graphs with n enumerated points without loops or multiple lines, and let v_k(G) be the number of mutually nonisomorphic k-point subgraphs of G G(n). It is proved that at least |G(n)| (1–1/n) graphs G G(n) possess the following properties: a) for any k [6log₂n], where c=–c log₂c–(1–c)×log₂(1–c) and c>1/2, we havev _k(G) > C _n ^k (1–1/n²); b) for any k [cn + 5 log₂n] we havev _k(G) = C _n ^k . Hence almost all graphs G G(n) containv(G) 2ⁿ pairwise nonisomorphic subgraphs.Translated from Matematicheskie Zametki, Vol. 9, No. 3, pp. 263–273, March, 1971.     

Characterizing matchings as the intersection of matroids

This paper deals with the problem of representing the matching independence system in a graph as the intersection of finitely many matroids. After characterizing the graphs for which the matching independence system is the intersection of two matroids, we study the function (G), which is the minimum number of matroids that need to be intersected in order to obtain the set of matchings on a graph G, and examine the maximal value, (n), for graphs with n vertices. We describe an integer programming formulation for deciding whether (G)k. Using combinatorial arguments, we prove that (n)(log logn). On the other hand, we establish that (n)O(logn/ log logn). Finally, we prove that (n)=4 for n=5,,12, and sketch a proof of (n)=5 for n=13,14,15.An earlier version appears as an extended abstract in the Proceedings of COMB01 [5]. Supported by the Gerhard-Hess-Forschungs-Förderpreis (WE 1462) of the German Science Foundation (DFG) awarded to R. Weismantel.     

Covering a Finite Abelian Group by Subset Sums

Let G be an abelian group of order n. The critical number c(G) of G is the smallest s such that the subset sums set (S) covers all G for eachs ubset SG\{0} of cardinality |S|s. It has been recently proved that, if p is the smallest prime dividing n and n/p is composite, then c(G)=|G|/p+p–2, thus establishing a conjecture of Diderrich.We characterize the critical sets with |S|=|G|/p+p–3 and (S)=G, where p3 is the smallest prime dividing n, n/p is composite and n7p²+3p.We also extend a result of Diderrichan d Mann by proving that, for n67, |S|n/3+2 and S=G imply (S)=G. Sets of cardinality for which (S) =G are also characterized when n183, the smallest prime p dividing n is odd and n/p is composite. Finally we obtain a necessary and sufficient condition for the equality (G)=G to hold when |S|n/(p+2)+p, where p5, n/p is composite and n15p².* Work partially supported by the Spanish Research Council under grant TIC2000-1017 Work partially supported by the Catalan Research Council under grant 2000SGR00079     

Brownian motion in a Poissonian potential

We study here ad-dimensional Brownian motion in a random potentialV(·, ) obtained as the sum of translations of a given fixed non negative shape function at the points of a Poisson cloud of constant intensityv. We are interested in the larget behavior for typical cloud configurations, of the Brownian path in timet under the influence of the natural Feynman-Kac weight associated toV(·, ). In particular, we show that the location at timet of the process tends to be concentrated near points of suitably low local eigenvalue of –1/2+V(·,), which lie almost at distancet from the origin. Near these points one can find in the cloud a big hole or clearing of size const(logt)^1/d with volume like a ball of radiusR ₀(d, v)(logt)^1/d .     

Maintaining the minimal distance of a point set in polylogarithmic time

A dynamic data structure is given that maintains the minimal distance in a set ofn points ink-dimensional space inO((logn) ^k log logn) amortized time per update. The size of the data structure is bounded byO(n(logn) ^k ). Distances are measured in the MinkowskiL _t -metric, where 1 t . This is the first dynamic data structure that maintains the minimal distance in polylogarithmic time for fully on-line updates.This work was supported by the ESPRIT II Basic Research Actions Program, under Contract No. 3075 (project ALCOM).     

Intersection queries in sets of disks

In this paper we develop some new data structures for storing a set of disks that can answer different types of intersection queries efficiency. If the disks are non-intersecting we obtain a linear size data structure that can report allk disks intersecting a query line segment in timeO(n ⁺ +k), wheren is the number of disks,=log₂(1+5)–1 0.695, and is an arbitrarily small positive constant. If the segment is a full line, the query time becomesO(n +k). For intersecting disks we obtain anO(n logn) size data structure that can answer an intersection query in timeO(n ^2/3 log² n+k). We also present a linear size data structure for ray shooting queries, whose query time isO(n ).The research of the first two authors was supported by the ESPRIT Basic Research Action No. 3075 (project ALCOM). The work of the third author was supported byDimacs (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center — NSF-STC88-09648.     

Spitzer's Strong Law of Large Numbers in Nonseparable Banach Spaces

It is well known, that for the sums of i.i.d. random variables we have S _n/n 0 a.s. iff _n=1 1/n P(|S _n| > n) < holds for all > 0 (Spitzer's SLLN). The result is also known in separable Banach spaces. It will be shown, that this also holds in nonseparable (= not necessarily separable) Banach spaces without any measurability assumption. In the theory of empirical processes this gives a characterization of Glivenko-Cantelli classes.     

Remarks on ergodicity of stationary irreducible transient Markov chains

Summary Consider a stationary process {X _n(), – < n < . If the measure of the process is finite (the measure of the whole sample space finite), it is well known that ergodicity of the process {X _n(), - < n < and of each of the subprocesses {X _n(), 0 n < , {X _n(), – < n 0 are equivalent (see [3]). We shall show that this is generally not true for stationary processes with a sigma-finite measure, specifically for stationary irreducible transient Markov chains. An example of a stationary irreducible transient Markov chain {X _n(), - < n <} with {itX_n(), 0 n < < ergodic but {X _n(), < n 0 nonergodic is given. That this can be the case has already been implicitly indicated in the literature [4]. Another example of a stationary irreducible transient Markov chain with both {X _n(), 0 n < and {itX _n(),-< < n 0} ergodic but {X _n(), - < n < nonergodic is presented. In fact, it is shown that all stationary irreducible transient Markov chains {X _n(), - < n < < are nonergodic.This research was supported in part by the Office of Naval Research.John Simon Guggenheim Memorial Fellow.     

Strong laws for the k-th order statistic when k≦c log2 n

Summary Under general regularity assumptions, we characterize the upper and lower almost sure classes of U _{k, n} , where U _{1, n} ...U _{n, n} are the order statistics of an i.i.d. sample of size n from the uniform distribution on (0, 1), and where k=k _n is a non-decreasing integer sequence such that 1k =O(log₂ n) as n .     

Spherical multipliers

It is proven in the paper that if functionf(x)L^p(Rⁿ), where 1/p> 1/2 + 1/(n + 1), then the restriction of the Fourier transform f() to the unit sphere S^n–1 lies in L²(S^n–1). As was shown by Fefferman [1], it follows from this that, when > (n –1)/(2(n + 1)), the Riesz-Bochner multiplier acts in LP(Rⁿ) if (n –1–2)/(2n) <1/p < (n + 1 + 2)/(2n).Translated from Matematicheskie Zametki, Vol. 23, No. 1, pp. 105–112, January, 1978.The author wishes to thank B. S. Mityagin for his attention to this work.     

Efficient Regular Polygon Dissections

We study the minimum number g(m,n) (respectively, p(m,n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygonal cuts). First we study regular polygon-square dissections and show that n/2 -2 g(4,n) (n/2) + o(n) and n/4 g(n,4) (n/2) + o(n) hold for sufficiently large n. We also consider polygonal cuts, i.e., the minimum number p(4,n) of pieces needed to dissect a square into a regular n-gon of the same area using polygonal cuts and show that n/4 p(4,n) (n/2) + o(n) holds for sufficiently large n. We also consider regular polygon-polygon dissections and obtain similar bounds for g(m,n) and p(m,n).