Topologically confined states at corrugations of gated bilayer graphene

We investigate the electronic and transport properties of gated bilayer graphene with one corrugated layer, which results in a stacking AB/BA boundary. When a gate voltage is applied to one layer, topologically protected gap states appear at the corrugation, which reveal as robust transport channels along the stacking boundary. With increasing size of the corrugation, more localized, quantum-well-like states emerge. These finite-size states are also conductive along the fold, but in contrast to the stacking boundary states, which are gapless, they present a gap. We have also studied periodic corrugations in bilayer graphene; our findings show that such corrugations between AB- and BA-stacked regions behave as conducting channels that can be easily identified by their shape

Interface States in Carbon Nanotube Junctions: Rolling up graphene

We study the origin of interface states in carbon nanotube intramolecular junctions between achiral tubes. By applying the Born-von Karman boundary condition to an interface between armchair- and zigzag-terminated graphene layers, we are able to explain their number and energies. We show that these interface states, costumarily attributed to the presence of topological defects, are actually related to zigzag edge states, as those of graphene zigzag nanoribbons. Spatial localization of interface states is seen to vary greatly, and may extend appreciably into either side of the junction. Our results give an alternative explanation to the unusual decay length measured for interface states of semiconductor nanotube junctions, and could be further tested by local probe spectroscopies

Probing prothrombin structure by limited proteolysis

Prothrombin, or coagulation factor II, is a multidomain zymogen precursor of thrombin that undergoes an allosteric equilibrium between two alternative conformations, open and closed, that react differently with the physiological activator prothrombinase. Specifically, the dominant closed form promotes cleavage at R320 and initiates activation along the meizothrombin pathway, whilst the open form promotes cleavage at R271 and initiates activation along the alternative prethrombin-2 pathway. Here we report how key structural features of prothrombin can be monitored by limited proteolysis with chymotrypsin that attacks W468 in the flexible autolysis loop of the protease domain in the open but not the closed form. Perturbation of prothrombin by selective removal of its constituent Gla domain, kringles and linkers reveals their long-range communication and supports a scenario where stabilization of the open form switches the pathway of activation from meizothrombin to prethrombin-2. We also identify R296 in the A chain of the protease domain as a critical link between the allosteric open-closed equilibrium and exposure of the sites of cleavage at R271 and R320. These findings reveal important new details on the molecular basis of prothrombin functio

On Byzantine Broadcast in Loosely Connected Networks

We consider the problem of reliably broadcasting information in a multihop asynchronous network that is subject to Byzantine failures. Most existing approaches give conditions for perfect reliable broadcast (all correct nodes deliver the authentic message and nothing else), but they require a highly connected network. An approach giving only probabilistic guarantees (correct nodes deliver the authentic message with high probability) was recently proposed for loosely connected networks, such as grids and tori. Yet, the proposed solution requires a specific initialization (that includes global knowledge) of each node, which may be difficult or impossible to guarantee in self-organizing networks - for instance, a wireless sensor network, especially if they are prone to Byzantine failures. In this paper, we propose a new protocol offering guarantees for loosely connected networks that does not require such global knowledge dependent initialization. In more details, we give a methodology to determine whether a set of nodes will always deliver the authentic message, in any execution. Then, we give conditions for perfect reliable broadcast in a torus network. Finally, we provide experimental evaluation for our solution, and determine the number of randomly distributed Byzantine failures than can be tolerated, for a given correct broadcast probability.Comment: 1

A Scalable Byzantine Grid

Modern networks assemble an ever growing number of nodes. However, it remains difficult to increase the number of channels per node, thus the maximal degree of the network may be bounded. This is typically the case in grid topology networks, where each node has at most four neighbors. In this paper, we address the following issue: if each node is likely to fail in an unpredictable manner, how can we preserve some global reliability guarantees when the number of nodes keeps increasing unboundedly ? To be more specific, we consider the problem or reliably broadcasting information on an asynchronous grid in the presence of Byzantine failures -- that is, some nodes may have an arbitrary and potentially malicious behavior. Our requirement is that a constant fraction of correct nodes remain able to achieve reliable communication. Existing solutions can only tolerate a fixed number of Byzantine failures if they adopt a worst-case placement scheme. Besides, if we assume a constant Byzantine ratio (each node has the same probability to be Byzantine), the probability to have a fatal placement approaches 1 when the number of nodes increases, and reliability guarantees collapse. In this paper, we propose the first broadcast protocol that overcomes these difficulties. First, the number of Byzantine failures that can be tolerated (if they adopt the worst-case placement) now increases with the number of nodes. Second, we are able to tolerate a constant Byzantine ratio, however large the grid may be. In other words, the grid becomes scalable. This result has important security applications in ultra-large networks, where each node has a given probability to misbehave.Comment: 17 page

Proper acceleration, geometric tachyon and dynamics of a fundamental string near Dpp branes

We present a detailed analysis of our recent observation that the origin of the geometric tachyon, which arises when a D$p$-brane propagates in the vicinity of a stack of coincident NS5-branes, is due to the proper acceleration generated by the background dilaton field. We show that when a fundamental string (F-string), described by the Nambu-Goto action, is moving in the background of a stack of coincident D$p$-branes, the geometric tachyon mode can also appear since the overall conformal mode of the induced metric for the string can act as a source for proper acceleration. We also studied the detailed dynamics of the F-string as well as the instability by mapping the Nambu-Goto action of the F-string to the tachyon effective action of the non-BPS D-string. We qualitatively argue that the condensation of the geometric tachyon is responsible for the (F,D$p$) bound state formation.Comment: 26 pages, v2: added references, v3: one ref. updated, to appear in Class. and Quant. Gravit

Gathering in Dynamic Rings

The gathering problem requires a set of mobile agents, arbitrarily positioned at different nodes of a network to group within finite time at the same location, not fixed in advanced. The extensive existing literature on this problem shares the same fundamental assumption: the topological structure does not change during the rendezvous or the gathering; this is true also for those investigations that consider faulty nodes. In other words, they only consider static graphs. In this paper we start the investigation of gathering in dynamic graphs, that is networks where the topology changes continuously and at unpredictable locations. We study the feasibility of gathering mobile agents, identical and without explicit communication capabilities, in a dynamic ring of anonymous nodes; the class of dynamics we consider is the classic 1-interval-connectivity. We focus on the impact that factors such as chirality (i.e., a common sense of orientation) and cross detection (i.e., the ability to detect, when traversing an edge, whether some agent is traversing it in the other direction), have on the solvability of the problem. We provide a complete characterization of the classes of initial configurations from which the gathering problem is solvable in presence and in absence of cross detection and of chirality. The feasibility results of the characterization are all constructive: we provide distributed algorithms that allow the agents to gather. In particular, the protocols for gathering with cross detection are time optimal. We also show that cross detection is a powerful computational element. We prove that, without chirality, knowledge of the ring size is strictly more powerful than knowledge of the number of agents; on the other hand, with chirality, knowledge of n can be substituted by knowledge of k, yielding the same classes of feasible initial configurations

D-brane orbiting NS5-branes

We study real time dynamics of a Dp-brane orbiting a stack of NS5-branes. It is generally known that a BPS D-brane moving in the vicinity of NS5-branes becomes unstable due to the presence of tachyonic degree of freedom induced on the D-brane. Indeed, the D-brane necessarily falls into the fivebranes due to gravitational attraction and eventually collapses into a pressureless fluid. Such a decay of the D-brane is known to be closely related to the rolling tachyon problem. In this paper we show that in special cases the decay of D-brane caused by gravitational attraction can be avoided. Namely for certain values of energy and angular momentum the D-brane orbits around the fivebranes, maintaining certain distance from the fivebranes all the time, and the process of tachyon condensation is suppressed. We show that the tachyonic degree of freedom induced on such a D-brane really disappears and the brane returns to a stable D-brane.Comment: 12 pages, latex, added referenc

Effective descriptions of branes on non-geometric tori

We investigate the low-energy effective description of non-geometric compactifications constructed by T-dualizing two or three of the directions of a T^3 with non-vanishing H-flux. Our approach is to introduce a D3-brane in these geometries and to take an appropriate decoupling limit. In the case of two T-dualities, we find at low energies a non-commutative T^2 fibered non-trivially over an S^1. In the UV this theory is still decoupled from gravity, but is dual to a little string theory with flavor. For the case of three T-dualities, we do not find a sensible decoupling limit, casting doubt on this geometry as a low-energy effective notion in critical string theory. However, by studying a topological toy model in this background, we find a non-associative geometry similar to one found by Bouwknegt, Hannabuss, and Mathai.Comment: 22 pages, 4 figures, references adde

Spectral compression of single photons

Photons are critical to quantum technologies since they can be used for virtually all quantum information tasks: in quantum metrology, as the information carrier in photonic quantum computation, as a mediator in hybrid systems, and to establish long distance networks. The physical characteristics of photons in these applications differ drastically; spectral bandwidths span 12 orders of magnitude from 50 THz for quantum-optical coherence tomography to 50 Hz for certain quantum memories. Combining these technologies requires coherent interfaces that reversibly map centre frequencies and bandwidths of photons to avoid excessive loss. Here we demonstrate bandwidth compression of single photons by a factor 40 and tunability over a range 70 times that bandwidth via sum-frequency generation with chirped laser pulses. This constitutes a time-to-frequency interface for light capable of converting time-bin to colour entanglement and enables ultrafast timing measurements. It is a step toward arbitrary waveform generation for single and entangled photons.Comment: 6 pages (4 figures) + 6 pages (3 figures