Lower Bounds for Dimensions of Sums of Sets

We study lower bounds for the Minkowski and Hausdorff dimensions of the algebraic sum E+K of two sets E,K⊂ℝ ^d .     

Convergent Interpolation to Cauchy Integrals over Analytic Arcs

We consider multipoint Padé approximation to Cauchy transforms of complex measures. We show that if the support of a measure is an analytic Jordan arc and if the measure itself is absolutely continuous with respect to the equilibrium distribution of that arc with Dini-smooth nonvanishing density, then the diagonal multipoint Padé approximants associated with appropriate interpolation schemes converge locally uniformly to the approximated Cauchy transform in the complement of the arc. This asymptotic behavior of Padé approximants is deduced from the analysis of underlying non-Hermitian orthogonal polynomials, for which we use classical properties of Hankel and Toeplitz operators on smooth curves. A construction of the appropriate interpolation schemes is explicit granted the parametrization of the arc.     

Stochastic Integrals and Evolution Equations with Gaussian Random Fields

The paper studies stochastic integration with respect to Gaussian processes and fields. It is more convenient to work with a field than a process: by definition, a field is a collection of stochastic integrals for a class of deterministic integrands. The problem is then to extend the definition to random integrands. An orthogonal decomposition of the chaos space of the random field, combined with the Wick product, leads to the Itô-Skorokhod integral, and provides an efficient tool to study the integral, both analytically and numerically. For a Gaussian process, a natural definition of the integral follows from a canonical correspondence between random processes and a special class of random fields. Also considered are the corresponding linear stochastic evolution equations.     

Sets of Approximation and Interpolation in ℂ for Manifold-Valued Maps

We give examples of non-smooth sets in the complex plane with the property that every holomorphic map continuous to the boundary from these sets into any complex manifold may be uniformly approximated by maps holomorphic in some neighborhood of the set (Mergelyan-type approximation for manifold-valued maps.) Similar results are proved for sections of complex-valued holomorphic submersions from complex manifolds.      

The Norm of the Laplace Operator Restriction to a Homogeneous Polynomial Space

We investigate the restriction Δ _r,μ of the Laplace operator Δ onto the space of r-variate homogeneous polynomials F of degree μ. In the uniform norm on the unit ball of ℝ ^r , and with the corresponding operator norm, ‖Δ _r,μ F‖≤‖Δ _r,μ ‖⋅‖F‖ holds, where, for arbitrary F, the ‘constant’ ‖Δ _r,μ ‖ is the best possible. We describe ‖Δ _r,μ ‖ with the help of the family T _μ (σ x), , of scaled Chebyshev polynomials of degree μ. On the interval [−1,+1], they alternate at least (μ−1)-times, as the Zolotarev polynomials do, but they differ from them by their symmetry. We call them Zolotarev polynomials of the second kind, and calculate ‖Δ _r,μ ‖ with their help. We derive upper and lower bounds, as well as the asymptotics for μ→∞. For r≥5 and sufficiently large μ, we just get ‖Δ _r,μ ‖=(r−2)μ(μ−1). However, for 2≤r≤4 or lower values of μ, the result is more complicated. This gives the problem a particular flavor. Some Bessel functions and the φcot φ-expansion are involved.      

Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems

We prove a new complexity bound, polynomial on the average, for the problem of finding an approximate zero of systems of polynomial equations. The average number of Newton steps required by this method is almost linear in the size of the input (dense encoding). We show that the method can also be used to approximate several or all the solutions of non-degenerate systems, and prove that this last task can be done in running time which is linear in the Bézout number of the system and polynomial in the size of the input, on the average.     

New Exceptional Sets and Convergence of the Square Partial Sums of Walsh–Fourier Series

For double Walsh–Fourier series and with f ∈ L~2([0, 1) × [0, 1)) we prove two almost orthogonality results relative to the linearized maximal square partial sums operator S_(N(x,y))f(x, y).Assumptions are N(x, y) non-decreasing as a function of x and of y and, roughly speaking, partial derivatives with approximately constant ratio ■≌2~(n_0) for all x and y, where n_0 is any fixed non-negative integer. Estimates, independent of N(x, y) and n_0, are then extended to L~r, 1 r 2.We give an application to the family N(x, y) = λxy on [0, 1) × [0, 1), any λ 10.     

Semyanistyi’s Integrals and Radon Transforms on Matrix Spaces

We introduce a new analytic family of intertwining operators which include the Radon transform over matrix planes and its inverse. These operators generalize integral transformations introduced by Semyanistyi (Dokl. Akad. Nauk SSSR 134:536–539, [1960]) in his research related to the hyperplane Radon transform in ℝ ⁿ . We obtain an extended version of Fuglede’s formula, connecting generalized Semyanistyi’s integrals, Radon transforms and Riesz potentials on the space of real rectangular matrices. This result combined with the matrix analog of the Hilbert transform leads to variety of new explicit inversion formulas for the Radon transform of functions of matrix argument. The authors were supported in part by the Edmund Landau Center for Research in Mathematical Analysis and Related Areas, sponsored by the Minerva Foundation (Germany). The first author was also supported by Abraham and Sarah Gelbart Research Institute for Mathematical Sciences. The second author was also supported by the NSF grants EPS-0346411 (Louisiana Board of Regents) and DMS-0556157).     

Calderón-Zygmund Capacities and Wolff Potentials on Cantor Sets

We show that, for some Cantor sets in ℝ ^d , the capacity γ _s associated with the s-dimensional Riesz kernel x/|x| ^s+1 is comparable to the capacity [(C)dot]_{frac23(d-s),frac32}dot{C}_{frac{2}{3}(d-s),frac{3}{2}} from non-linear potential theory. It is an open problem to show that, when s is positive and non-integer, they are comparable for all compact sets in ℝ ^d . We also discuss other open questions in the area.     

Weak Type Estimates for Singular Integrals Related to a Dual Problem of Muckenhoupt–Wheeden

A well-known open problem of Muckenhoupt–Wheeden says that any Calderón–Zygmund singular integral operator T is of weak type (1,1) with respect to a couple of weights (w,Mw). In this paper, we consider a somewhat “dual” problem:

Polynomial Hierarchy, Betti Numbers, and a Real Analogue of Toda’s Theorem

Toda (in SIAM J. Comput. 20(5):865–877, 1991) proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P ^#P , namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class #P. This result, which illustrates the power of counting, is considered to be a seminal result in computational complexity theory. An analogous result in the complexity theory over the reals (in the sense of Blum–Shub–Smale real machines in Bull. Am. Math. Soc. (NS) 21(1): 1–46, 1989) has been missing so far. In this paper we formulate and prove a real analogue of Toda’s theorem. Unlike Toda’s proof in the discrete case, which relied on sophisticated combinatorial arguments, our proof is topological in nature. As a consequence of our techniques, we are also able to relate the computational hardness of two extremely well-studied problems in algorithmic semi-algebraic geometry: the problem of deciding sentences in the first-order theory of the reals with a constant number of quantifier alternations, and that of computing Betti numbers of semi-algebraic sets. We obtain a polynomial time reduction of the compact version of the first problem to the second. This latter result may be of independent interest to researchers in algorithmic semi-algebraic geometry.     

RETRACTED ARTICLE: Convergence of Weighted Sums for Arrays of Negatively Dependent Random Variables and Its Applications

We discuss the complete convergence of weighted sums for arrays of rowwise negatively dependent random variables (ND r.v.’s) to linear processes. As an application, we obtain the complete convergence of linear processes based on ND r.v.’s which extends the result of Li et al. (Stat. Probab. Lett. 14:111–114, 1992), including the results of Baum and Katz (Trans. Am. Math. Soc. 120:108–123, 1965), from the i.i.d. case to a negatively dependent (ND) setting. We complement the results of Ahmed et al. (Stat. Probab. Lett. 58:185–194, 2002) and confirm their conjecture on linear processes in the ND case.     

Uppers to Zero in Polynomial Rings and Prüfer-Like Domains

Let D be an integral domain and X an indeterminate over D. It is well known that (a) D is quasi-Prüfer (i.e., its integral closure is a Prüfer domain) if and only if each upper to zero Q in D[X] contains a polynomial g ∈ D[X] with content c _D (g) = D; (b) an upper to zero Q in D[X] is a maximal t-ideal if and only if Q contains a nonzero polynomial g ∈ D[X] with c _D (g) ^v  = D. Using these facts, the notions of UMt-domain (i.e., an integral domain such that each upper to zero is a maximal t-ideal) and quasi-Prüfer domain can be naturally extended to the semistar operation setting and studied in a unified frame. In this article, given a semistar operation ☆ in the sense of Okabe–Matsuda, we introduce the ☆-quasi-Prüfer domains. We give several characterizations of these domains and we investigate their relations with the UMt-domains and the Prüfer v-multiplication domains.     

Toward the Calculation of Higher-Dimensional Stable Manifolds and Stable Sets for Noninvertible and Piecewise-Smooth Maps

This paper presents a new numerical method for computing global stable manifolds and global stable sets of nonlinear discrete dynamical systems. For a given map f:ℝ ^d →ℝ ^d , the proposed method is capable of yielding large parts of stable manifolds and sets within a certain compact region M⊂ℝ ^d . The algorithm divides the region M in sets and uses an adaptive subdivision technique to approximate an outer covering of the manifolds. In contrast to similar approaches, the method requires neither the system’s inverse nor its Jacobian. Hence, it can also be applied to noninvertible and piecewise-smooth maps. The successful application of the method is illustrated by computation of one- and two-dimensional stable manifolds and global stable sets.     

Some Inequalities Related to Transience and Recurrence of Markov Processes and Their Applications

For an irreducible symmetric Markov process on a (not necessarily compact) state space associated with a symmetric Dirichlet form, we give Poincaré-type inequalities. As an application of the inequalities, we consider a time-inhomogeneous diffusion process obtained by a time-dependent drift transformation from a diffusion process and give general conditions for the transience or recurrence of some sets. As a particular case, the diffusion process appearing in the theory of simulated annealing is considered.     

An Algorithm Based on Active Sets and Smoothing for Discretized Semi-Infinite Minimax Problems

We present a new active-set strategy which can be used in conjunction with exponential (entropic) smoothing for solving large-scale minimax problems arising from the discretization of semi-infinite minimax problems. The main effect of the active-set strategy is to dramatically reduce the number of gradient calculations needed in the optimization. Discretization of multidimensional domains gives rise to minimax problems with thousands of component functions. We present an application to minimizing the sum of squares of the Lagrange polynomials to find good points for polynomial interpolation on the unit sphere in ℝ³. Our numerical results show that the active-set strategy results in a modified Armijo gradient or Gauss-Newton like methods requiring less than a quarter of the gradients, as compared to the use of these methods without our active-set strategy. Finally, we show how this strategy can be incorporated in an algorithm for solving semi-infinite minimax problems.     

A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality

In this paper, we study the link between a Chance-Constrained optimization Problem (CCP) and its sample counterpart (SP). SP has a finite number, say N, of sampled constraints. Further, some of these sampled constraints, say k, are discarded, and the final solution is indicated by x^*_N,kx^{ast}_{N,k}. Extending previous results on the feasibility of sample convex optimization programs, we establish the feasibility of x^*_N,kx^{ast}_{N,k} for the initial CCP problem.     

Matrix-Differential-Operator Approach to the Maxwell Equations and the Dirac Equation

We use matrix-differential-operators and Fourier expansion to solve the Maxwell equations and the free Dirac equation for any given initial conditions.     

On the Wave Equation Associated to the Hermite and the Twisted Laplacian

The dispersive properties of the wave equation u _tt +Au=0 are considered, where A is either the Hermite operator −Δ+|x|² or the twisted Laplacian −(∇ _x −iy)²/2−(∇ _y +ix)²/2. In both cases we prove optimal L ¹−L ^∞ dispersive estimates. More generally, we give some partial results concerning the flows exp (itL ^ν ) associated to fractional powers of the twisted Laplacian for 0<ν<1.