Computing the Top Betti Numbers of Semialgebraic Sets Defined by Quadratic Inequalities in Polynomial Time

For any ℓ>0, we present an algorithm which takes as input a semi-algebraic set, S, defined by P ₁≤0,…,P _s ≤0, where each P _i ∈R[X ₁,…,X _k ] has degree≤2, and computes the top ℓ Betti numbers of S, b _k−1(S),…,b _k−ℓ (S), in polynomial time. The complexity of the algorithm, stated more precisely, is . For fixed ℓ, the complexity of the algorithm can be expressed as , which is polynomial in the input parameters s and k. To our knowledge this is the first polynomial time algorithm for computing nontrivial topological invariants of semialgebraic sets in R ^k defined by polynomial inequalities, where the number of inequalities is not fixed and the polynomials are allowed to have degree greater than one. For fixed s, we obtain, by letting ℓ=k, an algorithm for computing all the Betti numbers of S whose complexity is . An erratum to this article can be found at     

A Sharper Estimate on the Betti Numbers of Sets Defined by Quadratic Inequalities

In this paper we consider the problem of bounding the Betti numbers, b _i (S), of a semi-algebraic set S⊂ℝ ^k defined by polynomial inequalities P ₁≥0,…,P _s ≥0, where P _i ∈ℝ[X ₁,…,X _k ], s<k, and deg (P _i )≤2, for 1≤i≤s. We prove that for 0≤i≤k−1,

The Erdös-Jacobson-Lehel conjecture on potentiallyP k-graphic sequence is true

A variation in the classical Turan extrernal problem is studied. A simple graphG of ordern is said to have propertyPk if it contains a clique of sizek+1 as its subgraph. Ann-term nonincreasing nonnegative integer sequence π=(d₁, d₂,⋯, d₂) is said to be graphic if it is the degree sequence of a simple graphG of ordern and such a graphG is referred to as a realization of π. A graphic sequence π is said to be potentiallyP _k-graphic if it has a realizationG having propertyP _k . The problem: determine the smallest positive even number σ(k, n) such that everyn-term graphic sequence π=(d₁, d₂,…, d₂) without zero terms and with degree sum σ(π)=(d ₁+d ₂+ …+d ₂) at least σ(k,n) is potentially P_k-graphic has been proved positive. Project supported by the National Natural Science Foundation of China (Grant No. 19671077) and the Doctoral Program Foundation of National Education Department of China.     

Ideal einstein,conformally flat and semi-symmetric immersions

Recently, B. Y. Chen introduced a new intrinsic invariant of a manifold, and proved that everyn-dimensional submanifold of real space formsR ^m (ε) of constant sectional curvature ε satisfies a basic inequality δ(n ₁,…,n _k )≤c(n ₁,…,n _k )H ²+b(n ₁,…,n _k )ε, whereH is the mean curvature of the immersion, andc(n ₁,…,n _k ) andb(n ₁,…,n _k ) are constants depending only onn ₁,…,n _k ,n andk. The immersion is calledideal if it satisfies the equality case of the above inequality identically for somek-tuple (n ₁,…,n _k ). In this paper, we first prove that every ideal Einstein immersion satisfyingn≥n ₁+…+n _k +1 is totally geodesic, and that every ideal conformally flat immersion satisfyingn≥n ₁+…+n _k +2 andk≥2 is also totally geodesic. Secondly we completely classify all ideal semi-symmetric hypersurfaces in real space forms. The author was supported by the NSFC and RFDP.     

A finiteness condition for semigroups which generalizes Green-Rees' theorem

LetS be a finitely generated semigroup. ThenS is finite if every finitely generated subgroup ofS is finite and, for some integerm≥1, for everym-tuplex ₁,x ₂,…x _m of elements ofS there exist an integeri: 1≤i≤m and an integer ρ>1 such that:x _i +1…x _m (x ₁ x ₂…x _m )^ρ=x _i +1…x _m x ₁…x _m . The proof of the result is a direct generalisation of the original one by Green and Rees for the casem=1.     

On the Maximum Number of Translates in a Point Set

Given a finite set P⊆ℝ ^d , called a pattern, t _P (n) denotes the maximum number of translated copies of P determined by n points in ℝ ^d . We give the exact value of t _P (n) when P is a rational simplex, that is, the points of P are rationally affinely independent. In this case, we prove that t _P (n)=n−m _r (n), where r is the rational affine dimension of P, and m _r (n) is the r -Kruskal–Macaulay function. We note that almost all patterns in ℝ ^d are rational simplices. The function t _P (n) is also determined exactly when | P |≤3 or when P has rational affine dimension one and n is large enough. We establish the equivalence of finding t _P (n) and the maximum number s _R (n) of scaled copies of a suitable pattern R⊆ℝ⁺ determined by n positive reals. As a consequence, we show that s_Ak(n)=n-\varTheta (n^1-1/p(k))s_{A_{k}}(n)=n-\varTheta (n^{1-1/\pi(k)}) , where A _k ={1,2,…,k} is an arithmetic progression of size k, and π(k) is the number of primes less than or equal to k.     

Discrete Calderón’s Identity,Atomic Decomposition and Boundedness Criterion of Operators on Multiparameter Hardy Spaces

In this paper we establish a discrete Calderón’s identity which converges in both L ^q (ℝ ^n+m ) (1<q<∞) and Hardy space H ^p (ℝ ⁿ ×ℝ ^m ) (0<p≤1). Based on this identity, we derive a new atomic decomposition into (p,q)-atoms (1<q<∞) on H ^p (ℝ ⁿ ×ℝ ^m ) for 0<p≤1. As an application, we prove that an operator T, which is bounded on L ^q (ℝ ^n+m ) for some 1<q<∞, is bounded from H ^p (ℝ ⁿ ×ℝ ^m ) to L ^p (ℝ ^n+m ) if and only if T is bounded uniformly on all (p,q)-product atoms in L ^p (ℝ ^n+m ). The similar result from H ^p (ℝ ⁿ ×ℝ ^m ) to H ^p (ℝ ⁿ ×ℝ ^m ) is also obtained.     

Completely monotone multisequences, symmetric probabilities and a normal limit theorem

Let G _n,k be the set of all partial completely monotone multisequences of ordern and degreek, i.e., multisequencesc _n(β₁,β₂,…, β _k ), β₁,β₂,…, β_k = 0,1,2,…, β₁+β₂ + … +β _k ≤n,c _n(0,0,…, 0) = 1 and whenever β₀ ≤n - (β₁ + β₂ + … + β _k ) where Δc _n(β₁,β₂,…, β _k ) =c _n(β₁ + 1, β₂,…, β _k )+c _n(β₁,β₂+1,…, β _k )+…+c _n (β₁,β₂,…, β _k +1) -c _n(β₁,β₂,…, β _k ). Further, let Π _n,k be the set of all symmetric probabilities on {0,1,2,…,k} ⁿ . We establish a one-to-one correspondence between the sets G _n,k and Π _n,k and use it to formulate and answer interesting questions about both. Assigning to G _n,k the uniform probability measure, we show that, asn→∞, any fixed section {it{c_n}(β₁,β₂,…, β _k ), 1 ≤ Σβ _i ≤m}, properly centered and normalized, is asymptotically multivariate normal. That is, converges weakly to MVN[0, Σ _m ]; the centering constantsc ₀(β₁, β₂,…, β _k ) and the asymptotic covariances depend on the moments of the Dirichlet (1, 1,…, 1; 1) distribution on the standard simplex inR ^k.     

Multiderivations of Coxeter arrangements

Let V be an ℓ-dimensional Euclidean space. Let G⊂O(V) be a finite irreducible orthogonal reflection group. Let ? be the corresponding Coxeter arrangement. Let S be the algebra of polynomial functions on V. For H∈? choose α _H ∈V ^* such that H=ker(α _H ). For each nonnegative integer m, define the derivation module D ^(m) (?)={θ∈Der _S |θ(α _H )∈Sα ^m _H }. The module is known to be a free S-module of rank ℓ by K. Saito (1975) for m=1 and L. Solomon-H. Terao (1998) for m=2. The main result of this paper is that this is the case for all m. Moreover we explicitly construct a basis for D ^(m) (?). Their degrees are all equal to mh/2 (when m is even) or are equal to ((m−1)h/2)+m _i (1≤i≤ℓ) (when m is odd). Here m ₁≤···≤m _ℓ are the exponents of G and h=m _ℓ+1 is the Coxeter number. The construction heavily uses the primitive derivation D which plays a central role in the theory of flat generators by K. Saito (or equivalently the Frobenius manifold structure for the orbit space of G). Some new results concerning the primitive derivation D are obtained in the course of proof of the main result. Oblatum 27-XI-2001 & 4-XII-2001?Published online: 18 February 2002     

Additive latin transversals

We prove that for every odd primep, everyk≤p and every two subsets A={a ₁, …,a _k } andB={b ₁, …,b _k } of cardinalityk each ofZ _p , there is a permutationπ ∈S _k such that the sumsa _i +b _π(i) (inZ _p ) are pairwise distinct. This partially settles a question of Snevily. The proof is algebraic, and implies several related results as well. Research supported in part by a State of New Jersey grant and by the Hermann Minkowski Minerva Center for Geometry at Tel Aviv University.     

A proof of snevily’s conjecture

We prove Snevily’s conjecture, which states that for any positive integer k and any two k-element subsets {a ₁, …, a _k } and {b ₁, …, b _k } of a finite abelian group of odd order there exists a permutation π ∈ S _k such that all sums a _i + b _π(i) (i ∈ [1, k]) are pairwise distinct.     

Large antipodal families

A family {A _i | i ∈ I} of sets in ℝ ^d is antipodal if for any distinct i, j ∈ I and any p ∈ A _i , q ∈ A _j , there is a linear functional ϕ:ℝ ^d → ℝ such that ϕ(p) ≠ ϕ(q) and ϕ(p) ≤ ϕ(r) ≤ ϕ(q) for all r ∈ ∪ _i∈I A _i . We study the existence of antipodal families of large finite or infinite sets in ℝ³. The research was supported by the Hungarian-South African Intergovernmental Scientific and Technological Cooperation Programme, NKTH Grant no. ZA-21/2006 and South African National Research Foundation Grant no. UID 61853, as well as Hungarian National Foundation for Scientific Research Grants no. NK 67867, no. T47102, and no. K72537.     

Disjoint homotopic paths and trees in a planar graph

In this paper we describe a polynomial-time algorithm for the following problem:given: a planar graphG embedded in ℝ², a subset {I ₁, …,I _p} of the faces ofG, and pathsC ₁, …,C _k inG, with endpoints on the boundary ofI ₁ ∪ … ∪I _p; find: pairwise disjoint simple pathsP ₁, …,P _k inG so that, for eachi=1, …,k, P _i is homotopic toC _i in the space ℝ²\(I ₁ ∪ … ∪I _p). Moreover, we prove a theorem characterizing the existence of a solution to this problem. Finally, we extend the algorithm to disjoint homotopic trees. As a corollary we derive that, for each fixedp, there exists a polynormial-time algorithm for the problem:given: a planar graphG embedded in ℝ² and pairwise disjoint setsW ₁, …,W _k of vertices, which can be covered by the boundaries of at mostp faces ofG;find: pairwise vertex-disjoint subtreesT ₁, …,T _k ofG whereT _i (i=1, …, k).     

Test elements for endomorphisms of free groups and algebras

LetE be a bounded Borel subset of ℝⁿ,n≥2, of positive Lebesgue measure andP _E the corresponding ‘Pompeiu transform”. We prove thatP _E is injective onL ^p(ℝⁿ) if 1≤p≤2n/(n-1). We explore the connection between this problem and a Wiener-Tauberian type theorem for theM(n) action onL ^q(ℝⁿ) for various values ofq. We also take up the question of whenP _E is injective in caseE is of finite, positive measure, but is not necessarily a bounded set. Finally, we briefly look at these questions in the contexts of symmetric spaces of compact and non-compact type.     

Transversals of additive Latin squares

LetA={a ₁, …,a _k} andB={b ₁, …,b _k} be two subsets of an Abelian groupG, k≤|G|. Snevily conjectured that, whenG is of odd order, there is a permutationπ ∈S _ksuch that the sums α _i +b _i , 1≤i≤k, are pairwise different. Alon showed that the conjecture is true for groups of prime order, even whenA is a sequence ofk<|G| elements, i.e., by allowing repeated elements inA. In this last sense the result does not hold for other Abelian groups. With a new kind of application of the polynomial method in various finite and infinite fields we extend Alon’s result to the groups (ℤ _p ) ^a and in the casek<p, and verify Snevily’s conjecture for every cyclic group of odd order. Supported by Hungarian research grants OTKA F030822 and T029759. Supported by the Catalan Research Council under grant 1998SGR00119. Partially supported by the Hungarian Research Foundation (OTKA), grant no. T029132.     

Bounding the number of connected components of a real algebraic set

For every polynomial mapf=(f ₁,…,f _k): ℝ ⁿ →ℝ ^k , we consider the number of connected components of its zero set,B(Z _f) and two natural “measures of the complexity off,” that is the triple(n, k, d), d being equal to max(degree off _i), and thek-tuple (Δ₁,...,Δ₄), Δ _k being the Newton polyhedron off _i respectively. Our aim is to boundB(Z _f) by recursive functions of these measures of complexity. In particular, with respect to (n, k, d) we shall improve the well-known Milnor-Thom’s bound μ _d (n)=d(2d−1) ⁿ⁻¹. Considered as a polynomial ind, μ _d (n) has leading coefficient equal to 2 ⁿ⁻¹. We obtain a bound depending onn, d, andk such that ifn is sufficiently larger thank, then it improves μ _d (n) for everyd. In particular, it is asymptotically equal to 1/2(k+1)n ^k−1 dⁿ, ifk is fixed andn tends to infinity. The two bounds are obtained by a similar technique involving a slight modification of Milnor-Thom's argument, Smith's theory, and information about the sum of Betti numbers of complex complete intersections.     

Isoperimetric inequalities on minimal submanifolds of space forms

For a domainU on a certaink-dimensional minimal submanifold ofS ⁿ orH ⁿ, we introduce a “modified volume”M(U) ofU and obtain an optimal isoperimetric inequality forU k ^k ω _k M (D) ^k-1 ≤Vol(∂D) ^k , where ω _k is the volume of the unit ball ofR ^k . Also, we prove that ifD is any domain on a minimal surface inS ₊ ⁿ (orH ⁿ, respectively), thenD satisfies an isoperimetric inequality2π A≤L ²+A² (2π A≤L²−A² respectively). Moreover, we show that ifU is ak-dimensional minimal submanifold ofH ⁿ, then(k−1) Vol(U)≤Vol(∂U). Supported in part by KME and GARC     

Estimates for the closeness of successive convolutions of multidimensional symmetric distributions

Summary Let ξ₁, ξ₂,... be i.i.d random vectors in ℝ ^k with a common distribution ℒ(ξ_i),... = F, i = 1, 2,.... Let S _n = ξ₁+...+ξ _n . We investigate how small is the difference between ℒ(S _n ) and ℒ(S _{n+ m} ) in the case when ξ _i have symmetric distributions.     

Surjective partial differential operators on real analytic functions defined on open convex sets

Let P(D) be a partial differential operator with constant coefficients which is surjective on the space A(Ω) of real analytic functions on a covex open set Ω⊂ℝ ⁿ . Let L(P _m ) denote the localizations at ∞ (in the sense of H?rmander) of the principal part P _m . Then Q(x+iτN)≠ 0 for (x,τ)∈ℝ ⁿ ×(ℝ\{ 0}) for any Q∈L(P _m ) if N is a normal to δΩ which is noncharacteristic for Q. Under additional assumptions this implies that P _m must be locally hyperbolic. Received: 24 January 2000     

Deformation of certain quadratic algebras and the corresponding quantum semigroups

LetV be a finite-dimensional vector space. Given a decompositionV⊗V=⊕ _i=1,…n I _i , definen quadratic algebrasQ(V, J _(m)) whereJ _(m)=⊕ _i≠m I _i . There is also a quantum semigroupM(V; I ₁, …,I _n ) which acts on all these quadratic algebras. The decomposition determines as well a family of associative subalgebras of End (V ^⊗k ), which we denote byA _k =A _k (I ₁,…,I _n ),k≥2. In the classical case, whenV⊗V decomposes into the symmetric and skewsymmetric tensors,A _k coincides with the image of the representation of the group algebra of the symmetric groupS _k in End(V ^⊗k ). LetI _i,h be deformations of the subspacesI _i . In this paper we give a criteria for flatness of the corresponding deformations of the quadratic algebrasQ(V, J _(m),h ) and the quantum semigroupM(V;I _1,h ,…,I _n,h ). It says that the deformations will be flat if the algebrasA _k (I ₁, …,I _n ) are semisimple and under the deformation their dimension does not change. Usually, the decomposition intoI _i is defined by a given semisimple operatorS onV⊗V, for whichI _i are its eigensubspaces, and the deformationsI _i,h are defined by a deformationS _h ofS. We consider the cases whenS _h is a deformation of Hecke or Birman-Wenzl symmetry, and also the case whenS _h is the Yang-Baxter operator which appears by a representation of the Drinfeld-Jimbo quantum group. Applying the flatness criteria we prove that in all these cases we obtain flat deformations of the quadratic algebras and the corresponding quantum semigroups. Partially supported by a grant from the Israel Science Foundation administered by the Israel Academy of Sciences.