Supercyclicity in Spaces of Operators

A sufficient criterion for the map \({C_{A, B}(S) = ASB}\) to be supercyclic on certain algebras of operators on Banach spaces is given. If T is an operator satisfying the Supercyclicity Criterion on a Hilbert space H, then the linear map \({C_{T}(V) = TVT^*}\) is shown to be norm-supercyclic on the algebra \({\mathcal{K}(H)}\) of all compact operators, COT-supercyclic on the real subspace \({\mathcal{S}(H)}\) of all self-adjoint operators and weak*-supercyclic on \({\mathcal{L}(H)}\) of all bounded operators on H. Examples including operators of the form \({C_{B_w, F_\mu}}\) are provided, where B_w and \({F_\mu}\) are respectively backward and forward shifts on Banach sequence spaces.     

Weighted norm inequalities for oscillatory integrals with finite type phases on the line

We obtain two-weighted $L^2$ norm inequalities for oscillatory integral operators of convolution type on the line whose phases are of finite type. The conditions imposed on the weights involve geometrically-defined maximal functions, and the inequalities are best-possible in the sense that they imply the full $L^p(\mathbb{R})\to L^q(\mathbb{R})$ mapping properties of the oscillatory integrals. Our results build on work of Carbery, Soria, Vargas and the first author.     

On the stability of sparse convolutions

We give a stability result for sparse convolutions on ${?}^2(G)\times {?}^1(G)$ for torsion-free discrete Abelian groups G such as $\mathbb{Z}$. It turns out, that the torsion-free property prevents full cancellation in the convolution of sparse sequences and hence allows to establish stability, that is, injectivity with an universal lower norm bound, which only depends on the support cardinalities of the sequences. This can be seen as a reverse statement of the Young inequality for sparse convolutions. Our result hinges on a compression argument in additive set theory.     

A group of continuous self-maps on a topological groupoid

The group of bisections of groupoids plays an important role in the study of Lie groupoids. In this paper another construction is introduced. Indeed, for a topological groupoid G, the set of all continuous self-maps f on G such that (x, f(x)) is a composable pair for every \(x\in G\), is denoted by \(S_G\). We show that \(S_G\) by a natural binary operation is a monoid. \(S_G(\alpha )\), the group of units in \(S_G\) precisely consists of those \(f\in S_G\) such that the map \(x\mapsto xf(x)\) is a bijection on G. Similar to the group of bisections, \(S_G(\alpha )\) acts on G from the right and on the space of continuous self-maps on G from the left. It is proved that \(S_G(\alpha )\) with the compact- open topology inherited from C(G, G) is a left topological group. For a compact Hausdorff groupoid G it is proved that the group of bisections of \(G^2\) is isomorphic to the group \(S_G(\alpha )\) and the group of transitive bisections of G, \(Bis_T(G)\), is embedded in \(S_G(\alpha )\), where \(G^2\) is the groupoid of all composable pairs.     

Logarithmic potentials on Pn

We study the projective logarithmic potential ${\mathbb{G}}_{\mu }$ of a probability measure μ on the complex projective space ${\mathbb{P}}^n$. We prove that the range of the operator $\mu ?{\mathbb{G}}_{\mu }$ is contained in the (local) domain of definition of the complex Monge–Ampère operator acting on the class of quasi-plurisubharmonic functions on ${\mathbb{P}}^n$ with respect to the Fubini–Study metric. Moreover, when the measure μ has no atom, we show that the complex Monge–Ampère measure of its logarithmic potential is an absolutely continuous measure with respect to the Fubini–Study volume form on ${\mathbb{P}}^n$.     

Tighter approximation bounds for LPT scheduling in two special cases

$Q||C_{\max }$ denotes the problem of scheduling n jobs on m machines of different speeds such that the makespan is minimized. In the paper two special cases of $Q||C_{\max }$ are considered: case I, when $m?1$ machine speeds are equal, and there is only one faster machine; and case II, when machine speeds are all powers of 2 (2-divisible machines). Case I has been widely studied in the literature, while case II is significant in an approach to design so called monotone algorithms for the scheduling problem.We deal with the worst case approximation ratio of the classic list scheduling algorithm ‘Largest Processing Time (LPT)’. We provide an analysis of this ratio $\mathit{Lpt}/\mathit{Opt}$ for both special cases: For ‘one fast machine’, a tight bound of $(\sqrt{3}+1)/2\approx 1.3660$ is given. For 2-divisible machines, we show that in the worst case $1.3673<\mathit{Lpt}/\mathit{Opt}<1.4$. Besides, we prove another lower bound of $955/699>(\sqrt{3}+1)/2$ when LPT breaks ties arbitrarily.To our knowledge, the best previous lower and upper bounds were $(4/3,3/2?1/2m]$ in case I [T. Gonzalez, O.H. Ibarra, S. Sahni, Bounds for LPT schedules on uniform processors, SIAM Journal on Computing 6 (1) (1977) 155–166], respectively $[4/3?1/3m,3/2]$ in case II [R.L. Graham, Bounds on multiprocessing timing anomalies, SIAM Journal on Applied Mathematics 17 (1969) 416–429; A. Kovács, Fast monotone 3-approximation algorithm for scheduling related machines, in: Proc. 13th Europ. Symp. on Algs. (ESA), in: LNCS, vol. 3669, Springer, 2005, pp. 616–627]. Moreover, Gonzalez et al. conjectured the lower bound 4/3 to be tight in the ‘one fast machine’ case [T. Gonzalez, O.H. Ibarra, S. Sahni, Bounds for LPT schedules on uniform processors, SIAM Journal on Computing 6 (1) (1977) 155–166].