K-theory and Ramond-Ramond charge

We discuss the relation between the Ramond-Ramond charges of D-branes and the topology of Chan-Paton vector bundles. We show that a topologically nontrivial normal bundle induces RR charge and that the result fits in perfectly with the proposal that D-brane charge is the topology of the Chan-Paton bundle, regarded as an element of K-theory.Comment: 8 pages, harvmac. Partial retraction of the partial retraction, as explained in note adde

Results of the photometry of the spotted dM1-2e star EY Draconis

We have observed EY Draconis with the 24`` telescope of Konkoly Observatory in Budapest for 64 nights. In the first obse rving season the star produced a stable light curve for more than 60 rotation periods, however, the light curves observe d in the next season and the spot modelling show clear evidence of the evolution of the spotted stellar surface. The chan ges of the maximum brightness level suggests the existence of a longer period of about 300 days, which seems to be confir med by the ROTSE archival data.Comment: 4 pages, 7 figures with 12 image files, N+N+N conference, accepted for publication in A

Proteomic analyses of native brain KV4.2 channel complexes

Somatodendritic A-type (I(A)) voltage-gated K(+) (K(V)) channels are key regulators of neuronal excitability, functioning to control action potential waveforms, repetitive firing and the responses to synaptic inputs. Rapidly activating and inactivating somatodendritic I(A) channels are encoded by K(V)4 α subunits and accumulating evidence suggests that these channels function as components of macromolecular protein complexes. Mass spectrometry (MS)-based proteomic approaches were developed and exploited here to identify potential components and regulators of native brain K(V)4.2-encoded I(A) channel complexes. Using anti-K(V)4.2 specific antibodies, K(V)4.2 channel complexes were immunoprecipitated from adult wild type mouse brain. Parallel control experiments were performed on brain samples isolated from (K(V)4.2(−/−)) mice harboring a targeted disruption of the KCND2 (K(V)4.2) locus. Three proteomic strategies were employed: an in-gel approach, coupled to one-dimensional liquid chromatography-tandem MS (1D-LC-MS/MS), and two in-solution approaches, followed by 1D-or 2D-LC-MS/MS. The targeted in-gel 1D-LC-MS/MS analyses demonstrated the presence of the K(V)4 α subunits (K(V)4.2, K(V)4.3 and K(V)4.1) and the K(V)4 accessory, KChIP (KChIPI-4) and DPP (DPP6 and 10), proteins in native brain K(V)4.2 channel complexes. The more comprehensive, in-solution approach, coupled to 2D-LC-MS/MS, also called Multidimensional Protein Identification Technology (MudPIT), revealed that additional regulatory proteins, including the K(V) channel accessory subunit K(V)β1, are also components of native brain K(V)4.2 channel complexes. Additional biochemical and functional approaches will be required to elucidate the physiological roles of these newly identified K(V)4 interacting proteins

On Deterministic Linearizable Set Agreement Objects

A recent work showed that, for all n and k, there is a linearizable (n,k)-set agreement object O_L that is equivalent to the (n,k)-set agreement task [David Yu Cheng Chan et al., 2017]: given O_L, it is possible to solve the (n,k)-set agreement task, and given any algorithm that solves the (n,k)-set agreement task (and registers), it is possible to implement O_L. This linearizable object O_L, however, is not deterministic. It turns out that there is also a deterministic (n,k)-set agreement object O_D that is equivalent to the (n,k)-set agreement task, but this deterministic object O_D is not linearizable. This raises the question whether there exists a deterministic and linearizable (n,k)-set agreement object that is equivalent to the (n,k)-set agreement task. Here we show that in general the answer is no: specifically, we prove that for all n ? 4, every deterministic linearizable (n,2)-set agreement object is strictly stronger than the (n,2)-set agreement task. We prove this by showing that, for all n ? 4, every deterministic and linearizable (n,2)-set agreement object (together with registers) can be used to solve 2-consensus, whereas it is known that the (n,2)-set agreement task cannot do so. For a natural subset of (n,2)-set agreement objects, we prove that this result holds even for n = 3