A limit theorem for continuous selectors

Any (measurable) function K from Rⁿ to R defines an operator K acting on random variables X by K(X) = K(X₁,..., X_n), where the X_j are independent copies of X. The main result of this paper concerns continuous selectors H, continuous functions defined in Rn and such that H(x₁, x₂,..., x_n) ∈ {x₁, x₂,..., x_n}. For each such continuous selector H (except for projections onto a single coordinate) there is a unique point ω_H in the interval (0, 1) so that, for any random variable X, the iterates H^(N) acting on X converge in distribution as N → ∞ to the ωH-quantile of X.     

Some matrix functional equations

We investigate the pair of matrix functional equations G(x)F(y) = G(xy) and G(x)G(y) = F(y/x), featuring the two independent scalar variables x and y and the two N×N matrices F(z) andG(z) (with N an arbitrary positive integer and the elements of these two matrices functions of the scalar variable z). We focus on the simplest class of solutions, i.e., on matrices all of whose elements are analytic functions of the independent variable. While in the scalar (N = 1) case this pair of functional equations only possess altogether trivial constant solutions, in the matrix (N > 1) case there are nontrivial solutions. These solutions satisfy the additional pair of functional equations F(x)G(y) = G(y/x) andF(x)F(y) = F(xy), and an endless hierarchy of other functional equations featuring more than two independent variables.     

Extremes of Gaussian processes with smooth random expectation and smooth random variance

Let ξ(t), t ∈ [0, T],T > 0, be a Gaussian stationary process with expectation 0 and variance 1, and let η(t) and μ(t) be other sufficiently smooth random processes independent of ξ(t). In this paper, we obtain an asymptotic exact result for P(sup _t∈[0,T](η(t)ξ(t) + μ(t)) > u) as u→∞.     

A sharp eigenvalue theorem for fractional elliptic equations

The invisibility graph I(X) of a set X ? R ^d is a (possibly infinite) graph whose vertices are the points of X and two vertices are connected by an edge if and only if the straight-line segment connecting the two corresponding points is not fully contained in X. We consider the following three parameters of a set X: the clique number ω(I(X)), the chromatic number χ(I(X)) and the convexity number γ(X), which is the minimum number of convex subsets of X that cover X.We settle a conjecture of Matou?ek and Valtr claiming that for every planar set X, γ(X) can be bounded in terms of χ(I(X)). As a part of the proof we show that a disc with n one-point holes near its boundary has χ(I(X)) ≥ log log(n) but ω(I(X)) = 3.We also find sets X in R⁵ with χ(X) = 2, but γ(X) arbitrarily large.     

On the existence of strips inside domains convex in one direction

A plane domain Ω is convex in the positive direction if for every ω ∈ Ω, the entire half-line {ω + t: t ≥ 0} is contained in Ω. Suppose that h maps the unit disk onto such a domain Ω with the normalization h(0) = 0 and lim_t→∞h^?1(h(z) + t) = 1. We show that if ∠lim_z→?1 Re h(z) = ?∞ and ∠lim_z→?1(1 + z)h′(z) = ν ∈ (0, +∞), then Ω contains a maximal horizontal strip of width πν. We also prove a converse statement. These results provide a solution to a problem posed by Elin and Shoikhet in connection with semigroups of holomorphic functions.     

<Emphasis Type="Bold">K</Emphasis><Subscript>0</Subscript> of Semiartinian Von Neumann Regular Rings. Direct Finiteness Versus Unit-Regularity

If R is a regular and semiartinian ring, it is proved that the following conditions are equivalent: (1) R is unit-regular, (2) every factor ring of R is directly finite, (3) the abelian group K _O(R) is free and admits a basis which is in a canonical one to one correspondence with a set of representatives of simple right R-modules. For the class of semiartinian and unit-regular rings the canonical partial order of K _O(R) is investigated. Starting from any partially ordered set I, a special dimension group G(I) is built and a large class of semiartinian and unit-regular rings is shown to have the corresponding K _O(R) order isomorphic to G(P r i m _R ), where P r i m _R is the primitive spectrum of R. Conversely, if I is an artinian partially ordered set having a finite cofinal subset, it is proved that the dimension group G(I) is realizable as K _O(R) for a suitable semiartinian and unit-regular ring R.     

Homogenization of a nonstationary model equation of electrodynamics

In L ₂(?₃;?₃), we consider a self-adjoint operator ? _ε , ε > 0, generated by the differential expression curl η(x/ε)^?1 curl??ν(x/ε) div. Here the matrix function η(x) with real entries and the real function ν(x) are periodic with respect to some lattice, are positive definite, and are bounded. We study the behavior of the operators cos(τ? _ε ^1/2 ) and ? _ε ^?1/2 sin(τ? _ε ^1/2 ) for τ ∈ ? and small ε. It is shown that these operators converge to cos(τ(?⁰)^1/2) and (?₀)^?1/2 sin(τ(?₀)^1/2), respectively, in the norm of the operators acting from the Sobolev space H ^s (with a suitable s) to ?₂. Here ?⁰ is an effective operator with constant coefficients. Error estimates are obtained and the sharpness of the result with respect to the type of operator norm is studied. The results are used for homogenizing the Cauchy problem for the model hyperbolic equation ? _τ ² v _ε = ?? _ε v _ε , div v _ε = 0, appearing in electrodynamics. We study the application to a nonstationary Maxwell system for the case in which the magnetic permeability is equal to 1 and the dielectric permittivity is given by the matrix η(x/ε).     

Geometric Realizations of Lusztig’s Symmetries of Symmetrizable Quantum Groups

Let U be the quantum group and f be the Lusztig’s algebra associated with a symmetrizable generalized Cartan matrix. The algebra f can be viewed as the positive part of U. Lusztig introduced some symmetries T _i on U for all i ∈ I. Since T _i (f) is not contained in f, Lusztig considered two subalgebras _i f and ⁱ f of f for any i ∈ I, where _i f={x ∈ f | T _i (x) ∈ f} and \({^{i}\mathbf {f}}=\{x\in \mathbf {f}\,\,|\,\,T^{-1}_{i}(x)\in \mathbf {f}\}\). The restriction of T _i on _i f is also denoted by \(T_{i}:{_{i}\mathbf {f}}\rightarrow {^{i}\mathbf {f}}\). The geometric realization of f and its canonical basis are introduced by Lusztig via some semisimple complexes on the variety consisting of representations of the corresponding quiver. When the generalized Cartan matrix is symmetric, Xiao and Zhao gave geometric realizations of Lusztig’s symmetries in the sense of Lusztig. In this paper, we shall generalize this result and give geometric realizations of _i f, ⁱ f and \(T_{i}:{_{i}\mathbf {f}}\rightarrow {^{i}\mathbf {f}}\) by using the language ’quiver with automorphism’ introduced by Lusztig.     

Random process in a homogeneous Gaussian field

We consider a random process in a spatial-temporal homogeneous Gaussian field V (q , t) with the mean E V = 0 and the correlation function W(|q ? q′|, |t ? t′|) ≡ E[V (q, t)V (q′, t′)], where \( \bold{q} \in {\mathbb{R}^d} \), \( t \in {\mathbb{R}^{+} } \), and d is the dimension of the Euclidean space \( {\mathbb{R}^d} \). For a “density” G(r, t) of the familiar model of a physical system averaged over all realizations of the random field V, we establish an integral equation that has the form of the Dyson equation. The invariance of the equation under the continuous renormalization group allows using the renormalization group method to find an asymptotic expression for G(r, t) as r → ∞ and t → ∞.     

Analysis of algorithms for an online version of the convoy movement problem

In the convoy movement problem (CMP), a set of convoys must be routed from specified origins to destinations in a transportation network, represented by an undirected graph. Two convoys may not cross each other on the same edge while travelling in opposing directions, a restriction referred to as blocking. However, convoys are permitted to follow each other on the same edge, with a specified headway separating them, but no overtaking is permitted. Further, the convoys to be routed are distinguished based on their length. Particle convoys have zero length and are permitted to traverse an edge simultaneously, whereas convoys with non-zero length have to follow each other, observing a headway. The objective is to minimize the total time taken by convoys to travel from their origins to their destinations, given the travel constraints on the edges. We consider an online version of the CMP where convoy demands arise dynamically over time. For the special case of particle convoys, we present an algorithm that has a competitive ratio of 3 in the worst case and (5/2) on average. For the particle convoy problem, we also present an alternate, randomized algorithm that provides a competitive ratio of (√13?1). We then extend the results to the case of convoys with length, which leads to an algorithm with an O(T+CL) competitive ratio, where T={Max _e t(e)}/{Min _e t(e)}, C is the maximum congestion (the number of distinct convoy origin–destination pairs that use any edge e) and L={Max _c L(c)}/{Min _c L(c)}; here L(c)>0 represents the time-headway to be observed by any convoy that follows c and t(e) represents the travel time for a convoy c on edge e.     

Inverse problem with nonlocal observation of finding the coefficient multiplying <Emphasis Type="Italic">u</Emphasis> <Subscript> <Emphasis Type="Italic">t</Emphasis> </Subscript> in the parabolic equation

We study the inverse problem of the reconstruction of the coefficient ?(x, t) = ?⁰(x, t) + r(x) multiplying u_t in a nonstationary parabolic equation. Here ?⁰(x, t) ≥ ?⁰ > 0 is a given function, and r(x) ≥ 0 is an unknown function of the class L_∞(Ω). In addition to the initial and boundary conditions (the data of the direct problem), we pose the problem of nonlocal observation in the form ∫₀^Tu(x, t) dμ(t) = χ(x) with a known measure dμ(t) and a function χ(x). We separately consider the case dμ(t) = ω(t)dt of integral observation with a smooth function ω(t). We obtain sufficient conditions for the existence and uniqueness of the solution of the inverse problem, which have the form of ready-to-verify inequalities. We suggest an iterative procedure for finding the solution and prove its convergence. Examples of particular inverse problems for which the assumptions of our theorems hold are presented.     

Rational frames of minimal twist along space curves under specified boundary conditions

An adapted orthonormal frame (f₁(ξ),f₂(ξ),f₃(ξ)) on a space curve r(ξ), ξ ∈ [ 0, 1 ] comprises the curve tangent \(\mathbf {f}_{1}(\xi ) =\mathbf {r}^{\prime }(\xi )/|\mathbf {r}^{\prime }(\xi )|\) and two unit vectors f₂(ξ),f₃(ξ) that span the normal plane. The variation of this frame is specified by its angular velocity Ω = Ω₁f₁ + Ω₂f₂ + Ω₃f₃, and the twist of the framed curve is the integral of the component Ω₁ with respect to arc length. A minimal twist frame (MTF) has the least possible twist value, subject to prescribed initial and final orientations f₂(0),f₃(0) and f₂(1),f₃(1) of the normal–plane vectors. Employing the Euler–Rodrigues frame (ERF) — a rational adapted frame defined on spatial Pythagorean–hodograph curves — as an intermediary, an exact expression for an MTF with Ω₁ = constant is derived. However, since this involves rather complicated transcendental terms, a construction of rational MTFs is proposed by the imposition of a rational rotation on the ERF normal–plane vectors. For spatial PH quintics, it is shown that rational MTFs compatible with the boundary conditions can be constructed, with only modest deviations of Ω₁ about the mean value, by a rational quartic normal–plane rotation of the ERF. If necessary, subdivision methods can be invoked to ensure that the rational MTF is free of inflections, or to more accurately approximate a constant Ω₁. The procedure is summarized by an algorithm outline, and illustrated by a representative selection of computed examples.     

An integro-local theorem applicable on the whole half-axis to the sums of random variables with regularly varying distributions

We obtain an integro-local limit theorem for the sum S(n) = ξ(1)+?+ξ(n) of independent identically distributed random variables with distribution whose right tail varies regularly; i.e., it has the form P(ξ≥t) = t ^?β L(t) with β > 2 and some slowly varying function L(t). The theorem describes the asymptotic behavior on the whole positive half-axis of the probabilities P(S(n) ∈ [x, x + Δ)) as x → ∞ for a fixed Δ > 0; i.e., in the domain where the normal approximation applies, in the domain where S(n) is approximated by the distribution of its maximum term, as well as at the “junction” of these two domains.     

Probabilities of high extremes for a Gaussian stationary process in a random environment

Let ξ(t) be a zero-mean stationary Gaussian process with the covariance function r(t) of Pickands type, i.e., r(t) = 1 ? |t| ^α + o(|t| ^α ), t → 0, 0 < α ≤ 2, and η(t), ζ(t) be periodic random processes. The exact asymptotic behavior of the probabilities P(max _t∈[0,T] η(t)ξ(t) > u), P(max _t∈[0,T] (ξ(t) + η(t)) > u) and P(max _t∈[0,T] (η(t)ξ(t) + ζ(t)) > u) is obtained for u → ∞ for any T > 0 and independent ξ(t), η(t), ζ(t).     

Holomorphic vector bundles on open subsets of Stein manifolds

LetM be a connected two-dimensional Stein manifold withH ²(M,Z)=0 andS∈M a discrete subset withS≠ Ø. SetX:=M/S. Fix an integerr≥2. Then there exists a rankr vector bundleE onX such that there is no line bundleL onX with a non-zero mapL →E.     

On the Joint Distribution of First-passage Time and First-passage Area of Drifted Brownian Motion

For drifted Brownian motion X(t) = x-µ t + B _t (µ > 0) starting from x > 0, we study the joint distribution of the first-passage time below zero ,t(x), and the first-passage area ,A(x), swept out by X till the time t(x). In particular, we establish differential equations with boundary conditions for the joint moments E[t(x) ^m A(x) ⁿ ], and we present an algorithm to find recursively them, for any m and n. Finally, the expected value of the time average of X till the time t(x) is obtained.     

Continuous wavelets on compact manifolds

Let M be a smooth compact oriented Riemannian manifold, and let Δ _M be the Laplace–Beltrami operator on M. Say \({0 \neq f \in \mathcal{S}(\mathbb {R}^+)}\) , and that f (0)  =  0. For t  >  0, let K _t (x, y) denote the kernel of f (t ² Δ _M ). We show that K _t is well-localized near the diagonal, in the sense that it satisfies estimates akin to those satisfied by the kernel of the convolution operator f (t ²Δ) on \({\mathbb {R}^n}\) . We define continuous \({\mathcal {S}}\)-wavelets on M, in such a manner that K _t (x, y) satisfies this definition, because of its localization near the diagonal. Continuous \({\mathcal {S}}\)-wavelets on M are analogous to continuous wavelets on \({\mathbb {R}^n}\) in \({\mathcal {S}}\) (\({\mathbb {R}^n}\)). In particular, we are able to characterize the Hölder continuous functions on M by the size of their continuous \({\mathcal {S}}\)-wavelet transforms, for Hölder exponents strictly between 0 and 1. If M is the torus \({\mathbb T^2}\) or the sphere S ², and f (s)  =  se ^?s (the “Mexican hat” situation), we obtain two explicit approximate formulas for K _t , one to be used when t is large, and one to be used when t is small.     

On convex hull of Gaussian samples

Let X _i = {X _i (t), t ∈ T} be i.i.d. copies of a centered Gaussian process X = {X(t), t ∈ T} with values in\( {\mathbb{R}^d} \) defined on a separable metric space T. It is supposed that X is bounded. We consider the asymptotic behavior of convex hulls

$ {W_n} = {\text{conv}}\left\{ {{X_1}(t), \ldots, {X_n}(t),\,\,t \in T} \right\} $

and show that, with probability 1,

$ \mathop {{\lim }}\limits_{n \to \infty } \frac{1}{{\sqrt {{2\ln n}} }}{W_n} = W $

(in the sense of Hausdorff distance), where the limit shape W is defined by the covariance structure of X: W = conv{K _t , t ∈ T}, Kt being the concentration ellipsoid of X(t). We also study the asymptotic behavior of the mathematical expectations E f(W _n ), where f is an homogeneous functional.

     

Searching for a Best Least Absolute Deviations Solution of an Overdetermined System of Linear Equations Motivated by Searching for a Best Least Absolute Deviations Hyperplane on the Basis of Given Data

We consider the problem of searching for a best LAD-solution of an overdetermined system of linear equations Xa=z, X∈?^m×n, m≥n, \(\mathbf{a}\in \mathbb{R}^{n}, \mathbf {z}\in\mathbb{R}^{m}\). This problem is equivalent to the problem of determining a best LAD-hyperplane x?a ^T x, x∈? ⁿ on the basis of given data \((\mathbf{x}_{i},z_{i}), \mathbf{x}_{i}= (x_{1}^{(i)},\ldots,x_{n}^{(i)})^{T}\in \mathbb{R}^{n}, z_{i}\in\mathbb{R}, i=1,\ldots,m\), whereby the minimizing functional is of the form

$F(\mathbf{a})=\|\mathbf{z}-\mathbf{Xa}\|_1=\sum_{i=1}^m|z_i-\mathbf {a}^T\mathbf{x}_i|.$

An iterative procedure is constructed as a sequence of weighted median problems, which gives the solution in finitely many steps. A criterion of optimality follows from the fact that the minimizing functional F is convex, and therefore the point a ^?∈? ⁿ is the point of a global minimum of the functional F if and only if 0∈?F(a ^?).

Motivation for the construction of the algorithm was found in a geometrically visible algorithm for determining a best LAD-plane (x,y)?αx+βy, passing through the origin of the coordinate system, on the basis of the data (x _i ,y _i ,z _i ),i=1,…,m.     

Expectation of the truncated randomly weighted sums with dominatedly varying summands

We consider the asymptotic behavior of the values P(S > x), E(S 1_{S>x}), and E(S | S > x). Here S = θ₁X₁ + θ₂X₂ + · · · + θ_nX_n is a randomly weighted sum of the basic random variables X₁,X₂, . . . , X_n, which follow some special dependence structure, and {θ₁, θ₂, . . . , θ_n} is a collection of nonnegative and arbitrarily dependent random weights; the collections {X₁,X₂, . . .,X_n} and {θ₁, θ₂, . . . , θ_n} are supposed to be independent. We derive asymptotic formulas in the case where the number of summands n is fixed and the distributions of the basic random variables are dominatedly varying.We apply them to some values related to the risk measures of certain weighted sums.