B. Thaller, The Dirac Equation, Springer--Verlag, Berlin, 1992  Home/Search   Document Not in Database   Summary   Related Articles   Check

....a momentum, whose direction lies in that same solid angle. Moreover, the probability, that the particle will cross the detector within a certain area is given by the integral of the flux over that area and time. This has been proven for Schrodinger evolutions in great generality, see for instance [15, 2, 1, 16, 12, 6]. We consider here wavefunctions # t which satisfy the Dirac equation (conveniently setting c = # = 1) i ## t # l # l # t A # t #m# t H# t (1) where # l = # 0 # l # l 0 # ; # = # # ; l = 1, 2, 3 (2) # l being the Pauli matrices: # 1 = # # ; # 2 = # 0 1 # ; # ....

Thaller, B.:The Dirac equation, Springer Verlag, Berlin (1992). 64

.... in Research and Practice After the short introduction, we now take a look at this year s talks given at the 3 International Workshop on Learning Software Organizations (LSO 2001) We group the contributions according to the four steps of the basic learning cycle: Step 1: Planning LSOs In [26] Ralph Trittmann presents a framework for knowledge management, based on organization theory. The framework takes into account technical infrastructure, organizational structure, coordination, and motivation aspects. Based on this information the framework allows to compare knowledge management ....

R. Trittmann: The Organic and the Mechanistic Form of Managing Knowledge in Software Development. LNCS # 2176, Springer Verlag, 2001.

..... # n 1 grows faster than any computable function of n. Computing some initial bits of an Omega number is even more di#cult. According to Theorem 3, c.e. random reals can be coded by universal machines through their halting probabilities. How good or bad are these names In [12] see also [15, 16]) Chaitin proved the following: Theorem 5 Assume that ZFC is arithmetically sound. Then, for every universal machine U , ZFC can determine the value of only finitely many bits U . In fact one can give a bound on the number of bits U which ZFC can determine; this bound can be explicitly ....

.... More precisely, is there a bound on the set of non negative integers n such that ZFC proves a theorem of the form (1) From Theorem 5 we deduce that ZFC can prove only finitely many (true) statements of the form (1) This is Chaitin information theoretic version of Godel s incompleteness (see [15, 16]) Theorem 6 If ZFC is arithmetically sound and U is a universal machine, then almost all true statements of the form (1) are unprovable in ZFC. Again, a bound can be explicitly found, but not e#ectively computed. Of course, for every c.e. random real # we can construct a universal machine U ....

[Article contains additional citation context not shown here]

G. J. Chaitin. The Unknowable, Springer-Verlag, Singapore, 1999.

....(MLO) and non mine bottom objects (NOMBO) of similar size and shape. Our approach to the problem is motivated by the observation that echo highlights from broadband active sonars are an important perceptual cue that enable dolphins to recognize targets in challenging underwater environments [3]. Since echo returns from broadband sonar capture morphological information (including size, shape, and scattering characteristics) it should be possible to discriminate between MLO and NOMBO by analyzing the contact echo response. Successful approaches must overcome several challenges. First, ....

W.W.L. Au, The Sonar of Dolphins, Springer-Verlag, NewYork, 1993.

....that it is not governed by any law at all. There could be no principle which could in any way explain or predict the performance of such a universe. More importantly: there could be no control over events. Formally, a lawless universe can be represented by a Martin Lof Solovay Chaitin random [10, 11, 12] bit string [13, 14] This does not mean that on a local scale, say, for any finite number of phenomenologic occurrences or evolution steps, the lawless universe cannot appear to be governed by laws. Indeed, some observers embedded in a totally lawless universe [15, 16, 17, 18, 19, 2, 20] might ....

Gregory J. Chaitin. The Unknowable. Springer-Verlag, Singapore, 1999.

....as TreeViz [14] the VisDB system [17] the DeVise tool [22] Polaris [30] and SGI s MineSet [26] do handle numeric and nominal types. But these systems just assign some order to the nominal variables and treat them as ordinal types. Statistical Data Analysis packages including SAS [5] S Plus [20], XGobi [31] and Data Desk [32] do allow one to specify and manipulate the mappings from nominal to numeric, but the mappings are completely embedded within the tool and not extensible to allow for other data types. 2.2 Related Research Research on providing general visualizations for abstract ....

A. Krause and M. Olson. The Basics of S-PLUS. Springer Verlag, 3rd edition, 2002.

....Hypothesis (A) Each matrix element of V is almost everywhere (a.e. nite with respect to the three dimensional Lebesgue measure dx and the subspace j=1 [D(D j ) D(V ) is dense in HD . Under this hypothesis, HD is a symmetric operator. Detailed analysis of the Dirac operator is given in [11]. Example 2.1 A typical example for V is V em : q A with : R R an external scalar potential and A an external vector potential, where A j and are in the set loc (R ) f : R C; Borel measurable jxj R jf(x)j dx 1; 8R 0 Then D(V em ) ....

....Informal (heuristic) manupilations to obtain (4.32) are similar to the case of an abstract Dirac operator [11, p.180, Theorem 6.4] or to a case previously discussed by the present author [2, p.155, Theorem 4. 3] But, for completeness (since the assumption here is slightly di erent from those in [2, 11]) we give an outline of proof. Introducing an operator W ( z) 1 C( T 0 ( z) which is well de ned by Hypothesis (I) we have T ( z = W ( z) T 0 ( z) This implies that W ( z) is bijective and = T 0 ( z) T 0 ( z) 1 ; 4.33) S 0 ( A (B ....

B. Thaller, The Dirac Equation, Springer-Verlag, Berlin, Heidelberg, 1992. 26

....the positive spectral subspace of D. The underlying Hilbert space in which B acts is H = L ) Due to the algebraic properties of the Pauli matrices, the Dirac operator D in IR is a symmetric operator and satis es = Moreover, it has similar properties to that in IR (see [11] for example) it is a self adjoint operator in L ) with domain D(D) H ) and its spectrum is (1; m] m; 1) In particular, it is unbounded from below, so that it is dicult to de ne the ground state of atoms and molecules. In order to study the stability of relativistic systems ....

Thaller, B., The Dirac operator, Springer-Verlag, 1992.

....non portable programs. The internal program behavior is non deterministic, unlike the applications one wants to treat. Task handling incurs run time overhead. Execution times are hard to control. There are almost no generic simulation and debugging tools. Oocurretprogrammig laguages such as ADA [1] or OCCAM [31] are more elaborate. They naturally permit hierarchical and modular program development. Their tasking mechanism and communication primitives are defined at the language level and are portable. They often provide their user with interface and data manipulation facilities, allowing ....

AD A, The Programming Language ADA Reference Manual, Springer-Verlag, LNCS 155 (983).

....of G is determined by the sequence of numbers G(a n ) Proof. This follows at once from Definition 1 and Lemma 2. # Recall that an odd prime p is a Wieferich prime if (3) 2 1 (mod p See [12] for the first appearance of these numbers and their connection to Fermat s theorem, and [1] [5] for modern perspectives on the prevalence of these numbers and their history. Lemma 4. If p is an odd prime that is not a Wieferich prime, then 1 is p good. Proof. First notice that 2 1 mod p, so that the case k = 1 is immediate. We now claim that if p then p 1. ....

, The Book of Prime Number Records, Springer--Verlag, New York, 1988.

....in the non ordinary case. Let X 0 be an ordinary abelian variety in positive characteristic, and 0 a principal polarization, we write [ X 0 ; 0 ) x 2 A g;1 (F p ) Serre and Tate showed that the formal scheme (A g;1 ) x 0 has canonical coordinates , see [31] see [24] Chapter 5, see [33]. Note that the torsion points in the formal group (A g;1 ) x 0 = G m ) g(g 1) 2 correspond with the quasi canonical liftings of X 0 , i.e. the CM liftings (but End(X) need not be a maximal order in End 0 (X) End 0 (X 0 ) We pose the question whether such a canonical ....

W. Messing - The crystals associated to Barsotti-Tate groups: with applications to abelian schemes. Lect. Notes Math. 264, Springer - Verlag 1972.

....impressive visualization packages, some of which have functionality similar to that of EVEGA, but they were not suitable for the intended use. Some of the existing tools are platform dependent, such as AVS [7] and LINK [1] or network dependent, or they are not freely available, such as CATBox [2]. EVEGA was designed for use in classroom demonstrations, homework assignments, and analysis of algorithms. It can be used by students, instructors, and developers or programmers. The demarcation between these groups of users is sometimes loose. A student for example, might play the role of the ....

"CATBox - the Combinatorial Algorithm Toolbox", Springer Verlag, 2000.

....appeal to Cantor s cardinality argument that there are real functions that are not Baire. 41. See Hawkins [1975] for more on the development of Lebesgue measurability. See Oxtoby [1971] for an account of category and measure in juxtaposition. 42. See Moore [1982, 2.3] 43. See Kanamori [1994, #] for more on large cardinals. 44. Hausdor# s mathematical attitude is reflected in a remark following his explanation of cardinal number in a revised edition [1937, 5] of [1914] This formal explanation says what the cardinal numbers are supposed to do, not what they are. More precise ....

....[1967] of the independence of CH and in 1967 lecture notes eventually making their way to Bell [1985] 94. Richard Mansfield [1971] made the tree representations more explicit with a measurable cardinal. THE MATHEMATICAL DEVELOPMENT OF SET THEORY FROM CANTOR TO COHEN 57 95. See Kanamori [1994, #] for these recent developments. 96. Decades after his creation of forcing Cohenwrote (Albers AlexandersonReid [1990, 54] I regard the present solution of the [Continuum] P]roblem as very satisfactory. I think that it is the only possible solution. It gives one a feeling for what s ....

, The higher infinite II, Springer-Verlag, Berlin, to appear.

....Then e i a (x;c) P x a(x) e i a (x;c) P x a c (x) 5.15) where P x = ir x and a c (x) is the vector potential given by the transversal (Poincare) gauge relative to the point c: a c (x) Z 1 0 tb(c t(x c) dt) x c) 5. 16) Notice that a 0 (x) is the usual transversal gauge [26]: a 0 (x) Z 1 0 tb(tx)dt) x (5.17) The most interesting properties of a c (x) and ac (x; y) are given in the following: Lemma 5.2. i. ac (x; y) Z 1 0 dt Z 1 0 dssb(st(x y) s(y c) x c y c) 5.18) i.e. ac (x; y) is the ux through the triangle x c y. ii. j a c (x) ....

B. Thaller, The Dirac equation, Springer Verlag, Berlin, 1992.

....from this procedure, is de ned on the same domain as B 0 , i.e. dom[B V ] dom[B 0 ] dom[D 0 ] since V is B 0 bounded with relative bound . Moreover, B V is bounded from below by 1 0 and in particular invertible. To locate its essential spectrum we use a standard argument (see, e.g. [15]) Condition (I.9) implies that B 1 0 B 1 V is the norm limit of the operators B 1 0 B 1 RV as R tends to in nity, where R denotes a smoothed characteristic function of the set fjxj Rg: But for each R 0 we get B 1 0 B 1 RV = B 1 RV RV B 1 0 = B 1 RV V R jD 0 j 1 ....

B. Thaller. The Dirac Equation. Springer-Verlag, Heidelberg, New York, 1992.

No context found.

B. Thaller, The Dirac Equation, Springer--Verlag, Berlin, 1992

No context found.

G.J. Chaitin. The Unknowable, Springer Verlag, Singapore, 1999.

No context found.

L. Hormander: The Analysis of Linear Partial Di#erential Operators, I, Second Edition, Springer-Verlag, Berlin, 1990.

No context found.

C. CERCIGNANI: The Boltzmann Equation and Its Applications, Springer-Verlag, New York, 1988.

No context found.

. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, New York, USA.

....conditions for (1.1) are g(0)n(0, t) 0 and lim x## g(x)n(x, t) 0 t 0. 1.2) Denote the right hand side of (1. 1) by A(n) Below we shall assume that b(x) 0, g(x) and that b(x) g(x) L (R ) Defining h(x) exp b(s) g(s) ds using the machinery developed in [4] and a result of [1] we have the following proposition: Proposition 1 1. 1.1) 1.2) generates a semiflow on the space X = u C(R ) sup x#R g(x) h(x) u(x) 2. The semiflow preserves the cone of non negative functions in X. 3. There is a unique eigenvalue # 0 for which ....

....for which the operator A has a nonnegative eigenfunction y(x) furthermore y(x) is positive for all x (0, #) The key observation is that the change of variable n = hu g transforms (1.1) into a problem in which a generator of a strongly continuous semigroup is perturbed by a bounded operator. [4] treat the case of # = 2 and of cells of non zero minimal size and finite maximal size, but the arguments go through with minor changes. Positivity of y(x) for non zero x follows from the arguments of [1] for the case of constant b(x) and g(x) Note that if we let N(t) be the total cell ....

[Article contains additional citation context not shown here]

The Dynamics of Physiologically Structured Populations, J. A. J. Metz and O. Diekmann, eds. Springer-Verlag, Berlin 1986. 6

.... data So this led me to a theory of randomness based on program size complexity [1] whose main application turned out to be not in science, but in mathematics, more specifically, in meta mathematics, where it yields powerful new information theoretic versions of Godel s incompleteness theorem [2, 3, 4]. I ll discuss this in Section 3. # IBM Research Division, P. O. Box 218, Yorktown Heights, NY 10598, USA, E mail: chaitin us.ibm.com And from this new information theoretic point of view, math and physics do not seem too di#erent. In both cases understanding is compression, and is measured by ....

G. J. Chaitin, The Unknowable, Springer-Verlag, 1999.

.... data So this led me to a theory of randomness based on program size complexity [1] whose main application turned out to be not in science, but in mathematics, more specifically, in meta mathematics, where it yields powerful new information theoretic versions of Godel s incompleteness theorem [2, 3, 4]. I ll discuss this in Section 3. # IBM Research Division, P. O. Box 218, Yorktown Heights, NY 10598, USA, E mail: chaitin us.ibm.com And from this new information theoretic point of view, math and physics do not seem too di#erent. In both cases understanding is compression, and is measured by ....

G. J. Chaitin, The Unknowable, Springer-Verlag, 1999.

....is a split semisimple algebra; ii) S for all partitions of n; and, iii) e n. Note that e is equal to the characteristic of R in the case where q = 1. Consequently, as they must, these results agree with the corresponding results from the representation theory of the symmetric group (see [36] and Note 3 below) Theorem 3.39 combined with Lemma 3.35 also gives us the following combinatorial result (a more direct proof can be extracted from [35, Theorem A] 3.41 Corollary Let be a partition of n. Then is e restricted if and only if there exists an e restricted tableau. 1. ....

....is maximal such that Std( X 0 tX 1 t : tX k (disjoint union) where for i = 1; 2 : k there exists a bijection i : X i Gamma Std e ( such that [res t (k) q = res i (t) k) q for all t 2 X i and all k with 1 k n. 8. The rank of the Specht module S is explicitly known (see [36]) it is equal to n = ij where the product is over the nodes (i; j) 2 [ and h ij is the length of the (i; j)th hook (see page 55) Except in some very special cases, the dimension of D is not known. The q Schur Algebra The q Schur algebra was introduced by Dipper and James [15] who ....

, The representation theory of the symmetric groups, SLN, 682, Springer--Verlag, New York, 1978.

.... number of i s in row j of T is N i;j ( The definition of N i;j ( implies that for all i; j we have N i;j ( j Gamma1 mod 2 l(N i 1;j ( Recall that l(k) is the least integer such that k 2 l(k) By [3, Theorem 24.6] there exists a non zero T 2 Hom FSn (M [ S ) In [3], the hypothesis that T is reverse semistandard is used only to show that ker T S [ this is not needed here. 5 Gordon James and Andrew Mathas Corollary Suppose that R 6D [ Then S is reducible. Proof. By [3, Theorem 12.1] if D is a composition factor of M [ ....

, The representation theory of the symmetric groups, SLN, 682, Springer--Verlag, New York,

.... textbooks (the latter contains more advanced material) The aim of this introduction is to mention some elementary results and to put our chapter in its context not to give a historical introduction to the subject of cardinal arithmetic, for which the reader is referred to [4] and more generally [5]. A theorem of J. K onig says that if h i j i 2 Ii and h i j i 2 Ii are sequences of cardinals such that i i holds for every i 2 I , then i2I i i2I i : A theorem of Bukovsk y and of Hechler says that if is a singular cardinal and the values 2 for cardinals stabilize, ....

A. Kanamori. The Higher Innite. Springer-Verlag, 1994.

No context found.

Bernd Thaller. The Dirac equation. Springer-Verlag, Berlin, 1992.

No context found.

B. Thaller. The Dirac Equation. Springer-Verlag, Heidelberg, New York, 1992.

No context found.

Ada. The Programming Language Ada Reference Manual, volume 155 of LNCS. Springer--Verlag, Berlin, 1983.

No context found.

Chaitin, G. J. (1999) The Unknowable. Springer Verlag.

No context found.

Jorgensen, T.P., The Physics of Golf, Springer-Verlag, New York, 1994.

No context found.

Gregory J. Chaitin, The Unknowable, Springer Verlag, 1999.

No context found.

D. Kozen: The Design and Analysis of Algorithms. Springer-Verlag, 1991.

No context found.

Ada. The Programming Language Ada Reference Manual, volume 155 of LNCS. Springer--Verlag, Berlin, 1983.

No context found.

The Physics of Quantum Information, edited by D. Bouwmeester, A. Ekert, A. Zeilinger (Springer-Verlag, Berlin, 2000).

No context found.

Fortner, B.: The Data Handbook, Springer Verlag, New York, 1995

No context found.

, Time's arrow: The origins of thermodynamic behaviour, Springer-Verlag, New York, 1992.

No context found.

H. U. Fuchs, The Dynamics of Heat, Springer-Verlag, New York, 1996.

No context found.

Thaller B, The Dirac Equation, Springer-Verlag, Berlin, 1992.

No context found.

Ada. The Programming Language Ada Reference Manual, volume 155 of LNCS. Springer--Verlag, Berlin, 1983.

No context found.

, The analysis of linear partial dierential operators Vols. I-IV, Springer-Verlag, New York, Berlin, 1983, 1985.

No context found.

G. J. Chaitin. The Unknowable, Springer Verlag, Singapore, 1999.

No context found.

G. J. Chaitin. The Unknowable, Springer-Verlag, Singapore, 1999.

No context found.

G.J. Chaitin, The Unknowable, Springer-Verlag, 1999.

No context found.

The Visual Computer, Springer-Verlag, Heidelberg

No context found.

, The representation theory of the symmetric groups, SLN, 682, Springer--Verlag, New York, 1978.

No context found.

Griee, D. The Science o!Progrsmmig. Springer Verlag, New York, 1981.

No context found.

L. Hormander: The Analysis of Linear Partial Dierential Operators III, Springer Verlag, Berlin, 1985.

No context found.

G. J. Chaitin, The Unknowable, Springer-Verlag, New York, 1999.

No context found.

D. Gries, The ScienceofProgramming #Springer-Verlag, 1981#.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC