An Asymptotic Isoperimetric Inequality

For a finite metric space V with a metric , let V ⁿ be the metric space in which the distance between (a ₁ , . . ., a _n ) and (b ₁ , . . ., b _n ) is the sum . We obtain an asymptotic formula for the logarithm of the maximum possible number of points in V ⁿ of distance at least d from a set of half the points of V ⁿ , when n tends to infinity and d satisfies . Submitted: September 1997, Final version: November 1997     

Regularity for minimal boundaries in R n ¶with mean curvature in L n

Let be a minimal set with mean curvature in L ⁿ that is a minimum of the functional , where is open and . We prove that if then can be parametrized over the (n−1)-dimensional disk with a C ^α mapping with C ^α inverse. Received: 11 July 1997 / Revised version: 24 February 1998     

Moebius geometry of submanifolds in ? n

In this paper we define a Moebius invariant metric and a Moebius invariant second fundamental form for submanifolds in ? ⁿ and show that in case of a hypersurface with n≥ 4 they determine the hypersurface up to Moebius transformations. Using these Moebius invariants we calculate the first variation of the moebius volume functional. We show that any minimal surface in ? ⁿ is also Moebius minimal and that the image in ? ⁿ of any minimal surface in ℝ ⁿ unter the inverse of a stereographic projection is also Moebius minimal. Finally we use the relations between Moebius invariants to classify all surfaces in ?³ with vanishing Moebius form. Received: 18 November 1997     

An Integral Formula for Lipschitz-Killing Curvature and the Critical Points of Height Functions

We have established (see Shiohama and Xu in J. Geom. Anal. 7:377–386, 1997; Lemma) an integral formula on the absolute Lipschitz-Killing curvature and critical points of height functions of an isometrically immersed compact Riemannian n-manifold into R ^n+q . Making use of this formula, we prove a topological sphere theorem and a differentiable sphere theorem for hypersurfaces with bounded L ^n/2 Ricci curvature norm in R ⁿ⁺¹. We show that the theorems of Gauss-Bonnet-Chern, Chern-Lashof and the Willmore inequality are all its consequences.     

On denominators of the Kontsevich integral and the universal perturbative invariant of 3-manifolds

 The integrality of the Kontsevich integral and perturbative invariants is discussed. It is shown that the denominator of the degree n part of the Kontsevich integral of any knot or link is a divisor of (2!3!…n!)⁴(n+1)!. We prove this by establishing the existence of a Drinfeld's associator in the space of chord diagrams with special denominators. We also show that the denominator of the degree n part of the universal perturbative invariant of homology 3-spheres is not divisible by any prime greater than 2n+1. Oblatum 20-VI-1997 & 28-IV-1998 / Published online: 12 November 1998     

Existence of HPMDs with block size five

In this article, it is shown that the necessary condition for the existence of a holey perfect Mendelsohn design (HPMD) with block size 5 and type hⁿ, namely, n ≥ 5 and n(n - 1)hⁿ ≡ 0 (mod 5), is also sufficient, except possibly for a few cases. The results of this article guarantee the analogous existence results for group divisible designs (GDDs) of group-type hⁿ with block size k = 5 and having index λ = 4. Moreover, some more conclusive results for the existence of (v, 5, 1)-perfect Mendelsohn designs (PMDs) are also mentioned. © 1997 John Wiley & Sons, Inc. J Combin Designs 5: 257–273, 1997     

On the Degree of Approximation by Manifolds of Finite Pseudo-Dimension

The pseudo-dimension of a real-valued function class is an extension of the VC dimension for set-indicator function classes. A class of finite pseudo-dimension possesses a useful statistical smoothness property. In [10] we introduced a nonlinear approximation width = which measures the worst-case approximation error over all functions by the best manifold of pseudo-dimension n . In this paper we obtain tight upper and lower bounds on ρ _n (W ^r,d _p , L _q ) , both being a constant factor of n ^-r/d , for a Sobolev class W ^r,d _p , . As this is also the estimate of the classical Alexandrov nonlinear n -width, our result proves that approximation of W ^r,d _p by the family of manifolds of pseudo-dimension n is as powerful as approximation by the family of all nonlinear manifolds with continuous selection operators. March 12, 1997. Dates revised: August 26, 1997, October 24, 1997, March 16, 1998, June 15, 1998. Date accepted: June 25, 1998.     

The Discrete 2-Center Problem

We present an algorithm for computing the discrete 2-center of a set P of n points in the plane; that is, computing two congruent disks of smallest possible radius, centered at two points of P , whose union covers P . Our algorithm runs in time O(n ^4/3 log ⁵ n) . Received July 18, 1997, and in revised form March 17, 1998.     

On Levels in Arrangements of Lines, Segments, Planes, and Triangles%

We consider the problem of bounding the complexity of the k th level in an arrangement of n curves or surfaces, a problem dual to, and an extension of, the well-known k-set problem. Among other results, we prove a new bound, O(nk ^5/3 ) , on the complexity of the k th level in an arrangement of n planes in R ³ , or on the number of k -sets in a set of n points in three dimensions, and we show that the complexity of the k th level in an arrangement of n line segments in the plane is , and that the complexity of the k th level in an arrangement of n triangles in 3-space is O(n ² k ^5/6 α(n/k)) . <lsiheader> <onlinepub>26 June, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>19n3p315.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>yes <sectionname> </lsiheader> Received February 7, 1997, and in revised form May 15, 1997, and August 30, 1997.     

A particle approximation of the solution of the Kushner–Stratonovitch equation

We construct a sequence of branching particle systems α _n convergent in measure to the solution of the Kushner–Stratonovitch equation. The algorithm based on this result can be used to solve numerically the filtering problem. We prove that the rate of convergence of the algorithm is of order n ^?. This paper is the third in a sequence, and represents the most efficient algorithm we have identified so far. Received: 4 February 1997 / Revised version: 26 October 1998     

Sampling to provide or to bound: With applications to fully dynamic graph algorithms

In dynamic graph algorithms the following provide-or-bound problem has to be solved quickly: Given a set S containing a subset R and a way of generating random elements from S testing for membership in R, either (i) provide an element of R, or (ii) give a (small) upper bound on the size of R that holds with high probability. We give an optimal algorithm for this problem. This algorithm improves the time per operation for various dynamic graph algorithms by a factor of O(log n). For example, it improves the time per update for fully dynamic connectivity from O(log³n) to O(log²n). © 1997 John Wiley & Sons, Inc. Random Struct. Alg., 11 , 369–379 (1997)     

On dimensions of the groups of biholomorphic automorphisms of real-analytic hypersurfaces

In this paper we study the dependence of the local geometry of real-analytic hypersuffaces in ℂ ⁿ on the dimension of the group of biholomorphic automorphisms of this surface. We also classify the hypersurfaces in terms of this group. We present some examples showing that the classes of the given construction are not empty. We find a new formulation of the Freeman theorem on the so-called straightening of a real-analytic CR-submanifold in ℂ ⁿ with degenerate Levi form of constant rank. Translated fromMatematicheskie Zametki, Vol. 61, No. 3, pp. 349–358, March, 1997. Translated by E. G. Anisova     

Hamilton decompositions of cartesian products of multicycles

We define the multicycle C^(r)_m as a cycle on m vertices where each edge has multiplicity r. So C^(r)_m can be decomposed into r Hamilton cycles. We provide a complete answer to the following question: for which positive integers m, n, r, s with m, n ≥ 3 can the Cartesian product of two multicycles C^(r)_m x C^(s)_n be decomposed into r + s Hamilton cycles? We find some interesting characterizations of Hamilton cycles of C_m x C_n while answering the above question. © 1997 John Wiley & Sons, Inc.     

Some remarks on Legendrian rectifiable currents

A rectifiable current of dimension n−1 in the sphere bundle Sℝⁿ≃ℝⁿ×S ^{n −1} for euclidean space is Legendrian if it annihilates the contact 1-form α (i.e. T(α∧φ)=0 for all forms φ of degree n−2). Such a current may be naturally associated to any convex set or to any singular real analytic variety, and induces the curvature measures of such a set. We prove that the projection to ℝⁿ of a carrier of a general such T is C ²-rectifiable in the sense of Anzellotti–Serapioni. We deduce that the boundary of a set with positive reach, as well as its singular skeleta, are C ²-rectifiable. In case ∂T= 0 we prove also that the curvature measures associated to T satisfy the analogues of the classical variational formulas for curvature integrals. It follows that such formulas are valid for the curvature measures of subsets of space forms. Received: 3 December 1997/ Revised version: 25 May 1998     

Solution of a restricted Hadamard problem on Minkowski spaces

We give a complete solution of Hadamard's problem concerning Huygens' principle on even-dimensional Minkowski spaces 𝕄ⁿ⁺¹ for a restricted class of linear, second-order, normal hyperbolic operators ℒ︁ = □_n+1 + u(x¹, x²) with real (locally) analytic potentials u = u(x¹, x²) depending on two spatial variables and homogeneous of degree −2. © 1997 John Wiley & Sons, Inc.     

Coding and Counting Arrangements of Pseudolines

Arrangements of lines and pseudolines are important and appealing objects for research in discrete and computational geometry. We show that there are at most 2^{0.657&gt; n2}2^{0.657\> n^{2}} simple arrangements of n pseudolines in the plane. This improves on previous work by Knuth who proved an upper bound of 3^\binomn2 @ 2^{0.792&gt; n2}3^{\binom{n}{2}} \cong 2^{0.792\> n^{2}} in 1992 and the first author, who obtained 2^{0.697&gt; n2}2^{0.697\> n^{2}} in 1997. The argument uses surprisingly little geometry. The main ingredient is a lemma that was already central to the argument given by Knuth.     

Critical random graphs and the structure of a minimum spanning tree

We consider the complete graph on n vertices whose edges are weighted by independent and identically distributed edge weights and build the associated minimum weight spanning tree. We show that if the random weights are all distinct, then the expected diameter of such a tree is Θ(n^1/3). This settles a question of Frieze and Mc‐Diarmid (Random Struct Algorithm 10 (1997), 5–42). The proofs are based on a precise analysis of the behavior of random graphs around the critical point. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2009     

On the degree of iterates of automorphisms¶of the affine plane

For a polynomial automorphism f of ?² _ℂ, we set τ = deg f ²)/(deg f). We prove that τ≤ 1 if and only if f is triangularizable. In this situation, we show (by using a deep result from number theory known as the theorem of Skolem–Mahler–Lech) that the sequence (deg f ⁿ ) _{n ∈ℕ} is periodic for large n. In the opposite case, we prove that τ is an integer (τ≥ 2) and that the sequence (deg f ⁿ ) _{n ∈ℕ} is a geometric progression of ratio τ. In particular, if f is any automorphism, we obtain the rationality of the formal series . Received: 1 December 1997     

The degree sequence of a random graph. I. The models

We show that the joint distribution of the degrees of a random graph can be accurately approximated by several simpler models derived from a set of independent binomial distributions. On the one hand, we consider the distribution of degree sequences of random graphs with n vertices and ½m edges. For a wide range of values of m, this distribution is almost everywhere in close correspondence with the conditional distribution {(X₁,…,X_n) | ∑ X_i=m}, where X₁,…,X_n are independent random variables, each having the same binomial distribution as the degree of one vertex. We also consider random graphs with n vertices and edge probability p. For a wide range of functions p=p(n), the distribution of the degree sequence can be approximated by {(X₁,…,X>_n) | ∑ X_i is even}, where X₁,…,X_n are independent random variables each having the distribution Binom (n−1, p′), where p′ is itself a random variable with a particular truncated normal distribution. To facilitate computations, we demonstrate techniques by which statistics in this model can be inferred from those in a simple model of independent binomial random variables. Where they apply, the accuracy of our method is sufficient to determine asymptotically all probabilities greater than n^−k for any fixed k. In this first paper, we use the geometric mean of degrees as a tutorial example. In the second paper, we will determine the asymptotic distribution of the tth largest degree for all functions t=t(n) as n→∞. © 1997 John Wiley & Sons, Inc. Random Struct. Alg., 11 , 97–117 (1997)