Orbispaces as differentiable stratified spaces

We present some features of the smooth structure and of the canonical stratification on the orbit space of a proper Lie groupoid. One of the main features is that of Morita invariance of these structures—it allows us to talk about the canonical structure of differentiable stratified space on the orbispace (an object analogous to a separated stack in algebraic geometry) presented by the proper Lie groupoid. The canonical smooth structure on an orbispace is studied mainly via Spallek’s framework of differentiable spaces, and two alternative frameworks are then presented. For the canonical stratification on an orbispace, we extend the similar theory coming from proper Lie group actions. We make no claim to originality. The goal of these notes is simply to give a complementary exposition to those available and to clarify some subtle points where the literature can sometimes be confusing, even in the classical case of proper Lie group actions.     

Ground state solutions for the singular Lane-Emden-Fowler equation with sublinear convection term

We are concerned with singular elliptic equations of the form −Δu=p(x)(g(u)+f(u)+a|∇u|) in RN (N?3), where p is a positive weight and 0<a<1. Under the hypothesis that f is a nondecreasing function with sublinear growth and g is decreasing and unbounded around the origin, we establish the existence of a ground state solution vanishing at infinity. Our arguments rely essentially on the maximum principle.     

A Graphical Goodness-of-Fit Test for Dependence Models in Higher Dimensions

This article introduces a graphical goodness-of-fit test for copulas in more than two dimensions. The test is based on pairs of variables and can thus be interpreted as a first-order approximation of the underlying dependence structure. The idea is to first transform pairs of data columns with the Rosenblatt transform to bivariate standard uniform distributions under the null hypothesis. This hypothesis can be graphically tested with a matrix of bivariate scatterplots, Q-Q plots, or other transformations. Furthermore, additional information can be encoded as background color, such as measures of association or (approximate) p-values of tests of independence. The proposed goodness-of-fit test is designed as a basic graphical tool for detecting deviations from a postulated, possibly high-dimensional, dependence model. Various examples are given and the methodology is applied to a financial dataset. An implementation is provided by the R package copula. Supplementary material for this article is available online, which provides the R package copula and reproduces all the graphical results of this article.     

Convergence of Appell Polynomials of Long Range Dependent Moving Averages in Martingale Differences

We study limit distribution of partial sums S_N,k(t) = _{s = 1} ^{[N t]} A_k(X_s) of Appell polynomials of the long-range dependent moving average process X_t> = _{i t} b_{t - i i}, where {_i} is a strictly stationary and weakly dependent martingale difference sequence, and b_i i^{d - 1} (0 < d < 1/2). We show that if k(1-2 d)<1, then suitably normalized partial sums S_N,k(t) converge in distribution to the kth order Hermite process. This result generalizes the corresponding results of Surgailis, and Avram and Taqqu obtained in the case of the i.i.d. sequence { _i}.     

An exact method with variable fixing for solving the generalized assignment problem

We propose a simple exact algorithm for solving the generalized assignment problem. Our contribution is twofold: we reformulate the optimization problem into a sequence of decision problems, and we apply variable-fixing rules to solve these effectively. The decision problems are solved by a simple depth-first lagrangian branch-and-bound method, improved by our variable-fixing rules to prune the search tree. These rules rely on lagrangian reduced costs which we compute using an existing but little-known dynamic programming algorithm.     

Combined Routeing and Scheduling for the Transportation of Containerized Cargo

A tractor-trailer problem, with full load, from the class of combined routeing and scheduling problems is described. Distinctive features of the problem are: movements must be carried out within certain time windows; subsets of movements are linked in the sense that they must be executed in a certain order; and different priorities are attached to different movements. A new bidirectional sequential constructive heuristic is developed for the solution of this problem. The method constructs routes and schedules for the available tractor fleet. The algorithm attempts to minimize the total time for all the movements by minimizing the time taken up by unproductive movements (so-called deadhead) and waiting time between movements. Some practical aspects of the implementation of the approach are discussed.     

Spectral analysis for the Gauss problem on continued fractions

We present a new derivation of the formula appearing in Babenko (1978) and Mayer and Roepstorff (1987) that gives the probability distribution of τ⁻ⁿ${\tau }^{-n}$ in terms of the eigenvalues of a symmetric operator. Here τ$\tau$ is the well-known Gauss-map.     

Singular solutions for second-order non-divergence type elliptic inequalities in punctured balls

We study the existence and non-existence of positive singular solutions of second-order non-divergence type elliptic inequalities of the form $\sum\limits_{i,j = 1}^N {a_{ij} (x)\frac{{\partial ^2 u}} {{\partial x_i \partial x_j }}} + \sum\limits_{i = 1}^N {b_i (x)\frac{{\partial u}} {{\partial x_i }} \geqslant K(x)u^p ,} - \infty < p - \infty , $ with measurable coefficients in a punctured ball B _R \{0} of ? ^N , N ≥ 1. We prove the existence of a critical value p* which separates the existence region from the non-existence region. We show that in the critical case p = p*, the existence of a singular solution depends on the rate at which the coefficients (a _{i j} ) and (b _i ) stabilize at zero, and we provide some optimal conditions in this setting.     

Continuous fields of C*-algebras over finite dimensional spaces

Let X be a finite dimensional compact metrizable space. We study a technique which employs semiprojectivity as a tool to produce approximations of C(X)-algebras by C(X)-subalgebras with controlled complexity. The following applications are given. All unital separable continuous fields of C*-algebras over X with fibers isomorphic to a fixed Cuntz algebra On, n∈{2,3,…,∞}, are locally trivial. They are trivial if n=2 or n=∞. For n?3 finite, such a field is trivial if and only if (n−1)[A₁]=0 in K₀(A), where A is the C*-algebra of continuous sections of the field. We give a complete list of the Kirchberg algebras D satisfying the UCT and having finitely generated K-theory groups for which every unital separable continuous field over X with fibers isomorphic to D is automatically locally trivial or trivial. In a more general context, we show that a separable unital continuous field over X with fibers isomorphic to a KK-semiprojective Kirchberg C*-algebra is trivial if and only if it satisfies a K-theoretical Fell type condition.     

Vectorial penalization for generalized functional constrained problems

In this paper we use a double penalization procedure in order to reduce a set-valued optimization problem with functional constraints to an unconstrained one. The penalization results are given in several cases: for weak and strong solutions, in global and local settings, and considering two kinds of epigraphical mappings of the set-valued map that defines the constraints. Then necessary and sufficient conditions are obtained separately in terms of Bouligand derivatives of the objective and constraint mappings.