Evidence for Helical Edge Modes in Inverted InAs/GaSb Quantum Wells

We present an experimental study of low temperature electronic transport in the hybridization gap of inverted InAs/GaSb composite quantum wells. Electrostatic gate is used to push the Fermi level into the gap regime, where the conductance as a function of sample length and width is measured. Our analysis shows strong evidence for the existence of helical edge modes proposed by Liu et al [Phys. Rev. Lett., 100, 236601 (2008)]. Edge modes persist inspite of sizable bulk conduction and show only a weak magnetic field dependence - a direct consequence of gap opening away from zone center.Comment: 4 pages, 4 figure

Positive definite ∗*-spherical functions, property (T), and C∗C^*-completions of Gelfand pairs

The study of existence of a universal $C^*$-completion of the $^*$-algebra canonically associated to a Hecke pair was initiated by Hall, who proved that the Hecke algebra associated to (\operatorname{SL}_2(\Qp), \operatorname{SL}_2(\Zp)) does not admit a universal $C^*$-completion. Kaliszewski, Landstad and Quigg studied the problem by placing it in the framework of Fell-Rieffel equivalence, and highlighted the role of other $C^*$-completions. In the case of the pair (\operatorname{SL}_n(\Qp), \operatorname{SL}_n(\Zp)) for $n\geq 3$ we show, invoking property (T) of \operatorname{SL}_n(\Qp), that the $C^*$-completion of the $L^1$-Banach algebra and the corner of C^*(\operatorname{SL}_n(\Qp)) determined by the subgroup are distinct. In fact, we prove a more general result valid for a simple algebraic group of rank at least $2$ over a $\mathfrak{p}$-adic field with a good choice of a maximal compact open subgroup.Comment: 15 page

Analysis of a class of boundary value problems depending on left and right Caputo fractional derivatives

In this work we study boundary value problems associated to a nonlinear fractional ordinary differential equation involving left and right Caputo derivatives. We discuss the regularity of the solutions of such problems and, in particular, give precise necessary conditions so that the solutions are C1([0, 1]). Taking into account our analytical results, we address the numerical solution of those problems by the augmented-RBF method. Several examples illustrate the good performance of the numerical method.P.A. is partially supported by FCT, Portugal, through the program “Investigador FCT” with reference IF/00177/2013 and the scientific projects PEstOE/MAT/UI0208/2013 and PTDC/MAT-CAL/4334/2014. R.F. was supported by the “Fundação para a Ciência e a Tecnologia (FCT)” through the program “Investigador FCT” with reference IF/01345/2014.info:eu-repo/semantics/publishedVersio

An Exact Approach to Early/Tardy Scheduling with Release Dates

In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no unforced idle time. The problem is decomposed into a weighted earliness subproblem and a weighted tardiness subproblem. Lower bounding procedures are proposed for each of these subproblems, and the lower bound for the original problem is then simply the sum of the lower bounds for the two subproblems. The lower bounds and several versions of a branch-and-bound algorithm are then tested on a set of randomly generated problems, and instances with up to 30 jobs are solved to optimality. To the best of our knowledge, this is the first exact approach for the early/tardy scheduling problem with release dates and no unforced idle time.scheduling, early/tardy, release dates, lower bounds, branch-and-bound

Improved Lower Bounds for the Early/Tardy Scheduling Problem with No Idle Time

In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. Two of the lower bounds previously developed for this problem are based on lagrangean relaxation and the multiplier adjustment method, and require an initial sequence. We investigate the sensitivity of the lower bounds to the initial sequence, and experiment with di?erent dispatch rules and some dominance conditions. The computational results show that it is possible to obtain improved lower bounds by using a better initial sequence. The lower bounds are also incorporated in a branch-and-bound algorithm, and the computational tests show that one of the new lower bounds has the best performance for larger instances.scheduling, early/tardy, lower bound