967 resultados para reciprocity theorem
Resumo:
Ce mémoire s’applique à étudier d’abord, dans la première partie, la mesure de Mahler des polynômes à une seule variable. Il commence en donnant des définitions et quelques résultats pertinents pour le calcul de telle hauteur. Il aborde aussi le sujet de la question de Lehmer, la conjecture la plus célèbre dans le domaine, donne quelques exemples et résultats ayant pour but de résoudre la question. Ensuite, il y a l’extension de la mesure de Mahler sur les polynômes à plusieurs variables, une démarche semblable au premier cas de la mesure de Mahler, et le sujet des points limites avec quelques exemples. Dans la seconde partie, on commence par donner des définitions concernant un ordre supérieur de la mesure de Mahler, et des généralisations en passant des polynômes simples aux polynômes à plusieurs variables. La question de Lehmer existe aussi dans le domaine de la mesure de Mahler supérieure, mais avec des réponses totalement différentes. À la fin, on arrive à notre objectif, qui sera la démonstration de la généralisation d’un théorème de Boyd-Lawton, ce dernier met en évidence une relation entre la mesure de Mahler des polynômes à plusieurs variables avec la limite de la mesure de Mahler des polynômes à une seule variable. Ce résultat a des conséquences en termes de la conjecture de Lehmer et sert à clarifier la relation entre les valeurs de la mesure de Mahler des polynômes à une variable et celles des polynômes à plusieurs variables, qui, en effet, sont très différentes en nature.
Resumo:
Department of Physics, Cochin University of Science and Technology
Resumo:
In Safety critical software failure can have a high price. Such software should be free of errors before it is put into operation. Application of formal methods in the Software Development Life Cycle helps to ensure that the software for safety critical missions are ultra reliable. PVS theorem prover, a formal method tool, can be used for the formal verification of software in ADA Language for Flight Software Application (ALFA.). This paper describes the modeling of ALFA programs for PVS theorem prover. An ALFA2PVS translator is developed which automatically converts the software in ALFA to PVS specification. By this approach the software can be verified formally with respect to underflow/overflow errors and divide by zero conditions without the actual execution of the code.
Resumo:
In Safety critical software failure can have a high price. Such software should be free of errors before it is put into operation. Application of formal methods in the Software Development Life Cycle helps to ensure that the software for safety critical missions are ultra reliable. PVS theorem prover, a formal method tool, can be used for the formal verification of software in ADA Language for Flight Software Application (ALFA.). This paper describes the modeling of ALFA programs for PVS theorem prover. An ALFA2PVS translator is developed which automatically converts the software in ALFA to PVS specification. By this approach the software can be verified formally with respect to underflow/overflow errors and divide by zero conditions without the actual execution of the code
Resumo:
Using the functional approach, we state and prove a characterization theorem for classical orthogonal polynomials on non-uniform lattices (quadratic lattices of a discrete or a q-discrete variable) including the Askey-Wilson polynomials. This theorem proves the equivalence between seven characterization properties, namely the Pearson equation for the linear functional, the second-order divided-difference equation, the orthogonality of the derivatives, the Rodrigues formula, two types of structure relations,and the Riccati equation for the formal Stieltjes function.
Resumo:
The theory of reciprocity is predicated on the assumption that people are willing to reward nice or kind acts and to punish unkind ones. This assumption raises the question as to how to define kindness. In this paper we offer a new definition of kindness that we call “blame-freeness.” Put most simply, blame-freeness states that in judging whether player i has been kind or unkind to player j in a social situation, player j would have to put himself in the strategic position of player i, while retaining his preferences, and ask if he would have acted in a manner that was worse than i did under identical circumstances. If j would have acted in a more unkind manner than i acted, then we say that j does not blame i for his behavior. If, however, j would have been nicer than i was, then we say that “j blames i” for his actions (i’s actions were blameworthy). We consider this notion a natural, intuitive and empirically relevant way to explain the motives of people engaged in reciprocal behavior. After developing the conceptual framework, we then test this concept in a laboratory experiment involving tournaments and find significant support for the theory.
Resumo:
In recent years, several experiments have shown individuals exhibit authentic reciprocal behaviour in anonymous one-shot interactions. As reciprocity has been shown to be relevant in several economic fields, there have also been several attempts to model reciprocal bahaviour. I review the intention-based models of reciprocity and present an example of teacher management in the public sector in which the government offers an incentive scheme to implement a program. The incentive scheme has a prisoner´s dilemma structure. In both simultaneous and sequential games, equilibrium results may differ from those predicted by standard theory.
Resumo:
A theorem of Lusin is proved in the non-ordered context of JB*-triples. This is applied to obtain versions of a general transitivity theorem and to deduce refinements of facial structure in closed unit ballls of JB*-triples and duals.
Resumo:
A definition is given for the characteristic equation of anN-partitioned matrix. It is then proved that this matrix satisfies its own characteristic equation. This can then be regarded as a version of the Cayley-Hamilton theorem, of use withN-dimensional systems.