ﻻ يوجد ملخص باللغة العربية
We present a new estimate of the lithium abundance in the atmosphere of the brown dwarf LP 944-20. Our analysis is based on a self-consistent analysis of low, intermediate and high resolution optical and near-infrared spectra. We obtain log N(Li) = 3.25 +/-0.25 using fits of our synthetic spectra to the Li I resonance line doublet profiles observed with VLT/UVES and AAT/SPIRAL. This lithium abundance is over two orders of magnitude larger than previous estimates in the literature. In order to obtain good fits of the resonance lines of K I and Rb I and better fits to the TiO molecular absorption around the Li I resonance line, we invoke a semi-empirical model atmosphere with the dusty clouds located above the photosphere. The lithium abundance, however, is not changed by the effects of the dusty clouds. We discuss the implications of our estimate of the lithium abundance in LP 944-20 for the understanding of the properties of this benchmark brown dwarf.
We investigate perfect codes in $mathbb{Z}^n$ under the $ell_p$ metric. Upper bounds for the packing radius $r$ of a linear perfect code, in terms of the metric parameter $p$ and the dimension $n$ are derived. For $p = 2$ and $n = 2, 3$, we determine
Using the high-resolution near-infrared adaptive optics imaging from the NaCo instrument at the Very Large Telescope, we report the discovery of a new binary companion to the M-dwarf LP 1033-31 and also confirm the binarity of LP 877-72. We have char
A porous electrode resulting from unregulated Li growth is the major cause of the low Coulombic efficiency and potential safety hazards of rechargeable Li metal batteries. Strategies aiming to achieve large granular Li deposits have been extensively
We present and evaluate a compiler from Prolog (and extensions) to JavaScript which makes it possible to use (constraint) logic programming to develop the client side of web applications while being compliant with current industry standards. Targetin
We prove super-polynomial lower bounds on the size of linear programming relaxations for approximati