Given a domain Ω⊂ℂ^{$n$}, the Lempert function is a functional on the space $\text{Hol}(\mathbb{D},\Omega)$ of analytic disks with values in Ω, depending on a set of poles in Ω. We generalize its definition to the case where poles have multiplicities given by local indicators (in the sense of Rashkovskii) to obtain a function which still dominates the corresponding Green function, behaves relatively well under limits, and is monotonic with respect to the local indicators. In particular, this is an improvement over the previous generalization used by the same authors to find an example of a set of poles in the bidisk so that the (usual) Green and Lempert functions differ.

We state and prove a Chern–Osserman-type inequality in terms of the volume growth for minimal surfaces$S$which have finite total extrinsic curvature and are properly immersed in a Cartan–Hadamard manifold$N$with sectional curvatures bounded from above by a negative quantity$K$_{$N$}≤$b$<0 and such that they are not too curved (on average) with respect to the hyperbolic space with constant sectional curvature given by the upper bound$b$. We also prove the same Chern–Osserman-type inequality for minimal surfaces with finite total extrinsic curvature and properly immersed in an asymptotically hyperbolic Cartan–Hadamard manifold$N$with sectional curvatures bounded from above by a negative quantity$K$_{$N$}≤$b$<0.

In this paper, we discuss a general multiscale model reduction framework based on multiscale finite element methods. We give a brief overview of related multiscale methods. Due to page limitations, the overview focuses on a few related methods and is not intended to be comprehensive. We present a general adaptive multiscale model reduction framework, the Generalized Multiscale Finite Element Method. Besides the method's basic outline, we discuss some important ingredients needed for the method's success. We also discuss several applications. The proposed method allows performing local model reduction in the presence of high contrast and no scale separation.

We propose a class of interior proximal-like algorithms for the second-order cone program, which is to minimize a closed proper convex function subject to general second-order cone constraints. The class of methods uses a distance measure generated by a twice continuously differentiable strictly convex function on (0,+\infty), and includes as a special case the entropy-like proximal algorithm [Eggermont, <i>Linear Algebra Appl.</i>, 130 (1990), pp. 2542], which was originally proposed for minimizing a convex function subject to nonnegative constraints. Particularly, we consider an approximate version of these methods, allowing the inexact solution of subproblems. Like the entropy-like proximal algorithm for convex programming with nonnegative constraints, we, under some mild assumptions, establish the global convergence expressed in terms of the objective values for the proposed algorithm, and we show that the

In this paper, we give a uniform construction of irreducible genuine characters of the Pin cover W of a Weyl group W, and put them into the context of theory of Springer representations. In the process, we provide a direct connection between Springer theory, via Green polynomials, the irreducible representations of W, and an extended Dirac operator for graded Hecke algebras. We also introduce a q-elliptic pairing for W with respect to the reflection representation V. These constructions are of independent interest. The q-elliptic pairing is a generalization of the elliptic pairing of W introduced by Reeder, and it is also related to S. Kato's notion of (graded) Kostka systems for the semidirect product A W= C [W] S (V).