Irregular wavelet frames on<Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript>(ℝ<Superscript>n</Superscript>)

In this paper, we present the conditions on dilation parameter {s _j}_j that ensure a discrete irregular wavelet system {s _j ^n/2ψ(s _j ·−bk)} _{j∈ℤ,k∈ℤ} ⁿ to be a frame on L²(ℝⁿ), and for the wavelet frame we consider the perturbations of translation parameter b and frame function ψ respectively.     

Almost linear upper bounds on the length of general davenport—schinzel sequences

Davenport—Schinzel sequences are sequences that do not contain forbidden subsequences of alternating symbols. They arise in the computation of the envelope of a set of functions. We obtain almost linear upper bounds on the length λ_s(n) of Davenport—Schinzel sequences composed ofn symbols in which no alternating subsequence is of length greater thans+1. These bounds are of the formO(nα(n)^O(α(n)5-3)), and they generalize and extend the tight bound Θ(nα(n)) obtained by Hart and Sharir for the special cases=3 (α(n) is the functional inverse of Ackermann’s function), and also improve the upper boundO(n log*n) due to Szemerédi. Work on this paper has been supported in part by a grant from the U.S. — Israeli Binational Science Foundation.     

On generalized energy equality of the Navier-Stokes equations

We show that for every initial dataa εL ²(Ω) there exists a weak solutionu of the Navier-Stokes equations satisfying the generalized energy inequality introduced by Caffarelli-Kohn-Nirenberg forn=3. We also show that if a weak solutionu εL ^s (0,T;L ^q (Ω)) with 2/q + 2/s ≤ 1 and 3/q + 1/s ≤ 1 forn=3, or 2/q + 2/s ≤ 1 andq ≥ 4 forn ≥ 4, thenu satisfies both the generalized and the usual energy equalities. Moreover we show that the generalized energy equality holds only under the local hypothesis thatu εL ^s (ε, T; L ^q (K)) for all compact setsK ⊂ ⊂ Ω and all 0 <ε <T with the same (q, s) as above when 3 ≤n ≤ 10.     

On K s -free subgraphs in K s+k -free graphs and vertex Folkman numbers

Extending the problem of determining Ramsey numbers Erdős and Rogers introduced the following function. For given integers 2 ≤ s < t let f _s,t (n) = min{max{|S|: S ⊆ V (H) and H[S] contains no K _s }}, where the minimum is taken over all K _t -free graphs H of order n. This function attracted a considerable amount of attention but despite that, the gap between the lower and upper bounds is still fairly wide. For example, when t=s+1, the best bounds have been of the form Ω(n ^1/2+o(1)) ≤ f _s,s+1(n) ≤ O(n ^1−ɛ(s)), where ɛ(s) tends to zero as s tends to infinity. In this paper we improve the upper bound by showing that f _s,s+1(n) ≤ O(n ^2/3). Moreover, we show that for every ɛ > 0 and sufficiently large integers 1 ≪ k ≪ s, Ω(n ^1/2−ɛ ) ≤ f _s,s+k (n) ≤ O(n ^1/2+ɛ . In addition, we also discuss some connections between the function f _s,t and vertex Folkman numbers.     

On the concentration of eigenvalues of random symmetric matrices

It is shown that for every 1≤s≤n, the probability that thes-th largest eigenvalue of a random symmetricn-by-n matrix with independent random entries of absolute value at most 1 deviates from its median by more thant is at most 4e ⁻ t ²32 ^s2. The main ingredient in the proof is Talagrand’s Inequality for concentration of measure in product spaces. Research supported in part by a USA — Israel BSF grant, by a grant from the Israel Science Foundation and by the Hermann Minkowski Minerva Center for Geometry at Tel Aviv University. Research supported in part by a USA — Israel BSF grant and by a Bergmann Memorial Grant.     

A braidlike presentation of Sp(n,p)

Forn even andp an odd prime a symplectic group Sp(n, p) is a quotient of the Artin braid groupB _n+1. Ifs ₁, …,s _n are standard generators ofB _n+1 then the kernel of the corresponding epimorphism is the normal closure of just four elements:s ₁ ^p ,(s ₁ s ₂)⁶,s ₁ ^(p+1)/2 s ₂ ⁴ s ₁ ^(p−1)/2 s ₂ ⁻² s ₁ ⁻¹ s ₂ ² and (s ₁ s ₂ s ₃)⁴ A ⁻¹ s ₁ ⁻² A, whereA=s ₂ s ₃ ⁻¹ s ₂ ^(p−1)/2 s ₄ s ₃ ² s ₄, all of them lying in the subgroupB ₅. Sp(n, p) acts on a vector space and the image of the subgroupB _n ofB _n+1 in Sp(n, p), denoted Sp(n−1,p), is a stabilizer of one vector. A sequence of inclusions …B _k+1·B _k … induces a sequence of inclusions …Sp(k,p)·Sp(k−1,p)…, which can be used to study some finite-valued invariants of knots and links in the 3-sphere via the Markov theorem. Partially supported by the Technion VPR-Fund.     

Algebraic relations for reciprocal sums of odd terms in Fibonacci numbers

In this paper, we prove the algebraic independence of the reciprocal sums of odd terms in Fibonacci numbers ∑ _n=1^∞ F _2n−1⁻¹, ∑ _n=1^∞ F _2n−1⁻², ∑ _n=1^∞ F _2n−1⁻³ and write each ∑ _n=1^∞ F _2n−1^−s (s≥4) as an explicit rational function of these three numbers over ℚ. Similar results are obtained for various series including the reciprocal sums of odd terms in Lucas numbers.      

On the growth of an entire dirichlet series

We establish the relation between the increase of the quantityM(σ,F) = ∣a ₀∣ + ∑ _n=1 ^∞ ∣a _n ∣ exp (σλ _n ) and the behavior of sequences (|a _n |) and (λ _n ), where (λ _n ) is a sequence of nonnegative numbers increasing to + ∞, andF(s) =a ₀ + ∑ _n=1 ^∞ a _n e ^sλn ,s=σ+it, is the Dirichlet entire series. Lviv University, Lviv. Translated from Ukrainskii Matematicheskii Zhurmal, Vol. 51, No. 8, pp. 1149–1153, August, 1999.     

Dynamic ordinal analysis

 Dynamic ordinal analysis is ordinal analysis for weak arithmetics like fragments of bounded arithmetic. In this paper we will define dynamic ordinals – they will be sets of number theoretic functions measuring the amount of sΠ ^b ₁(X) order induction available in a theory. We will compare order induction to successor induction over weak theories. We will compute dynamic ordinals of the bounded arithmetic theories sΣ ^b _n (X)−L ^m IND for m=n and m=n+1, n≥0. Different dynamic ordinals lead to separation. In this way we will obtain several separation results between these relativized theories. We will generalize our results to further languages extending the language of bounded arithmetic. Received: 27 April 2001 / Published online: 19 December 2002 The results for sΣ ^b _n (X)−L ^m IND are part of the authors dissertation [3]; the results for sΣ ^b _m (X)−L ^m+1 IND base on results of ARAI [1]. Mathematics Subject Classification (2000): Primary 03F30; Secondary 03F05, 03F50 Key words or phrases: Dynamic ordinal – Bounded arithmetic – Proof-theoretic ordinal – Order induction – Semi-formal system – Cut-elimination     

How many s-subspaces must miss a point set in PG(d, q)

The following result is well-known for finite projective spaces. The smallest cardinality of a set of points of PG(n, q) with the property that every s-subspace has a point in the set is (q ^n+1-s - 1)/(q - 1). We solve in finite projective spaces PG(n, q) the following problem. Given integers s and b with 0 ≤ s ≤ n - 1 and 1 ≤ b ≤ (q ^n+1-s - 1)/(q - 1), what is the smallest number of s-subspaces that must miss a set of b points. If d is the smallest integer such that b ≤ (q ^d+1 - 1)/(q - 1), then we shall see that the smallest number is obtained only when the b points generate a subspace of dimension d. We then also determine the smallest number of s-subspaces that must miss a set of b points of PG(n, q) which do not lie together in a subspace of dimension d. The results are obtained by geometrical and combinatorial arguments that rely on a strong algebraic result for projective planes by T. Szőnyi and Z. Weiner.     

Large Distinct Part Sizes in a Random Integer Partition

Let Y _s,n denote the number of part sizes ≧ s in a random and uniform partition of the positive integer n that are counted without multiplicity. For s = λ(6n)^1/2/π + o(n ^1/4), 0 ≦ λ < ∞, as n → ∞, we establish the weak convergence of Y _s,n to a Gaussian distribution in the form of a central limit theorem. The mean and the standard deviation are also asymptotically determined. This revised version was published online in June 2006 with corrections to the Cover Date.     

Extensions of Meyers-Ziemer results

Letp∈(1, +∞) ands ∈ (0, +∞) be two real numbers, and letH _p ^s (ℝ ⁿ ) denote the Sobolev space defined with Bessel potentials. We give a classA of operators, such thatB _s,p -almost all points ℝ ⁿ are Lebesgue points ofT(f), for allf ∈H _p ^s (ℝ ⁿ ) and allT ∈A (B _s,p denotes the Bessel capacity); this extends the result of Bagby and Ziemer (cf. [2], [15]) and Bojarski-Hajlasz [4], valid wheneverT is the identity operator. Furthermore, we describe an interesting special subclassC ofA (C contains the Hardy-Littlewood maximal operator, Littlewood-Paley square functions and the absolute value operatorT: f→|f|) such that, for everyf ∈H _p ^s (ℝ ⁿ ) and everyT ∈C, T(f) is quasiuniformly continuous in ℝ ⁿ ; this yields an improvement of the Meyers result [10] which asserts that everyf ∈H _p ^s (ℝ ⁿ ) is quasicontinuous. However,T (f) does not belong, in general, toH _p ^s (ℝ ⁿ ) wheneverT ∈C ands≥1+1/p (cf. Bourdaud-Kateb [5] or Korry [7]).     

Dielectronic recombination rate coefficients of Cu-like Ta ion

The knowledge of accurate ionization and recombination rates of heavy ions is crucial for the study of X-ray lasers and inertia confine fusion (ICF). The dielectronic recombination rates of Cu-like Ta⁴⁴⁺ (1s²2s²2p⁶3s²3p⁶3d¹⁰4s¹) ion through the (3d¹⁰41n’ 1’,n’ = 4, 5) configurations are given. The remarkable difference between the isoelectronic trends of the rate coefficients for dielectronic recombination through 3d¹⁰4141’ and 3d¹⁰4151’ is emphasized.     

The monotone circuit complexity of boolean functions

Recently, Razborov obtained superpolynomial lower bounds for monotone circuits that cliques in graphs. In particular, Razborov showed that detecting cliques of sizes in a graphm vertices requires monotone circuits of size Ω(m ^s /(logm)^2s ) for fixeds, and sizem ^Ω(logm) form/4]. In this paper we modify the arguments of Razborov to obtain exponential lower bounds for circuits. In particular, detecting cliques of size (1/4) (m/logm)^2/3 requires monotone circuits exp (Ω((m/logm)^1/3)). For fixeds, any monotone circuit that detects cliques of sizes requiresm) ^s ) AND gates. We show that even a very rough approximation of the maximum clique of a graph requires superpolynomial size monotone circuits, and give lower bounds for some Boolean functions. Our best lower bound for an NP function ofn variables is exp (Ω(n ^1/4 · (logn)^1/2)), improving a recent result of exp (Ω(n ^1/8-ε)) due to Andreev. First author supported in part by Allon Fellowship, by Bat Sheva de-Rotschild Foundation by the Fund for basic research administered by the Israel Academy of Sciences. Second author supported in part by a National Science Foundation Graduate Fellowship.     

The Dichotomy Between Traces on d-sets F in R^n and the Density of D（R^n／Г） in Function Spaces

A space Apq^s （R^n） with A ： B or A = F and s ∈R, 0 〈 p, q 〈 ∞ either has a trace in Lp（Г）, where Г is a compact d-set in R^n with 0 〈 d 〈 n, or D（R^n／Г） is dense in it. Related dichotomy numbers are introduced and calculated.     

A Boundedness Criterion via Atoms for Linear Operators in Hardy Spaces

Let p∈(0,1] and s≥[n(1/p−1)], where [n(1/p−1)] denotes the maximal integer no more than n(1/p−1). In this paper, the authors prove that a linear operator T extends to a bounded linear operator from the Hardy space H ^p (ℝ ⁿ ) to some quasi-Banach space ℬ if and only if T maps all (p,2,s)-atoms into uniformly bounded elements of ℬ.      

Analytic Continuation of Dirichlet Series with Almost Periodic Coefficients

We consider Dirichlet series z_g,a(s)=?_n=1^￥ g(na) e^{-l_n s}{\zeta_{g,\alpha}(s)=\sum_{n=1}^\infty g(n\alpha) e^{-\lambda_n s}} for fixed irrational α and periodic functions g. We demonstrate that for Diophantine α and smooth g, the line Re(s) = 0 is a natural boundary in the Taylor series case λ _n  = n, so that the unit circle is the maximal domain of holomorphy for the almost periodic Taylor series ?_n=1^￥ g(na) zⁿ{\sum_{n=1}^{\infty} g(n\alpha) z^n}. We prove that a Dirichlet series z_g,a(s) = ?_n=1^￥ g(n a)/n^s{\zeta_{g,\alpha}(s) = \sum_{n=1}^{\infty} g(n \alpha)/n^s} has an abscissa of convergence σ ₀ = 0 if g is odd and real analytic and α is Diophantine. We show that if g is odd and has bounded variation and α is of bounded Diophantine type r, the abscissa of convergence σ ₀ satisfies σ ₀ ≤ 1 − 1/r. Using a polylogarithm expansion, we prove that if g is odd and real analytic and α is Diophantine, then the Dirichlet series ζ _g,α (s) has an analytic continuation to the entire complex plane.     

Semi-parametric Estimation of the Hölder Exponent of a Stationary Gaussian Process with Minimax Rates

Let (X(t))_t∈[0,1] be a centered Gaussian process with stationary increments such that IE[(X_{u+t-X_u)²] = C|t|^s+r(t). Assume that there exists an extra parameter β > 0 and a polynomial P of degree smaller than s + β such that |r(t)-P(t)| is bounded with respect to |t|^s+β. We consider the problem of estimating the parameter s ∈ (0,2) in the asymptotic framework given by n equispaced observations in [0, 1]. Adding possibly stronger regularity conditions to r, we define classes of such processes over which we show that s cannot be estimated at a better rate than n^{min(1/2, β)}. Then, we study increment (or, more generally, discrete variation) estimators. We obtained precise bounds of the bias of the variance which show that the bias mainly depend on the parameter β and the variance on two terms, one depending on the parameter s and one on some regularity properties of r. A central limit theorem is given when the variance term relying on s dominates the bias and the other variance term. Eventually, we exhibit an estimator which achieves the minimax rate over a wide range of classes for which sufficient regularity conditions are assumed on r. This revised version was published online in August 2006 with corrections to the Cover Date.     

Solvability of elliptic functional-differential equations with compressions of the arguments in weighted spaces

In the paper, the equation