1000 resultados para Entropia -- Teoria matemàtica
Resumo:
We generalize the analogous of Lee Hwa Chungs theorem to the case of presymplectic manifolds. As an application, we study the canonical transformations of a canonical system (M, S, O). The role of Dirac brackets as a test of canonicity is clarified.
Resumo:
O estudo da presença da matriz positivista na história da educação brasileira vem sendo feito, muitas vezes, de forma mecânica e reducionista pela historiografia tradicional. A partir da perspectiva da história cultural, este artigo toma o livro didático como objeto cultural para mostrar que tipo de apropriação o cotidiano escolar realizou, por ocasião do advento da República, do pensamento positivista no ensino da matemática escolar. Tal análise concentra-se na resposta à questão: existiu, em algum momento da história da educação brasileira, uma matemática escolar positivista?
Resumo:
We present a heuristic method for learning error correcting output codes matrices based on a hierarchical partition of the class space that maximizes a discriminative criterion. To achieve this goal, the optimal codeword separation is sacrificed in favor of a maximum class discrimination in the partitions. The creation of the hierarchical partition set is performed using a binary tree. As a result, a compact matrix with high discrimination power is obtained. Our method is validated using the UCI database and applied to a real problem, the classification of traffic sign images.
Resumo:
O objetivo deste artigo é contribuir para o conhecimento da história da formação de professores e pesquisadores de Matemática na Faculdade Nacional de Filosofia - FNFi. Descreve-se o processo de negociação para a escolha de professores estrangeiros para atuar no curso de Matemática, bem como a proposta curricular; identificam-se os primeiros alunos e discute-se a formação pedagógica do futuro professor. Mostram-se as dificuldades enfrentadas durante a Segunda Guerra Mundial, pelos matemáticos estrangeiros, bem como analisa-se a contribuição de alguns desses matemáticos para o desenvolvimento da pesquisa no país. Identificam-se os primeiros brasileiros, José Abdelhay e Leopoldo Nachbin, que tiveram um papel relevante no ensino e pesquisa matemática, nos anos iniciais do surgimento do cursos de bacharelado e licenciatura em Matemática na FNFi. O período analisado vai da criação da FNFi (1939) e estende-se até meados de 1950, quando começam os embates pela disputa de espaço acadêmico na área de Matemática.
Resumo:
Este texto objetiva oferecer uma breve panorâmica da teoria psicossociológica das representações sociais, estabelecendo algumas pontes com as teorias feministas de gênero. Nesse sentido, percorre as origens e fundamentos da teoria de Moscovici, as suas variações e alguns pontos de convergência com as teorias feministas.
Resumo:
In this paper we study the set of periods of holomorphic maps on compact manifolds, using the periodic Lefschetz numbers introduced by Dold and Llibre, which can be computed from the homology class of the map. We show that these numbers contain information about the existence of periodic points of a given period; and, if we assume the map to be transversal, then they give us the exact number of such periodic orbits. We apply this result to the complex projective space of dimension n and to some special type of Hopf surfaces, partially characterizing their set of periods. In the first case we also show that any holomorphic map of CP(n) of degree greater than one has infinitely many distinct periodic orbits, hence generalizing a theorem of Fornaess and Sibony. We then characterize the set of periods of a holomorphic map on the Riemann sphere, hence giving an alternative proof of Baker's theorem.
Resumo:
Given a compact Riemannian manifold $M$ of dimension $m \geq 2$, we study the space of functions of $L^2(M)$generated by eigenfunctions ofeigenvalues less than $L \geq 1$ associated to the Laplace-Beltrami operator on $M$. On these spaces we give a characterization of the Carleson measures and the Logvinenko-Sereda sets.
Resumo:
A subclass of games with population monotonic allocation schemes is studied, namelygames with regular population monotonic allocation schemes (rpmas). We focus on theproperties of these games and we prove the coincidence between the core and both theDavis-Maschler bargaining set and the Mas-Colell bargaining set
Resumo:
L. S. Shapley, in his paper 'Cores of Convex Games', introduces Convex Measure Games, those that are induced by a convex function on R, acting over a measure on the coalitions. But in a note he states that if this function is a function of several variables, then convexity for the function does not imply convexity of the game or even superadditivity. We prove that if the function is directionally convex, the game is convex, and conversely, any convex game can be induced by a directionally convex function acting over measures on the coalitions, with as many measures as players
Resumo:
It is very well known that the first succesful valuation of a stock option was done by solving a deterministic partial differential equation (PDE) of the parabolic type with some complementary conditions specific for the option. In this approach, the randomness in the option value process is eliminated through a no-arbitrage argument. An alternative approach is to construct a replicating portfolio for the option. From this viewpoint the payoff function for the option is a random process which, under a new probabilistic measure, turns out to be of a special type, a martingale. Accordingly, the value of the replicating portfolio (equivalently, of the option) is calculated as an expectation, with respect to this new measure, of the discounted value of the payoff function. Since the expectation is, by definition, an integral, its calculation can be made simpler by resorting to powerful methods already available in the theory of analytic functions. In this paper we use precisely two of those techniques to find the well-known value of a European call
Resumo:
We show that any cooperative TU game is the maximum of a finite collection of convex games. This max-convex decomposition can be refined by using convex games with non-negative dividends for all coalitions of at least two players. As a consequence of the above results we show that the class of modular games is a set of generators of the distributive lattice of all cooperative TU games. Finally, we characterize zero-monotonic games using a strong max-convex decomposition
Resumo:
The monotonic core of a cooperative game with transferable utility (T.U.-game) is the set formed by all its Population Monotonic Allocation Schemes. In this paper we show that this set always coincides with the core of a certain game associated to the initial game.
Resumo:
The set of optimal matchings in the assignment matrix allows to define a reflexive and symmetric binary relation on each side of the market, the equal-partner binary relation. The number of equivalence classes of the transitive closure of the equal-partner binary relation determines the dimension of the core of the assignment game. This result provides an easy procedure to determine the dimension of the core directly from the entries of the assignment matrix and shows that the dimension of the core is not as much determined by the number of optimal matchings as by their relative position in the assignment matrix.