19 resultados para Minimum Inductance
Resumo:
We answer the following question: given any n∈ℕ, which is the minimum number of endpoints en of a tree admitting a zero-entropy map f with a periodic orbit of period n? We prove that en=s1s2…sk−∑i=2ksisi+1…sk, where n=s1s2…sk is the decomposition of n into a product of primes such that si≤si+1 for 1≤i
Resumo:
Markets, in the real world, are not efficient zero-sum games where hypotheses of the CAPM are fulfilled. Then, it is easy to conclude the market portfolio is not located on Markowitz"s efficient frontier, and passive investments (and indexing) are not optimal but biased. In this paper, we define and analyze biases suffered by passive investors: the sample, construction, efficiency and active biases and tracking error are presented. We propose Minimum Risk Indices (MRI) as an alternative to deal with to market index biases, and to provide investors with portfolios closer to the efficient frontier, that is, more optimal investment possibilities. MRI (using a Parametric Value-at-Risk Minimization approach) are calculated for three stock markets achieving interesting results. Our indices are less risky and more profitable than current Market Indices in the Argentinean and Spanish markets, facing that way the Efficient Market Hypothesis. Two innovations must be outlined: an error dimension has been included in the backtesting and the Sharpe"s Ratio has been used to select the"best" MRI
Resumo:
The set of initial conditions for which the pseudoclassical evolution algorithm (and minimality conservation) is verified for Hamiltonians of degrees N (N>2) is explicitly determined through a class of restrictions for the corresponding classical trajectories, and it is proved to be at most denumerable. Thus these algorithms are verified if and only if the system is quadratic except for a set of measure zero. The possibility of time-dependent a-equivalence classes is studied and its physical interpretation is presented. The implied equivalence of the pseudoclassical and Ehrenfest algorithms and their relationship with minimality conservation is discussed in detail. Also, the explicit derivation of the general unitary operator which linearly transforms minimum-uncertainty states leads to the derivation, among others, of operators with a general geometrical interpretation in phase space, such as rotations (parity, Fourier).