نتایج جستجو برای: incompressibility

تعداد نتایج: 967  

2001
Masahiro Nakano

Abstract The role of effective hadron masses and effective couplings in nuclear matter is studied using a generalized effective Lagrangian for σ-ω model. A simple relation among the effective masses, the effective couplings and the incompressibility K is derived. Using the relation, it is found that the effective repulsive and the effective attractive forces are almost canceled to each other at...

1994
Hiroo Azuma

We investigate the W∞ algebra in the integer quantum Hall effects. Defining the simplest vacuum, the Dirac sea, we evaluate the central extension for this algebra. A new algebra which contains the central extension is called the W1+∞ algebra. We show that this W1+∞ algebra is an origin of the KacMoody algebra which determines the behavior of edge states of the system. We discuss the relation be...

2007
Alexander Shen

This document contains lecture notes of an introductory course on Kolmogorov complexity. They cover basic notions of algorithmic information theory: Kolmogorov complexity (plain, conditional, prefix), notion of randomness (Martin-Löf randomness, Mises–Church randomness), Solomonoff universal a priori probability and their properties (symmetry of information, connection between a priori probabil...

2000
A. B. Larionov W. Cassing C. Greiner U. Mosel

We perform a systematic study of in-plane and out-of-plane proton and neutron flow from nucleus-nucleus collisions within the BUU transport approach employing different parameter sets for the mean-field potentials that can be characterized by the nuclear incompressibility and the stiffness of the momentum-dependent potential. We find that a simultaneous description of the experimental data from...

2016
Nicolas Rougerie Jakob Yngvason

We consider fractional quantum Hall states built on Laughlin’s original Nbody wave-functions, i.e., they are of the form holomorphic × gaussian and vanish when two particles come close, with a given polynomial rate. Such states appear naturally when looking for the ground state of 2D particles in strong magnetic fields, interacting via repulsive forces and subject to an external potential due t...

Journal: :Inf. Process. Lett. 2009
Edgar G. Daylight Wouter M. Koolen Paul M. B. Vitányi

For every total recursive time bound t, a constant fraction of all compressible (low Kolmogorov complexity) strings is t-bounded incompressible (high time-bounded Kolmogorov complexity); there are uncountably many infinite sequences of which every initial segment of length n is compressible to log n yet t-bounded incompressible below 1 4n− log n; and there are countable infinitely many recursiv...

1999
Nguyen Van Giai Zhongyu Ma

Using effective lagrangians which correspond to a wide range of values for K1 relativistic RPA calculations are performed for monopole and dipole compression modes in nuclei. It is found that Dirac sea states have an important effect on compression mode energies. Including these negative energy states into relativistic RPA brings the results into general agreement with those of time-dependent r...

2003
Nguyen Van Giai

The status of the theoretical research on the compressional modes of finite nuclei and the incompressibility K∞ of nuclear matter, is reviewed. It is argued that the recent experimental data on the Isoscalar Giant Monopole Resonance (ISGMR) allow extracting the value of K∞ with an uncertainity of about ± 12 MeV. Non-relativistic (Skyrme, Gogny) and relativistic mean field models predict for K∞ ...

Journal: :Physical review. E, Statistical, nonlinear, and soft matter physics 2011
Rei Kurita Eric R Weeks

We use confocal microscopy to study the compressibility of a random-close-packed sample of colloidal particles. To do this, we introduce an algorithm to estimate the size of each particle. Taking into account their sizes, we compute the compressibility of the sample as a function of wave vector q, and find that this compressibility vanishes linearly as q→0, showing that the packing structure is...

1997
Vasileios Megalooikonomou

We compare the incompressibility method of Kolmogorov complexity that is used in formal proofs of mathematical and computational results with more traditional methods such as proofs by counting, proofs by probabilistic arguments and proofs by pumping lemmas for formal languages. We consider applications of Kolmogorov complexity in several diierent areas such as lower bounds, average case analys...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید