MGD Dirac Stars

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MGD: the Mouse Genome Database

The Mouse Genome Database (MGD) (http://www.informatics.jax.org) one component of a community database resource for the laboratory mouse, a key model organism for interpreting the human genome and for understanding human biology. MGD strives to provide an extensively integrated information resource with experimental details annotated from both literature and on-line genomic data sources. MGD cu...

متن کامل

Synthesis and crystal structures of Cs MgD and Cs MgD 2 4 3 5

The title compounds were prepared by sintering stoichiometric mixtures of the binary deuterides in an autoclave under 65 bar pressure at 625 K. Neutron powder diffraction reveals a b-K SO type structure for Cs MgD (space group Pnma, a58.5988(4), b56.6234(3), 2 4 2 4 ˚ ˚ c511.5988(5) A) and a Cs CoCl type structure for Cs MgD (space group I4/mcm, a58.4022(2), c512.6951(4) A). In both deuterides ...

متن کامل

dirac structures

in this paper we introduce the concept of dirac structures on (hermitian) modules and vectorbundles and deduce some of their properties. among other things we prove that there is a one to onecorrespondence between the set of all dirac structures on a (hermitian) module and the group of allautomorphisms of the module. this correspondence enables us to represent dirac structures on (hermitian)mod...

متن کامل

SADDLE POINT VARIATIONAL METHOD FOR DIRAC CONFINEMENT

A saddle point variational (SPV ) method was applied to the Dirac equation as an example of a fully relativistic equation with both negative and positive energy solutions. The effect of the negative energy states was mitigated by maximizing the energy with respect to a relevant parameter while at the same time minimizing it with respect to another parameter in the wave function. The Cornell pot...

متن کامل

Unweighted p-center problem on extended stars

An extended star is a tree which has only one vertex with degree larger than two. The -center problem in a graph  asks to find a subset  of the vertices of  of cardinality  such that the maximum weighted distances from  to all vertices is minimized. In this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2020

ISSN: 2073-8994

DOI: 10.3390/sym12040508