Multipliers of the Hölder classes

Following the lines of [13] we introduce the classes of mixed smoothness $\text{L}$α_p(Rⁿ), $\text{L}$α_p(Zⁿ) for a multi-index α = (α₁,…, α_n). Such classes are naturally tied up with the study of semi-elliptic differential and difference equations.Besides a brief presentation of such classes, we concentrate our research on the study of mixed homogeneous multipliers with homogeneity β = (β₁, …, β_n) and their preservation of mixed homogeneous Hölder classes $\text{L}$_α^∞, for a different multi-index α.In the last paragraph we apply the results to produce various improvements of the classical Schauder's estimates, for differential and difference equations, in the parabolic and elliptic case.     

Strong Sperner property of the subgroup lattice of an Abelianp-group

Letn andk be arbitrary positive integers,p a prime number and L_(k ⁿ)(p) the subgroup lattice of the Abelianp-group (Z/p ^k ) ⁿ . Then there is a positive integerN(n,k) such that whenp N(n,k),L _(k ^N )(p) has the strong Sperner property.     

Hermite series estimates of a probability density and its derivatives

The following estimate of the pth derivative of a probability density function is examined: $\text{Σ}{}_{\mathrm{k\; =\; 0}}{}^{\mathrm{N}}\text{a}\text{?}{}_{\mathrm{k}}\text{h}{}_{\mathrm{k}}\text{(x)}$, where h_k is the kth Hermite function and $\text{a}\text{?}{}_{\mathrm{k}}\text{= (}\text{(?1)}{}^{\mathrm{p}}\text{n}\text{)}$Σ_{i = 1}ⁿh_k^(p)(X_i) is calculated from a sequence X₁,…, X_n of independent random variables having the common unknown density. If the density has r derivatives the integrated square error converges to zero in the mean and almost completely as rapidly as O(n^?α) and O(n^?α log n), respectively, where $\text{α =}\text{2(r ? p)}\text{(2r + 1)}$. Rates for the uniform convergence both in the mean square and almost complete are also given. For any finite interval they are O(n^?β) and $\text{O(n}{}^{\mathrm{<mtext>?\beta </mtext><mtext>2</mtext>}}\text{log}\text{n)}$, respectively, where $\text{β =}\text{(2(r ? p) ? 1)}\text{(2r + 1)}$.     

ABSTRACT CAPACITY OF REGIONS AND COMPACT EMBEDDING WITH APPLICATIONS

The weighted Sobolev-Lions type spaces W pl,γ(Ω; E0, E) = W pl,γ(Ω; E) ∩ Lp,γ (Ω; E0) are studied, where E0, E are two Banach spaces and E0 is continuously and densely embedded on E. A new concept of capacity of region Ω∈ Rn in W pl,γ(; E0, E) is introduced. Several conditions in terms of capacity of region Ω and interpolations of E0 and E are found such that ensure the continuity and compactness of embedding operators. In particular, the most regular class of interpolation spaces Eα between E0 and E, depending of α and l, are found such that mixed differential operators Dα are bounded and compact from W pl,γ(Ω; E0, E) to Eα-valued Lp,γ spaces. In applications, the maximal regularity for differential-operator equations with parameters are studied.     

Third order efficiency of conditional tests for exponential families

Let P_η, η = (θ, γ) ∈ Θ × Γ ? $\text{R}$ × $\text{R}$^k, be a (k + 1)-dimensional exponential family. Let $\text{?}{}_{\mathrm{n}}{}^1$, n ∈ $\text{N}$, be an optimal similar test for the hypothesis {P_(θ,γ)ⁿ: γ ∈ Γ} (θ ∈ Θ fixed) against alternatives P_(θ1,γ1)ⁿ, θ₁ > θ, γ₁ ∈ Γ. It is shown that (?_n¹)_{n∈$\text{N}$} is third order efficient in the class of all test-sequences that are asymptotically similar of level α + o(n^?1) (locally uniformly in the nuisance parameter γ).     

Divisibility properties of generalized Laguerre polynomials

In this paper we give effective upper bounds for the degree k of divisors (over ?) of generalized Laguerre polynomials L^α_n(x), i.e. of for α = −tn − s − 1 and α = tn + s with t,s ∈ ?, t = O(log k), s = O(k log k) and k sufficiently large.     

Arithmetical progressions formed byk different Lehmer pseudoprimes

LetU _n=(αⁿ-β²)/(α-β) forn odd andU _n=(αⁿ-βⁿ)/(α²-β²) for evenn, where α and β are distinct roots of the trinomialf(z)=z ²-√Lz+Q andL>0 andQ are rational integers.U _n is then-th Lehmer number connected withf(z). A compositen is a Lehmer pseudoprime for the bases α and β ifU _n??(n)≡0 (modn), where?(n)=(LD/n) is the Jacobi symbol. IfD=L?4Q>0, U _n denotesn-th Lehmer number,p>3 and 2p?1 are primes,p(2p-1)+(α²-β²)², (α^2p-1±β^2p-1)/(α±β) are composite then the numbers (α^2p-1+β^2p-1)/(α+β), (α^2p-β^2p)/(α²-β²), (α^2p-1-β^2p-1)/(α-β) are lehmer pseudoprimes for the bases α and β and form an arithmetical progression. IfD>0 then from hypothesisH of A. Schinzel on polynomials it follows that for every positive integerk there exists infinitely many arithmetic progressions formed fromk different Lehmer pseudoprimes for the bases α and β.     

The weighted Hardy spaces associated to self-adjoint operators and their duality on product spaces

Let L be a non-negative self-adjoint operator acting on L²(R ⁿ ) satisfying a pointwise Gaussian estimate for its heat kernel. Let w be an A _r weight on R ⁿ × R ⁿ , 1 < r < ∞. In this article we obtain a weighted atomic decomposition for the weighted Hardy space H _L,w ^p (R ⁿ ×R ⁿ ), 0 < p ≤ 1 associated to L. Based on the atomic decomposition, we show the dual relationship between H _L,w ¹ (R ⁿ × R ⁿ ) and BMO_L,w(R ⁿ × R ⁿ ).     

A problem of Zarankiewicz

Zarankiewicz, in problem P 101, Colloq. Math., 2 (1951), p. 301, and others have posed the following problem: Determine the least positive integer k_α,β(m, n) so that if a 0,1-matrix of size m by n contains k_α,β(m, n) ones then it must have an α by β submatrix consisting entirely of ones. This paper improves upon previously known upper bounds for k_α,β(m, n) by proving that $\text{k}{}_{\mathrm{\alpha \beta }}\text{(m,n)?}\text{1+((β?1)}\text{(}\text{p}\text{α?1}\text{))(}\text{m}\text{α}\text{)}\text{+}\text{((p+1)(α?1)}\text{α}\text{)n}$ for each integer p greater than or equal to α ? 1. Each of these inequalities is better than the others for a specific range of values of n. Equality is shown to hold infinitely often for each value of p. Finally some applications of this result are made to arrangements of lines in the projective plane.     

On rectangular visibility

Given a set of n points in the plane, two points are said to be rectangularly visible if the orthogonal rectangle with the two points as opposite vertices has no other point of the set in its interior. In this paper it is shown that all pairs of rectangularly visible points in a set of size n can be determined in O(n log n + k) time, where k is the number of reported pairs, using O(n) space. Also, we consider the query problem: Given a set V of points and an arbitrary point p, determine those points in V that are rectangularly visible from p. A dynamic data structure is described that uses O(n log n) space, has a query time of O(k + log²n) and an update time of O(log³ n). Additionally, we extend the results to the 3-dimensional case.     

Matricial logarithmic derivatives

If θ is a norm on Cⁿ, then the mapping $\text{A→}\text{lim}{}_{\mathrm{h\downarrow 0}}\text{6I+hA6}{}_{\mathrm{\theta }}\text{?1}\text{/h}$ from M_n(C) (=C^{n × n}) into R is called the logarithmic derivative induced by the vector norm θ. In this paper we generalize this concept to a mapping γ from M_n(C) into M_k(R), where k ? n. Denoting by α(B) the spectral abscissa of a square matrix B (the largest of the real parts of the eigenvalues), we show, in particular, that α(A) ?α(γ(A)). As a byproduct we obtain simple sufficient conditions for the stability of a matrix.     

Oscillatory hyper Hilbert transforms along general curves

We consider the oscillatory hyper Hilbert transform H _γ,α,β f(x) = ∫ ₀ ^∞ f(x - Γ(t))e^it-β t^-(1+α)dt; where Γ(t) = (t, γ(t)) in ?² is a general curve. When γ is convex, we give a simple condition on γ such that H _γ,α,β is bounded on L ² when β > 3α, β > 0: As a corollary, under this condition, we obtain the L ^p -boundedness of H _γ,α,β when 2β/(2β - 3α) < p < 2β/(3α). When Γ is a general nonconvex curve, we give some more complicated conditions on γ such that H _γ,α,β is bounded on L ²: As an application, we construct a class of strictly convex curves along which H _γ,α,β is bounded on L ² only if β > 2α > 0.     

Properties of Modules and Rings Relative to Some Matrices

Let R be a ring and  _β×α(R) (?   _β×α(R)) the set of all β × α full (row finite) matrices over R where α and β ≥ 1 are two cardinal numbers. A left R-module M is said to be “injective relative” to a matrix A ? ?   _β×α(R) if every R-homomorphism from R ^(β) A to M extends to one from R ^(α) to M. It is proved that M is injective relative to A if and only if it is A-pure in every module which contains M as a submodule. A right R-module N is called flat relative to a matrix A ?  _β×α(R) if the canonical map μ: N? R ^(β) A → N ^α is a monomorphism. This extends the notion of (m, n)-flat modules so that n-projectivity, finitely projectivity, and τ-flatness can be redefined in terms of flatness relative to certain matrices. R is called left coherent relative to a matrix A ?  _β×α(R) if R ^(β) A is a left R-ML module. Some results on τ-coherent rings and (m, n)-coherent rings are extended.     

The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α,β)-Pair Decomposition

We consider a geometric optimization problem that arises in network design. Given a set P of n points in the plane, source and destination points s, t∈P, and an integer k>0, one has to locate k Steiner points, such that the length of the longest edge of a bottleneck path between s and t is minimized. In this paper, we present an O(nlog² n)-time algorithm that computes an optimal solution, for any constant k. This problem was previously studied by Hou et al. (in Wireless Networks 16, 1033–1043, 2010), who gave an O(n ²logn)-time algorithm. We also study the dual version of the problem, where a value λ>0 is given (instead of k), and the goal is to locate as few Steiner points as possible, so that the length of the longest edge of a bottleneck path between s and t is at most λ. Our algorithms are based on two new geometric structures that we develop—an (α,β)-pair decomposition of P and a floor (1+ε)-spanner of P. For real numbers β>α>0, an (α,β)-pair decomposition of P is a collection $\mathcal{W}=\{(A_{1},B_{1}),\ldots,(A_{m},B_{m})\}$ of pairs of subsets of P, satisfying the following: (i) For each pair $(A_{i},B_{i}) \in\mathcal {W}$ , both minimum enclosing circles of A _i and B _i have a radius at most α, and (ii) for any p, q∈P, such that |pq|≤β, there exists a single pair $(A_{i},B_{i}) \in\mathcal{W}$ , such that p∈A _i and q∈B _i , or vice versa. We construct (a compact representation of) an (α,β)-pair decomposition of P in time O((β/α)³ nlogn). In some applications, a simpler (though weaker) grid-based version of an (α,β)-pair decomposition of P is sufficient. We call this version a weak (α,β)-pair decomposition of P. For ε>0, a floor (1+ε)-spanner of P is a (1+ε)-spanner of the complete graph over P with weight function w(p,q)=?|pq|?. We construct such a spanner with O(n/ε ²) edges in time O((1/ε ²)nlog² n), even though w is not a metric. Finally, we present two additional applications of an (α,β)-pair decomposition of P. In the first, we construct a strong spanner of the unit disk graph of P, with the additional property that the spanning paths also approximate the number of substantial hops, i.e., hops of length greater than a given threshold. In the second application, we present an O((1/ε ²)nlogn)-time algorithm for computing a one-sided approximation for distance selection (i.e., given k, $1 \le k \le{n \choose2}$ , find the k’th smallest Euclidean distance induced by P), significantly improving the running time of the algorithm of Bespamyatnikh and Segal.     

LDU decomposition of an extension matrix of the Pascal matrix

Let Ω_m,n(α,β,γ) denote a set of all elements of weighted lattice paths with weight (α,β,γ) in the xy-plane from (0,0) to (m,n) such that a vertical step V=(0,1), a horizontal step H=(1,0), and a diagonal step D=(1,1) are endowed with weights α,β, and γ respectively and let ω(Ω_m,n(α,β,γ)) denote the weight of Ω_m,n(α,β,γ) defined by

     

On the equivalence of the Euler-Pommier operators in spaces of analytic functions

In the space A (θ) of all one-valued functions f(z) analytic in an arbitrary region G ? ? (0 ∈ G) with the topology of compact convergence, we establish necessary and sufficient conditions for the equivalence of the operators L ₁=α _n z ⁿ Δ ⁿ + ... + α₁ zΔ+α₀ E and L ₂= z ⁿ a _n (z)Δ ⁿ + ... + za ₁(z)Δ+a ₀(z)E, where δ: (Δ?)(z)=(f(z)-?(0))/z is the Pommier operator in A(G), n ∈ ?, α _n ∈ ?, a _k (z) ∈ A(G), 0≤k≤n, and the following condition is satisfied: Σ _j=s ^n?1 α _j+1 ∈ 0, s=0,1,...,n?1. We also prove that the operators z ^s+1Δ+β(z)E, β(z) ∈ A _R , s ∈ ?, and z ^s+1 are equivalent in the spaces A _R, 0?R?-∞, if and only if β(z) = 0.     

Strong Sperner property of the subgroup lattice of an Abelianp-group

Letn andk be arbitrary positive integers,p a prime number and L_(k ⁿ)(p) the subgroup lattice of the Abelianp-group (Z/p ^k ) ⁿ . Then there is a positive integerN(n,k) such that whenp N(n,k),L _(k ^N )(p) has the strong Sperner property.     

Monotonicity of permanents of certain doubly stochastic circulant matrices

Let p_k(A), k=2,…,n, denote the sum of the permanents of all k×k submatrices of the n×n matrix A. A conjecture of Ðokovi?, which is stronger than the famed van der Waerden permanent conjecture, asserts that the functions p_k((1?θ)J_n+;θA), k=2,…, n, are strictly increasing in the interval 0?θ?1 for every doubly stochastic matrix A. Here J_n is the n×n matrix all whose entries are equal $\text{1}\text{n}$. In the present paper it is proved that the conjecture holds true for the circulant matrices A=αI_n+ βP_n, α, β?0, α+;β=1, and $\text{A=}\text{(nJ}{}_{\mathrm{n}}\text{?I}{}_{\mathrm{n}}\text{?P}{}_{\mathrm{n}}\text{)}\text{(n?2)}$, where I_n and P_n are respectively the n×n identify matrix and the n×n permutation matrix with 1's in positions (1,2), (2,3),…, (n?1, n), (n, 1).     

Endpoint estimates for the commutator of pseudo-differential operators

It is well known that the commutator Tb of the Calderón-Zygmund singular integral operator is bounded on L^p(Rⁿ) for 1 < p < +∞ if and only if b ∈ BMO [1]. On the other hand, the commutator T_b is bounded from H¹(Rⁿ) into L¹(Rⁿ) only if the function b is a constant [2]. In this article, we will discuss the boundedness of commutator of certain pseudo-differential operators on Hardy spaces H¹. Let T^σ be the operators that its symbol is S⁰_1,δ with 0 ≤ δ < 1, if b ∈ LMO_∞, then, the commutator [b, T^σ] is bounded from H¹(Rⁿ) into L¹(Rⁿ) and from L¹(Rⁿ) into BMO(Rⁿ); If [b, T^σ] is bounded from H¹(Rⁿ) into L¹(Rⁿ) or L¹(Rⁿ) into BMO(Rⁿ), then, b ∈ LMO_loc.     

A sharper threshold for bootstrap percolation in two dimensions

Two-dimensional bootstrap percolation is a cellular automaton in which sites become ‘infected’ by contact with two or more already infected nearest neighbours. We consider these dynamics, which can be interpreted as a monotone version of the Ising model, on an n × n square, with sites initially infected independently with probability p. The critical probability p _c is the smallest p for which the probability that the entire square is eventually infected exceeds 1/2. Holroyd determined the sharp first-order approximation: p _c ~ π ²/(18?log?n) as n → ∞. Here we sharpen this result, proving that the second term in the expansion is ?(log?n)^?3/2+o(1), and moreover determining it up to a poly(log?log?n)-factor. The exponent ?3/2 corrects numerical predictions from the physics literature.