On point to point reflection of harmonic functions across real-analytic hypersurfaces in ℝ n

Let Γ be a non-singular real-analytic hypersurface in some domainU ⊂ ℝ ⁿ and let Har₀(U, Γ) denote the linear space of harmonic functions inU that vanish on Γ. We seek a condition onx ⁰,x ¹ ∈U/Γ such that the reflection law (RL)u(x ⁰)+Ku(x ¹)=0, ∀u∈Har₀(U, Γ) holds for some constantK. This is equivalent to the class Har₀ (U, Γ) not separating the pointsx ⁰,x ¹. We find that in odd-dimensional spaces (RL)never holds unless Γ is a sphere or a hyperplane, in which case there is a well known reflection generalizing the celebrated Schwarz reflection principle in two variables. In even-dimensional spaces the situation is different. We find a necessary and sufficient condition (denoted the SSR—strong Study reflection—condition), which we described both analytically and geometrically, for (RL) to hold. This extends and complements previous work by e.g. P.R. Garabedian, H. Lewy, D. Khavinson and H. S. Shapiro.     

A fast matrix–vector multiplication method for solving the radiosity equation

A “fast matrix–vector multiplication method” is proposed for iteratively solving discretizations of the radiosity equation (I — К)u = E. The method is illustrated by applying it to a discretization based on the centroid collocation method. A convergence analysis is given for this discretization, yielding a discretized linear system (I — K _n )u _n = E _n. The main contribution of the paper is the presentation of a fast method for evaluating multiplications K_n v, avoiding the need to evaluate K_n explicitly and using fewer than O(n ²) operations. A detailed numerical example concludes the paper, and it illustrates that there is a large speedup when compared to a direct approach to discretization and solution of the radiosity equation. The paper is restricted to the surface S being unoccluded, a restriction to be removed in a later paper. This revised version was published online in June 2006 with corrections to the Cover Date.     

A Property About Minimum Edge- and Minimum Clique-Cover of a Graph

 Let G be a graph with n vertices, and denote as γ(G) (as θ(G)) the cardinality of a minimum edge cover (of a minimum clique cover) of G. Let E (let C) be the edge-vertex (the clique-vertex) incidence matrix of G; write then P(E)={x∈ℜ ⁿ :Ex≤1,x≥0}, P(C)={x∈ℜ ⁿ :Cx≤1,x≥0}, α _E (G)=max{1 ^T x subject to x∈P(E)}, and α _C (G)= max{1 ^T x subject to x∈P(C)}. In this paper we prove that if α _E (G)=α _C (G), then γ(G)=θ(G). Received: May 20, 1998?Final version received: April 12, 1999     

Positive values of non-homogeneous indefinite quadratic forms of type (1, 4)

Let Г_r,n—r denote the infimum of all number Г > 0 such that for any real indefinite quadratic form inn variables of type (r, n—r), determinantD ≠ 0 and real numbers c₁; c₂,…, c_n, there exist integersx ₁,x₂,…,x_n satisfying 0 < Q(x₁+c₁,x₂ + c₂,…,x_n + c_n) ≤(Г|Z > |)^1/n. All the values of Г_r,n—r are known except for г_1,4. Earlier it was shown that 8 ≤Г_1,4 ≤16. Here we improve the upper bound to get Г_1,4 < 12.     

An Extremal Problem on Degree Sequences of Graphs

 Let G=(I _n ,E) be the graph of the n-dimensional cube. Namely, I _n ={0,1} ⁿ and [x,y]∈E whenever ||x−y||₁=1. For A⊆I _n and x∈A define h _A (x) =#{y∈I _n A|[x,y]∈E}, i.e., the number of vertices adjacent to x outside of A. Talagrand, following Margulis, proves that for every set A⊆I _n of size 2 ⁿ⁻¹ we have for a universal constant K independent of n. We prove a related lower bound for graphs: Let G=(V,E) be a graph with . Then , where d(x) is the degree of x. Equality occurs for the clique on k vertices. Received: January 7, 2000 RID="*" ID="*" Supported in part by BSF and by the Israeli academy of sciences     

New series of odd non-congruent numbers

We determine all square-free odd positive integers n such that the 2-Selmer groups S _n and Ŝ _n of the elliptic curve E _n : y ² = x(x − n)(x − 2n) and its dual curve ê _n : y ² = x ³ + 6nx ² + n ² x have the smallest size: S _n = {1}, Ŝ _n = {1, 2, n, 2n}. It is well known that for such integer n, the rank of group E _n (ℚ) of the rational points on E _n is zero so that n is a non-congruent number. In this way we obtain many new series of elliptic curves E _n with rank zero and such series of integers n are non-congruent numbers. Dedicated to Professor Sheng GONG on the occasion of his 75th birthday     

Symmetric block bases of sequences with large average growth

We show that if 0<ε≦1, 1≦p<2 andx ₁, …,x _n is a sequence of unit vectors in a normed spaceX such thatE ‖∑ _l ⁿ ε_i x _l‖≧n ^1/p, then one can find a block basisy ₁, …,y _m ofx ₁, …,x _n which is (1+ε)-symmetric and has cardinality at leastγn ^2/p-1(logn)⁻¹, where γ depends on ε only. Two examples are given which show that this bound is close to being best possible. The first is a sequencex ₁, …,x _n satisfying the above conditions with no 2-symmetric block basis of cardinality exceeding 2n ^2/p-1. This sequence is not linearly independent. The second example is a sequence which satisfies a lowerp-estimate but which has no 2-symmetric block basis of cardinality exceedingCn ^2/p-1(logn)^4/3, whereC is an absolute constant. This applies when 1≦p≦3/2. Finally, we obtain improvements of the lower bound when the spaceX containing the sequence satisfies certain type-condition. These results extend results of Amir and Milman in [1] and [2]. We include an appendix giving a simple counterexample to a question about norm-attaining operators.     

Estimates for the rate of strong approximation in the multidimensional invariance principle

The aim of this paper is to derive simplest consequences of the author's result of the multidimensional invariance principle. We obtain bounds for the rate of strong Gaussian approximation of sums of independent R ^d-valued random variables ξ_j having finite moments of the form EH (‖ξ_j‖), where H (x) is a monotone function growing not slower than x² and not faster than e^cx. A multidimensional version of results of Sakhanenko is obtained. Bibliography: 19 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 339, 2006, pp. 37–53.     

Estimates for the rate of strong Gaussian approximation for sums of i.i.d. multidimensional random vectors

The aim of this paper is to derive new optimal bounds for the rate of strong Gaussian approximation of sums of i.i.d. R ^d-valued random variables ξ_j that have finite moments of the form EH (‖ξ_j‖), where H (x) is a monotone function growing not slower than x² and not faster than e^cx. We obtain some generalization and improvements of results of U. Einmahl (1989). Bibliography: 28 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 351, 2007, pp. 141–158.     

Stopping rules forx n/n and related problems

The following results illustrate the problems with which this note deals. Letx _n (n=1, 2, ...) be non-negative, independent, identically distributed random variables, letβ>1 andEx ₁ ^β <∞. Then there exists a stopping ruleτ withP{τ<∞}=1, which maximizesE x _t/t among all stopping rulest. Moreover, the same rule maximizesE max (x ₁, ...,x _t)/t andE max (x ₁,..,x _τ)/τ=Ex _τ/τ Research supported in part by Grant GP-5705 of the National Science Foundation, USA.     

On the error terms for representation numbers of quadratic forms

Let f be a primitive positive integral binary quadratic form of discriminant −D, and r _f (n) the number of representations of n by f up to automorphisms of f. We first improve the error term E(x) of $ \sum\limits_{n \leqq x} {r_f (n)^\beta } $ \sum\limits_{n \leqq x} {r_f (n)^\beta } for any positive integer β. Next, we give an estimate of ∫₁ ^T |E(x)|² x ^−3/2 dx when β = 1.     

Bergman kernel asymptotics for generalized Fock spaces

Letm(t)dt be a positive measure onR ⁺. We investigate the relations among the growth ofm, the growth of its moment sequence {y_n}, the growth of its Bergman kernel functionk x=Σγ{_n/^-1}x ⁿ, and the growth of the kernel function associated to the measureK(t) ⁻¹m(t) dt. For a large class of measures, we find that these quantities satisfy asymptotic relations similar to the simple exact relations which hold in the model casem(t)=e ⁻¹. Supported in part by a grant from the National Science Foundation.     

Positive linear operators generated by analytic functions

Let φ be a power series with positive Taylor coefficients {a _k } _k=0^∞ and non-zero radius of convergence r ≤ ∞. Let ξ _x , 0 ≤ x < r be a random variable whose values α _k , k = 0, 1, …, are independent of x and taken with probabilities a _k x ^k /φ(x), k = 0, 1, …. The positive linear operator (A _φ f)(x):= E[f(ξ _x )] is studied. It is proved that if E(ξ _x ) = x, E(ξ _x ²) = qx ² + bx + c, q, b, c ∈ R, q > 0, then A _φ reduces to the Szász-Mirakyan operator in the case q = 1, to the limit q-Bernstein operator in the case 0 < q < 1, and to a modification of the Lupaş operator in the case q > 1.     

The existence of non-degenerate functions on a compact differentiablem-manifoldM

Summary Let M be a compact differentiable m-manifold of class C^m in E_n, n=2m+1. Let x=(x₁, ..., x_n) represent a point in E_n. The union of the direction c on the direction sphere S_n−1 in E_n such that the scalar product c · x defines a non-degenerate fonction on M is an open subset of S_n−1 whose complement θ has a Lebesgue measure zero on S_n−1. When M is non-compact θ can be everywhere dense on S_n−1, but still has Lebesgue measure zero. To Giovanni Sansone on his 70^th birth day.     

On the weak non-defectivity of veronese embeddings of projective spaces

Fix integers n, x, k such that n≥3, k>0, x≥4, (n, x)≠(3, 4) and k(n+1)<( _n ^n+x ). Here we prove that the order x Veronese embedding ofP ⁿ is not weakly (k−1)-defective, i.e. for a general S⊃P ⁿ such that #(S) = k+1 the projective space | I _2S (x)| of all degree t hypersurfaces ofP ⁿ singular at each point of S has dimension ( _n ^/n+x )−1− k(n+1) (proved by Alexander and Hirschowitz) and a general F∈| I _2S (x)| has an ordinary double point at each P∈ S and Sing (F)=S. The author was partially supported by MIUR and GNSAGA of INdAM (Italy).     

On some characterization of probability distributions in Hilbert spaces

Summary The aim of this paper is to prove the following theorem about characterization of probability distributions in Hilbert spaces:Theorem. — Let x₁, x₂, …, x_n be n (n≥3) independent random variables in the Hilbert spaceH, having their characteristic functionals f_k(t) = E[e^i(t,x _k)], (k=1, 2, …, n): let y₁=x₁ + x_n, y₂=x₂ + x_n, …, y_n−1=x_n−1 + x_n. If the characteristic functional f(t₁, t₂, …, t_n−1) of the random variables (y₁, y₂, …, y_n−1) does not vanish, then the joint distribution of (y₁, y₂, …, y_n−1) determines all the distributions of x₁, x₂, …, x_n up to change of location.     

Entropy bounds for perfect matchings and Hamiltonian cycles

For a graph G = (V,E) and x: E → ℜ⁺ satisfying Σ _e∋υ x _e = 1 for each υ ∈ V, set h(x) = Σ _e x _e log(1/x _e ) (with log = log₂). We show that for any n-vertex G, random (not necessarily uniform) perfect matching f satisfying a mild technical condition, and x _e =Pr(e∈f),

On the bounded version of Hilbert's tenth problem

 The paper establishes lower bounds on the provability of 𝒟=NP and the MRDP theorem in weak fragments of arithmetic. The theory I ⁵ E ₁ is shown to be unable to prove 𝒟=NP. This non-provability result is used to show that I ⁵ E ₁ cannot prove the MRDP theorem. On the other hand it is shown that I ¹ E ₁ proves 𝒟 contains all predicates of the form (∀i≤|b|)P(i,x)^Q(i,x) where ^ is =, <, or ≤, and I ⁰ E ₁ proves 𝒟 contains all predicates of the form (∀i≤b)P(i,x)=Q(i,x). Here P and Q are polynomials. A conjecture is made that 𝒟 contains NLOGTIME. However, it is shown that this conjecture would not be sufficient to imply 𝒟=N P. Weak reductions to equality are then considered as a way of showing 𝒟=NP. It is shown that the bit-wise less than predicate, ≤₂, and equality are both co-NLOGTIME complete under FDLOGTIME reductions. This is used to show that if the FDLOGTIME functions are definable in 𝒟 then 𝒟=N P. Received: 13 July 2001 / Revised version: 9 April 2002 / Published online: 19 December 2002 Key words or phrases: Bounded Arithmetic – Bounded Diophantine Complexity     

On calculation of moments of ladder heights

Let X,X ₁,X ₂, … be independent identically distributed random variables, F(x) = P{X < x}, S ₀ = 0, and S _n =Σ _i=1 ⁿ X _i . We consider the random variables, ladder heights Z ₊ and Z ₋ that are respectively the first positive sum and the first negative sum in the random walk {S _n }, n = 0, 1, 2, …. We calculate the first three (four in the case EX = 0) moments of random variables Z ₊ and Z ₋ in the qualitatively different cases EX > 0, EX < 0, and EX = 0. __________ Translated from Lietuvos Matematikos Rinkinys, Vol. 46, No. 2, pp. 159–179, April–June, 2006.