منابع مشابه
A refined Quicksort asymptotic
The complexity of the Quicksort algorithm is usually measured by the number of key comparisons used during its execution. When operating on a list of n data, permuted uniformly at random, the appropriately normalized complexity Yn is known to converge almost surely to a non-degenerate random limit Y. This assumes a natural embedding of all Yn on one probability space, e.g., via random binary se...
متن کاملA refined Razumov-Stroganov conjecture
We extend the Razumov-Stroganov conjecture relating the groundstate of the O(1) spin chain to alternating sign matrices, by relating the groundstate of the monodromy matrix of the O(1) model to the so-called refined alternating sign matrices, i.e. with prescribed configuration of their first row, as well as to refined fully-packed loop configurations on a square grid, keeping track both of the ...
متن کاملA Refined Polar Decomposition: A=UPD
A reenement of the polar decomposition of a nonsingular matrix A is considered. Here A is written as a product of unitary U ; Hermitian and positive deenite P which has unit diagonal, and diagonal positive D : It is shown that such a decomposion exists and is unique. Rectangular and singular cases are also considered. Then a simple xed point iteration using SVD is given to compute this decompos...
متن کاملA Refined View of the Box Algebra
This paper presents the operational semantics and the Petri net semantics of a fragment of the box algebra in tutorial style. For the operational semantics, inductive rules for marked expressions are given. For the net semantics, a general mechanism of refinement and relabelling is introduced, using which the connectives of the algebra are defined. A companion paper shows how this mechanism can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tellus A: Dynamic Meteorology and Oceanography
سال: 2006
ISSN: 1600-0870
DOI: 10.1111/j.1600-0870.2006.00172.x