output
19962026
most citedAncient human genomes suggest three ancestral populations for present-day Europeans

1.5k citations

Showing 2009Show all

13 papers · 1 filter

quant-ph2009★ 8 cited

Qubit transfer between photons at telecom and visible wavelengths in a slow-light atomic medium

A. Gogyan

We propose a method that enables efficient conversion of quantum information frequency between different regions of spectrum of light based on recently demonstrated strong parametr…

quant-ph2009★ 16 cited

Entanglement-preserving frequency conversion in cold atoms

A. Gogyan, Yu. Malakyan

We propose a method that enables efficient frequency conversion of quantum information based on recently demonstrated strong parametric coupling between two single-photon pulses pr…

quant-ph2009★ 8 cited

Creation of a Photonic Time-bin Qubit via Parametric Interaction of Photons in a Driven Resonant Medium

N. Sisakyan, Yu. Malakyan

A novel method of preparing a single photon in temporally-delocalized entangled modes is proposed and analyzed. We show that two single-photon pulses propagating in a driven nonabs…

cs.DM2009

A note on upper bounds for the maximum span in interval edge colorings of graphs

R. R. Kamalian, P. A. Petrosyan

An edge coloring of a graph with colors is called an interval -coloring if for each there is at least one edge of colored by , the c…

cs.DM2009

Interval edge colorings of some products of graphs

Petros A. Petrosyan

An edge coloring of a graph with colors is called an interval -coloring if for each there is at least one edge of colored by ,…

math-ph2009★ 15 cited

Incomplete beta-function expansions of the solutions to the confluent Heun equation

Artur Ishkhanyan

Several expansions of the solutions to the confluent Heun equation in terms of incomplete Beta functions are constructed. A new type of expansion involving certain combinations of…

math-ph2009★ 41 cited

New solutions of Heun general equation

Artur Ishkhanyan, Kalle-Antti Suominen

We show that in four particular cases the derivative of the solution of Heun general equation can be expressed in terms of a solution to another Heun equation. Starting from this p…

cs.DM2009★ 13 cited

On disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs

Davit Aslanyan, Vahan V. Mkrtchyan, Samvel S. Petrosyan +1

We show that any factor of a cubic graph can be extended to a maximum edge-colorable subgraph. We also show that the sum of sizes of maximum and edge-colorable sub…

nucl-ex2009★ 1 cited

Fragmentation of relativistic nuclei in peripheral interactions in nuclear track emulsion

D. A. Artemenkov, V. Bradnova, M. M. Chernyavsky +19

The technique of nuclear track emulsions is used to explore the fragmentation of light relativistic nuclei down to the most peripheral interactions - nuclear "white" stars. A compl…

physics.optics2009★ 43 cited

Electromagnetically Induced Transparency versus Nonlinear Faraday Effect. Coherent Control of the Light Beam Polarization

R. Drampyan, S. Pustelny, W. Gawlik

We report on experimental and theoretical study of the nonlinear Faraday effect under conditions of electromagnetically induced transparency at the 5$S_{1/2} \to 5P_{3/2} \to 5D_{5…

physics.atom-ph2009★ 90 cited

Enhanced electric field sensitivity of rf-dressed Rydberg dark states

M. G. Bason, M. Tanasittikosol, A. Sargsyan +4

The formation of rf-dressed Rydberg dark states in thermal Rb vapour is demonstrated. It is shown that such states exhibit enhanced sensitivity to dc electric fields compared to th…

quant-ph2009★ 8 cited

Confinement limit of Dirac particles in scalar 1D potentials

R. G. Unanyan, J. Otterbach, M. Fleischhauer

We present a general proof that Dirac particles cannot be localized below their Compton length by symmetric but otherwise arbitrary scalar potentials. This proof does not invoke th…

cs.DM2009★ 1 cited

On upper bounds for parameters related to construction of special maximum matchings

Artur Khojabaghyan, Vahan V. Mkrtchyan

For a graph let and denote the size of the largest and smallest maximum matching of a graph obtained from by removing a maximum matching of . We show that…