Equipartition of mass distributions by hyperplanes

We consider the problem of determining the smallest dimensiond=Δ(j, k) such that, for anyj mass distributions inR ^d , there arek hyperplanes so that each orthant contains a fraction 1/2 ^k of each of the masses. The case Δ(1,2)=2 is very well known. The casek=1 is answered by the ham-sandwich theorem with Δ(j, 1)=j. By using mass distributions on the moment curve the lower bound Δ(j, k)≥j(2 ^k −1)/k is obtained. We believe this is a tight bound. However, the only general upper bound that we know is Δ(j, k)≤j2 ^k−1. We are able to prove that Δ(j, k)=⌈j(^2k−1/k⌉ for a few pairs (j, k) ((j, 2) forj=3 andj=2 ⁿ withn≥0, and (2, 3)), and obtain some nontrivial bounds in other cases. As an intermediate result of independent interest we prove a Borsuk-Ulam-type theorem on a product of balls. The motivation for this work was to determine Δ(1, 4) (the only case forj=1 in which it is not known whether Δ(1,k)=k); unfortunately the approach fails to give an answer in this case (but we can show Δ(1, 4)≤5). This research was supported by the National Science Foundation under Grant CCR-9118874.     

On-line coloring of perfect graphs

Lovász, Saks, and Trotter showed that there exists an on-line algorithm which will color any on-linek-colorable graph onn vertices withO(nlog^(2k–3) n/log^(2k–4) n) colors. Vishwanathan showed that at least (log ^k–1 n/k ^k ) colors are needed. While these remain the best known bounds, they give a distressingly weak approximation of the number of colors required. In this article we study the case of perfect graphs. We prove that there exists an on-line algorithm which will color any on-linek-colorable perfect graph onn vertices withn ^10k/loglogn colors and that Vishwanathan's techniques can be slightly modified to show that his lower bound also holds for perfect graphs. This suggests that Vishwanathan's lower bound is far from tight in the general case.Research partially supported by Office of Naval Research grant N00014-90-J-1206.     

On some 2-adic properties of a recurrence involving stirling numbers

We analyze some 2-adic properties of the sequence defined by the recurrence Z(1) = 1; Z(n) = Σ _k=1 ⁿ⁻¹ S(n, k)Z(k), n ≥ 2, which counts the number of ultradissimilarity relations, i.e., ultrametrics on an n-set. We prove the 2-adic growth property ν ₂(Z(n)) ≥ ⌈log₂ n⌉ −1 and present conjectures on the exact values.     

Fast deterministic approximation for the multicommodity flow problem

In this paper we consider an optimization version of the multicommodity flow problem which is known as the maximum concurrent flow problem. We show that an approximate solution to this problem can be computed deterministically using O(k(ε ⁻² + logk) logn) 1-commodity minimum-cost flow computations, wherek is the number of commodities,n is the number of nodes, andε is the desired precision. We obtain this bound by proving that in the randomized algorithm developed by Leighton et al. (1995) the random selection of commodities can be replaced by the deterministic round-robin without increasing the total running time. Our bound significantly improves the previously known deterministic upper bounds and matches the best known randomized upper bound for the approximation concurrent flow problem. A preliminary version of this paper appeared inProceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, San Francisco CA, 1995, pp. 486–492.     

A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs

1.IntroductionLetG=(V,E,W)beaconnected,weightedandundirectedgraph,VeEE,w(e)(相似文献   

A sparse graph almost as good as the complete graph on points inK dimensions

A setV ofn points ink-dimensional space induces a complete weighted undirected graph as follows. The points are the vertices of this graph and the weight of an edge between any two points is the distance between the points under someL _p metric. Let ε≤1 be an error parameter and letk be fixed. We show how to extract inO(n logn+ε ^−k log(1/ε)n) time a sparse subgraphG=(V, E) of the complete graph onV such that: (a) for any two pointsx, y inV, the length of the shortest path inG betweenx andy is at most (1+∈) times the distance betweenx andy, and (b)|E|=O(ε^−k n).     

Tiling Transitive Tournaments and Their Blow-ups

Let TT _k denote the transitive tournament on k vertices. Let TT(h,k) denote the graph obtained from TT _k by replacing each vertex with an independent set of size h≥1. The following result is proved: Let c ₂=1/2, c ₃=5/6 and c _k =1−2^{−k−log k} for k≥4. For every ∈>0 there exists N=N(∈,h,k) such that for every undirected graph G with n>N vertices and with δ(G)≥c _k n, every orientation of G contains vertex disjoint copies of TT(h,k) that cover all but at most ∈n vertices. In the cases k=2 and k=3 the result is asymptotically tight. For k≥4, c _k cannot be improved to less than 1−2^{−0.5k(1+o(1))}. This revised version was published online in June 2006 with corrections to the Cover Date.     

Rearrangements of (0–1) matrices

Let ℬ(m) be the set of all then-square (0–1) matrices containingm ones andn ²−m zeros, 0<m<n ². The problem of finding the maximum ofs(A ²) over this set, wheres(A ²) is the sum of the entries ofA ²,A ∈ ℬ (m) is considered. This problem is solved in the particular casesm=n ² −k ² andm=k ²,k ²>(n ²/2). This paper forms part of a thesis in partial fulfillment of the requirements for the degree of Doctor of Science at the Technion-Israel Institute of Technology. The author wishes to thank Professor B. Schwarz and Dr. D. London for their help in the preparation of this paper.     

Some simple in-place merging algorithms

The theoretical presentation and analysis is given for two families of simple in-place merging algorithms and their limiting cases. The first family merges stably inO(k·n) time andO(n ^1/k ) additional space with a limiting case running inO(n logn) time and constant space. The second family merges unstably inO (k ·n) time andO(log ^k n) space with a limiting case running inO(nG(n)) time and constant space. HereG(n) is the leastk such thatF(k) n whereF(0)=1 andF(i)=2 ^F(i–1) fori1. Each algorithm gives rise to a corresponding merge sort.     

Euclidean minimum spanning trees and bichromatic closest pairs

We present an algorithm to compute a Euclidean minimum spanning tree of a given setS ofN points inE ^d in timeO(F _d (N,N) log ^d N), whereF _d (n,m) is the time required to compute a bichromatic closest pair amongn red andm green points inE ^d . IfF _d (N,N)=Ω(N ^1+ε), for some fixed ɛ>0, then the running time improves toO(F _d (N,N)). Furthermore, we describe a randomized algorithm to compute a bichromatic closest pair in expected timeO((nm logn logm)^2/3+m log² n+n log² m) inE ₃, which yields anO(N ^4/3 log^4/3 N) expected time, algorithm for computing a Euclidean minimum spanning tree ofN points inE ³. Ind≥4 dimensions we obtain expected timeO((nm)^{1−1/([d/2]+1)+ε}+m logn+n logm) for the bichromatic closest pair problem andO(N ^{2−2/([d/2]+1)ε}) for the Euclidean minimum spanning tree problem, for any positive ɛ. The first, second, and fourth authors acknowledge support from the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), a National Science Foundation Science and Technology Center under NSF Grant STC 88-09648. The second author's work was supported by the National Science Foundation under Grant CCR-8714565. The third author's work was supported by the Deutsche Forschungsgemeinschaft under Grant A1 253/1-3, Schwerpunktprogramm “Datenstrukturen und effiziente Algorithmen”. The last two authors' work was also partially supported by the ESPRIT II Basic Research Action of the EC under Contract No. 3075 (project ALCOM).     

The complexity and depth of Boolean circuits for multiplication and inversion in some fields <Emphasis Type="Italic">GF</Emphasis>(2<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)

Let n = (p − 1) · p ^k , where p is a prime number such that 2 is a primitive root modulo p, and 2 ^p−1 − 1 is not a multiple of p ². For a standard basis of the field GF(2 ⁿ ), a multiplier of complexity O(log log p)n log n log log _p n and an inverter of complexity O(log p log log p)n log n log log _p n are constructed. In particular, in the case p = 3 the upper bound

Estimates for the number of rational points on convex curves and surfaces

Let Γ ⊂ ℝ^d be a bounded strictly convex surface. We prove that the number k_n(Γ) of points of Γ that lie on the lattice satisfies the following estimates: lim inf k_n(Γ)/n^d−2 < ∞ for d ≥ 3 and lim inf k_n(Γ)/log n < ∞ for d = 2. Bibliography: 9 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 344, 2007, pp. 174–189.     

An asymptotic approximation of Wallis’ sequence

An asymptotic approximation of Wallis’ sequence W(n) = Π _k=1 ⁿ 4k ²/(4k ² − 1) obtained on the base of Stirling’s factorial formula is presented. As a consequence, several accurate new estimates of Wallis’ ratios w(n) = Π _k=1 ⁿ (2k−1)/(2k) are given. Also, an asymptotic approximation of π in terms of Wallis’ sequence W(n) is obtained, together with several double inequalities such as, for example,

A Bichromatic Incidence Bound and an Application

We prove a new, tight upper bound on the number of incidences between points and hyperplanes in Euclidean d-space. Given n points, of which k are colored red, there are O _d (m ^2/3 k ^2/3 n ^(d−2)/3+kn ^d−2+m) incidences between the k red points and m hyperplanes spanned by all n points provided that m=Ω(n ^d−2). For the monochromatic case k=n, this was proved by Agarwal and Aronov (Discrete Comput. Geom. 7(4):359–369, 1992).     

Fractional Poisson equations and ergodic theorems for fractional coboundaries

For a given contractionT in a Banach spaceX and 0<α<1, we define the contractionT _α=Σ _j=1 ^∞ a _j T ^j , where {a _j } are the coefficients in the power series expansion (1-t)^α=1-Σ _j=1 ^∞ a _j t ^j in the open unit disk, which satisfya _j >0 anda _j >0 and Σ _j=1 ^∞ a _j =1. The operator calculus justifies the notation(I−T) ^α :=I−T _α (e.g., (I−T _1/2)²=I−T). A vectory∈X is called an, α-fractional coboundary for T if there is anx∈X such that(I−T) ^α x=y, i.e.,y is a coboundary forT _α . The fractional Poisson equation forT is the Poisson equation forT _α . We show that if(I−T)X is not closed, then(I−T) ^α X strictly contains(I−T)X (but has the same closure). ForT mean ergodic, we obtain a series solution (converging in norm) to the fractional Poisson equation. We prove thaty∈X is an α-fractional coboundary if and only if Σ _k=1 ^∞ T ^k y/k ^1-α converges in norm, and conclude that lim _n ‖(1/n ^1-α)Σ _k=1 ⁿ T ^k y‖=0 for suchy. For a Dunford-Schwartz operatorT onL ₁ of a probability space, we consider also a.e. convergence. We prove that iff∈(I−T) ^α L ₁ for some 0<α<1, then the one-sided Hilbert transform Σ _k=1 ^∞ T ^k f/k converges a.e. For 1<p<∞, we prove that iff∈(I−T) ^α L _p with α>1−1/p=1/q, then Σ _k=1 ^∞ T ^k f/k ^1/p converges a.e., and thus (1/n ^1/p ) Σ _k=1 ⁿ T ^k f converges a.e. to zero. Whenf∈(I−T) ^1/q L _p (the case α=1/q), we prove that (1/n ^1/p (logn)^1/q )Σ _k=1 ⁿ T ^k f converges a.e. to zero.     

On the difference between the number of prime divisors at consecutive integers

Suppose thatg(n) is equal to the number of divisors ofn, counting multiplicity, or the number of divisors ofn, a≠0 is an integer, andN(x,b)=|{n∶n≤x, g(n+a)−g(n)=b orb+1}|. In the paper we prove that sup _b N(x,b)≤C(a)x)(log log 10 _x )^−1/2 and that there exists a constantC(a,μ)>0 such that, given an integerb |b|≤μ(log logx)^1/2,x≥x _o, the inequalityN(x,b)≥C(a,μ)x(log logx(^−1/2) is valid. Translated fromMatematicheskie Zametki, Vol. 66, No. 4, pp. 579–595, October, 1999.     

Semiclassical <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript> Estimates of Quasimodes on Curved Hypersurfaces

Let M be a compact manifold of dimension n, P=P(h) a semiclassical pseudodifferential operator on M, and u=u(h) an L ² normalized family of functions such that P(h)u(h) is O(h) in L ²(M) as h↓0. Let H⊂M be a compact submanifold of M. In a previous article, the second-named author proved estimates on the L ^p norms, p≥2, of u restricted to H, under the assumption that the u are semiclassically localized and under some natural structural assumptions about the principal symbol of P. These estimates are of the form Ch ^−δ(n,k,p) where k=dim H (except for a logarithmic divergence in the case k=n−2, p=2). When H is a hypersurface, i.e., k=n−1, we have δ(n,n−1, 2)=1/4, which is sharp when M is the round n-sphere and H is an equator.     

Hypergraphs with independent neighborhoods

For each k ≥ 2, let ρ _k ∈ (0, 1) be the largest number such that there exist k-uniform hypergraphs on n vertices with independent neighborhoods and (ρ _k + o(1))( _k ⁿ ) edges as n → ∞. We prove that ρ _k = 1 − 2logk/k + Θ(log log k/k) as k → ∞. This disproves a conjecture of Füredi and the last two authors.     

On Kneser solutions of higher order nonlinear ordinary differential equations

The equationx ⁽ⁿ⁾(t)=(−1) ⁿ │x(t)│ ^k withk>1 is considered. In the casen≦4 it is proved that solutions defined in a neighbourhood of infinity coincide withC(t−t₀)^−n/(k−1), whereC is a constant depending only onn andk. In the general case such solutions are Kneser solutions and can be estimated from above and below by a constant times (t−t ₀)^−n/(k−1). It is shown that they do not necessarily coincide withC(t−t₀)^−n/(k−1). This gives a negative answer to two conjectures posed by Kiguradze that Kneser solutions are determined by their value in a point and that blow-up solutions have prescribed asymptotics. Dedicated to Professor Vladimir Maz'ya on the occasion of his 60th birthday. The author was supported by the Swedish Natural Science Research Council (NFR) grant M-AA/MA 10879-304.     

On embedding trees into uniformly convex Banach spaces

We investigate the minimum value ofD =D(n) such that anyn-point tree metric space (T, ρ) can beD-embedded into a given Banach space (X, ∥·∥); that is, there exists a mappingf :T →X with 1/D ρ(x,y) ≤ ∥f(x) −f(y)∥ ≤ρ(x,y) for anyx,y εT. Bourgain showed thatD(n) grows to infinity for any superreflexiveX (and this characterized super-reflexivity), and forX =ℓ _p, 1 <p < ∞, he proved a quantitative lower bound of const·(log logn)^min(1/2,1/p). We give another, completely elementary proof of this lower bound, and we prove that it is tight (up to the value of the constant). In particular, we show that anyn-point tree metric space can beD-embedded into a Euclidean space, with no restriction on the dimension, withD =O(√log logn). This paper contains results from my thesis [Mat89] from 1989. Since the subject of bi-Lipschitz embeddings is becoming increasingly popular, in 1997 I finally decided to publish this English version. Supported by Czech Republic Grant GAČR 0194 and by Charles University grants No. 193, 194.