Local Definitizability of {{T^{[\ast]}T}} and {{TT^{{[\ast]}}}}

The spectral properties of two products AB and BA of possibly unbounded operators A and B in a Banach space are considered. The results are applied in the comparison of local spectral properties of the operators ${T^{[\ast]} T}$ and ${TT^{[\ast]}}$ in a Krein space. It is shown that under the assumption that both operators ${T^{[\ast]} T}$ and ${TT^{[\ast]}}$ have non-empty resolvent sets, the operator ${T^{[\ast]} T}$ is locally definitizable if and only if ${TT^{[\ast]}}$ is. In this context the critical points of both operators are compared.     

A probabilistic analysis of the Next-Fit bin packing algorithm

An infinite supply of pieces, with i.i.d. sizes, is packed under the Next-Fit packing procedure. The process A_n, the number of bins required to pack n pieces, is investigated, and the first two moments are computed when the piece sizes are uniformly distributed. For this special case expressions for the distribution of A_n are also presented.     

Nonlinear Schrödinger equations: concentration on weighted geodesics in the semi-classical limit

We consider the problem

${?}^2\mathrm{\Delta }u?V(x)u+u^p=0,u>0,u\in H^1({\mathbb{R}}^2),$

where $p>1$, $?>0$ is a small parameter and V is a uniformly positive, smooth potential. Let Γ be a closed curve, nondegenerate geodesic relative to the weighted arclength ${\int }_{\Gamma }{V}^{\sigma }$, where $\sigma =\frac{p+1}{p?1}?\frac{1}{2}$. We prove the existence of a solution $u_{\mathrm{\epsilon }}$ concentrating along the whole of Γ, exponentially small in ? at any positive distance from it, provided that ? is small and away from certain critical numbers. This proves a conjecture raised in [A. Ambrosetti, A. Malchiodi, W.-M. Ni, Singularly perturbed elliptic equations with symmetry: existence of solutions concentrating on spheres, Part I, Commun. Math. Phys. 235 (2003) 427–466] in the two-dimensional case. To cite this article: M. del Pino et al., C. R. Acad. Sci. Paris, Ser. I 341 (2005).     

Topological structure of complete Riemannian manifolds with cyclic holonomy groups

Let M be a complete m-dimensional Riemannian manifold with cyclic holonomy group, let X be a closed flat manifold homotopy equivalent to M, and let L→X be a nontrivial line bundle over X whose total space is a flat manifold with cyclic holonomy group. We prove that either M is diffeomorphic to X×Rm-dimX or M is diffeomorphic to L×Rm-dimX−1.     

Heavy-tails and regime-switching in electricity prices

In this paper we first analyze the stylized facts of electricity prices, in particular, the extreme volatility and price spikes which lead to heavy-tailed distributions of price changes. Then we calibrate Markov regime-switching (MRS) models with heavy-tailed components and show that they adequately address the aforementioned characteristics. Contrary to the common belief that electricity price models ‘should be built on log-prices’, we find evidence that modeling the prices themselves is more beneficial and methodologically sound, at least in case of MRS models.     

The representation dimension of domestic weakly symmetric algebras

Auslander’s representation dimension measures how far a finite dimensional algebra is away from being of finite representation type. In [1], M. Auslander proved that a finite dimensional algebra A is of finite representation type if and only if the representation dimension of A is at most 2. Recently, R. Rouquier proved that there are finite dimensional algebras of an arbitrarily large finite representation dimension. One of the exciting open problems is to show that all finite dimensional algebras of tame representation type have representation dimension at most 3. We prove that this is true for all domestic weakly symmetric algebras over algebraically closed fields having simply connected Galois coverings.     

Improved lower bounds for the online bin stretching problem

We use game theory techniques to automatically compute improved lower bounds on the competitive ratio for the bin stretching problem. Using these techniques, we improve the best lower bound for this problem to 19/14. We explain the technique and show that it can be generalized to compute lower bounds for any online or semi-online packing or scheduling problem.     

The 1‐2‐3‐Conjecture for Hypergraphs

A weighting of the edges of a hypergraph is called vertex‐coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e. every edge contains at least two vertices with different weighted degrees. In this article, we show that such a weighting is possible from the weight set for all hypergraphs with maximum edge size and not containing edges solely consisting of identical vertices. The number is best possible for this statement.