Gian‐Carlo Wick

نویسندگان

چکیده

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

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

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

منابع مشابه

Wick Calculus

In quantum field theory, physicists routinely use " normal ordering " of operators, which just amounts to shuffling all creation operators to the left. Potentially confusing , then, is the occurrence in the literature of normal-ordered functions, sometimes called " Wick transforms ". We aim to introduce the reader to some basic results and ideas around this theme, if not the mathematical subtle...

متن کامل

Physics: Nichols and Wick

shorter wave-lengths of the point where a temperature increase had very little effect (actually a small decrease in absorption, as would be expected) Ribaud found that the absorption began again to increase with temperature. This evidently is the continuous absorption due to the higher vibrational states. For photochemical reactions the important consequence is that in such molecules one must e...

متن کامل

Lee Wick Dark Energy

We consider the cosmological application of Lee-Wick theory where a field has a higher derivative kinetic operators. The higher derivative term can be eliminated by introducing a set of auxiliary fields. We investigate the cosmological evolutions of these fields as a candidate of dark energy. This model has the same structure as so called “quintom’ model except the form of potentials and the si...

متن کامل

A unifying look at the Apostolico-Giancarlo string-matching algorithm

String matching is the problem of finding all the occurrences of a pattern in a text. We present a new method to compute the combinatorial shift function (“matching shift”) of the well-known Boyer–Moore string matching algorithm. This method implies the computation of the length of the longest suffixes of the pattern ending at each position in this pattern. These values constituted an extra-pre...

متن کامل

Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm

The Apostolico-Giancarlo string-matching algorithm is analyzed precisely. We give a tight upper bound of 3 2 n text characters comparisons when searching for a pattern in a text of length n. We exhibit a family of patterns and texts reaching this bound. We also provide a slightly improved version of the algorithm.

متن کامل

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


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

ژورنال

عنوان ژورنال: Physics Today

سال: 1993

ISSN: 0031-9228,1945-0699

DOI: 10.1063/1.2808795