Almost tight upper bounds for lower envelopes in higher dimensions

We consider the problem of bounding the combinatorial complexity of the lower envelope ofn surfaces or surface patches ind-space (d≥3), all algebraic of constant degree, and bounded by algebraic surfaces of constant degree. We show that the complexity of the lower envelope ofn such surface patches isO(n ^d−1+∈), for any ∈>0; the constant of proportionality depends on ∈, ond, ons, the maximum number of intersections among anyd-tuple of the given surfaces, and on the shape and degree of the surface patches and of their boundaries. This is the first nontrivial general upper bound for this problem, and it almost establishes a long-standing conjecture that the complexity of the envelope isO(n ^d-2λ _q (n)) for some constantq depending on the shape and degree of the surfaces (where λ _q (n) is the maximum length of (n, q) Davenport-Schinzel sequences). We also present a randomized algorithm for computing the envelope in three dimensions, with expected running timeO(n ^2+∈), and give several applications of the new bounds. Work on this paper has been supported by NSF Grant CCR-91-22103, and by grants from the U.S.-Israeli Binational Science Foundation, the G.I.F., the German-Israeli Foundation for Scientific Research and Development, and the Fund for Basic Research administered by the Israeli Academy of Sciences.     

Homogenization of some parabolic operators with several time scales

The main focus in this paper is on homogenization of the parabolic problem ∂ _t uɛ − ∇ · (a(x/ɛ,t/ɛ,t/ɛ ^r )∇u ^ɛ ) = f. Under certain assumptions on a, there exists a G-limit b, which we characterize by means of multiscale techniques for r > 0, r ≠ 1. Also, an interpretation of asymptotic expansions in the context of two-scale convergence is made.     

Vertical decompositions for triangles in 3-space

We prove that, for any constant ɛ>0, the complexity of the vertical decomposition of a set ofn triangles in three-dimensional space isO(n ^2+ɛ +K), whereK is the complexity of the arrangement of the triangles. For a single cell the complexity of the vertical decomposition is shown to beO(n ^2+ɛ ). These bounds are almost tight in the worst case. We also give a deterministic output-sensitive algorithm for computing the vertical decomposition that runs inO(n ² logn+V logn) time, whereV is the complexity of the decomposition. The algorithm is reasonably simple (in particular, it tries to perform as much of the computation in two-dimensional spaces as possible) and thus is a good candidate for efficient implementations. The algorithm is extended to compute the vertical decomposition of arrangements ofn algebraic surface patches of constant maximum degree in three-dimensional space in timeO(nλ _q (n) logn +V logn), whereV is the combinatorial complexity of the vertical decomposition, λ _q (n) is a near-linear function related to Davenport-Schinzel sequences, andq is a constant that depends on the degree of the surface patches and their boundaries. We also present an algorithm with improved running time for the case of triangles which is, however, more complicated than the first algorithm. Mark de Berg was supported by the Dutch Organization for Scientific Research (N.W.O.), and by ESPRIT Basic Research Action No. 7141 (project ALCOM II:Algorithms and Complexity). Leonidas Guibas was supported by NSF Grant CCR-9215219, by a grant from the Stanford SIMA Consortium, by NSF/ARPA Grant IRI-9306544, and by grants from the Digital Equipment, Mitsubishi, and Toshiba Corporations. Dan Halperin was supported by a Rothschild Postdoctoral Fellowship, by a grant from the Stanford Integrated Manufacturing Association (SIMA), by NSF/ARPA Grant IRI-9306544, and by NSF Grant CCR-9215219. A preliminary version of this paper appeared inProc. 10th ACM Symposium on Computational Geometry, 1994, pp. 1–10.     

Almost tight upper bounds for the single cell and zone problems in three dimensions

We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement ofn low-degree algebraic surface patches in 3-space. We show that this complexity isO(n ^2+ε), for any ε>0, where the constant of proportionality depends on ε and on the maximum degree of the given surfaces and of their boundaries. This extends several previous results, almost settles a 9-year-old open problem, and has applications to motion planning of general robot systems with three degrees of freedom. As a corollary of the above result, we show that the overall complexity of all the three-dimensional cells of an arrangement ofn low-degree algebraic surface patches, intersected by an additional low-degree algebraic surface patch σ (the so-calledzone of σ in the arrangement) isO(n ^2+ε), for any ε>0, where the constant of proportionality depends on ε and on the maximum degree of the given surfaces and of their boundaries. Work on this paper by the first author has been supported by a Rothschild Postdoctoral Fellowship, by a grant from the Stanford Integrated Manufacturing Association (SIMA), by NSF/ARPA Grant IRI-9306544, and by NSF Grant CCR-9215219. Work on this paper by the second author has been supported by NSF Grants CCR-91-22103 and CCR-93-111327, and by grants from the U.S.-Israeli Binational Science Foundation, the G.I.F., the German-Israeli Foundation for Scientific Research and Development, and the Israel Science Fund administered by the Israeli Academy of Sciences.     

Eigenvalue distributions from impacts on a ring

We consider the collision dynamics produced by three beads with masses (m ₁, m ₂, m ₃) sliding without friction on a ring, where the masses are scaled so that m ₁ = 1/ɛ, m ₂ = 1, m ₃ = 1 − ɛ, for 0 ⩽ ɛ ⩾ 1. The singular limits ɛ = 0 and ɛ = 1 correspond to two equal mass beads colliding on the ring with a wall, and without a wall respectively. In both these cases, all solutions are periodic and the eigenvalue distributions (around the unit circle) associated with the products of collision matrices are discrete. We then numerically examine the regime which parametrically connects these two states, i.e. 0 < ɛ < 1, and show that the eigenvalue distribution is generically uniform around the unit circle, which implies that the dynamics are no longer periodic. By a sequence of careful numerical experiments, we characterize how the uniform spectrum collapses from continuous to discrete in the two singular limits ɛ → 0 and ɛ → 1 for an ensemble of initial velocities sampled uniformly on a fixed energy surface. For the limit ɛ → 0, the distribution forms Gaussian peaks around the discrete limiting values ± 1, ± i, with variances that scale in power law form as σ ² ∼ αɛ ^β. By contrast, the convergence in the limit ɛ → 1 to the discrete values ±1 is shown to follow a logarithmic power-law σ ² ∼ log(ɛ ^β).     

Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces

   Abstract. We show that n arbitrary circles in the plane can be cut into O(n ^3/2+ɛ ) arcs, for any ɛ>0 , such that any pair of arcs intersects at most once. This improves a recent result of Tamaki and Tokuyama [20]. We use this result to obtain improved upper bounds on the number of incidences between m points and n circles. An improved incidence bound is also obtained for graphs of polynomials of any constant maximum degree.     

Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces

Abstract. We show that n arbitrary circles in the plane can be cut into O(n ^3/2+ɛ ) arcs, for any ɛ>0 , such that any pair of arcs intersects at most once. This improves a recent result of Tamaki and Tokuyama [20]. We use this result to obtain improved upper bounds on the number of incidences between m points and n circles. An improved incidence bound is also obtained for graphs of polynomials of any constant maximum degree.     

Bounding the Derived Length for a Given Set of Character Degrees

Let G be a finite solvable group with {1, a, b, c, ab, ac} as the character degree set, where a ,b, and c are pairwise coprime integers greater than 1. We show that the derived length of G is at most 4. This verifies that the Taketa inequality, dl(G) ≤ |cd(G)|, is valid for solvable groups with {1, a, b, c, ab, ac} as the character degree set. Also, as a corollary, we conclude that if a, b, c, and d are pairwise coprime integers greater than 1 and G is a solvable group such that cd(G) = {1, a, b, c, d, ac, ad, bc, bd}, then dl(G) ≤ 5. Finally, we construct a family of solvable groups whose derived lengths are 4 and character degree sets are in the form {1, p, b, pb, q ^p , pq ^p }, where p is a prime, q is a prime power of an odd prime, and b > 1 is integer such that p, q, and b are pairwise coprime. Hence, the bound 4 is the best bound for the derived length of solvable groups whose character degree set is in the form {1, a, b, c, ab, ac} for some pairwise coprime integers a, b, and c.     

Diffusion approximation for the convection-diffusion equation with random drift

We consider the asymptotic behavior of the solutions ofscaled convection-diffusion equations ∂ _t u _ɛ (t, x) = κΔ _x (t, x) + 1/ɛV(t/ɛ²,xɛ) ·∇ _x u _ɛ (t, x) with the initial condition u _ɛ(0,x) = u ₀(x) as the parameter ɛ↓ 0. Under the assumptions that κ > 0 and V(t, x), (t, x) ∈R ^d is a d-dimensional,stationary, zero mean, incompressible, Gaussian random field, Markovian and mixing in t we show that the laws of u _ɛ(t,·), t≥ 0 in an appropriate functional space converge weakly, as ɛ↓ 0, to a δ-type measureconcentrated on a solution of a certain constant coefficient heat equation. Received: 23 March 2000 / Revised version: 5 March 2001 / Published online: 9 October 2001     

Minimal surfaces of rotation in Finsler space with a Randers metric

 We consider Finsler spaces with a Randers metric F=α+β, on the three dimensional real vector space, where α is the Euclidean metric and β=bdx ₃ is a 1-form with norm b,0≤b<1. By using the notion of mean curvature for immersions in Finsler spaces introduced by Z. Shen, we get the ordinary differential equation that characterizes the minimal surfaces of rotation around the x ₃ axis. We prove that for every b,0≤b<1, there exists, up to homothety, a unique forward complete minimal surface of rotation. The surface is embedded, symmetric with respect to a plane perpendicular to the rotation axis and it is generated by a concave plane curve. Moreover, for every there are non complete minimal surfaces of rotation, which include explicit minimal cones. Received: 30 November 2001 / Published online: 10 February 2003 RID="⋆" ID="⋆" Partially supported by CAPES RID="⋆⋆" ID="⋆⋆" Partially supported by CNPq and PROCAD.     

Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time

The cost of solving an initial value problem for index-1 differential algebraic equations to accuracy ɛ is polynomial in ln(1/ɛ). This cost is obtained for an algorithm based on the Taylor series method for solving differential algebraic equations developed by Pryce. This result extends a recent result by Corless for solutions of ordinary differential equations. The results of the standard theory of information-based complexity give exponential cost for solving ordinary differential equations, being based on a different model.     

More-Than-Nearly-Perfect Packings and Partial Designs

o (n) of the n vertices. Here we show, in particular, that regular uniform hypergraphs for which the ratio of degree to maximum codegree is , for some ɛ>0, have packings which cover all but vertices, where α=α(ɛ)>0. The proof is based on the analysis of a generalized version of R?dl's nibble technique. We apply the result to the problem of finding partial Steiner systems with almost enough blocks to be Steiner systems, where we prove that, for fixed positive integers t<k, there exist partial S(t,k,n)'s with at most uncovered t-sets, improving the earlier result. Received: September 23, 1994/Revised: November 14, 1996     

The linear arboricity of graphs

Alinear forest is a forest in which each connected component is a path. Thelinear arboricity la(G) of a graphG is the minimum number of linear forests whose union is the set of all edges ofG. Thelinear arboricity conjecture asserts that for every simple graphG with maximum degree Δ=Δ(G), . Although this conjecture received a considerable amount of attention, it has been proved only for Δ≦6, Δ=8 and Δ=10, and the best known general upper bound for la(G) is la(G)≦⌈3Δ/5⌉ for even Δ and la(G)≦⌈(3Δ+2)/5⌉ for odd Δ. Here we prove that for everyɛ>0 there is a Δ₀=Δ₀(ɛ) so that la(G)≦(1/2+ɛ)Δ for everyG with maximum degree Δ≧Δ₀. To do this, we first prove the conjecture for everyG with an even maximum degree Δ and withgirth g≧50Δ. Research supported in part by Allon Fellowship, by a Bat Sheva de Rothschild grant, by the Fund for Basic Research administered by the Israel Academy of Sciences and by a B.S.F. Bergmann Memorial grant.     

The best quadrature based on given Hermite information for the Sobolev class KWr[a, b]

As usual, denote by KW ^r[a, b] the Sobolev class consisting of every function whose (r − 1)th derivative is absolutely continuous on the interval [a, b] and rth derivative is bounded by K a.e. in [a, b]. For a function f ∈ KW ^r [a, b], its values and derivatives up to r − 1 order at a set of nodes x are known. These values are said to be the given Hermite information. This work reports the results on the best quadrature based on the given Hermite information for the class KW ^r [a, b]. Existence and concrete construction issue of the best quadrature are settled down by a perfect spline interpolation. It turns out that the best quadrature depends on a system of algebraic equations satisfied by a set of free nodes of the interpolation perfect spline. From our another new result, it is shown that the system can be converted in a closed form to two single-variable polynomial equations, each being of degree approximately r/2. As a by-product, the best interpolation formula for the class KW ^r [a, b] is also obtained.     

Numerical solution of a nonlinear time-optimal control problem

Nonlinear systems with a stationary (i.e., explicitly time independent) right-hand side are considered. For time-optimal control problems with such systems, an iterative method is proposed that is a generalization of one used to solve nonlinear time-optimal control problems for systems divided by phase states and controls. The method is based on constructing finite sequences of simplices with their vertices lying on the boundaries of attainability domains. Assuming that the system is controllable, it is proved that the minimizing sequence converges to an ɛ-optimal solution after a finite number of iterations. A pair {T, u(·)} is called an ɛ-optimal solution if |T − T _opt| − ɛ, where T _opt is the optimal time required for moving the system from the initial state to the origin and u is an admissible control that moves the system to an ɛ-neighborhood of the origin over the time T.     

Polaroid operators,SVEP and perturbed Browder,Weyl theorems

A Banach space operatorT ɛB(X) is polaroid,T ɛP, if the isolated points of the spectrum ofT are poles of the resolvent ofT. LetPS denote the class of operators inP which have have SVEP, the single-valued extension property. It is proved that ifT is polynomiallyPS andA ɛB(X) is an algebraic operator which commutes withT, thenf(T+A) satisfies Weyl’s theorem andf(T ^*+A ^*) satisfiesa-Weyl’s theorem for everyf which is holomorphic on a neighbourhood of σ(T+A).     

Extremal graphs of diameter two and given maximum degree,embeddable in a fixed surface

It is known that for each d there exists a graph of diameter two and maximum degree d which has at least ⌈(d/2)⌉ ⌈(d + 2)/2⌉ vertices. In contrast with this, we prove that for every surface S there is a constant d_s such that each graph of diameter two and maximum degree d ≥ d_s, which is embeddable in S, has at most ⌊(3/2)d⌋ + 1 vertices. Moreover, this upper bound is best possible, and we show that extremal graphs can be found among surface triangulations. © 1997 John Wiley & Sons, Inc.     

Scale limit of a variational inequality modeling diffusive flux in a domain with small holes and strong adsorption in case of a critical scaling

In this paper we study the asymptotic behavior of solutions u _ɛ of the elliptic variational inequality for the Laplace operator in domains periodically perforated by balls with radius of size C ₀ɛ_α, C ₀ > 0, α = n/n−2, and distributed with period ɛ. On the boundary of balls, we have the following nonlinear restrictions u _ɛ ≥ 0, ∂_ν u _ɛ ≥ −ɛ^−ασ(x, u _ɛ), u _ɛ(∂_ν u _ɛ + ɛ^−ασ(x, u _ɛ)) = 0. The weak convergence of the solutions u _ɛ to the solution of an effective variational equality is proved. In this case, the effective equation contains a nonlinear term which has to be determined as solution of a functional equation. Furthermore, a corrector result with respect to the energy norm is given.     

Improved approximations of the solution and derivatives to a singularly perturbed reaction-diffusion equation based on the solution decomposition method

In the case of the Dirichlet problem for a singularly perturbed ordinary differential reaction-diffusion equation, a new approach is used to the construction of finite difference schemes such that their solutions and their normalized first- and second-order derivatives converge in the maximum norm uniformly with respect to a perturbation parameter ɛ ∈(0, 1]; the normalized derivatives are ɛ-uniformly bounded. The key idea of this approach to the construction of ɛ-uniformly convergent finite difference schemes is the use of uniform grids for solving grid subproblems for the regular and singular components of the grid solution. Based on the asymptotic construction technique, a scheme of the solution decomposition method is constructed such that its solution and its normalized first- and second-order derivatives converge ɛ-uniformly at the rate of O(N ⁻²ln² N), where N + 1 is the number of points in the uniform grids. Using the Richardson technique, an improved scheme of the solution decomposition method is constructed such that its solution and its normalized first and second derivatives converge ɛ-uniformly in the maximum norm at the same rate of O(N ⁻⁴ln⁴ N).     

Approximation of singularly perturbed parabolic equations in unbounded domains subject to piecewise smooth boundary conditions in the case of solutions that grow at infinity

The initial-boundary value problem in a domain on a straight line that is unbounded in x is considered for a singularly perturbed reaction-diffusion parabolic equation. The higher order derivative in the equation is multiplied by a parameter ɛ², where ɛ ∈ (0, 1]. The right-hand side of the equation and the initial function grow unboundedly as x → ∞ at a rate of O(x ²). This causes the unbounded growth of the solution at infinity at a rate of O(Ψ(x)), where Ψ(x) = x ² + 1. The initialboundary function is piecewise smooth. When ɛ is small, a boundary and interior layers appear, respectively, in a neighborhood of the lateral part of the boundary and in a neighborhood of the characteristics of the reduced equation passing through the discontinuity points of the initial function. In the problem under examination, the error of the grid solution grows unboundedly in the maximum norm as x → ∞ even for smooth solutions when ɛ is fixed. In this paper, the proximity of solutions of the initial-boundary value problem and its grid approximations is considered in the weighted maximum norm ∥·∥ ^w with the weighting function Ψ⁻¹(x); in this norm, the solution of the initial-boundary value problem is ɛ-uniformly bounded. Using the method of special grids that condense in a neighborhood of the boundary layer or in neighborhoods of the boundary and interior layers, special finite difference schemes are constructed and studied that converge ɛ-uniformly in the weighted norm. It is shown that the convergence rate considerably depends on the type of nonsmoothness in the initial-boundary conditions. Grid approximations of the Cauchy problem with the right-hand side and the initial function growing as O(Ψ(x)) that converge ɛ-uniformly in the weighted norm are also considered.