Surface spectral function in the superconducting state of a topological insulator

We discuss the surface spectral function of superconductors realized from a topological insulator, such as the copper-intercalated Bi$_{2}$Se$_{3}$. These functions are calculated by projecting bulk states to the surface for two different models proposed previously for the topological insulator. Dependence of the surface spectra on the symmetry of the bulk pairing order parameter is discussed with particular emphasis on the odd-parity pairing. Exotic spectra like an Andreev bound state connected to the topological surface states are presented.Comment: 12 pages, 9 figures, 1 tabl

Relativistic DNLS and Kaup-Newell Hierarchy

By the recursion operator of the Kaup-Newell hierarchy we construct the relativistic derivative NLS (RDNLS) equation and the corresponding Lax pair. In the nonrelativistic limit $c \rightarrow \infty$ it reduces to DNLS equation and preserves integrability at any order of relativistic corrections. The compact explicit representation of the linear problem for this equation becomes possible due to notions of the $q$-calculus with two bases, one of which is the recursion operator, and another one is the spectral parameter

Bandwidth theorem for random graphs

A graph $G$ is said to have \textit{bandwidth} at most $b$, if there exists a labeling of the vertices by $1,2,..., n$, so that $|i - j| \leq b$ whenever $\{i,j\}$ is an edge of $G$. Recently, B\"{o}ttcher, Schacht, and Taraz verified a conjecture of Bollob\'{a}s and Koml\'{o}s which says that for every positive $r,\Delta,\gamma$, there exists $\beta$ such that if $H$ is an $n$-vertex $r$-chromatic graph with maximum degree at most $\Delta$ which has bandwidth at most $\beta n$, then any graph $G$ on $n$ vertices with minimum degree at least $(1 - 1/r + \gamma)n$ contains a copy of $H$ for large enough $n$. In this paper, we extend this theorem to dense random graphs. For bipartite $H$, this answers an open question of B\"{o}ttcher, Kohayakawa, and Taraz. It appears that for non-bipartite $H$ the direct extension is not possible, and one needs in addition that some vertices of $H$ have independent neighborhoods. We also obtain an asymptotically tight bound for the maximum number of vertex disjoint copies of a fixed $r$-chromatic graph $H_0$ which one can find in a spanning subgraph of $G(n,p)$ with minimum degree $(1-1/r + \gamma)np$.Comment: 29 pages, 3 figure

Efficient β-cell regeneration by a combination of neogenesis and replication following β-cell ablation and reversal of pancreatic duct ligation.

Achieving efficient β-cell regeneration is a major goal of diabetes research. Previously, we found that a combination of β-cell ablation and pancreatic duct ligation led to β-cell regeneration by direct conversion from α-cells. Here, we studied the effect of surgical reversal of the duct ligation, finding that there was a wave of β-cell replication following reversal. The combination of β-cell neogenesis prior to reversal of the duct ligation and β-cell replication following reversal resulted in efficient β-cell regeneration and eventual recovery of function. This provides an important proof of principle that efficient β-cell regeneration is possible, even from a starting point of profound β-cell ablation. This has important implications for efforts to promote β-cell regeneration