Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,685
An Elementary Proof of the Quantum Adiabatic Theorem
, 2004
"... We provide an elementary proof of the quantum adiabatic theorem. ..."
Abstract
-
Cited by 15 (2 self)
- Add to MetaCart
We provide an elementary proof of the quantum adiabatic theorem.
A constructive and elementary proof of Reny’s Theorem ∗.
"... A constructive and elementary proof ..."
AN ELEMENTARY PROOF OF THE LIFTING THEOREM
, 1974
"... An elementary proof is given of the lifting theorem for a complete totally finite measure space, which does not use the martingale theorem or Yitali differentiation. Introduction * In this paper we give a proof of the lifting theorem for a complete totally finite measure space, which involves only e ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
An elementary proof is given of the lifting theorem for a complete totally finite measure space, which does not use the martingale theorem or Yitali differentiation. Introduction * In this paper we give a proof of the lifting theorem for a complete totally finite measure space, which involves only
Elementary Proofs on Optimal Stopping
, 2001
"... Elementary proofs of classical theorems on pricing perpetual call and put options in the standard Black-Scholes model are given. The method presented does not rely on stochastic calculus and is also applied to give prices and optimal stopping rules for perpetual call options when the stock is driven ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Elementary proofs of classical theorems on pricing perpetual call and put options in the standard Black-Scholes model are given. The method presented does not rely on stochastic calculus and is also applied to give prices and optimal stopping rules for perpetual call options when the stock
An elementary proof of the Johnson-Lindenstrauss Lemma
, 1999
"... The Johnson-Lindenstrauss lemma shows that a set of n points in high dimensional Euclidean space can be mapped down into an O(log n=ffl 2 ) dimensional Euclidean space such that the distance between any two points changes by only a factor of (1 \Sigma ffl). In this note, we prove this lemma using ..."
Abstract
-
Cited by 152 (1 self)
- Add to MetaCart
elementary probabilistic techniques. Computer Science Division, UC Berkeley. Email: dasgupta@cs.berkeley.edu. y Computer Science Division, UC Berkeley. Email: angup@cs.berkeley.edu. Supported by NSF grant CCR-9505448. 1 Introduction Johnson and Lindenstrauss [6] proved a fundamental result, which said
An elementary proof of a theorem of
- Johnson and Lindenstrauss. Random Structures and Algorithms, 22(1):60 – 65
, 2003
"... ABSTRACT: A result of Johnson and Lindenstrauss [13] shows that a set of n points in high dimensional Euclidean space can be mapped into an O(log n/ � 2)-dimensional Euclidean space such that the distance between any two points changes by only a factor of (1 � �). In this note, we prove this theorem ..."
Abstract
-
Cited by 43 (0 self)
- Add to MetaCart
this theorem using elementary probabilistic techniques. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 22: 60–65, 2002
AN ELEMENTARY PROOF OF BLUNDON’S INEQUALITY
, 2008
"... ABSTRACT. In this note, we give an elementary proof of Blundon’s Inequality. We make use of a simple auxiliary result, provable by only using the Arithmetic Mean- Geometric Mean Inequality. ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
ABSTRACT. In this note, we give an elementary proof of Blundon’s Inequality. We make use of a simple auxiliary result, provable by only using the Arithmetic Mean- Geometric Mean Inequality.
An elementary proof of the hook formula
"... The hook-length formula is a well known result expressing the number of standard tableaux of shape λ in terms of the lengths of the hooks in the diagram of λ. Many proofs of this fact have been given, of varying complexity. We present here an elementary new proof which uses nothing more than the fun ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
The hook-length formula is a well known result expressing the number of standard tableaux of shape λ in terms of the lengths of the hooks in the diagram of λ. Many proofs of this fact have been given, of varying complexity. We present here an elementary new proof which uses nothing more than
AN ELEMENTARY PROOF OF JENSEN’S THEOREM
, 2009
"... We present a new, easy, and elementary proof of Jensen’s Theorem on the uniqueness of infinity harmonic functions. The idea is to pass to a finite difference equation by taking maximums and minimums over small balls. ..."
Abstract
- Add to MetaCart
We present a new, easy, and elementary proof of Jensen’s Theorem on the uniqueness of infinity harmonic functions. The idea is to pass to a finite difference equation by taking maximums and minimums over small balls.
Elementary Proofs of Adequacy
, 1997
"... We give a technique for proving computational adequacy, applied to models of Plotkin's FPC. The proof is elementary, in that it avoids the use of certain abstract notions, namely logical relations. The technique appears to be quite general. We present an arbitrary term using fixed-points whose ..."
Abstract
- Add to MetaCart
We give a technique for proving computational adequacy, applied to models of Plotkin's FPC. The proof is elementary, in that it avoids the use of certain abstract notions, namely logical relations. The technique appears to be quite general. We present an arbitrary term using fixed-points whose
Results 1 - 10
of
2,685
