Staurosira magallanesica, a replacement name for Staurosira patagonica

Staurosira patagonica M.L.Garcia, Maidana, Ector & E.Morales described a new species found in material of Maar Magallanes, Patagonia, Argentina and other lakes in southern Patagonia. This new species was analysed in detail by light and electron microscopy and a comprehensive description is given in Garcia et al. (2017: 107, 114, figs 2-45). However, this name is a later homonym of Staurosira patagonica Cleve, 1882. If we compare our species to Cleve’s illustration (Cleve 1882: pl. 16: fig. 13), we can easily differentiate the two by their general valve outline and morphometric data. As pointed out by Garcia et al. (2017), re-examination of the type material of members of the Fragilariaceae is needed to confirm identities, establish taxonomic boundaries and to facilitate identification, and this is also the case with Staurosira patagonica Cleve. A new name is, however, required for Staurosira patagonica M.L.Garcia, Maidana, Ector & E.Morales as it is an illegitimate name: Staurosira magallanesica M.L.Garcia, Maidana, Ector & E.Morales nom. nov. Replaced synonym: Staurosira patagonica M.L.Garcia, Maidana, Ector & E.Morales Nova Hedwigia, Beiheft 146: 107, 114, figs 2-45, 2017, nom illeg., non Staurosira patagonica Cleve 1882 Öfversigt af Kongliga Svenska Vetenskaps-Akademiens Förhandlingar 38(10): 13, pl. 16: fig. 13, 1882 ‘1881’. Etymology: we have derived the specific epithet from the name of the paleolake Maar Magallanes where this new species was found for the first time by N.I. Maidana (Maidana & Corbella 1997).Fil: García, María Luján. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Biodiversidad y Biología Experimental; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Biodiversidad y Biología Experimental y Aplicada. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Biodiversidad y Biología Experimental y Aplicada; ArgentinaFil: Maidana, Nora Irene. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Biodiversidad y Biología Experimental; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Biodiversidad y Biología Experimental y Aplicada. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Biodiversidad y Biología Experimental y Aplicada; ArgentinaFil: Ector, Luc. Luxembourg Institute of Science and Technology; LuxemburgoFil: Morales, E. A.. Universidade de Évora; Portuga

A quantum protocol to win the graph colouring game on all Hadamard graphs

This paper deals with graph colouring games, an example of pseudo-telepathy, in which two provers can convince a verifier that a graph $G$ is $c$-colourable where $c$ is less than the chromatic number of the graph. They win the game if they convince the verifier. It is known that the players cannot win if they share only classical information, but they can win in some cases by sharing entanglement. The smallest known graph where the players win in the quantum setting, but not in the classical setting, was found by Galliard, Tapp and Wolf and has 32,768 vertices. It is a connected component of the Hadamard graph $G_N$ with $N=c=16$. Their protocol applies only to Hadamard graphs where $N$ is a power of 2. We propose a protocol that applies to all Hadamard graphs. Combined with a result of Frankl, this shows that the players can win on any induced subgraph of $G_{12}$ having 1609 vertices, with $c=12$. Combined with a result of Frankl and Rodl, our result shows that all sufficiently large Hadamard graphs yield pseudo-telepathy games.Comment: 5pag

An Introduction to Quantum Complexity Theory

We give a basic overview of computational complexity, query complexity, and communication complexity, with quantum information incorporated into each of these scenarios. The aim is to provide simple but clear definitions, and to highlight the interplay between the three scenarios and currently-known quantum algorithms.Comment: 28 pages, LaTeX, 11 figures within the text, to appear in "Collected Papers on Quantum Computation and Quantum Information Theory", edited by C. Macchiavello, G.M. Palma, and A. Zeilinger (World Scientific

Sequence of a putative human housekeeping gene (HK33) localized on chromosome 1

A gene (X33) localized on human chromosome 1 has been detected by crossreaction of its fusion protein with a monospecific antiserum directed against human vitamin-D-binding protein (hDBP; group-specific component). Its cDNA sequence analysis showed no evident homologies neither to the sequence encoding hDBP nor to any other sequence. The largest cDNA clone of 3.2 kb includes a 897-bp coding region and a large 3’ untranslated region with at least four polyadenylation sites. Further cDNA amplification using PCR demonstrated a total cDNA length of approx. 3.7 kb. Northern blot analysis revealed signals at about 2.2-2.5 kb and 4.0 kb, the shorter transcripts representing mRNAs using one of the two polyadenylation sites at about 2.0 kb. Synthesis of the 299-amino-acid polypeptide (33 kDa) in the bacterial host, with subsequent Western blot analysis, verified the sequence-specific recognition by the hDBPspecific antiserum. The search of protein databanks revealed no homology of HK33 to any known sequence. Since the gene is transcribed in all cells and tissues tested so far, it is a strong candidate for another housekeeping gene

Does Suppositional Reasoning Solve the Bootstrapping Problem?

In a 2002 article Stewart Cohen advances the “bootstrapping problem” for what he calls “basic justification theories,” and in a 2010 followup he offers a solution to the problem, exploiting the idea that suppositional reasoning may be used with defeasible as well as with deductive inference rules. To curtail the form of bootstrapping permitted by basic justification theories, Cohen insists that subjects must know their perceptual faculties are reliable before perception can give them knowledge. But how is such knowledge of reliability to be acquired if not through perception itself? Cohen proposes that such knowledge may be acquired a priori through suppositional reasoning. I argue that his strategy runs afoul of a plausible view about how epistemic principles function; in brief, I argue that one must actually satisfy the antecedent of an epistemic principle, not merely suppose that one does, to acquire any justification by its means – even justification for a merely conditional proposition

Simulatings POVMs on EPR pairs with six bits of expected communication

We present a classical protocol for simulating correlations obtained by bipartite POVMs on an EPR pair. The protocol uses shared random variables (also known as local hidden variables) augmented by six bits of expected communication.Comment: 3 pages, short not

Substituting a qubit for an arbitrarily large number of classical bits

We show that a qubit can be used to substitute for an arbitrarily large number of classical bits. We consider a physical system S interacting locally with a classical field phi(x) as it travels directly from point A to point B. The field has the property that its integrated value is an integer multiple of some constant. The problem is to determine whether the integer is odd or even. This task can be performed perfectly if S is a qubit. On the otherhand, if S is a classical system then we show that it must carry an arbitrarily large amount of classical information. We identify the physical reason for such a huge quantum advantage, and show that it also implies a large difference between the size of quantum and classical memories necessary for some computations. We also present a simple proof that no finite amount of one-way classical communication can perfectly simulate the effect of quantum entanglement.Comment: 8 pages, LaTeX, no figures. v2: added result on entanglement simulation with classical communication; v3: minor correction to main proof, change of title, added referenc